On August 23rd, a UCLA computer in the GIMPS PrimeNet network discovered the 45th known Mersenne prime, 2^43,112,609-1, a mammoth 12,978,189 digit number! The prime number qualifies for the Electronic Frontier Foundation's $100,000 award for discovery of the first 10 million digit prime number. Congratulations to Edson Smith, who was responsible for installing and maintaining the GIMPS software on the UCLA Mathematics Department's computers.

On September 6th, the 46th known Mersenne prime, 2^37,156,667-1, a 11,185,272 digit number was found by Hans-Michael Elvenich in Langenfeld near Cologne, Germany! This was the first Mersenne prime to be discovered out of order since Colquitt and Welsh discovered 2^110,503-1 in 1988.

The nearly decade long quest for the EFF award came down to a close race to the finish - with just two weeks separating the discovery of the two primes.

As promised, GIMPS will give $50,000 of the EFF award to the UCLA Mathematics Department for discovering the first 10 million digit prime. $25,000 will go to charity, and most of the remainder will go to discoverers of the previous six Mersenne primes.

In recognition of the individual discoverers, the GIMPS project leaders, and every GIMPS participant's contributions, credit for the two primes goes to "Edson Smith, George Woltman, Scott Kurowski, et al.", and "Hans-Michael Elvenich, George Woltman, Scott Kurowski, et al.".

Edson Smith has worked in the IT industry for 27 years and the last 10 years as the Computing Manager for the UCLA Mathematics Department. Last Fall he replaced the Lab's screen savers with prime95 - a perfect fit for the Mathematics Department. UCLA has a rich history in the discovery of Mersenne primes. Dr. Raphael Robinson found five Mersenne primes at UCLA in 1952 and Alex Hurwitz found two more in 1961.

Hans-Michael Elvenich is a 44 year old Electrical Engineer working for Lanxess, a chemical company. He is a prime number enthusiast and is the owner and operator of www.primzahlen.de. In German, prime numbers are called "Primzahlen".

Both primes were first verified by Tom Duell (Burlington, MA, USA) and Rob Giltrap (Wellington, New Zealand), both of Sun Microsystems, using the Mlucas program by Ernst Mayer of Cupertino California USA. The verifications ran on 8 dual-core SPARC64 VI 2.15Ghz CPUs of a Sun SPARC Enterprise M5000 Server and 4 quad-core SPARC64 VII 2.52GHz CPUs of a Sun SPARC Enterprise M8000 Server in Menlo Park, CA, USA. The first prime verification took 13 days, the second prime took 5 days.

Both primes were also independently verified by Tony Reix of Bull SAS in Grenoble, France using 16 1.6 GHz Itanium2 CPUs of a Bull NovaScale 6160 HPC server and the Glucas program. Jeff Gilchrist of Carleton University in Ottawa, Canada has also verified both primes using up to 16 1.6 GHz Itanium2 CPUs of a server at SHARCNET, running the Glucas program by Guillermo Ballester Valor of Granada, Spain.

Perfectly Scientific, Dr. Crandall's company which developed the FFT algorithm used by GIMPS, will make posters you can order containing all 12.9 and 11.1 million digits. You'll need a good magnifying glass to read the tiny, tiny print!

You can read a little more in the short press release.

Lightning strikes twice. On September 4, 2006, in the same room just a few feet away from their last find, Dr. Curtis Cooper and Dr. Steven Boone's CMSU team broke their own world record, discovering the 44th known Mersenne prime, 2^32,582,657-1. The new prime at 9,808,358 digits is 650,000 digits larger than their previous record prime found last December. However, the new prime falls short of the 10 million digits required for GIMPS to claim the .

With five record primes found in less than 3 years, GIMPS has been on an incredible lucky streak. Never before have Mersenne primes been bunched so closely together. When looking at the exponents, we expect only 1.78 Mersenne primes between powers of two, and prior to 2003, a maximum of 3 Mersenne primes were found between powers of two. The last 5 Mersenne prime exponents all fell between 2²⁴ and 2²⁵ -- and we haven't finished testing all the exponents in that range!

The new prime was independently verified in 6 days by Tony Reix of Bull S.A. in Grenoble, France using 16 Itanium2 1.5 GHz CPUs of a Bull NovaScale 6160 HPC at Bull Grenoble Research Center, running the Glucas program by Guillermo Ballester Valor of Granada, Spain.

Dr. Cooper and Dr. Boone could not have made this discovery alone. In recognition of contributions made by the project coordinators and the tens of thousands GIMPS volunteers, credit for this new discovery goes to "Cooper, Boone, Woltman, Kurowski, et al.". The discovery is the tenth record prime for the GIMPS project. Join now and you could find the next record-breaking prime! You could even win some cash.

Perfectly Scientific, Dr. Crandall's company which developed the FFT algorithm used by GIMPS, will make a poster you can order containing the entire 9.8 million digit number. It is kind of pricey because accurately printing an over-sized poster in 1-point font is not easy! This makes a cool present for the serious math nut in your family.

For more information on this prime discovery read the full press release.

Mersenne Wiki Created. From the good folks that brought you the Mersenne Forums comes the Mersenne Wiki. Browse the Wiki to learn more about GIMPS and Mersenne Primes.

Version 25.7 of Prime95/mprime released. Go to the download page to upgrade.

NFSNet / Cunningham project needs your help!! The Cunningham project is trying to complete the factorization of 2ⁿ-1 and 2ⁿ+1 where n < 1200. To do this they need to find as many "small" factors as possible using ECM. Visit 2^n-1, 2^n+1 for current ECM status. Visit the forums for help setting up prime95 to run ECM curves.

GIMPS forums. Here you can chat with fellow GIMPS members, get help with installation questions, learn more about how GIMPS works, etc.

You could discover one of the most coveted finds in all of Mathematics - a new Mersenne prime number. We've found twelve already. Join in on this fun, yet serious research project. All you need is a personal computer, patience, and a lot of luck.

In addition to the joy of making a mathematical discovery, you could win a (USD) $3,000 cash GIMPS Research Discovery Award for each Mersenne prime discovered, and the Electronic Frontier Foundation is offering a $150,000 award to the first person or group to discover a 100 million digit prime number! See how GIMPS will distribute this award if we are lucky enough to find the winning 100 million digit prime.

Prime numbers have long fascinated amateur and professional mathematicians. An integer greater than one is called a prime number if its only divisors are one and itself. The first prime numbers are 2, 3, 5, 7, 11, etc. For example, the number 10 is not prime because it is divisible by 2 and 5. A Mersenne prime is a prime of the form 2^P-1. The first Mersenne primes are 3, 7, 31, 127 (corresponding to P = 2, 3, 5, 7). There are only 46 known Mersenne primes.

GIMPS, the Great Internet Mersenne Prime Search, was formed in January 1996 to discover new world-record-size Mersenne primes. GIMPS harnesses the power of thousands of small computers like yours to search for these "needles in a haystack".

Most GIMPS members join the search for the thrill of possibly discovering a record-setting, rare, and historic new Mersenne prime. Of course, there are many other reasons.

Last Updated October 23, 2009