h1card_01p_02
The first four perfect numbers: divisor portraits
6 divisors: 1, 2, 3 1 + 2 + 3 = 6 ✓ = 2^1 x (2^2-1) Mersenne prime: 3 28 divisors: 1,2,4,7,14 1+2+4+7+14=28 ✓ = 2^2 x (2^3-1) Mersenne prime: 7 496 divisors: 1,2,4,...,248 sum = 496 ✓ = 2^4 x (2^5-1) Mersenne prime: 31 8128 divisors: 1...4064 sum = 8128 ✓ = 2^6 x (2^7-1) Mersenne prime: 127
Euclid–Euler theorem: even perfect numbers ↔ Mersenne primes
n is even perfect ⟺ n = 2^(p−1) · (2^p − 1)
where 2^p − 1 is a Mersenne prime
Euclid proved the → direction. Euler proved ← . All 51 known perfect numbers are even and come from this formula. Whether odd perfect numbers exist is unknown.
Perfect numbers on a log scale: they grow faster than exponentially
3.7637.5260.7781.4472.6953.917.526628496812833,5 …

Values shown as log10. Even on a log scale each jump is dramatically larger. The 51st perfect number has over 49 million digits.

linkscard_06card_07
Digunakan dalam
Matematika
Fisika
Teknik
🧬Biologi
💻Ilmu Komputer
📊Statistika
📈Keuangan
🎨Seni
🏛Arsitektur
Musik
🔐Kriptografi
🌌Astronomi
Kimia
🦉Filsafat
🗺Geografi
🌿Ekologi
Want to test your knowledge?
Question
Apa itu bilangan bersahabat?
tap · space
1 / 10