Perfect Numbers
Definition
n is perfect if σ(n)=2n. Even perfect numbers: 2ᵖ⁻¹(2ᵖ−1) when 2ᵖ−1 is prime (Euler-Euclid theorem).
Examples
Example 1. Verify 6 is perfect.
Solution. Divisors: 1,2,3. Sum=6. ✓
In Depth
A perfect number equals the sum of its proper divisors. The first four are 6, 28, 496, 8128. Euclid proved that \(2^{p-1}(2^p-1)\) is perfect whenever \(2^p-1\) is prime (a Mersenne prime). Euler proved the converse: every even perfect number has this form.
Whether any odd perfect number exists is one of the oldest open problems in mathematics. If one exists, it must be greater than \(10^{1500}\), have at least 9 distinct prime factors, and satisfy many other constraints — yet none has been found or ruled out.
Related concepts: abundant numbers (sum of proper divisors exceeds the number), deficient numbers (sum is less), and amicable pairs (each equals the sum of the other's proper divisors). The pair (220, 284) was known to the ancient Greeks.
The sum-of-divisors function \(\sigma(n)=\sum_{d\mid n}d\) satisfies \(\sigma(n)=2n\) for perfect \(n\). It is multiplicative: \(\sigma(mn)=\sigma(m)\sigma(n)\) for \(\gcd(m,n)=1\). For prime powers: \(\sigma(p^k)=(p^{k+1}-1)/(p-1)\).
Mersenne primes \(M_p=2^p-1\) are required for even perfect numbers. As of 2024, only 51 Mersenne primes are known, the largest being \(2^{136279841}-1\). The Great Internet Mersenne Prime Search (GIMPS) uses distributed computing to search for new ones.
Key Properties & Applications
The abundancy index \(\sigma(n)/n\) classifies numbers: deficient (\(<2\)), perfect (\(=2\)), abundant (\(>2\)). The natural density of abundant numbers is about 24.76%. Every multiple of an abundant number is abundant; every divisor of a deficient number is deficient.
Sociable numbers generalize amicable pairs: a cycle \(n_1\to n_2\to\cdots\to n_k\to n_1\) where each number is the sum of proper divisors of the previous. Amicable pairs are 2-cycles. The smallest known 4-cycle starts at 1264460.
The Riemann hypothesis is equivalent to a statement about the sum of divisors: \(\sigma(n)
Further Reading & Context
The study of perfect numbers connects to many areas of mathematics and its applications. Understanding the foundational definitions and theorems provides the basis for advanced work in analysis, algebra, and applied mathematics.
Historical development: most mathematical concepts evolved over centuries, with contributions from mathematicians across many cultures. The modern axiomatic treatment provides rigor, while computational tools enable practical application.
In modern mathematics, this topic appears in graduate courses and research across pure and applied mathematics. Connections to computer science, physics, and engineering make it a versatile and important area of study. Mastery of the core results and techniques opens doors to research in number theory, analysis, geometry, and beyond.
Recommended next steps: work through the standard theorems with full proofs, explore the connections to related topics listed above, and practice with a variety of problems ranging from computational exercises to theoretical proofs. The interplay between different areas of mathematics is one of the subject's greatest rewards.