Congruences of the Fibonacci numbers modulo a prime. (Russian. English summary) Zbl 1510.11064
Summary: Congruences of the form \(F(expr1) \equiv\varepsilon F(expr2) \pmod p\) by prime modulo \(p\) are proved, whenever \(expr1\) is a polynomial with respect to \(p\). The value of \(\varepsilon\) 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, a_{k-1}, \dots , a_2, a_1, a_0\) and with respect to \(p\) of form \(5t \pm 1\); then, \(F(A(p))\equiv F(a_k + a_{k-1} + \dots + a_2 + a_1 + a_0) \pmod p\). In particular, we consider the case when the coefficients of the polynomial expr1 form the Pisano period modulo \(p\). To search for existing congruences, experiments were performed in the Wolfram Mathematica system.
MSC:
11B39 | Fibonacci and Lucas numbers and polynomials and generalizations |
11A07 | Congruences; primitive roots; residue systems |
Software:
MathematicaReferences:
[1] | Zyuzkov V. M., Eksperimenty v teorii chisel, Izd-vo NTL, Tomsk, 2019, 348 pp. |
[2] | Wolfram Mathematica, |
[3] | Grekhem R., Knut D., Potashnik O., Konkretnaya matematika. Osnovanie informatiki, 2-e izd., ispr., Mir, M.; BINOM. Laboratoriya znanii, 2006, 703 pp. |
[4] | Vajda S., Fibonacci & Lucas Numbers and the Golden Section: Theory and Applications, Ellis Horwood, Chichester, England, 1989, 190 pp. · Zbl 0695.10001 |
[5] | Weisstein Eric W., Wolfram MathWorld: Pisano Period, |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.