A standard way to prove that every nonnegative integer has a unique binary representation is to use the division algorithm. Repeatedly divide the number by 2, record the remainders, and continue until the quotient becomes zero. The remainders, read backwards, give the binary expansion. Uniqueness follows because at each step the quotient and remainder are […]