Fibonacci × 3 · 6 · 9
Explore a real repeating structure in the Fibonacci sequence using exact modular arithmetic, state space, residue geometry, and every-fourth-term sampling.
Start with Fibonacci.
The sequence grows without bound. Modular arithmetic lets us study its repeating remainder structure instead of its size.
Move into finite state space.
For modulus m, a Fibonacci state can be represented by (Fₙ mod m, Fₙ₊₁ mod m). Because only finitely many such states exist, the deterministic recurrence eventually repeats.
Modulo 9 has period 24.
The Fibonacci modular state returns to its starting state after 24 steps: π(9)=24.
Sample every fourth term.
The residues become 3, 3, 0, 6, 6, 0. For these positive multiples of 9, digital-root notation displays residue 0 as 9.
Reveal the six-position pattern.
3 → 3 → 9 → 6 → 6 → 9 → repeat
Now use the lab to change the modulus or sampling interval and test which parts of the structure survive.
Why 3 → 3 → 9 → 6 → 6 → 9 appears
1. Sample every fourth term
Gₖ = F₄ₖ
That subsequence satisfies Gₖ₊₂ = 7Gₖ₊₁ − Gₖ.
2. Reduce modulo 9
Starting from residues 3, 3 forces:
3, 3, 0, 6, 6, 0
For the positive multiples of 9 here, digital-root notation displays residue 0 as 9.
3. Why six sampled positions?
Fibonacci modulo 9 has Pisano period 24. Sampling every fourth term reveals a six-position sampled cycle.
4. Why 3 and 6 mirror each other
Modulo 9, 6 ≡ −3. The two residues are additive inverses.
A genuine modular structure
The repeating pattern follows from the Fibonacci recurrence, finite modular state space, and the chosen sampling interval.
No extra physical claim is implied
The pattern alone is not evidence that 3, 6, or 9 have unique energetic, physical, or mystical properties.
Mathematical notes
A positive multiple of 9 has residue 0 modulo 9 but digital root 9. The lab keeps these concepts separate and only displays 0 as 9 when discussing digital-root notation.
The Pisano period π(m) is the period of the Fibonacci sequence modulo m. For m = 9, π(9) = 24.
For Gₖ = F₄ₖ, the recurrence Gₖ₊₂ = 7Gₖ₊₁ − Gₖ leads modulo 9 to 3, 3, 0, 6, 6, 0.
The helix and residue ring are chosen embeddings. The ordered state pair (Fₙ mod m, Fₙ₊₁ mod m) is the direct finite-state dynamical representation.