New solutions of 𝑎^{𝑝-1}≡1\pmod{𝑝²}

			Journals Home Search Author Info Subscribe Tech Support My Subscriptions Browser Compatibility Info Help
ISSN 1088-6842(online) ISSN 0025-5718(print)

New solutions of $a\sp {p-1}\equiv 1\pmod {p\sp 2}$

Author: Peter L. Montgomery
Journal: Math. Comp. 61 (1993), 361-363
MSC: Primary 11A07; Secondary 11A15
MathSciNet review: 1182246
Full-text PDF Free Access

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}}$ .

[1] M. Aaltonen and K. Inkeri, Catalan’s equation 𝑥^{𝑝}-𝑦^{𝑞}=1 and related congruences, Math. Comp. 56 (1991), no. 193, 359–370. MR 1052082 (91g:11025), http://dx.doi.org/10.1090/S0025-5718-1991-1052082-7
[2] 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 (47 #3288)
[3] D. H. Lehmer, On Fermat’s quotient, base two, Math. Comp. 36 (1981), no. 153, 289–290. MR 595064 (82e:10004), http://dx.doi.org/10.1090/S0025-5718-1981-0595064-5
[4] Daniel Shanks and H. C. Williams, Gunderson’s function in Fermat’s last theorem, Math. Comp. 36 (1981), no. 153, 291–295. MR 595065 (82g:10004), http://dx.doi.org/10.1090/S0025-5718-1981-0595065-7
[5] H. C. Williams, The influence of computers in the development of number theory, Comput. Math. Appl. 8 (1982), no. 2, 75–93. MR 649653 (83c:10002), http://dx.doi.org/10.1016/0898-1221(82)90026-8