October 05, 2008
New Mersenne prime found

Time for some math news: Researchers at UCLA have discovered a new Mersenne prime number.


UCLA mathematicians appear to have won a $100,000 prize from the Electronic Frontier Foundation for discovering a 13-million-digit prime number that has long been sought by computer users.

While the prize money is nothing special, the bragging rights for discovering the 46th known Mersenne prime are huge.

"We're delighted," said UCLA's Edson Smith, leader of the effort. "Now we're looking for the next one, despite the odds," which are thought to be about one in 150,000 that any number tested will be a Mersenne prime.

Prime numbers are those, like three, seven and 11, that are divisible only by themselves and one. Mersenne primes, named after the 17th century French mathematician Marin Mersenne, who discovered them, take the form 2^P - 1, where P is also a prime number.

In the new UCLA prime, P = 43,112,609.

Thousands of people around the world have been participating in the Great Internet Mersenne Prime Search, or GIMPS, in which underused computing power is harnessed to perform the complex and tedious calculations needed to find and verify Mersenne primes. The prize is being offered for finding the first Mersenne prime with more than 10 million digits.


The details of the EFF prize are here. There's more where that came from, if you can find some even bigger prime numbers.

Of course, the discovery of a new Mersenne prime means we also have a new perfect number. I suppose since that's a corollary result, it never gets the same publicity as the Mersenne prime discovery does. I think it's just as cool, even if it didn't take any of the work.

Posted by Charles Kuffner on October 05, 2008 to Technology, science, and math
Comments
Post a comment

(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)