activemathematics/ONM

Prime Power Landmarks

Prime Power Landmarks

The prime powers — p, p², p³, … — are not arbitrary milestones in the number line. They mark the algebraic closure of each new dimensional cycle. Each power of a prime p closes the p-dimensional space of combinations that prime can reach alone.

The dimensional closure sequence

In the Ontological Number Map (ONM), each prime p opens a new axis of distinction:

  • p — the prime itself — a pure irreducible distinction, one-dimensional
  • p² — the “truth table” — all combinations of p with itself; p-ary 2D grid
  • p³ — the “material space milestone” — full three-dimensional closure; p-ary cube
  • p⁴, p⁵… — higher closures, each sealing another dimensional layer

The first few:

Prime p p² p³ ONM reading
2 2 4 8 Binary: distinction (2), truth table (4), octave cube (8)
3 3 9 27 Trinary: vector (3), 3D grid (9), material lattice (27)
5 5 25 125 Quintic: matter (5), 2D matter (25), matter cube (125)
7 7 49 343 Septic: 7D distinction, 49-cell grid, 343-element cube

The adjacency law: what lives next to a prime cube

The numbers immediately adjacent to p³ are algebraically determined by p itself:

p³ − 1  =  (p−1) × (p²+p+1)
p³ + 1  =  (p+1) × (p²−p+1)

These are exact algebraic identities, not coincidences. The factoring of the number immediately above or below a prime cube is fixed by p.

p = 2: 2³ = 8. Adjacent: 2³+1 = 9 = 3² — the octave lands on the square of the next prime. The binary cube and the ternary square meet at 9.

p = 3: 3³ = 27. Adjacent: 3³+1 = 28 = (3+1)(3²−3+1) = 4 × 7. The ternary cube lands next to 28, the second perfect number (1+2+4+7+14 = 28). Not coincidence — identity.

p = 5: 5³ = 125. Adjacent: 5³+1 = 126 = (5+1)(5²−5+1) = 6 × 21 = 2×3²×7. 5²−1 = 24 = 2³×3 (the number of hours, of major/minor keys, of the Babylonian base-60 factor).

p = 7: 7²+1 = 50 = 2×5². The square of 7 lands next to twice the square of 5.

The third cyclotomic polynomial: Φ₃(p) = p²+p+1

From the identity p³−1 = (p−1)×(p²+p+1), the factor p²+p+1 is the third cyclotomic polynomial Φ₃(p). Whether Φ₃(p) is itself prime is an open question:

p Φ₃(p) = p²+p+1 Prime?
2 7 Prime
3 13 Prime
5 31 Prime
7 57 = 3×19 Composite
11 133 = 7×19 Composite
13 183 = 3×61 Composite
17 307 Prime
19 381 = 3×127 Composite

The primes for which Φ₃(p) is prime (p = 2, 3, 5, 17, …) are related to Artin’s conjecture on primitive roots. No known pattern fully predicts which. The cube announces its dimensional closure; whether the next shell is prime or composite remains one of the deepest unsolved adjacency problems in number theory.

The infinitude connection

The adjacent composites at each prime power level are not merely decoration. Euclid’s proof of the infinitude of primes uses this same adjacency:

N = p₁ × p₂ × ... × pₙ + 1

N is either prime itself (a new prime) or divisible by a prime not in the list (also a new prime). The “+1” — the step just past the product — is always where the next prime is hiding. Time cannot freeze because there is always another prime just beyond the last landmark.

The prime cube p³ and the “+1” adjacency are the same principle at the dimensional scale: each closed cube announces a new prime waiting in its neighbour.

Connection to the Tusk Series

In the Tusk Series T(n) = sopfr(n) − sopfr(n−1), prime powers p^k contribute: sopfr(p^k) = k×p, so the k-th power of prime p adds k×p to the sum-of-prime-factors. The dimensional sequence p → p² → p³ shows up as a harmonic ladder in T(n): each prime power marks a step-up in the sopfr “elevation,” visible as a secondary spike structure between the dominant prime spikes.

Connection to cellular automata (Schroeder Ch17)

Pascal’s triangle modulo p produces the Sierpinski gasket — a fractal with Hausdorff dimension log(p+1)/log(p). The prime power sequence p → p² → p³ is the self-similar nesting: the p-row block appears at scale p, p², p³, … The cellular automaton of number space replicates itself at every prime power scale.

Connections