Enter a modulus, 1 < m < 100,000,000 and compute the period, rank, order, and multiplier of F(mod m).
The period of F(mod m) is the number of terms before the sequence repeats.
The rank of F(mod m) is the least positive integer r such that Fr = 0 (mod m).
The order of F(mod m) is period/rank. Note that the zeros of F(mod m) are evenly spaced.
If F(mod m) has rank r, then the multiplier of F(mod m) is Fr+1 (mod m).
For more information see my article The Fibonacci Sequence Modulo M.
This page created by Marc Renault