New prime in base 2

A new prime has been discovered: 2 74 , 207 , 281 1. \Large {2}^{74,207,281} - 1. Find the sum of its digit when written in Binary (base 2).

0 74,207,282 282 74,207,281

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.

1 solution

Arulx Z
Jan 22, 2016

2 2 1 = 1 1 2 2 3 1 = 11 1 2 2 4 1 = 111 1 2 2^2-1=11_2 \\ 2^3-1=111_2 \\ 2^4-1=1111_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 ) { k }^{ n }-1=\left( k-1 \right) \left( { k }^{ n-1 }+{ k }^{ n-2 }+{ k }^{ n-3 }+\dots +{ k }^{ 2 }+k+1 \right)

On plugging in 2, we get -

( 2 1 ) ( 2 74 , 207 , 280 + 2 74 , 207 , 279 + 2 74 , 207 , 278 + + 2 2 + 2 + 1 ) = 2 74 , 207 , 280 + 2 74 , 207 , 279 + 2 74 , 207 , 278 + + 2 2 + 2 + 1 \left( 2-1 \right) \left( { 2 }^{ 74,207,280 }+{ 2 }^{ 74,207,279 }+{ 2 }^{ 74,207,278 }+\dots +{ 2 }^{ 2 }+2+1 \right) \\ ={ 2 }^{ 74,207,280 }+{ 2 }^{ 74,207,279 }+{ 2 }^{ 74,207,278 }+\dots +{ 2 }^{ 2 }+2+1

When we write this number in base 2, we get

11111 11 2 74,207,281 ones \underbrace { { 11111\dots 11 }_{ 2 } }_{ \text{74,207,281 ones}}

Remember that the bases are 0 indexed. The sum is simply 74,207,281.

Number sense

2 74 , 207 , 281 2^{74,207,281} is the smallest 74,207,282 digit number. Subtracting 1 from 2 74 , 207 , 281 2^{74,207,281} will form the largest 74,207,281 digit number, which is simply

11111 11 2 74,207,281 ones \underbrace { { 11111\dots 11 }_{ 2 } }_{ \text{74,207,281 ones} }

Hence the sum is 74,207,281.

Moderator note:

Nice approaches shown here.

Very good solution showing many alternative(+1)

Aareyan Manzoor - 5 years, 4 months ago

Log in to reply

Thank you :) Nice problem though. Definitely great for the problem writing party.

Arulx Z - 5 years, 4 months ago

Nice solution thank you

zain ali - 5 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...