Stormer's theorem (1897): finitely many consecutive pairs where both are 11-smooth. The largest such pair is (2400, 2401). Their CRT decompositions reveal zero-trading: the mod-8 and mod-25 channels are zero on one side, the mod-49 channel is zero on the other.
2400 = 2^5 * 3 * 5^2. 2401 = 7^4. Their CRT decompositions reveal which channels carry zeros:
| Channel | 2400 | 2401 | Trade |
|---|---|---|---|
| mod 8 | 0 (ZERO) | 1 | 2 exits |
| mod 9 | 6 = 2*3 | 7 | neutral |
| mod 25 | 0 (ZERO) | 1 | 5 exits |
| mod 49 | 48 = 7^2-1 | 0 (ZERO) | 7 enters |
| mod 11 | 2 | 3 | neutral |
2400 has zeros in the mod-8 and mod-25 channels. 2401 has zero in the mod-49 channel. The zeros trade: 2 and 5 yield to 7.
When 2400 uses primes 2 and 5, it fills the mod-49 channel to 48 = 7^2 - 1. One step later, 7 takes over: the mod-49 channel drops to 0, and the mod-8 and mod-25 channels reset to 1.
Every consecutive smooth pair trades zeros (since gcd(n,n+1) = 1, their prime factors are disjoint). The larger pairs show increasingly dramatic trades:
| n | n+1 | Factorization | Zero Trade |
|---|---|---|---|
| 8 | 9 | 2^3, 3^2 | 2 -> 3 |
| 48 | 49 | 2^4*3, 7^2 | 2*3 -> 7 |
| 80 | 81 | 2^4*5, 3^4 | 2*5 -> 3 |
| 120 | 121 | 2^3*3*5, 11^2 | 2*3*5 -> 11 |
| 224 | 225 | 2^5*7, 3^2*5^2 | 2*7 -> 3*5 |
| 384 | 385 | 2^7*3, 5*7*11 | 2*3 -> 5*7*11 |
| 2400 | 2401 | 2^5*3*5^2, 7^4 | 2*3*5 -> 7 (final) |
The final pair is the most extreme: three primes on one side, one on the other. 7 absorbs 2, 3, and 5. Only 11 stays neutral (never zeros in either).
In the last smooth pair, 2401 = 7^4 is a pure power of a single prime. The other primes (2, 3, 5) all appear in 2400. 11 divides neither.
| Aspect | Standard view | Ring structure |
|---|---|---|
| The pair | 2400 and 2401 are consecutive integers. Stormer 1897 curiosity | CRT zeros trade: mod-8 and mod-25 yield to mod-49. Structural |
| Why last? | Analytic bound from Pell equations | 7^3+1 blocked by Heegner 43. Only 7^4 finds a smooth neighbor |
| Sum | 4801 is prime, no further significance | CRT shows traded channels neutralized to 1. Sum remembers the trade |
| 11 channel | 11 divides neither -- unremarkable | 11 stays neutral: never participates in the zero-trades |
Enter n to factor (n, n+1) and see their CRT decompositions. Watch which channels carry zeros and how they trade.
Explore pair starting at n:
Try: 8 (2^3), 48 (2^4*3), 80 (2^4*5), 224 (2^5*7), 2400 (the last smooth pair).
Source code · Public domain (CC0)
.ax source compiled to WASM via self-hosting compiler. Zero HTML authored.