The Bernoulli Connection

The Bernoulli numbers are among the oldest objects in mathematics -- they appear in power sum formulas, in zeta values at even integers, and in the Taylor series for tangent. In 1840, von Staudt and Clausen proved that denom(B_2k) = product of all primes p where (p-1)|2k. Nobody noticed what happens when you combine this with the Cunningham map c(n) = 2n+1.

The Period Theorem

Each axiom prime p enters the Bernoulli denominator with a specific period -- how often it appears as k increases. Since p = c(q) for the Cunningham chain, the condition (p-1)|2k becomes q|k. The period of each prime IS the previous axiom prime.

First simultaneous appearance of all five: B_60 at k = 30 = D*K*E = lcm{1,1,2,3,5}. Not coincidence -- 30 = product of the first three axiom primes.

The Bernoulli Table

Watch as k increases. Each axiom prime dances in and out on its own Cunningham-inherited schedule.

At k=3, depth b=7 enters for the first time. The denominator is 2*3*7 = 42. The answer to the ultimate question is the Bernoulli denominator where depth first appears. At k=5, transcendental L=11 enters -- but E=5 is gone (period D=2, and 5 is odd).

The Convergence Staircase

As k increases, the maximum count of axiom primes in denom(B_2k) climbs a staircase: 2, 3, 5, 6, 7 axiom primes first appear at indices 2k = 2, 4, 12, 48, 240. The ratios between consecutive indices follow the chain: D, K, D^2, E. Count 4 is SKIPPED entirely -- GATE enters at 2k=12 alongside b, jumping directly from 3 to 5 axiom primes.

The 490 split appears in the totient structure: DEAD totient lcm = 12 = lambda(DATA), ALIVE totient lcm = 60 = D^2*K*E, ratio = E = the observer. The product P(b) = 240 is the shadow polynomial evaluated at b: (b-1)(b-2)(b-3)(b-5) drops E=5 from the consecutive sequence -- the same E-opacity that makes the shadow polynomial blind to the observer.

The Gate Breach

At k=6: E=5 present (2|6) and b=7 present (3|6). But 6|6 means 12|12 means (13-1)|12. The gate 13 is FORCED open whenever observation and depth coexist.

The Ramanujan denominator 2730 = THIN + lambda = 2310 + 420. The famous 691 in the numerator of B_12? That is the scar left by L=11's absence: period(L) = E = 5, and 5 does not divide 6. The transcendental was locked out.

The GATE Interlock

Of the C(4,2)=6 possible pairs from the DATA primes {D,K,E,b}, exactly ONE forces a non-DATA prime into the Bernoulli denominator. The observer E and the depth b never share a denominator without GATE=13 standing between them.

The five remaining DATA pairs are all safe -- their totient lcms never reach phi(GATE). Only observation times depth summons the boundary prime. In the 490 split, {E,b} are both DEAD (inner channels) while GATE is ALIVE (boundary). The split predicted which pair would trigger the breach.

The Self-Reference Loop

The Cunningham chain D=2 -> E=5 -> L=11 -> 23 -> 47 extends past the axiom. The prime 23 = c(L) has Bernoulli period (23-1)/2 = 11 = L. The chain L -> c(L) = 23 -> period(23) = L is a fixed-point loop. The contaminator's Bernoulli period IS the prime that generated it.

Smooth Bernoulli Density

How many Bernoulli numbers have 11-smooth denominators? Each intruder p > 11 contaminates at rate 1/s where s = (p-1)/2:

Four-contamination product: (5*7*8*10)/(6*8*9*11) = 175/297 = E^2*b / K^3*L. Exact axiom expression. Asymptotic density decays; at k = 770 = D*E*b*L, it hits exactly K/(D*E) = 3/10.

The Enrichment Ladder

Eisenstein series E_k have coefficients related to divisor sums. Modular enrichment -- structure visible mod c(k-1) versus generic -- follows a precise pattern when c(k-1) is prime:

Enrichment at prime c(k-1) is exactly c(k-1)/D by Fermat's little theorem. When c(k-1) is composite -- like weight 8 where c(7) = 15 = K*E -- enrichment drops to 1.9x. Only primes carry the full signal.

The Extension Partition

Among the first 120 = D^3*K*E Bernoulli indices, each denominator picks up some subset of the three extension primes {L, GATE, ESCAPE}. This partitions 120 indices into D^3 = 8 subsets -- one for each combination. Every subset count is {D,K}-smooth.

The half-totient identities bridge extension primes back to DATA: (L-1)/2 = E, (GATE-1)/2 = D*K, (ESCAPE-1)/2 = D^3. The lcm of these three is 120 -- the partition lives on exactly one full cycle of extension prime appearances. The extension primes enter the Bernoulli world through DATA-shaped doors.

Explore: Bernoulli Denominators

Enter k to see denom(B_{2k}). Von Staudt-Clausen: prime p divides denom iff (p-1)|2k.

Enter k (1-30):

Try: k=1 (denom=6), k=3 (denom=42=ANSWER), k=5 (denom=66), k=6 (denom=2730=GATE enters).

Contrast Table