The divisor sum is the whole test
A proper divisor is a positive whole-number divisor smaller than the number itself. For 6, those divisors are 1, 2, and 3, and their sum is 6. The number 6 is therefore perfect—not because its factors include some special pattern at a glance, but because every smaller exact divisor contributes precisely the number’s own value when added together.
This rule quickly rules out most candidates. The proper divisors of 8 are 1, 2, and 4, which total only 7; those of 12 total 16, overshooting instead. A perfect number hits the balance exactly.
Why perfect numbers connect to prime patterns
The next example, 28, has proper divisors 1, 2, 4, 7, and 14, which add to 28. There is a deeper pattern behind all known perfect numbers: every even perfect number comes from a special prime called a Mersenne prime, a prime one less than a power of two. If 2^p − 1 is prime, then 2^(p−1)(2^p − 1) is perfect. For p = 2, this gives 6; for p = 3, it gives 28.
The connection works because the powers of two supply a neat run of divisors, while the other prime factor supplies a matching set. Together, their divisors balance exactly at the number itself. This also makes the search for even perfect numbers a search for Mersenne primes—but finding one requires checking that a potentially enormous number has no factors.
The unanswered odd case
The pattern completely describes even perfect numbers, but it does not settle whether any odd perfect number exists. None has been found, and mathematicians have not proved that none can exist. So the simple test that starts with 1 + 2 + 3 = 6 opens a question that remains unresolved: can an odd number ever balance its proper divisors in the same way?
