Nepedia
Back to Discover
Advanced Reader
🔢

Perfect number

math Maturity 11-13 Next article →

In number theory, a perfect number is a positive integer that equals the sum of its positive proper divisors. A proper divisor is any number that divides into a larger number evenly, excluding the number itself. The sum of these divisors is known as the aliquot sum. Therefore, a perfect number is a number that is equal to its own aliquot sum.

Perfect number Cuisenaire rods 6 exact
Perfect number Cuisenaire rods 6 exact

For example, the number 6 has the proper divisors 1, 2, and 3. Adding these together gives 1 + 2 + 3 = 6. The next perfect number is 28, which has the divisors 1, 2, 4, 7, and 14. When added, these equal 28.

Mathematically, a perfect number can also be defined through the sum-of-divisors function, denoted by the Greek letter sigma (σ). A number is perfect if it is exactly half the sum of all its positive divisors, including itself. This means that for a perfect number $n$, $\sigma(n) = 2n$. This elegant definition allows mathematicians to study the relationship between a number and its components. While the concept is simple, the properties of these numbers are deeply complex and reveal much about the structure of integers.

The study of perfect numbers is ancient. Euclid included them in his work, *Elements*, around 300 BC. He identified a specific rule for creating even perfect numbers. He proved that if $2^p - 1$ is a prime number, then $2^{p-1}(2^p - 1)$ is a perfect number. Primes that follow this specific form are called Mersenne primes, named after the 17th-century monk Marin Mersenne. For many centuries, mathematicians only knew of the first four perfect numbers: 6, 28, 496, and 8128. Around AD 100, the mathematician Nicomachus noted 8128 and made several observations about these numbers, though some of his claims were incorrect.

It took another two millennia to complete the picture of even perfect numbers. In the 18th century, Leonhard Euler proved that Euclid's formula actually generates every even perfect number. This connection is known as the Euclid–Euler theorem. Because of this theorem, there is a one-to-one correspondence between Mersenne primes and even perfect numbers. If you find a new Mersenne prime, you have found a new even perfect number. This relationship makes the search for perfect numbers a search for these rare primes. Today, the Great Internet Mersenne Prime Search (GIMPS) uses distributed computing to find them.

Even perfect numbers possess several remarkable properties. Every even perfect number is a triangular number, meaning it is the sum of all integers from 1 up to a certain point. They are also hexagonal numbers. Except for the number 6, every even perfect number has a digital root of 1. To find the digital root, you add the digits of a number, then add the digits of that result, repeating the process until only one digit remains. For instance, the digital root of 8128 is found by calculating 8 + 1 + 2 + 8 = 19, then 1 + 9 = 10, and finally 1 + 0 = 1. Additionally, in binary form, every even perfect number consists of a sequence of ones followed by a sequence of zeros.

Despite these discoveries, two massive mysteries remain unsolved. First, mathematicians do not know if there are infinitely many perfect numbers or infinitely many Mersenne primes. Second, no one knows if any odd perfect numbers exist. While no odd perfect number has ever been found, mathematicians have not been able to prove they cannot exist. Modern research has established strict requirements for what an odd perfect number must look like. For example, it must be greater than $10^{1500}$ and have at least 10 distinct prime factors. Some mathematicians, like Carl Pomerance, have even suggested through heuristic arguments that odd perfect numbers likely do not exist at all.

Perfect numbers also connect to other mathematical concepts like harmonic divisor numbers. Every perfect number is a harmonic divisor number, meaning the harmonic mean of its divisors is an integer. They also relate to the study of Descartes numbers, which are odd numbers that would be perfect if one of their composite factors were prime. The search for these numbers continues to drive advancements in computer science and number theory, as finding them requires testing massive values that push the limits of modern technology.

709 words

Where will your curiosity go next?

Keep exploring at your chosen reading level.

🖼️ Images & Media (1)
File:Perfect number Cuisenaire rods 6 exact.svg
Perfect number Cuisenaire rods 6 exact.svg
More to explore

🔬 Go deeper

More advanced topics to explore

🪜 Step back

Simpler topics to build understanding

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.