MersennePrimeExponent

MersennePrimeExponent[n]

gives the n^(th) Mersenne prime exponent.

Details

  • A Mersenne prime exponent is a prime number p for which the Mersenne number is prime.
  • In MersennePrimeExponent[n], n must be a positive integer.
  • As of this version of the Wolfram Language, only the first 45 Mersenne prime exponents are known. MersennePrimeExponent[n] will attempt to find Mersenne prime exponents for larger n, but cannot be expected to return results in a reasonable time.

Examples

open allclose all

Basic Examples  (1)

Return the first ten Mersenne prime exponents:

In[1]:=
Click for copyable input
Out[1]=

Construct the corresponding Mersenne primes:

In[2]:=
Click for copyable input
Out[2]=

Check that they are all primes:

In[3]:=
Click for copyable input
Out[3]=

Scope  (1)

Properties & Relations  (5)

Possible Issues  (1)

See Also

MersennePrimeExponentQ  Prime  PrimeQ  PerfectNumber  PerfectNumberQ

Introduced in 2016
(10.4)