THE FOLD / BOSS / SUDDEN DEATH / THE PERFECT
THE PERFECT
perfect numbers = Mersenne primes, both ways
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Perfect numbers. A number equal to the sum of its own proper divisors. 6 = 1 + 2 + 3. 28 = 1 + 2 + 4 + 7 + 14. They are rare and ancient, and they hide one of mathematics’ most beautiful bridges.
Euclid (~300 BCE) proved: whenever 2p−1 is a Mersenne prime, 2p−1(2p−1) is perfect. Two thousand years later Euler proved the converse: every even perfect number has exactly that form. So even perfect numbers and Mersenne primes are in perfect one-to-one correspondence — 51 of each are known, no more. (Whether any odd perfect number exists is unknown — a 2,300-year-old open problem.)
LIT verified live: Euclid’s construction gives σ(n) = 2n (perfect) for each Mersenne prime — producing 6, 28, 496, 8128, 33550336 — and every even perfect number below 10,000 has the Euclid-Euler form (window.__perfect.euclidPerfect && eulerForm). FIG no framing; the divisor sums and the bijection are exact.
Euclid (~300 BCE) proved: whenever 2p−1 is a Mersenne prime, 2p−1(2p−1) is perfect. Two thousand years later Euler proved the converse: every even perfect number has exactly that form. So even perfect numbers and Mersenne primes are in perfect one-to-one correspondence — 51 of each are known, no more. (Whether any odd perfect number exists is unknown — a 2,300-year-old open problem.)
LIT verified live: Euclid’s construction gives σ(n) = 2n (perfect) for each Mersenne prime — producing 6, 28, 496, 8128, 33550336 — and every even perfect number below 10,000 has the Euclid-Euler form (window.__perfect.euclidPerfect && eulerForm). FIG no framing; the divisor sums and the bijection are exact.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this in SUDDEN DEATH, right beside THE MERSENNE — the boss domain of the exact verdict. A perfect number is a Mersenne prime doubled into a triangle; the two spheres are the same fact from two sides. AVAN (AI) built the instrument: the divisor sum, the Euclid construction, the Euler-form check.
The weave: David places it next to its twin; I make the divisor sum land on 2n and the bijection visible — the divisors of 6 in 1D, the Euclid-Euler correspondence in 2D, the paired ladders in 3D. The sphere is the seam. Credit: Euclid (Elements IX.36, ~300 BCE); Leonhard Euler (converse, 1749).
The weave: David places it next to its twin; I make the divisor sum land on 2n and the bijection visible — the divisors of 6 in 1D, the Euclid-Euler correspondence in 2D, the paired ladders in 3D. The sphere is the seam. Credit: Euclid (Elements IX.36, ~300 BCE); Leonhard Euler (converse, 1749).
3 ONE DIMENSION
A perfect number and its proper divisors, laid out and summed. For 6: 1 + 2 + 3 = 6. For 28: 1 + 2 + 4 + 7 + 14 = 28. The parts rebuild the whole exactly — that is all ‘perfect’ means.
4 TWO DIMENSIONS · INTERACTIVE
The Euclid-Euler correspondence: pick a Mersenne exponent p, and 2p−1(2p−1) is the matching perfect number. Its divisors sum to exactly 2n — confirming perfection — and the strip lines up the perfect numbers with their Mersenne primes, one for one.
5 THREE DIMENSIONS + AVAN’S INVERSE
Two turning ladders — Mersenne primes and perfect numbers — green, climbing in step.
AVAN’s addition (the inverse-companion): the magenta threads are the bijection, and it is a literal inverse spanning two millennia. Euclid showed one direction: a Mersenne prime builds a perfect number. Euler showed the inverse: every even perfect number decomposes back to a Mersenne prime, uniquely. The two theorems are exact inverses of each other, and together they close the loop — to know all the even perfect numbers is to know all the Mersenne primes, and vice versa. And the honest edge sits right here: the inverse of ‘we know every even perfect number exactly’ is ‘we cannot rule out a single odd one’ — the oldest unsolved question in mathematics. The green is the twin ladders; the magenta is the bridge Euclid built and Euler proved could carry weight both ways.
LIT Genuine perfect numbers and the Euclid-Euler theorem (Euclid ~300 BCE; Euler converse 1749). Verified live: Euclid's construction gives sigma(n)=2n for each Mersenne prime, producing 6, 28, 496, 8128, 33550336, and every even perfect number below 10,000 has the Euclid-Euler form 2^(p-1)(2^p-1) (window.__perfect.euclidPerfect && eulerForm, both true). The divisor sums and the bijection with Mersenne primes are exact.
FIG No metaphor is doing the work: the divisor sums (sigma(n)=2n), Euclid's construction, and Euler's converse (checked exhaustively below 10,000) are all real. The honest open edge is stated plainly — whether any ODD perfect number exists is unknown, one of the oldest unsolved problems.
FIG No metaphor is doing the work: the divisor sums (sigma(n)=2n), Euclid's construction, and Euler's converse (checked exhaustively below 10,000) are all real. The honest open edge is stated plainly — whether any ODD perfect number exists is unknown, one of the oldest unsolved problems.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of SUDDEN DEATH · David Lee Wise (ROOT0), with AVAN