Fibonacci-Wieferich primes; heuristics on distributions of primes with arithmetic constraints; Fibonacci numbers; Wall-Sun-Sun prime; modular periodicity; periodic sequence
This paper has been inspired by the endeavour of a large number of mathematicians to discover a Fibonacci-Wieferich prime. An exhaustive computer search has not been successful up to the present even though there exists a conjecture that there are infinitely many such primes. This conjecture is based on the assumption that the probability that a prime $p$ is Fibonacci-Wieferich is equal to $1/p$. According to our computational results and some theoretical consideratons, another form of probability can be assumed. This observation leads us to interesting consequences.
 R. Crandall K. Dilcher C. Pomerance: A search for Wieferich and Wilson primes
. Math. Comp. 66 (1997) 443-449. MR 1372002
 A.-S. Elsenhans J. Jahnel: The Fibonacci sequence modulo p2 - An investigation by computer for p < 10**14. The On-Line Encyclopedia of Integer Sequences (2004) 27 p.
 Hua-Chieh Li: Fibonacci primitive roots and Wall's question
. The Fibonacci Quarterly 37 (1999) 77-84. MR 1676707
| Zbl 0936.11011
 J. Klaka: Criteria for Testing Wall's Question. preprint (2007).
 L. Skula: A note on some relations among special sums of reciprocals modulo p
. to appear in Math. Slovaca (2008). MR 2372821
| Zbl 1164.11001
 Zhi-Hong Sun, Zhi-Wei Sun: Fibonacci Numbers and Fermat's Last Theorem
. Acta Arith. 60 (1992) 371-388. MR 1159353