We can represent any integer by the sum of multiplication of its digits by 10 to the power of its place:
345 = 5 + 40 + 300.
Same goes to binary too:
1101 = 1 + 2*0 + 4*1 + 8*1 or 13
So lets try to produce the largest possible binary number:
1 + 2*1 + 4*1 + 8*1 + ...
essentially this would look like this in binary: 111111...
Note that the only odd number that is being added is the very first lonely 1, everything after that is a multiple of 2 and therefore even. so everything else is being added is even and then we add 1 to it. by definition it becomes odd! we can try the same in decimal or any other even base:
9 + 9*10 + 9*100 + 9*1000... = 9999999...
and it is an odd number.
Interestingly in all odd bases, the largest number is even :/
8 + 8*9 + 8*81 + 8*729 + .... = 88888888...
345 = 5 + 40 + 300.
Same goes to binary too:
1101 = 1 + 2*0 + 4*1 + 8*1 or 13
So lets try to produce the largest possible binary number:
1 + 2*1 + 4*1 + 8*1 + ...
essentially this would look like this in binary: 111111...
Note that the only odd number that is being added is the very first lonely 1, everything after that is a multiple of 2 and therefore even. so everything else is being added is even and then we add 1 to it. by definition it becomes odd! we can try the same in decimal or any other even base:
9 + 9*10 + 9*100 + 9*1000... = 9999999...
and it is an odd number.
Interestingly in all odd bases, the largest number is even :/
8 + 8*9 + 8*81 + 8*729 + .... = 88888888...