Cycles in the Generalized Fibonacci Sequence Modulo a Prime
A generalized Fibonacci sequence \(\{G(n)\}\) satisfies the recurrence: \[ G(n)= aG(n- 1)+ bG(n- 2), \] where \(a\), \(b\), \(G(0)\), \(G(1)\) are given integers. Assume that the associated characteristic equation: \(\lambda^2= a\lambda+ b\) has distinct integer roots, so that \(a^2+ 4b= x^2> 0\). The authors consider the behavior of \(\{G(n)\}\pmod p\), where \(p\) is prime. In particular, let \(C(p)= c\) be the least positive integer such that \[ G(n+ c)\equiv G(n)\pmod p\text{ and }G(n+ c+ 1)\equiv G(n+1)\pmod p \] for all sufficiently large \(n\). The authors show that if \(p\) is a prime such that \((x,p)= (b,p)= 1\), then \(C(p)|(p- 1)\).
- Complete generalized Fibonacci sequences modulo primes
- Fibonacci goes magic
- On equivalence classes of generalized Fibonacci sequences
- scientific article; zbMATH DE number 4204429 (Why is no real title available?)
- scientific article; zbMATH DE number 3963929 (Why is no real title available?)
- scientific article; zbMATH DE number 3619979 (Why is no real title available?)
- The generalized bi-periodic Fibonacci sequence modulo m
- The Hadamard-type k-step Fibonacci sequences in groups
- LINEARLIZATION OF GENERALIZED FIBONACCI SEQUENCES
- Zero-avoiding solutions of the Fibonacci recurrence modulo a prime
- Fibonacci periods and multiples
- On the generalized Fibonacci sequences of polynomials over finite fields
This page was built for publication: Cycles in the Generalized Fibonacci Sequence Modulo a Prime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4665690)