Fibonacci primitive root Created 2026-10-20 Updated 2026-11-05
A Fibonacci primitive root modulo an odd prime is a primitive root modulo n satisfying . Its powers obey , so the same multiplication that generates all nonzero residues also follows a Fibonacci recurrence.
For example, works modulo five: and its powers exhaust the nonzero residues. Solving the quadratic condition alone is insufficient; the multiplicative order must also equal . Away from , the quadratic has roots only when its discriminant five is a quadratic residue modulo .
A primitive root modulo is a residue class generating the cyclic multiplicative group , so its order is . If is one generator, all generators are with . Thus the number is
where is Euler's totient function. This includes , with .