Cycles in the Generalized Fibonacci Sequence Modulo a Prime (Q4665690)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2155146
Language Label Description Also known as
default for all languages
No label defined
    English
    Cycles in the Generalized Fibonacci Sequence Modulo a Prime
    scientific article; zbMATH DE number 2155146

      Statements

      0 references
      0 references
      11 April 2005
      0 references
      generalized Fibonacci sequence
      0 references
      Cycles in the Generalized Fibonacci Sequence Modulo a Prime (English)
      0 references
      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)\).
      0 references

      Identifiers