Mersenne conjectures

In mathematics, the Mersenne conjectures concern the characterization of prime numbers of a form called Mersenne primes, meaning prime numbers that are a power of two minus one.

1 Original Mersenne conjecture
2 New Mersenne conjecture
3 Lenstra–Pomerance–Wagstaff conjecture
4 See also
5 References
6 External links

Original Mersenne conjecture

The original, called Mersenne's conjecture, was a statement by Marin Mersenne in his Cogitata Physica-Mathematica (1644; see e.g. Dickson 1919) that the numbers $2^n - 1$ were prime for n = 2, 3, 5, 7, 13, 17, 19, 31, 67, 127 and 257, and were composite for all other positive integers n < 257. Due to the size of these numbers, Mersenne did not and could not test all of them, nor could his peers in the 17th century. It was eventually determined, after three centuries and the availability of new techniques such as the Lucas–Lehmer test, that Mersenne's conjecture contained five errors, namely two are composite (n = 67, 257) and three omitted primes (n = 61, 89, 107). The correct list is: n = 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107 and 127.

While Mersenne's original conjecture is false, it has led to the New Mersenne conjecture and the Lenstra–Pomerance–Wagstaff conjecture.

New Mersenne conjecture

The New Mersenne conjecture or Bateman, Selfridge and Wagstaff conjecture (Bateman et al. 1989) states that for any odd natural number p, if any two of the following conditions hold, then so does the third:

p = 2^k ± 1 or p = 4^k ± 3 for some natural number k.
2^p − 1 is prime (a Mersenne prime).
(2^p + 1) / 3 is prime (a Wagstaff prime).

If p is an odd composite number, then 2^p − 1 and (2^p + 1)/3 are both composite. Therefore it is only necessary to test primes to verify the truth of the conjecture.

Currently, the known numbers for which all three conditions hold are: 3, 5, 7, 13, 17, 19, 31, 61, 127.

The New Mersenne conjecture can be thought of as an attempt to salvage the centuries-old Mersenne's conjecture, which is false. However, according to Robert D. Silverman, John Selfridge agreed that the New Mersenne conjecture is "obviously true" as it was chosen to fit the known data and counter-examples beyond those cases are exceedingly unlikely. It may be regarded more as a curious observation than as an open question in need of proving.

Renaud Lifchitz has shown that the NMC is true for all integers less than or equal to 16,777,212 by systematically testing all odd primes for which it is already known that one of the conditions holds. His website documents the verification of results up to this number. Another, currently more up-to-date status page on the NMC is The New Mersenne Prime conjecture.

Lenstra–Pomerance–Wagstaff conjecture

Lenstra, Pomerance, and Wagstaff have conjectured that there is an infinite number of Mersenne primes, and, more precisely, that the number of Mersenne primes less than x is asymptotically approximated by

$e^\gamma\cdot\log \log(x)/\log(2),$ ^[1]

where γ is the Euler–Mascheroni constant. In other words, the number of Mersenne primes with exponent p less than y is asymptotically

$e^\gamma\cdot\log(y)/\log(2).$ ^[1]

This means that there should on average be about $e^\gamma\cdot\log(10)/\log(2)$ ≈ 5.92 primes p of a given number of decimal digits such that $M_p$ is prime.

References

Bateman, P. T.; Selfridge, J. L.; Wagstaff, Jr., Samuel S. (1989). "The new Mersenne conjecture". American Mathematical Monthly (Mathematical Association of America) 96 (2): 125–128. doi:10.2307/2323195. JSTOR 2323195. MR 0992073.

Dickson, L. E. (1919). History of the Theory of Numbers. Carnegie Institute of Washington. pp. 31. OL 6616242M. Reprinted by Chelsea Publishing, New York, 1971, ISBN 0828400865.

^ ^a ^b http://primes.utm.edu/mersenne/heuristic.html

External links

The Prime Pages. Mersenne's conjecture.