Congruences of the Fibonacci numbers modulo a prime

Congruences of the form F(expr1) ≡ εF(expr2) (mod p) by prime modulo p are proved, whenever expr1 is a polynomial with respect to p. The value of ε equals 1 or -1 and expr2 does not contain p. An example of such a theorem is as follows: given a polynomial A(p) with integer coefficients а_к, a_k-1, ..., a₂, а₁ a₀ and with respect to p of form 5t ± 1; then, F(A(p)) ≡ F(a_k + а_к-1 + ... + а₂ + а₁ + а₀) (mod p). In particular, we consider the case when the coefficients of the polynomial expr1 form the Pisano period modulo p. To search for existing TOngruences, experiments were performed in the Wolfram Mathematica system. AMS Mathematical Subject Classification: MSC 11B39, 11A07

Keywords

Authors

References