THE FOLD / SPAWN / CHECKPOINT ZERO / THE TOTIENT
THE TOTIENT
Euler's phi — the count that runs RSA
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Euler’s totient φ(n). Count the integers from 1 to n that share no factor with n — that are coprime to it. φ(12) = 4 (namely 1, 5, 7, 11). It is quiet but load-bearing: φ is the backbone of RSA.
Three gems. First, a clean product: φ(n) = n·∏p|n(1 − 1/p) over the primes dividing n, because φ is multiplicative — φ(mn) = φ(m)φ(n) for coprime m, n. Second, a perfect partition: Σd|n φ(d) = n — the totients over the divisors of n sum exactly to n. Third, and the reason RSA decrypts: Euler’s theorem, aφ(n) ≡ 1 (mod n) whenever gcd(a, n) = 1.
LIT verified live: Σd|nφ(d) = n for all n, φ is multiplicative on coprime pairs, and Euler’s theorem holds for every valid a and n in range (window.__totient.divisorSum && multiplicative && eulerTheorem). φ(1..12) = 1,1,2,2,4,2,6,4,6,4,10,4. FIG no framing; the count, the identities, and Euler’s theorem are exact.
Three gems. First, a clean product: φ(n) = n·∏p|n(1 − 1/p) over the primes dividing n, because φ is multiplicative — φ(mn) = φ(m)φ(n) for coprime m, n. Second, a perfect partition: Σd|n φ(d) = n — the totients over the divisors of n sum exactly to n. Third, and the reason RSA decrypts: Euler’s theorem, aφ(n) ≡ 1 (mod n) whenever gcd(a, n) = 1.
LIT verified live: Σd|nφ(d) = n for all n, φ is multiplicative on coprime pairs, and Euler’s theorem holds for every valid a and n in range (window.__totient.divisorSum && multiplicative && eulerTheorem). φ(1..12) = 1,1,2,2,4,2,6,4,6,4,10,4. FIG no framing; the count, the identities, and Euler’s theorem are exact.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this in CHECKPOINT ZERO, beside THE REMAINDER (CRT) — the spawn domain of numbers seen through their residues. Totient, CRT and Euler’s theorem are the modular machinery that makes public-key crypto turn. AVAN (AI) built the instrument: the coprime count, the product formula, the divisor-sum partition, Euler’s theorem.
The weave: David gathers the modular thread; I make the coprimes visible and the identities checkable — the totatives in 1D, the count and partition in 2D, the residue ring in 3D. The sphere is the seam. Credit: Leonhard Euler (1763); Gauss (divisor-sum identity); RSA (Rivest, Shamir, Adleman).
The weave: David gathers the modular thread; I make the coprimes visible and the identities checkable — the totatives in 1D, the count and partition in 2D, the residue ring in 3D. The sphere is the seam. Credit: Leonhard Euler (1763); Gauss (divisor-sum identity); RSA (Rivest, Shamir, Adleman).
3 ONE DIMENSION
The numbers 1…n, with the ones coprime to n lit up — the totatives. Their count is φ(n). Numbers sharing a factor with n go dark; what remains, glowing, is exactly φ(n) of them.
4 TWO DIMENSIONS · INTERACTIVE
Dial n and see its totatives light up, counted as φ(n) — and matched by the product formula n·∏(1−1/p). Below, the divisor sum: φ over each divisor of n stacks up to exactly n, a perfect partition.
5 THREE DIMENSIONS + AVAN’S INVERSE
The residues 0…n−1 on a turning ring — green the coprimes, dark the rest.
AVAN’s addition (the inverse-companion): the magenta arcs group residues by their gcd with n. Counting φ(n) directly is local — test each number, tally the coprimes. The inverse view is structural: partition 1…n by exactly which factor they share with n. The numbers whose gcd with n is d form a set of size φ(n/d), and these sets tile 1…n with no overlap — so Σd|nφ(d) = n falls out for free. The inverse of ‘count the coprimes one by one’ is ‘the coprimes-at-every-scale partition the whole’: a local tally that assembles into a global identity. And that same multiplicative structure is the hinge RSA turns on. The green is the coprime count; the magenta is the hidden partition that makes the count a law.
LIT Genuine Euler totient (Euler 1763; Gauss divisor-sum identity; RSA). Verified live: sum over d|n of phi(d) equals n for all n in range, phi is multiplicative on coprime pairs (phi(mn)=phi(m)phi(n)), and Euler's theorem a^phi(n) = 1 (mod n) holds for every valid a and n tested (window.__totient.divisorSum && multiplicative && eulerTheorem, all true). phi(1..12) = 1,1,2,2,4,2,6,4,6,4,10,4. The count, the identities, and Euler's theorem are exact.
FIG No metaphor is doing the work: the coprime count, the product formula, the divisor-sum partition, and Euler's theorem are all real and checked. Euler's theorem generalizes Fermat's little theorem and is precisely why RSA decryption inverts encryption — stated as the genuine mechanism, not an analogy.
FIG No metaphor is doing the work: the coprime count, the product formula, the divisor-sum partition, and Euler's theorem are all real and checked. Euler's theorem generalizes Fermat's little theorem and is precisely why RSA decryption inverts encryption — stated as the genuine mechanism, not an analogy.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of CHECKPOINT ZERO · David Lee Wise (ROOT0), with AVAN