A Mersenne prime is a prime number that is one less than a power of two, written 2 to the n minus 1 for some whole number n. They are named after the French friar Marin Mersenne, who studied numbers of this form in the early seventeenth century. A number of this form can only be prime if its exponent n is itself prime, though a prime exponent does not guarantee the result is prime. As of 2024, 52 Mersenne primes are known, the largest being 2 to the 136,279,841 minus 1, found in October 2024, and since 1997 essentially every new one has been discovered by the distributed computing project GIMPS, the Great Internet Mersenne Prime Search. The Euclid-Euler theorem ties Mersenne primes directly to even perfect numbers: every Mersenne prime generates an even perfect number, and every even perfect number arises this way.
Facts
Connections
Attributed To
Source Mersenne Prime (Wikipedia)
In Branch
Source Wolfram MathWorld: Mersenne Prime
Is Kind Of Object
Sources
1. Mersenne Prime (Wikipedia)
History section
The exponents listed by Mersenne in 1644 were as follows: 2, 3, 5, 7, 13, 17, 19, 31, 67, 127, 257.
Attributed To: Marin Mersenne, Lead
They are named after Marin Mersenne, a French Minim friar, who studied them in the early 17th century
View the SourceWolfram MathWorld: Mersenne Prime
Wolfram MathWorldIn Branch: Number Theory, Subject classificationsQuote, In Branch: Number Theory, Subject classifications
Number Theory Special Numbers
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.