mersenneforum.org 40th Prime Mersenne Number?
 Register FAQ Search Today's Posts Mark Forums Read

 2003-11-27, 12:56 #1 Unregistered   22×3×109 Posts 40th Prime Mersenne Number? It has been in the press, but I didn't find the candidate. It is 2^n -1 for which n?
 2003-11-27, 13:02 #2 PrimeCruncher     Sep 2003 Borg HQ, Delta Quadrant 10101111102 Posts Until verification runs are completed to ensure that it is a Mersenne Prime, the exponent will not be released. We've all been waiting to find out...
 2003-11-27, 16:49 #3 PrimeCruncher     Sep 2003 Borg HQ, Delta Quadrant 12768 Posts George's verification runs will finish December 2. See this thread in the Lounge: http://www.mersenneforum.org/showthr...&threadid=1420
 2003-12-03, 13:45 #4 jinydu     Dec 2003 Hopefully Near M48 110110111102 Posts Quoting www.mersenne.org: On November 17, 2003 Michael Shafer's computer found the 40th known Mersenne prime, 220,996,011-1! This number "weighs in" at a whopping 6,320,430 decimal digits! This is also the largest known prime number, surpassing GIMPS' last discovery by over 2 million digits. The number is (2^220996011)-1 and has in fact been verified independently twice.
 2003-12-03, 17:08 #5 nomadicus     Jan 2003 North Carolina 2×3×41 Posts That's p=20,996,011 220,996,011 is a little beyond our reach today.
 2003-12-05, 00:16 #6 epatka   Jun 2003 25 Posts According to the German Stern Magazine the new prime number is 2^20 996 011 -1. It has 6 320 430 digits. http://stern.de/wissenschaft/forschu...16686&nv=hp_rt The name is Michael Schaefer of the Michigan State University on a standard PC.
2003-12-05, 01:19   #7
PrimeCruncher

Sep 2003

70210 Posts

Quote:
 Originally posted by epatka According to the German Stern Magazine the new prime number is 2^20 996 011 -1. It has 6 320 430 digits. http://stern.de/wissenschaft/forschu...16686&nv=hp_rt The name is Michael Schaefer of the Michigan State University on a standard PC.
That is correct. The computer that found M40 was a Pentium 4.

 2003-12-05, 09:12 #8 jinydu     Dec 2003 Hopefully Near M48 2×3×293 Posts Oops, sorry about that typo. For anyone who wants to know: # of digits = (p*log[base 10]2) rounded up. I think

 Similar Threads Thread Thread Starter Forum Replies Last Post dabaichi News 571 2020-10-26 11:02 aketilander Operazione Doppi Mersennes 1 2012-11-09 21:16 Brain PrimeNet 3 2010-07-22 10:01 illman-q Miscellaneous Math 33 2004-09-19 05:02 Citrix Lounge 28 2003-12-21 19:42

All times are UTC. The time now is 17:45.

Mon Jan 17 17:45:01 UTC 2022 up 178 days, 12:14, 0 users, load averages: 1.26, 1.44, 1.42