Period Count for Fibonacci recurrences modulo primes
Period Count for Fibonacci recurrences modulo primes
Let be prime, and let count distinct periods modulo of the Fibonacci recurrence and its parity transform over all initial conditions . Let be the positive integer governing the Pisano period. Period Count for Fibonacci Recurrences modulo . If , then for odd and
If , then , with subclasses
for the two-length case, and
for the three-length case. In subclass B2, the lengths are , , and , with multiplicities and for the latter two. All primes congruent to belong to B2, while primes congruent to may belong to either subclass. These proposed classifications and counts are not resolved in the supplied text.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Marc T. Pudelko, “Modular Periodicity of Random Initialized Recurrences”, arXiv:2510.24882 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.