Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Euclid-Euler Theorem

Number Theory

The Euclid-Euler theorem is a theorem in number theory relating perfect numbers to Mersenne primes. It states that an even number is perfect if and only if it equals a power of two multiplied by a Mersenne prime, a prime number one less than a power of two, in the specific relationship that Euclid and Leonhard Euler together established, with Euclid proving one direction and Euler proving the other. Whether there are infinitely many Mersenne primes, and therefore infinitely many even perfect numbers, remains an open conjecture, and it is likewise unknown whether even a single odd perfect number exists.

Facts
Statement
An even natural number is perfect if and only if it has the form 2 to the power (p minus 1) multiplied by Mp, where Mp is a Mersenne prime. 2
Proof Year
1747 2
Classification
Statement Form
Characterization Theorem 1
Connections

Has Statement Form

Entity-backed identity for the statement-form enum value this theorem 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 statement-form fact itself stays on the theorem unchanged.

In Branch

Source Euclid-Euler theorem, Wikipedia
Sources
1. Wikipedia: Euclid-Euler theorem
WikipediaLead section, statement-form reference
Quote, Lead section, statement-form reference
It states that an even number is perfect if and only if it has the form 2pāˆ’1(2p āˆ’ 1), where 2p āˆ’ 1 is a prime number.
View the Source
2. Euclid-Euler theorem, Wikipedia
  • Statement and examples section
    The Euclid-Euler theorem states that an even natural number is perfect if and only if it has the form 2^(p-1) Mp, where Mp is a Mersenne prime.
  • History section, Euler citation
    Originally read to the Berlin Academy on February 23, 1747, and published posthumously.
  • In Branch: Number Theory, Lead sentence
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.