Go back
I know you have been breathlessly waiting:

I know you have been breathlessly waiting:

Posers and Puzzles

s
Fast and Curious

slatington, pa, usa

Joined
28 Dec 04
Moves
53321
Clock
18 Jan 06
Vote Up
Vote Down

The 43rd Mersenne prime number has just been found by comps
running 9 years at Central Missouri State University.
It is: *drum roll*
(2^30402457) - 1.
Its 9,152,052 digits surpassing the last one which had a mere
7 million decimal digits.
It seems there is a prize of 100,000 $US for the first prime with
more than 10 million digits and it just missed. Oh well, another
nine years and they will have that 100K nailed.

B

Joined
07 Dec 05
Moves
3685
Clock
18 Jan 06
Vote Up
Vote Down

Thanks sonhouse,

Here is a link to the web blogg posted a few days ago.
http://weblog.physorg.com/news4471.html

X
Cancerous Bus Crash

p^2.sin(phi)

Joined
06 Sep 04
Moves
25076
Clock
19 Jan 06
Vote Up
Vote Down

Originally posted by sonhouse
The 43rd Mersenne prime number has just been found by comps
running 9 years at Central Missouri State University.
It is: *drum roll*
(2^30402457) - 1.
Its 9,152,052 digits surpassing the last one which had a mere
7 million decimal digits.
It seems there is a prize of 100,000 $US for the first prime with
more than 10 million digits and it just missed. Oh well, another
nine years and they will have that 100K nailed.
Thread 35998 Try to keep up sonhouse.

The 42nd Mersenne prime was found in February 2005. This one was found in December 2005. Also the computers on campus are a part of PrimeNet a disributed computer network. The central server hands out numbers to check (all of the form 2^p -1) and your computer returns the positive or negative result to the main computer. Checking large numbers for primality is a long process, the computer that found this prime took 50 days of idle processes to do so.

Also if you found a 10 million digit mersenne prime using PrimeNet you would not get $100k you would get $50k (http://www.mersenne.org/prize.htm).

Cookies help us deliver our Services. By using our Services or clicking I agree, you agree to our use of cookies. Learn More.