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.

Ancestors (6)

  1. Integer sequences
  2. Numbers
  3. Arithmetic
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Mersenne prime by Ciro Santilli 37 Updated 2025-07-16
Read the full article
See all articles in the same topic Create my own version