The Partition Function

p(n) counts how many ways to write n as a sum of positive integers. It speaks the axiom.

The partition function p(n) is one of the most studied objects in all of mathematics. p(4) = 5 because 4 can be written as 4, 3+1, 2+2, 2+1+1, or 1+1+1+1.

It grows explosively — p(100) is already 190,569,292,356 — yet for the first 12 values, every single one factors using only the primes {2, 3, 5, 7, 11}.

At n = 13, it stops. The same gate that closes the axiom.

n	p(n)	FACTORIZATION	SMOOTH?
1	1	sigma	yes
2	2	D	yes
3	3	K	yes
4	5	E	yes
5	7	b	yes
6	11	L	yes
7	15	K * E	yes
8	22	D * L	yes
9	30	D * K * E	yes
10	42	D * K * b = ANSWER	yes
11	56	D³ * b	yes
12	77	b * L	yes
13	101	101 (prime)	GATE
14	135	K³ * E	yes
15	176	D⁴ * L	yes
16	231	K * b * L	yes
17	297	K³ * L	yes
18	385	E * b * L	yes
19	490	D * E * b²	yes
20	627	3 * 11 * 19	19 = f(E)

CLICK A ROW

Three Fixed Points

p(sigma = 1) 1 = sigma Fixed point. The ground state counts itself.

p(D = 2) 2 = D Fixed point. Duality has two partitions: 2 and 1+1.

p(K = 3) 3 = K Fixed point. Closure closes on itself.

p(E = 5) 7 = b The observer becomes depth. E maps to b.

p(D * E = 10) 42 = ANSWER D * K * b. The answer to everything.

p(ME = 18) 385 = E * b * L Inner axiom sum maps to product of Ramanujan primes.

Ramanujan's Congruences

In 1919, Ramanujan discovered that the partition function obeys divisibility patterns at exactly three primes. Those three primes are {5, 7, 11} — the axiom's outer chain.

CONGRUENCE	PRIME	OFFSET	AXIOM ROLE
p(5n + 4) = 0 mod 5	E = 5	D² = 4	Observer. Self-blind (E² = E-null).
p(7n + 5) = 0 mod 7	b = 7	E = 5	Depth. Suffering. The b² channel.
p(11n + 6) = 0 mod 11	L = 11	D * K = 6	Transcendental. The protector speaks.

D and K have no Ramanujan congruences. The inner chain {2, 3} is the structural skeleton — it builds, but it does not divide the partition function this way. Only the outer chain {5, 7, 11} does.

PRIME	CONGRUENCE?	WHY
D = 2	No	Builder. No partition congruence.
K = 3	No	Closer. No partition congruence.

The offsets are axiom products: D² = 4, E = 5, D*K = 6.
Their sum = K * E = 15. Their product = E! = 120.
Ramanujan's congruences are the axiom speaking through combinatorics.

Two Roads, One Ring

The D-chain class numbers produce the same vocabulary: sigma, K, E, D³, GATE, ESCAPE. Those are class numbers of quadratic fields.

Here, the partition function produces the same constants through a completely different mechanism: counting additive decompositions. Two independent branches of number theory. Same axiom.

The smooth zone length (12 = lambda(DATA)) is the same constant that appears as the D-chain generator: lambda = Carmichael function.

What others see vs. what the axiom shows

Standard view: The partition function grows rapidly and its congruences (Ramanujan's) are deep but isolated results.

Axiom view: p(n) is axiom-smooth for n ≤ 12 — a smooth zone gated by 13. Ramanujan's three moduli {5, 7, 11} = {E, b, L} are exactly the axiom primes above K. The partition function's gate IS the axiom's gate.

What Does This Mean?

The partition function p(n) has been studied for three centuries, from Euler's generating function to Hardy-Ramanujan's asymptotic formula. Nobody expected its small values to have algebraic structure.

Yet for n = 1 through 12, every p(n) factors using only {2, 3, 5, 7, 11}. At n = 13, a new prime (101) appears. The same number 13 that stops the Cunningham chain, gates the class numbers, and bounds the axiom's skin.

The partition-prime block — the values of n where p(n) is itself prime — is {2, 3, 4, 5, 6}, yielding {D, K, E, b, L}: the complete axiom chain. The gaps between partition primes are {7, 23, 41} = {b, CC1(D)[3], KEY}.

Ramanujan's three congruences select exactly the outer primes {5, 7, 11}. The offsets {4, 5, 6} are axiom products. The partition function was always speaking this language. It took the axiom to hear it.