A new prime has been discovered: Find the sum of its digit when written in Binary (base 2).
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
2 2 − 1 = 1 1 2 2 3 − 1 = 1 1 1 2 2 4 − 1 = 1 1 1 1 2
As we can see, a pattern emerges. Now let's try to prove the pattern. There are many interesting ways to prove it. Here are 2 of them.
Algebraic way
We know that -
k n − 1 = ( k − 1 ) ( k n − 1 + k n − 2 + k n − 3 + ⋯ + k 2 + k + 1 )
On plugging in 2, we get -
( 2 − 1 ) ( 2 7 4 , 2 0 7 , 2 8 0 + 2 7 4 , 2 0 7 , 2 7 9 + 2 7 4 , 2 0 7 , 2 7 8 + ⋯ + 2 2 + 2 + 1 ) = 2 7 4 , 2 0 7 , 2 8 0 + 2 7 4 , 2 0 7 , 2 7 9 + 2 7 4 , 2 0 7 , 2 7 8 + ⋯ + 2 2 + 2 + 1
When we write this number in base 2, we get
74,207,281 ones 1 1 1 1 1 … 1 1 2
Remember that the bases are 0 indexed. The sum is simply 74,207,281.
Number sense
2 7 4 , 2 0 7 , 2 8 1 is the smallest 74,207,282 digit number. Subtracting 1 from 2 7 4 , 2 0 7 , 2 8 1 will form the largest 74,207,281 digit number, which is simply
74,207,281 ones 1 1 1 1 1 … 1 1 2
Hence the sum is 74,207,281.