Catalan–Mersenne Number

In mathematics, a double Mersenne number is a Mersenne number of the form

:$M_ = 2^-1$

where ''p'' is prime.

Examples

The first four terms of the sequence of double Mersenne numbers areChris Caldwell
''Mersenne Primes: History, Theorems and Lists''
at the Prime Pages. :
:$M_ = M_3 = 7$
:$M_ = M_7 = 127$
:$M_ = M_ = 2147483647$
:$M_ = M_ = 170141183460469231731687303715884105727$

Double Mersenne primes

A double Mersenne number that is prime is called a double Mersenne prime. Since a Mersenne number ''M''_''p'' can be prime only if ''p'' is prime, (see Mersenne prime for a proof), a double Mersenne number $M_$ can be prime only if ''M''_''p'' is itself a Mersenne prime. For the first values of ''p'' for which ''M''_''p'' is prime, $M_$ is known to be prime for ''p'' = 2, 3, 5, 7 while explicit factors of $M_$ have been found for ''p'' = 13, 17, 19, and mersenne prime 31.

Thus, the smallest candidate for the next double Mersenne prime is $M_$, or 2^{2305843009213693951} − 1.
Being approximately 1.695,
this number is far too large for any currently known primality test. It has no prime factor below 1 × 10³⁶.
There are probably no other double Mersenne primes than the four known.

Smallest prime factor of $M_$ (where ''p'' is the ''n''th prime) are

:7, 127, 2147483647, 170141183460469231731687303715884105727, 47, 338193759479, 231733529, 62914441, 2351, 1399, 295257526626031, 18287, 106937, 863, 4703, 138863, 22590223644617, ... (next term is > 1 × 10³⁶)

Catalan–Mersenne number conjecture

The recursively defined sequence
: $c_0 = 2$
: $c_ = 2^-1 = M_$
is called the sequence of Catalan–Mersenne numbers. The first terms of the sequence are:
:$c_0 = 2$
:$c_1 = 2^2-1 = 3$
:$c_2 = 2^3-1 = 7$
:$c_3 = 2^7-1 = 127$
:$c_4 = 2^-1 = 170141183460469231731687303715884105727$
:$c_5 = 2^-1 \approx 5.45431 \times 10^ \approx 10^$
Catalan discovered this sequence after the discovery of the primality of $M_=c_4$ by Lucas in 1876.L. E. Dickson,
History of the theory of numbers. Volume 1: Divisibility and primality
' (1919). Published by Washington, Carnegie Institution of Washington.^{p. 22} Catalan conjectured that they are prime "up to a certain limit". Although the first five terms are prime, no known methods can prove that any further terms are prime (in any reasonable time) simply because they are too huge. However, if $c_5$ is not prime, there is a chance to discover this by computing $c_5$ modulo some small prime $p$ (using recursive modular exponentiation). If the resulting residue is zero, $p$ represents a factor of $c_5$ and thus would disprove its primality. Since $c_5$ is a Mersenne number, such a prime factor $p$ would have to be of the form $2kc_4 +1$. Additionally, because $2^n-1$ is composite when $n$ is composite, the discovery of a composite term in the sequence would preclude the possibility of any further primes in the sequence.

If $c_5$ were prime, it would also contradict the New Mersenne conjecture. It is known that $\frac$ is composite, with factor $886407410000361345663448535540258622490179142922169401 = 5209834514912200c_4 + 1$.''New Mersenne Conjecture''
/ref>

In popular culture

In the ''Futurama'' movie ''The Beast with a Billion Backs'', the double Mersenne number $M_$ is briefly seen in "an elementary proof of the Goldbach conjecture". In the movie, this number is known as a "Martian prime".

See also

* Cunningham chain
* Double exponential function
* Fermat number
* Perfect number
* Wieferich prime

References

Further reading

*.

External links

*
* Tony Forbes
A search for a factor of MM61
.

Status of the factorization of double Mersenne numbers

Double Mersennes Prime Search

Operazione Doppi Mersennes

{{Mersenne

Eponymous numbers in mathematics
Integer sequences
Large integers
Unsolved problems in number theory
Mersenne primes