The golden ratio phi = (1+sqrt(5))/2 satisfies x^2 - x - 1 = 0 with discriminant 5. In Z/pZ it exists only when 5 is a quadratic residue mod p. Walking the chain's primes: phi first exists at p = 11 as a primitive root. At p = 5 it is ramified (both roots collapse). At p = 13 it is blocked entirely. The Legendre symbol (5/p) traces the chain.
The Golden Visibility Ladder
Prime
Note
(5/p)
Status
2
even prime
-1
phi NOT in Z/2Z
3
3
-1
phi NOT in Z/3Z
5
discriminant
0
RAMIFIED: phi = beta = 3
7
7
-1
phi NOT in Z/7Z
11
1+2+3+5
+1
PRIMITIVE ROOT (ord = 10)
13
2^2+3^2
-1
BLOCKED. Cannot exist.
Golden Visibility Theorem (PROVED)
phi first exists as a distinguishable element at p = 11. At p = 5, phi is ramified: both roots of x^2-x-1 collapse because 5 divides the discriminant. At p = 11, phi is a primitive root (generates all units of Z/11). At p = 13, phi is blocked: (5/13) = -1, no square root of 5 exists. The Legendre symbol (5/p) determines everything.
Quadratic Character Duality
Character Duality Theorem (PROVED)
phi*beta = -1 (mod p). Therefore: p = 1 (mod 4) -> phi and beta have SAME quadratic character. p = 3 (mod 4) -> OPPOSITE character. Proof: (phi*beta)^((p-1)/2) = (-1)^((p-1)/2). QED.
p
p mod 4
phi
Primitive?
11
3
8 (ord 10)
PHI only
19 = 5^2-5-1
3
5 (ord 9)
BETA only
29
1
6 (ord 14)
Neither
41 = 7^2-7-1
1
7 (ord 40)
BOTH
59
3
34 (ord 58)
PHI only
109 = 11^2-11-1
1
11 (ord 108)
BOTH
When p = 3 mod 4, exactly one of {phi, beta} can be a primitive root. When p = 1 mod 4, both or neither.
The f(p) Flip
Mod-4 Flip (PROVED)
f(p) = p^2 - p - 1 flips the mod-4 class. p = 1 mod 4 implies f(p) = 3 mod 4. p = 3 mod 4 implies f(p) = 1 mod 4. Proof: p=1: f = 1-1-1 = -1 = 3 mod 4. p=3: f = 9-3-1 = 5 = 1 mod 4.
Corollary: f(p) flips which golden conjugate generates. At p = 11 (11 mod 4 = 3): phi alone is primitive. At f(11) = 109 (109 mod 4 = 1): BOTH phi and beta are primitive roots.
The Golden Chain
phi = p mod f(p) (PROVED)
For any prime p: (2p-1)^2 = 5 (mod f(p)). Therefore phi = p (mod f(p)). The golden ratio equals each prime inside its own f(p) image. Proof: (2p-1)^2 = 4p^2 - 4p + 1 = 4f(p) + 5. QED.
p
f(p)
phi mod f(p)
Primitive?
3
5
3
YES (ramified)
5
19
5
NO (5 divides discriminant)
7
41
7
YES (ord 40 = p-1)
11
109
11
YES (ord 108 = p-1)
67
4421
67
YES (ord 4420 = p-1)
phi mod f(3) = 3. phi mod f(5) = 5. phi mod f(7) = 7. phi mod f(11) = 11. And p = 5 is the ONLY chain prime where phi fails to generate -- because 5 divides the discriminant, the two roots are indistinguishable.
Special Primes
Mersenne Connection (PROVED)
Among Mersenne primes 2^n - 1 for n in {2,3,5,7}: 5 is a quadratic residue for exactly one: 2^5 - 1 = 31. There phi = 19 = f(5), and beta = 13 is a primitive root of Z/31.
p = 211 (PROVED)
At p = 211 = 210 + 1 (one above Z/210): ord(phi) = 42 = 2*3*7. Subgroup index: 210/42 = 5. The golden ratio's order at the first prime above the four-channel ring is the product of three of its primes.
Non-Generating Orders
Conjugate Order Theorem (PROVED)
At p = 11: ord(beta) = 5. At p = 19: ord(phi) = 9. When one conjugate is primitive and the other is not, the non-generating order is itself a chain prime or chain value.
Pisano periods
pi(p) = 2(p+1) maximal
For primes where 5 is a non-residue (3, 7, 13, 17, 23, 43, 67, 97). Exception: p = 47, pi = 32 (1/3 of max).
p = 13
pi(13) = 28 = 4*7
Divides 2(13+1) = 28 exactly. At 13, phi must leave the base field.
Explore: phi Visibility Check
Enter any odd prime p. Does the golden ratio exist in Z/pZ? The Legendre symbol (5/p) tells all: +1 means phi exists, -1 means blocked, 0 means ramified (p=5).
Check golden ratio at prime p:
Try: 2, 3, 5, 7, 11, 13, 19, 29, 41, 109, 211. Which primes let phi in?
Contrast Table
Golden ratio
Appears in phyllotaxis, art, Fibonacci. Whether phi is a primitive root is a curiosity.
phi is a primitive root mod 11. Ramified at 5 (discriminant divides). Blocked at 13. The Legendre symbol (5/p) traces the chain's primes.
Fibonacci mod p
Pisano periods, a classical sequence in number theory.
All Pisano periods at chain primes are 11-smooth. lcm = 240 = |roots(E8)|.
f(p) = p^2-p-1
An unremarkable polynomial.
phi = p (mod f(p)) universally. The golden ratio becomes each chain prime through its own f(p) image. 5 is the only failure: discriminant divides.