Mathematics Atlas

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

Perfect Number

Number Theory

A perfect number is a positive integer that equals the sum of its own positive divisors, not counting itself: 6 is perfect because its proper divisors 1, 2 and 3 add up to 6, and the next one is 28. The idea appears as early as Euclid's Elements, and Euclid himself proved that whenever 2 to the p minus 1 is prime, the number 2 to the p-1 times that quantity is a perfect number. Ancient Greek mathematicians knew only the first four perfect numbers, 6, 28, 496 and 8128, the last of which the mathematician Nicomachus recorded around AD 100. Leonhard Euler later proved the converse, that every even perfect number must take this exact form, a result now called the Euclid-Euler theorem; whether any odd perfect number exists, or whether the list of perfect numbers is infinite, both remain unresolved.

Facts
Classification
Object Kind
Number 1
Connections

In Branch

Source Wikipedia: Perfect number

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. Wikipedia: Perfect number
  • Lead section
    In number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, divisors excluding the number itself.
  • In Branch: Number Theory, Lead sentence
    In number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, diviso
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.