# Two New Mersenne Primes

Two new Mersenne primes: 243,112,609-1 and 237,156,667-1. The former is now the largest prime number known. Interestingly the larger was discovered before the former, thus winning $100,000 from the EFF for Edson Smith who installed the software which identified this Mersenne prime on a UCLA computer. The$100K prize was for the first 10 million digit prime. The next prize is \$150K for a 100 million digit prime number. Pretty amazing that two 10 million digit Mersenne's were discovered within weeks of each other.

Mersenne primes are prime numbers which are a power of two minus one, i.e. of the form 2n-1 where n is an integer. Mersenne primes are named after Marion Mersenne, a french dude sometimes known as the father of acoustics. He made a list of the known Mersenne's up to 257 in the exponent. Who said list makers don't get credit.

There are thought to be an infinite number of Mersenne primes, but no one knows how to prove this. Now days, Mersenne primes are sought by computer as there are good algorithms for testing their primality. The largest non-Mersenne prime known right now is 19,249 (213,018,586) + 1. Edouard Lucas spent 19 years testing whether the Mersenne number 2127-1 was prime. Luckily for him it was. Wouldn't that have sucked if after eighteen years he had found that it wasn't prime?

Tags

### More like this

##### Sunday Function
Due to some homework which is taking longer than anticipated, today's Sunday Function will have to be a bit quick. It's no less interesting for that. Define a function Q(n) on the natural numbers, such that Q(n) = 1 for a prime number and Q(n) = 0 for a composite number. In other words, it's just…
##### Perfect Numbers
I'll return to my Dawkins series later in the week. But after all our exertions recently trying to resolve the mysteries of the universe, I find myself in the mood for a straight math post. So, inspired by some comments from this post, let's talk about perfect numbers. A number is said to be…
##### Monday Math: Mersenne Primes
Like all moderately curious people, I'm sure you've often wondered whether it's possible for $N=a^k-1$   to be a prime number, where a and k are positive integers. Well, I'm here to answer that for you! To avoid trivial cases, we shall assume that k is at least two. Of course, I'm sure we all…
##### Monday Math: Proving Euler's Formula for Perfect Numbers
In last week's post we discussed perfect numbers. These were numbers, like 6, 28 and 496, that are equal to the sums of their proper divisors. We referred to Euler's formula, which claims that every even perfect number has the form $2^{p-1} \left(2^p-1 \right),$ where the term in parentheses…

I think you need to fix the parentheses on the expression for the largest non-Mersenne prime (otherwise, it is quite composite).

By Jim Harrington (not verified) on 19 Sep 2008 #permalink

In addition to the usual "largest known perfect number" consequence, these new primes lower the exponent for the best known locally decodable codes to below O(n0.0000000232).

By Paul Beame (not verified) on 19 Sep 2008 #permalink

That should say the complexity of the best such codes, not the exponent.

By Paul Beame (not verified) on 19 Sep 2008 #permalink

Not only did they discover, the largest prime number, but this was also the number of points that their football team gave up in the last game.

By Roger Nullset (not verified) on 27 Sep 2008 #permalink