Re:48th Mersenne prime found
by jnotarstefano on Tuesday February 05, 2013 @01:42PM
(#5172369)
This is in fact the consequence of a fact first proven by Euler: every even perfect number is of the form (2^(p-1)) * (2^p - 1) where 2^p - 1 is a prime. That is, it's p ones shifted left by p-1 zeroes.
Re:48th Mersenne prime found
by SagelyGuru on Tuesday February 05, 2013 @01:57PM
(#5172459)
Surely then the third should be: 111110000, not 1111100. Looks like you are two zeroes short of perfect ;)
Awesome. I'll have to apply the binary notation approach to answering the question I just posted below.
In case anyone is curious, the explicit power of two formula for these perfect numbers can be found here:
http://primes.utm.edu/mersenne/index.html#theorems
The first perfect number, 6, written in binary is 110 The second, 28, in binary is 11100 The third, 496, in binary is 1111100 The fourth, 8128, in binary is 1111111000000
See the pattern? Its a number of ones equal to the mersenne prime that generates the perfect number, followed by one less number of zeroes.
Just an interesting tidbit I discovered completely by accident in college that I always thought was cool. :)
Of course it derives directly from the fact that mersenne primes (and perfect numbers) are based on powers of two, but I still thought it was cool (probably because I discovered it accidentally and independently without trying to)