TOPICS
Search

Gaussian Mersenne Prime


A Gaussian Mersenne prime is a Gaussian prime of the form

 M_n=(1+i)^n-1.

The Gaussian integer M_n is called a Gaussian Mersenne number even when it is not a Gaussian prime. The corresponding number (1-i)^n-1 is its complex conjugate. In terms of the squared complex modulus,

 N(M_n)=M_nM_n^_=2^n-2^(1+n/2)cos((npi)/4)+1.

Consequently, M_n is a Gaussian prime iff N(M_n) is an ordinary prime (Berrizbeitia and Iskra 2010).

The known exponents n are 2, 3, 5, 7, 11, 19, 29, 47, 73, 79, 113, 151, 157, 163, 167, 239, 241, 283, 353, 367, 379, 457, 997, ... (OEIS A057429). Other than 2, every such exponent must itself be a prime. The exponents satisfying n=1 (mod 8) begin 73, 113, 241, 353, 457, 3041, 27529, 364289, 991961, 1203793, 1667321, and 4792057. They give perfect Gaussian integers by McDaniel's construction.

As of Aug. 2026, the largest Gaussian Mersenne prime listed by the Prime Pages has n=15317227. Its squared complex modulus, 2^(15317227)+2^(7658614)+1, is a prime number containing 4,610,945 digits (Caldwell).


See also

Gaussian Integer, Gaussian Prime, Mersenne Prime, Perfect Gaussian Integer

Explore with Wolfram|Alpha

References

Berrizbeitia, P. and Iskra, B. "Gaussian Mersenne and Eisenstein Mersenne Primes." Math. Comput. 79, 1779-1791, 2010. https://doi.org/10.1090/S0025-5718-10-02324-0.Caldwell, C. "Gaussian Mersenne Norm." The Prime Pages. https://t5k.org/top20/page.php?id=41.Sloane, N. J. A. Sequence A057429 in "The On-Line Encyclopedia of Integer Sequences."

Cite this as:

Weisstein, Eric W. "Gaussian Mersenne Prime." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GaussianMersennePrime.html

Subject classifications