Lehmer, D. H. On Fermat’s quotient, base two. (English) Zbl 0452.10001 Math. Comput. 36, 289-290 (1981). Summary: This paper extends the search for solutions of the congruence \(2^{p-1}-1 \equiv 0\pmod {p^2}\) to the limit \(p < 6 \cdot {10^9}\). No solution, except the well-known \(p = 1093\) and \(p = 3511\), was found. Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 13 Documents MSC: 11A07 Congruences; primitive roots; residue systems 11-04 Software, source code, etc. for problems pertaining to number theory Keywords:Fermat’s quotient; solutions of congruence; computer search PDFBibTeX XMLCite \textit{D. H. Lehmer}, Math. Comput. 36, 289--290 (1981; Zbl 0452.10001) Full Text: DOI