gives the n
Mersenne prime exponent.
MersennePrimeExponent
gives the n
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 50 Mersenne prime exponents have definite ranking. Two more Mersenne prime exponents are known, but their ranking is still unknown. MersennePrimeExponent[n] will attempt to find Mersenne prime exponents for n larger than 50, but cannot be expected to return results in a reasonable time.
Examples
open all close allBasic Examples (1)
Scope (1)
MersennePrimeExponent automatically threads over lists:
MersennePrimeExponent[Range[10]]Properties & Relations (5)
Mersenne prime exponents generate even perfect numbers:
n = Range[10];
mpe = MersennePrimeExponent[n]PerfectNumber[n, "Even"] == 2 ^ (mpe - 1)(2 ^ mpe - 1)Triangular numbers of Mersenne primes generate even perfect numbers:
mersennePrime[n_] := 2 ^ MersennePrimeExponent[n] - 1;
range = Range[40];PolygonalNumber[mersennePrime[range]] == PerfectNumber[range, "Even"]Hexagonal numbers related to Mersenne prime exponents generate even perfect numbers:
powertwo[n_] := 2 ^ (MersennePrimeExponent[n] - 1);
range = Range[40];PolygonalNumber[6, powertwo[range]] == PerfectNumber[range, "Even"]Mersenne prime exponents generate superperfect numbers:
superPerfectQ[n_] := DivisorSigma[1, DivisorSigma[1, n]] == 2n;
powertwo[n_] := 2 ^ (MersennePrimeExponent[n] - 1);AllTrue[powertwo[Range[20]], superPerfectQ]A trinomial whose order is a Mersenne prime exponent is primitive modulo 2 if and only if it is irreducible:
MersennePrimeExponent[10]poly = x ^ 89 + x ^ 38 + 1;PrimitivePolynomialQ[poly, 2]IrreduciblePolynomialQ[poly, Modulus -> 2]Possible Issues (1)
As of this version of the Wolfram Language, only 50 Mersenne prime exponents have definite ranking:
TimeConstrained[MersennePrimeExponent[51], 10]Two more Mersenne prime exponents are known, but their ranking is still unknown:
mpe = {82589933, 136279841};
AllTrue[mpe, # > MersennePrimeExponent[50]&]AllTrue[mpe, MersennePrimeExponentQ]See Also
MersennePrimeExponentQ Prime PrimeQ PerfectNumber PerfectNumberQ
Function Repository: MersennePrime
Related Guides
Text
Wolfram Research (2016), MersennePrimeExponent, Wolfram Language function, https://reference.wolfram.com/language/ref/MersennePrimeExponent.html (updated 2026).
CMS
Wolfram Language. 2016. "MersennePrimeExponent." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2026. https://reference.wolfram.com/language/ref/MersennePrimeExponent.html.
APA
Wolfram Language. (2016). MersennePrimeExponent. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/MersennePrimeExponent.html
BibTeX
@misc{reference.wolfram_2026_mersenneprimeexponent, author="Wolfram Research", title="{MersennePrimeExponent}", year="2026", howpublished="\url{https://reference.wolfram.com/language/ref/MersennePrimeExponent.html}", note=[Accessed: 12-June-2026]}
BibLaTeX
@online{reference.wolfram_2026_mersenneprimeexponent, organization={Wolfram Research}, title={MersennePrimeExponent}, year={2026}, url={https://reference.wolfram.com/language/ref/MersennePrimeExponent.html}, note=[Accessed: 12-June-2026]}