Mersenne prime

Unsolved problem in mathematics: Are there infinitely many Mersenne primes? (more unsolved problems in mathematics)

Many fundamental questions about Mersenne primes remain unresolved. It is not even known whether the set of Mersenne primes is finite or infinite. The Lenstra–Pomerance–Wagstaff conjecture asserts that there are infinitely many Mersenne primes and predicts their order of growth. It is also not known whether infinitely many Mersenne numbers with prime exponents are composite, although this would follow from widely believed conjectures about prime numbers, for example, the infinitude of Sophie Germain primes congruent to 3 (mod 4). For these primes p, 2p + 1 (which is also prime) will divide M_p, for example, 23 | M₁₁, 47 | M₂₃, 167 | M₈₃, 263 | M₁₃₁, 359 | M₁₇₉, 383 | M₁₉₁, 479 | M₂₃₉, and 503 | M₂₅₁ (sequence A002515 in the OEIS). Since for these primes p, 2p + 1 is congruent to 7 mod 8, so 2 is a quadratic residue mod 2p + 1, and the multiplicative order of 2 mod 2p + 1 must divide ${\displaystyle {\frac {(2p+1)-1}{2}}}$ = p. Since p is a prime, it must be p or 1. However, it cannot be 1 since ${\displaystyle \Phi _{1}(2)=1}$ and 1 has no prime factors, so it must be p. Hence, 2p + 1 divides ${\displaystyle \Phi _{p}(2)=2^{p}-1}$ and ${\displaystyle 2^{p}-1=M_{p}}$ cannot be prime.

The first four Mersenne primes are M₂ = 3, M₃ = 7, M₅ = 31 and M₇ = 127 and because the first Mersenne prime starts at M₂, all Mersenne primes are congruent to 3 (mod 4). Other than M₀ = 0 and M₁ = 1, all other Mersenne numbers are also congruent to 3 (mod 4). Consequently, in the prime factorization of a Mersenne number ( ≥ M₂ ) there must be at least one prime factor congruent to 3 (mod 4).

A basic theorem about Mersenne numbers states that if M_p is prime, then the exponent p must also be prime. This follows from the identity

${\displaystyle {\begin{aligned}2^{ab}-1&=(2^{a}-1)\cdot \left(1+2^{a}+2^{2a}+2^{3a}+\cdots +2^{(b-1)a}\right)\\&=(2^{b}-1)\cdot \left(1+2^{b}+2^{2b}+2^{3b}+\cdots +2^{(a-1)b}\right).\end{aligned}}}$

This rules out primality for Mersenne numbers with composite exponent, such as M₄ = 2⁴ − 1 = 15 = 3 × 5 = (2² − 1) × (1 + 2²).

Though the above examples might suggest that M_p is prime for all primes p, this is not the case, and the smallest counterexample is the Mersenne number

M₁₁ = 2¹¹ − 1 = 2047 = 23 × 89.

The evidence at hand suggests that a randomly selected Mersenne number is much more likely to be prime than an arbitrary randomly selected odd integer of similar size.[3] Nonetheless, prime values of M_p appear to grow increasingly sparse as p increases. For example, eight of the first 11 primes p give rise to a Mersenne prime M_p (the correct terms on Mersenne's original list), while M_p is prime for only 43 of the first two million prime numbers (up to 32,452,843).

The lack of any simple test to determine whether a given Mersenne number is prime makes the search for Mersenne primes a difficult task, since Mersenne numbers grow very rapidly. The Lucas–Lehmer primality test (LLT) is an efficient primality test that greatly aids this task, making it much easier to test the primality of Mersenne numbers than that of most other numbers of the same size. The search for the largest known prime has somewhat of a cult following. Consequently, a lot of computer power has been expended searching for new Mersenne primes, much of which is now done using distributed computing.

Arithmetic modulo a Mersenne number is particularly efficient on a binary computer, making them popular choices when a prime modulus is desired, such as the Park–Miller random number generator. To find a primitive polynomial of Mersenne number order requires knowing the factorization of that number, so Mersenne primes allow one to find to primitive polynomials of very high order. Such primitive trinomials are used in pseudorandom number generators with very large periods such as the Mersenne twister, generalized shift register and Lagged Fibonacci generators.

Mersenne primes M_p are closely connected to perfect numbers. In the 4th century BC, Euclid proved that if 2^p − 1 is prime, then 2^{p − 1}(2^p − 1) is a perfect number. In the 18th century, Leonhard Euler proved that, conversely, all even perfect numbers have this form.[4] This is known as the Euclid–Euler theorem. It is unknown whether there are any odd perfect numbers.

Mersenne primes take their name from the 17th-century French scholar Marin Mersenne, who compiled what was supposed to be a list of Mersenne primes with exponents up to 257. The exponents listed by Mersenne were as follows:

2, 3, 5, 7, 13, 17, 19, 31, 67, 127, 257.

His list replicated the known primes of his time with exponents up to 19. His next entry, 31, was correct, but the list then became largely incorrect, as Mersenne mistakenly included M₆₇ and M₂₅₇ (which are composite) and omitted M₆₁, M₈₉, and M₁₀₇ (which are prime). Mersenne gave little indication of how he came up with his list.[5]

Édouard Lucas proved in 1876 that M₁₂₇ is indeed prime, as Mersenne claimed. This was the largest known prime number for 75 years, and the largest ever found manually (without the aid of computers). M₆₁ was determined to be prime in 1883 by Ivan Mikheevich Pervushin, though Mersenne claimed it was composite, and for this reason it is sometimes called Pervushin's number. This was the second-largest known prime number, and it remained so until 1911. Lucas had shown another error in Mersenne's list in 1876. Without finding a factor, Lucas demonstrated that M₆₇ is actually composite. No factor was found until a famous talk by Frank Nelson Cole in 1903.[6] Without speaking a word, he went to a blackboard and raised 2 to the 67th power, then subtracted one. On the other side of the board, he multiplied 193,707,721 × 761,838,257,287 and got the same number, then returned to his seat (to applause) without speaking.[7] He later said that the result had taken him "three years of Sundays" to find.[8] A correct list of all Mersenne primes in this number range was completed and rigorously verified only about three centuries after Mersenne published his list.

Fast algorithms for finding Mersenne primes are available, and as of June 2019 the seven largest known prime numbers are Mersenne primes.

The first four Mersenne primes M₂ = 3, M₃ = 7, M₅ = 31 and M₇ = 127 were known in antiquity. The fifth, M₁₃ = 8191, was discovered anonymously before 1461; the next two (M₁₇ and M₁₉) were found by Pietro Cataldi in 1588. After nearly two centuries, M₃₁ was verified to be prime by Leonhard Euler in 1772. The next (in historical, not numerical order) was M₁₂₇, found by Édouard Lucas in 1876, then M₆₁ by Ivan Mikheevich Pervushin in 1883. Two more (M₈₉ and M₁₀₇) were found early in the 20th century, by R. E. Powers in 1911 and 1914, respectively.

The best method presently known for testing the primality of Mersenne numbers is the Lucas–Lehmer primality test. Specifically, it can be shown that for prime p > 2, M_p = 2^p − 1 is prime if and only if M_p divides S_{p − 2}, where S₀ = 4 and S_k = (S_{k − 1})² − 2 for k > 0.

During the era of manual calculation, all the exponents up to and including 257 were tested with the Lucas–Lehmer test and found to be composite. A notable contribution was made by retired Yale physics professor Horace Scudder Uhler, who did the calculations for exponents 157, 167, 193, 199, 227, and 229.[9] Unfortunately for those investigators, the interval they were testing contains the largest known relative gap between Mersenne primes: the next Mersenne prime exponent, 521, would turn out to be more than four times larger than the previous record of 127.

Graph of number of digits in largest known Mersenne prime by year – electronic era. The vertical scale is logarithmic in the number of digits, thus being a ${\displaystyle \log(\log(y))}$ function in the value of the prime.

The search for Mersenne primes was revolutionized by the introduction of the electronic digital computer. Alan Turing searched for them on the Manchester Mark 1 in 1949,[10] but the first successful identification of a Mersenne prime, M₅₂₁, by this means was achieved at 10:00 pm on January 30, 1952 using the U.S. National Bureau of Standards Western Automatic Computer (SWAC) at the Institute for Numerical Analysis at the University of California, Los Angeles, under the direction of Lehmer, with a computer search program written and run by Prof. R. M. Robinson. It was the first Mersenne prime to be identified in thirty-eight years; the next one, M₆₀₇, was found by the computer a little less than two hours later. Three more — M₁₂₇₉, M₂₂₀₃, and M₂₂₈₁ — were found by the same program in the next several months. M₄₂₅₃ is the first Mersenne prime that is titanic, M_44,497 is the first gigantic, and M_6,972,593 was the first megaprime to be discovered, being a prime with at least 1,000,000 digits.[11] All three were the first known prime of any kind of that size. The number of digits in the decimal representation of M_n equals ⌊n × log₁₀2⌋ + 1, where ⌊x⌋ denotes the floor function (or equivalently ⌊log₁₀M_n⌋ + 1).

In September 2008, mathematicians at UCLA participating in the Great Internet Mersenne Prime Search (GIMPS) won part of a $100,000 prize from the Electronic Frontier Foundation for their discovery of a very nearly 13-million-digit Mersenne prime. The prize, finally confirmed in October 2009, is for the first known prime with at least 10 million digits. The prime was found on a Dell OptiPlex 745 on August 23, 2008. This was the eighth Mersenne prime discovered at UCLA.[12]

On April 12, 2009, a GIMPS server log reported that a 47th Mersenne prime had possibly been found. The find was first noticed on June 4, 2009, and verified a week later. The prime is 2^42,643,801 − 1. Although it is chronologically the 47th Mersenne prime to be discovered, it is smaller than the largest known at the time, which was the 45th to be discovered.

On January 25, 2013, Curtis Cooper, a mathematician at the University of Central Missouri, discovered a 48th Mersenne prime, 2^57,885,161 − 1 (a number with 17,425,170 digits), as a result of a search executed by a GIMPS server network.[13]

On January 19, 2016, Cooper published his discovery of a 49th Mersenne prime, 2^74,207,281 − 1 (a number with 22,338,618 digits), as a result of a search executed by a GIMPS server network.[14][15][16] This was the fourth Mersenne prime discovered by Cooper and his team in the past ten years.

On September 2, 2016, the Great Internet Mersenne Prime Search finished verifying all tests below M_37,156,667, thus officially confirming its position as the 45th Mersenne prime.[17]

On January 3, 2018, it was announced that Jonathan Pace, a 51-year-old electrical engineer living in Germantown, Tennessee, had found a 50th Mersenne prime, 2^77,232,917 − 1 (a number with 23,249,425 digits), as a result of a search executed by a GIMPS server network.[18]

On December 21, 2018, it was announced that The Great Internet Mersenne Prime Search (GIMPS) discovered the largest known prime number, 2^82,589,933 − 1, having 24,862,048 digits. A computer volunteered by Patrick Laroche from Ocala, Florida made the find on December 7, 2018.[19]

1. If a and p are natural numbers such that a^p − 1 is prime, then a = 2 or p = 1.
   • Proof: a ≡ 1 (mod a − 1). Then a^p ≡ 1 (mod a − 1), so a^p − 1 ≡ 0 (mod a − 1). Thus a − 1 | a^p − 1. However, a^p − 1 is prime, so a − 1 = a^p − 1 or a − 1 = ±1. In the former case, a = a^p, hence a = 0, 1 (which is a contradiction, as neither −1 nor 0 is prime) or p = 1. In the latter case, a = 2 or a = 0. If a = 0, however, 0^p − 1 = 0 − 1 = −1 which is not prime. Therefore, a = 2.
2. If 2^p − 1 is prime, then p is prime.
   • Proof: Suppose that p is composite, hence can be written p = ab with a and b > 1. Then 2^p − 1 = 2^ab − 1 = (2^a)^b − 1 = (2^a − 1)((2^a)^b−1 + (2^a)^b−2 + … + 2^a + 1) so 2^p − 1 is composite. By contrapositive, if 2^p − 1 is prime then p is prime.
3. If p is an odd prime, then every prime q that divides 2^p − 1 must be 1 plus a multiple of 2p. This holds even when 2^p − 1 is prime.
   • For example, 2⁵ − 1 = 31 is prime, and 31 = 1 + 3 × (2 × 5). A composite example is 2¹¹ − 1 = 23 × 89, where 23 = 1 + (2 × 11) and 89 = 1 + 4 × (2 × 11).
   • Proof: By Fermat's little theorem, q is a factor of 2^q−1 − 1. Since q is a factor of 2^p − 1, for all positive integers c, q is also a factor of 2^pc − 1. Since p is prime and q is not a factor of 2¹ − 1, p is also the smallest positive integer x such that q is a factor of 2^x − 1. As a result, for all positive integers x, q is a factor of 2^x − 1 if and only if p is a factor of x. Therefore, since q is a factor of 2^q−1 − 1, p is a factor of q − 1 so q ≡ 1 (mod p). Furthermore, since q is a factor of 2^p − 1, which is odd, q is odd. Therefore, q ≡ 1 (mod 2p).
   • This fact leads to a proof of Euclid's theorem, which asserts the infinitude of primes, distinct from the proof written by Euclid: for every odd prime p, all primes dividing 2^p − 1 are larger than p; thus there are always larger primes than any particular prime.
   • It follows from this fact that for every prime p > 2, there is at least one prime of the form 2kp+1 less than or equal to M_p, for some integer k.
4. If p is an odd prime, then every prime q that divides 2^p − 1 is congruent to ±1 (mod 8).
   • Proof: 2^p+1 ≡ 2 (mod q), so 2^1/2(p+1) is a square root of 2 mod q. By quadratic reciprocity, every prime modulus in which the number 2 has a square root is congruent to ±1 (mod 8).
5. A Mersenne prime cannot be a Wieferich prime.
   • Proof: We show if p = 2^m − 1 is a Mersenne prime, then the congruence 2^p−1 ≡ 1 (mod p²) does not hold. By Fermat's little theorem, m | p − 1. Therefore, one can write p − 1 = mλ. If the given congruence is satisfied, then p² | 2^mλ − 1, therefore 0 ≡ 2^mλ − 1/2^m − 1 = 1 + 2^m + 2^2m + ... + 2^{(λ − 1)m} ≡ −λ mod (2^m − 1). Hence 2^m − 1 | λ, and therefore λ ≥ 2^m − 1. This leads to p − 1 ≥ m(2^m − 1), which is impossible since m ≥ 2.
6. If m and n are natural numbers then m and n are coprime if and only if 2^m − 1 and 2ⁿ − 1 are coprime. Consequently, a prime number divides at most one prime-exponent Mersenne number.[20] That is, the set of pernicious Mersenne numbers is pairwise coprime.
7. If p and 2p + 1 are both prime (meaning that p is a Sophie Germain prime), and p is congruent to 3 (mod 4), then 2p + 1 divides 2^p − 1.[21]
   • Example: 11 and 23 are both prime, and 11 = 2 × 4 + 3, so 23 divides 2¹¹ − 1.
   • Proof: Let q be 2p + 1. By Fermat's little theorem, 2^2p ≡ 1 (mod q), so either 2^p ≡ 1 (mod q) or 2^p ≡ −1 (mod q). Supposing latter true, then 2^p+1 = (2^{1/2(p + 1)})² ≡ −2 (mod q), so −2 would be a quadratic residue mod q. However, since p is congruent to 3 (mod 4), q is congruent to 7 (mod 8) and therefore 2 is a quadratic residue mod q. Also since q is congruent to 3 (mod 4), −1 is a quadratic nonresidue mod q, so −2 is the product of a residue and a nonresidue and hence it is a nonresidue, which is a contradiction. Hence, the former congruence must be true and 2p + 1 divides M_p.
8. All composite divisors of prime-exponent Mersenne numbers are strong pseudoprimes to the base 2.
9. With the exception of 1, a Mersenne number cannot be a perfect power. That is, and in accordance with Mihăilescu's theorem, the equation 2^m − 1 = n^k has no solutions where m, n, and k are integers with m > 1 and k > 1.

The table below lists all known Mersenne primes (sequence A000043 (p) and A000668 (M_p) in OEIS):

All Mersenne numbers below the 51st Mersenne prime (M_82,589,933) have been tested at least once but some have not been double-checked. Primes are not always discovered in increasing order. For example, the 29th Mersenne prime was discovered after the 30th and the 31st. Similarly, M_43,112,609 was followed by two smaller Mersenne primes, first 2 weeks later and then 9 months later.[80] M_43,112,609 was the first discovered prime number with more than 10 million decimal digits.

The largest known Mersenne prime (2^82,589,933 − 1) is also the largest known prime number.[1]

The largest known prime has been a Mersenne prime since 1952, except between 1989 and 1992.[81]

Since they are prime numbers, Mersenne primes are divisible only by 1 and by themselves. However, not all Mersenne numbers are Mersenne primes, and the composite Mersenne numbers may be factored non-trivially. Mersenne numbers are very good test cases for the special number field sieve algorithm, so often the largest number factorized with this algorithm has been a Mersenne number. As of June 2019, 2^1,193 − 1 is the record-holder,[82] having been factored with a variant of the special number field sieve that allows the factorization of several numbers at once. See integer factorization records for links to more information. The special number field sieve can factorize numbers with more than one large factor. If a number has only one very large factor then other algorithms can factorize larger numbers by first finding small factors and then making a primality test on the cofactor. As of June 2019, the largest factorization with probable prime factors allowed is 2^7,313,983 − 1 = 305,492,080,276,193 × q, where q is a 2,201,714-digit probable prime. It was discovered by Oliver Kruse.[83] As of June 2019, the Mersenne number M₁₂₇₇ is the smallest composite Mersenne number with no known factors; it has no prime factors below 2⁶⁷.[84]

The table below shows factorizations for the first 20 composite Mersenne numbers (sequence A244453 in the OEIS).

The number of factors for the first 500 Mersenne numbers can be found at (sequence A046800 in the OEIS).

In the mathematical problem Tower of Hanoi, solving a puzzle with an n-disc tower requires M_n steps, assuming no mistakes are made.[85] The number of rice grains on the whole chessboard in the wheat and chessboard problem is M₆₄.

The asteroid with minor planet number 8191 is named 8191 Mersenne after Marin Mersenne, because 8191 is a Mersenne prime (3 Juno, 7 Iris, 31 Euphrosyne and 127 Johanna having been discovered and named during the 19th century).[86]

In geometry, an integer right triangle that is primitive and has its even leg a power of 2 ( ≥ 4 ) generates a unique right triangle such that its inradius is always a Mersenne number. For example, if the even leg is 2^n + 1 then because it is primitive it constrains the odd leg to be 4ⁿ − 1, the hypotenuse to be 4ⁿ + 1 and its inradius to be 2ⁿ − 1.[87]

The Mersenne numbers were studied with respect to the total number of accepting paths of non-deterministic polynomial time Turing machines in 2018[88] and intriguing inclusions were discovered.

A Mersenne–Fermat number is defined as 2^pr − 1/2^{pr − 1} − 1, with p prime, r natural number, and can be written as MF(p, r). When r = 1, it is a Mersenne number. When p = 2, it is a Fermat number. The only known Mersenne–Fermat primes with r > 1 are

MF(2, 2), MF(2, 3), MF(2, 4), MF(2, 5), MF(3, 2), MF(3, 3), MF(7, 2), and MF(59, 2).[89]

In fact, MF(p, r) = Φ_p^r(2), where Φ is the cyclotomic polynomial.

The simplest generalized Mersenne primes are prime numbers of the form f(2ⁿ), where f(x) is a low-degree polynomial with small integer coefficients.[90] An example is 2⁶⁴ − 2³² + 1, in this case, n = 32, and f(x) = x² − x + 1; another example is 2¹⁹² − 2⁶⁴ − 1, in this case, n = 64, and f(x) = x³ − x − 1.

It is also natural to try to generalize primes of the form 2ⁿ − 1 to primes of the form bⁿ − 1 (for b ≠ 2 and n > 1). However (see also theorems above), bⁿ − 1 is always divisible by b − 1, so unless the latter is a unit, the former is not a prime. This can be remedied by allowing b to be an algebraic integer instead of an integer:

Look up Mersenne prime in Wiktionary, the free dictionary.

• "Mersenne number", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
• GIMPS home page
• GIMPS status — status page gives various statistics on search progress, typically updated every week, including progress towards proving the ordering of the largest known Mersenne primes
• GIMPS, known factors of Mersenne numbers
• M_q = (8x)² − (3qy)² Property of Mersenne numbers with prime exponent that are composite (PDF)
• M_q = x² + d·y² math thesis (PS)
• Grime, James. "31 and Mersenne Primes". Numberphile. Brady Haran. Archived from the original on 2013-05-31. Retrieved 2013-04-06.
• Mersenne prime bibliography with hyperlinks to original publications
• report about Mersenne primes — detection in detail (in German)
• GIMPS wiki
• Will Edgington's Mersenne Page — contains factors for small Mersenne numbers
• Known factors of Mersenne numbers
• Decimal digits and English names of Mersenne primes
• Prime curios: 2305843009213693951
• http://www.leyland.vispa.com/numth/factorization/cunningham/2-.txt Archived 2014-11-05 at the Wayback Machine
• http://www.leyland.vispa.com/numth/factorization/cunningham/2+.txt Archived 2013-05-02 at the Wayback Machine
• OEIS sequence A250197 (Numbers n such that the left Aurifeuillian primitive part of 2^n+1 is prime)—Factorization of Mersenne numbers M_n (n up to 1280)
• Factorization of completely factored Mersenne numbers
• The Cunningham project, factorization of bⁿ ± 1, b = 2, 3, 5, 6, 7, 10, 11, 12
• http://www.leyland.vispa.com/numth/factorization/cunningham/main.htm Archived 2016-03-04 at the Wayback Machine
• http://www.leyland.vispa.com/numth/factorization/anbn/main.htm Archived 2016-02-02 at the Wayback Machine