Binary Perfection

In December 2018, GIMPS discovered the 5 1 st 51^{\text{st}} known Mersenne Prime , 2 82589933 1 2^{82589933} - 1 .

If the 5 1 st 51^{\text{st}} known perfect number (a positive integer that is equal to the sum of its proper positive divisors) were written in binary notation, how many digits would it have?


The answer is 165179865.

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

Jordan Cahn
Jan 23, 2019

Let q = 82589933 q=82589933 . All known perfect numbers are of the form 2 p 1 ( 2 p 1 ) 2^{p-1}(2^p-1) where 2 p 1 2^p-1 is a Mersenne prime. Furthermore, all Mersenne primes correspond to a perfect number of this form. Thus, the 51 51 st known perfect number is 2 q 1 ( 2 q 1 ) = 2 2 q 1 2 q 2^{q-1}(2^q-1) = 2^{2q-1}-2^q . Note that 2 q < 2 2 q 2 2^q<2^{2q-2} . Thus, 2 2 q 2 < 2 2 q 1 2 q < 2 2 q 1 2^{2q-2}<2^{2q-1}-2^q<2^{2q-1} and 2 2 q 1 2 q 2^{2q-1}-2^q has 2 q 1 = 165179865 2q-1 = \boxed{165179865} binary digits.

Great solution!

David Vreken - 2 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...