Period Count for Fibonacci recurrences modulo primes

From papers

Let pp be prime, and let #(p)\#(p) count distinct periods modulo pp of the Fibonacci recurrence and its parity transform over all initial conditions (a0,a1)(Z/pZ)2(a_0,a_1)\in(\mathbb Z/p\mathbb Z)^2. Let α\alpha be the positive integer governing the Pisano period. Period Count for Fibonacci Recurrences modulo pp. If p2,3(mod5)p\equiv2,3\pmod5, then πA(p)=2(p+1)/α\pi_A(p)=2(p+1)/\alpha for odd α\alpha and

#A(p)=α2(p1)+1.\#_A(p)=\frac\alpha2(p-1)+1.

If p1,4(mod5)p\equiv1,4\pmod5, then πB(p)=(p1)/α\pi_B(p)=(p-1)/\alpha, with subclasses

#B1(p)=α(p+1)+1,\#_{B1}(p)=\alpha(p+1)+1,

for the two-length case, and

#B2(p)=α(p+2)+1,\#_{B2}(p)=\alpha(p+2)+1,

for the three-length case. In subclass B2, the lengths are 00, πB(p)/2\pi_B(p)/2, and πB(p)\pi_B(p), with multiplicities 2α2\alpha and pαp\alpha for the latter two. All primes congruent to 11,19(mod20)11,19\pmod{20} belong to B2, while primes congruent to 1,9(mod20)1,9\pmod{20} 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

No solutions have been posted yet.