File:Digits_in_largest_prime_found_as_a_function_of_time.svg · Wikimedia Commons · See Wikimedia Commons
Mersenne prime
Sign in to saveprime number of the form 2ⁿ−1
A Mersenne prime is a prime number that can be expressed as 2ⁿ−1, meaning one less than a power of two. These special primes are mathematically interesting and have been studied for centuries, though it remains unknown whether infinitely many of them exist.
AI-generated from the Wikipedia summary — may contain errors.
Wikidata facts
Show 1 more fact
- Commons category
- Mersenne prime numbers
Sources (3)
via Wikidata · CC0
~32 min read
Article
In mathematics, a Mersenne prime is a prime number that is one less than a power of two. That is, it is a prime number of the form Mn = 2 − 1 for some integer n. They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century. If n is a composite number then so is 2 − 1. Therefore, an equivalent definition of the Mersenne primes is that they are the prime numbers of the form Mp = 2 − 1 for some prime p.
The exponents n that give Mersenne primes are 2, 3, 5, 7, 13, 17, 19, 31, ... (sequence A000043 in the OEIS) and the resulting Mersenne primes are 3, 7, 31, 127, 8191, 131071, 524287, 2147483647, ... (sequence A000668 in the OEIS).