Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



On Fermat’s quotient, base two

Author: D. H. Lehmer
Journal: Math. Comp. 36 (1981), 289-290
MSC: Primary 10-04
MathSciNet review: 595064
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: This paper extends the search for solutions of the congruence \[ {2^{p - 1}} - 1 \equiv 0\quad \pmod {p^2}\] to the limit $p < 6 \cdot {10^9}$. No solution, except the well-known $p = 1093$ and $p = 3511$, was found.

References [Enhancements On Off] (What's this?)

  • J. Brillhart, J. Tonascia, and P. Weinberger, On the Fermat quotient, Computers in number theory (Proc. Sci. Res. Council Atlas Sympos. No. 2, Oxford, 1969) Academic Press, London, 1971, pp. 213–222. MR 0314736
  • A. Wieferich, "Zum letzen Fermatschen Theorem," J.für Math., v. 136, 1909, pp. 293-302.

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 10-04

Retrieve articles in all journals with MSC: 10-04

Additional Information

Article copyright: © Copyright 1981 American Mathematical Society