Record Mersenne Prime - Printable Version +- HP Forums ( https://archived.hpcalc.org/museumforum)+-- Forum: HP Museum Forums ( https://archived.hpcalc.org/museumforum/forum-1.html)+--- Forum: Old HP Forum Archives ( https://archived.hpcalc.org/museumforum/forum-2.html)+--- Thread: Record Mersenne Prime ( /thread-238719.html) |

Record Mersenne Prime - Howard Owen - 02-05-2013
Re: Record Mersenne Prime - Jim Horn - 02-05-2013
Actually, that's 2^57885161-1, not 2^257885161-1. The extra "2" makes quite a difference.
Still quite a find!
Re: Record Mersenne Prime - Howard Owen - 02-05-2013
Whoops! Corrected. Thanks Jim.
Re: Record Mersenne Prime - Kiyoshi Akima - 02-05-2013
Drat! My HP-19C was working on that one last month when it ran out of paper ;-)
Re: Record Mersenne Prime - Frank Boehm (Germany) - 02-06-2013
I have to out myself as an early SETI@home-member (I think I registered as user 6xx), having run the Mersenne program as well. Re: Record Mersenne Prime - Marcel Samek - 02-06-2013
By their stats, those 100000 users have 730562 computers registered, so the picture is even uglier. Ouch is right.
Re: Record Mersenne Prime - Valentin Albillo - 02-07-2013
Quote: Another simple word: Bollocks.
Regards. Re: Record Mersenne Prime - Eddie W. Shore - 02-08-2013
Over 17 million digits - it would take a good number of years just for a human to write all the numbers of this number. Wow.
It boggles the mind, just like we know of a million digits of pi.
Re: Record Mersenne Prime - Paul Townsend (UK) - 02-16-2013
Whenever M_n = 2^n-1 is prime, the larger number P_n = (4^n - 2^n)/2 is "perfect", i.e. its factors add up to the number itself. n=2: M_n = 3, P_n = 6 = 1 + 2 + 3 n=3: M_n = 7, P_n = 28 = 1 + 2 + 4 + 7 + 14 n=5: M_n = 31, P_n = 496 = 1 + 2 + 4 + 8 + 16 + 31 + 62 +124 + 248 This new Mercenne prime makes for a new perfect number.
At a rough guess, the number of digits in a Mercenne prime is approx 30% of n, and the number of digits in the corresponding perfect number is twice this, approx 60% of n.
Re: Record Mersenne Prime - Thomas Klemm - 02-16-2013
Quote: log(a^{n}) = n log(a)log(2) = 0.30103 ~ 30%
Re: Record Mersenne Prime - Valentin Albillo - 02-18-2013
Quote:
After all, it's never been proved that there are none, so this is your chance to make math history ... XD
Best regards. |