Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematical Object

Mersenne Prime

Number Theory

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
Classification
Object Kind
Number 1
Origin Year
1644 1
Connections

Is Kind Of Object

Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.

Sources
1. Mersenne Prime (Wikipedia)
History section
Quote, History section
The exponents listed by Mersenne in 1644 were as follows: 2, 3, 5, 7, 13, 17, 19, 31, 67, 127, 257.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.