New solutions of $a^ {p-1}\equiv 1\pmod {p^ 2}$
HTML articles powered by AMS MathViewer
- by Peter L. Montgomery PDF
- Math. Comp. 61 (1993), 361-363 Request permission
Abstract:
We tabulate solutions of ${a^{p - 1}} \equiv 1\;\pmod {p^2}$ where $2 \leq a \leq 99$ and where p is an odd prime, $p < {2^{32}}$.References
- M. Aaltonen and K. Inkeri, Catalan’s equation $x^p-y^q=1$ and related congruences, Math. Comp. 56 (1991), no. 193, 359–370. MR 1052082, DOI 10.1090/S0025-5718-1991-1052082-7
- 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
- D. H. Lehmer, On Fermat’s quotient, base two, Math. Comp. 36 (1981), no. 153, 289–290. MR 595064, DOI 10.1090/S0025-5718-1981-0595064-5
- Daniel Shanks and H. C. Williams, Gunderson’s function in Fermat’s last theorem, Math. Comp. 36 (1981), no. 153, 291–295. MR 595065, DOI 10.1090/S0025-5718-1981-0595065-7
- H. C. Williams, The influence of computers in the development of number theory, Comput. Math. Appl. 8 (1982), no. 2, 75–93. MR 649653, DOI 10.1016/0898-1221(82)90026-8
Additional Information
- © Copyright 1993 American Mathematical Society
- Journal: Math. Comp. 61 (1993), 361-363
- MSC: Primary 11A07; Secondary 11A15
- DOI: https://doi.org/10.1090/S0025-5718-1993-1182246-5
- MathSciNet review: 1182246