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 .

Articles by others on the same topic (0)

There are currently no matching articles.