The modular forms page showed WHAT: tau(p) mod 23 classifies primes into inner and outer classes. This page answers WHY. The Cyclotomic Period Theorem traces periods 2 and 3 back to the Cunningham chain. Then the Smooth Zone Ladder shows the partition function's smooth zone.
For any prime p (except 23 = 2*11+1), tau(p^k) mod 23 cycles with period depending on whether p is a quadratic residue (inner, period 3) or non-residue (outer, period 2) mod 23. These periods are forced:
3 appears three ways: as the period, as the cyclotomic index, and as the class number h(-23). A self-referential loop.
Evaluating cyclotomic polynomials at x = 2 generates the ring's primes. Not chosen -- forced by algebra:
| Polynomial | Formula at x=2 | Value | Note |
|---|---|---|---|
| Phi_1(2) | 2 - 1 | 1 | Identity |
| Phi_2(2) | 2 + 1 | 3 | Prime |
| Phi_3(2) | 4 + 2 + 1 | 7 | Prime |
| Phi_6(2) | 4 - 2 + 1 | 3 | Same as Phi_2 |
| Product | Phi_1*Phi_2*Phi_3*Phi_6 | 63 | 9 * 7 |
Phi_3(2) = 2^2+2+1 = 7. The third cyclotomic at x=2 yields 7. Phi_2(2) = 3. Phi_4(2) = 5. Phi_10(2) = 11. Phi_12(2) = 13. The ring's primes appear at cyclotomic orders that divide 12.
For the initial prime segment S_k = {p_1, ..., p_k}, define B(S_k) = the largest n such that ALL partition values p(1),...,p(n) are S_k-smooth. Watch how the smooth zone grows:
| Smooth set S | B(S) | Breaker | Jump |
|---|---|---|---|
| {2} | 2 | p(3) = 3 | +1 |
| {2, 3} | 3 | p(4) = 5 | +1 |
| {2, 3, 5} | 4 | p(5) = 7 | +1 |
| {2, 3, 5, 7} | 5 | p(6) = 11 | +1 |
| {2,3,5,7,11} | 12 | p(13) = 101 | +7 jump! |
Second smooth block: p(14) through p(19) are all {2,3,5,7,11}-smooth again. Length = 6. Breaker = p(20) contains factor 19. Total smooth = 12 + 6 = 18.
The partition values p(2) through p(6) are exactly the primes {2, 3, 5, 7, 11}: p(2)=2, p(3)=3, p(4)=5, p(5)=7, p(6)=11. Each smooth set S_k breaks at p(k+2) because the partition function equals the prime sequence at these positions. The breaker IS the next prime.
Three threads converge on the same numbers:
Eta, partitions, class numbers, cyclotomic polynomials -- four branches of number theory, all governed by the same small primes.
Enter n (1-12) to compute the n-th cyclotomic polynomial at x=2. Watch the primes appear: Phi_1=1, Phi_2=3, Phi_3=7, Phi_4=5, Phi_10=11, Phi_12=13.
Order n:
Source code · Public domain (CC0)
.ax source compiled to WASM via self-hosting compiler. Zero HTML authored.