Definition:Mersenne Prime

Definition
A Mersenne prime is a Mersenne number which happens to be prime.

That is, it is a prime number of the form $2^p - 1$.

From Primes of the Form of a Power Less One, it is clear that in order for $2^p - 1$ to be prime, then $p$ must also be prime.

The number $2^p - 1$ is, in this context, often denoted $M_p$.

It is not known whether there is an infinite number of Mersenne primes.

Historical Note
They are named for Marin Mersenne, who published a book Cogitata Physico-Mathematica in 1644, in which he claimed that the only primes $p \le 257$ for which $2^p - 1$ is prime are $2, 3, 5, 7, 13, 17, 19, 31, 67, 127$ and $257$.

He was not entirely correct, as shall be seen.

Previous to that, the special nature of these primes had been noted by Euclid, who showed that if $2^n - 1$ is prime, then $2^{n-1} \left({2^n - 1}\right)$ is perfect. The first four primes of this form were known to him.

The fifth one, $M_{13}$, may have been known to Iamblichus in the 4th century A.D., but this is uncertain, as he does not explicitly demonstrate it. It was definitely known about by 1456.

Pietro Cataldi is supposed to have discovered the 6th and 7th Mersenne primes $M_{17}$ and $M_{19}$ in 1588. Recent researches, however, suggest that these may have already been discovered by 1460. But as no evidence has been found from that date that they had been proven to be prime, it is possible that these were just lucky guesses.

Cataldi also claimed the primality of the Mersenne numbers $M_{23}, M_{29}, M_{31}$ and $M_{37}$. In this he was correct only about $M_{31}$, so it is more than possible he was only guessing.

Work started in earnest on these numbers from Mersenne's work.


 * In the 17th century, Fermat showed that $M_{23}$ has $47$ as a divisor, and that $M_{37}$ has $223$ as a factor.


 * 1738: Euler showed that $M_{29}$ is composite, having the factor $233$.


 * 1772: Euler showed that $M_{31}$ is indeed prime.


 * 1811: Peter Barlow (somewhat short-sightedly, given historical 20-20 hindsight) stated in his book that $M_{31}$ "is the the greatest [i.e. Mersenne number] at present known to be such ... and probably the greatest that ever will be discovered." See Barlow's Prediction.


 * 1876: Édouard Lucas proved that $M_{127}$ is prime, and also discovered that $M_{67}$ is actually composite.


 * 1883: Ivan Pervushin proved that $M_{61}$ is prime.


 * 1903: The factors of $M_{67}$ were found by Frank Cole who delivered a now famous lecture On The Factorization of Large Numbers in which he performed (without uttering a word) the arithmetic demonstrating what those factors were.


 * 1911: R. E. Powers proved that $M_{89}$ is prime.


 * 1914: R. E. Powers proved that $M_{107}$ is prime.


 * 1916: R. E. Powers proved that $M_{241}$ is composite.


 * 1922: Maurice Kraitchik proved that $M_{257}$ is actually composite.

Thus Mersenne's assertion was finally investigated in full: he had been determined to be wrong by including $M_{67}$ and $M_{257}$ in his list of primes, and by failing to include $M_{61}$, $M_{89}$ and $M_{107}$.

(Pervushin's discovery of the primality of $M_{61}$ caused some to suggest that Mersenne's claim of the primality of $M_{67}$ may have been a copying error for $M_{61}$.)

Nobody will ever know how Mersenne came to his conclusions, as it is impossible with the mathematical knowledge of the time for him to have worked it all out by hand. The fact that he made so few mistakes is incredible.

The work continued, and does so to this day.


 * 1952: Raphael Robinson used a computer to show that $M_{521}, M_{607}, M_{1279}, M_{2203}$ and $M_{2281}$ are all prime.


 * During the next four decades, the count of known Mersenne primes was doubled by various mathematicians testing supercomputers.

Since then, hunting for Mersenne primes has become a casual hobby for anyone who has access to a computer.

Testing Primality of a Mersenne number
The Lucas-Lehmer Test is a way of determining the primality of a given $M_p$ without laboriously testing each possible prime divisor.

G.I.M.P.S.
"G.I.M.P.S." (Great Internet Mersenne Prime Search), or just "GIMPS", has become a gathering place for Number Theorists interested in the discovery of the Mersenne primes.

In August and September of 2008 alone, both the 45th and 46th Mersenne primes were discovered:

$M_{43,112,609}$ (a 12,978,189 digit number)

and

$M_{37,156,667}$ (an 11,185,272 digit number)

becoming the first Mersenne primes of 10 million digits to be found.

You can follow the work of G.I.M.P.S. at www.mersenne.org.

Currently known Mersenne Primes
Note that the index numbers of Mersenne primes after no. 40 are uncertain, as there may still be undiscovered Mersenne primes between the 39th and 47th. Not all numbers in that range have been explored yet.