Mersenne prime ( $M_{p} = 2^{p} - 1 prime$ )

A Mersenne prime is a Mersenne number that is a prime number. It is the prime factor required by the Euclid-Euler theorem;

3, 7, 31, 127

generate

6, 28, 496, 8128

. The family is named after Marin Mersenne.

 Ancestors (7)

 Incoming links (4)

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (2)

Mersenne prime by

Wikipedia Bot  1

A Mersenne prime is a specific type of prime number that can be expressed in the form \(M_n = 2^n - 1\), where \(n\) is a positive integer. In other words, if \(M_n\) is prime, then \(n\) itself must also be prime.

 Read the full article

Mersenne prime by

Ciro Santilli  40 Updated 2025-07-16

 Read the full article

  See all articles in the same topic Create my own version