Prove that PCCn is the largest possible $1-$error detecting binary code of length n$,$ that is$,$ if C $($Z$2)$n is any binary code of length n which is $1-$error detecting, then $|$C$|<=2$n$1.$