Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})

Keller, Wilfrid; Richstein, Jörg

doi:10.1090/S0025-5718-04-01666-7

Solutions of the congruence $a^{p-1} \equiv 1 \pmod {p^r}$
HTML articles powered by AMS MathViewer

by Wilfrid Keller and Jörg Richstein PDF

Math. Comp. 74 (2005), 927-936 Request permission

Abstract:

To supplement existing data, solutions of $a^{p-1} \equiv 1 \pmod {p^2}$ are tabulated for primes $a, p$ with $100 < a < 1000$ and $10^4 < p < 10^{11}$. For $a < 100$, five new solutions $p > 2^{32}$ are presented. One of these, $p = 188748146801$ for $a = 5$, also satisfies the “reverse” congruence $p^{a-1} \equiv 1 \pmod {a^2}$. An effective procedure for searching for such “double solutions” is described and applied to the range $a < 10^6$, $p <\max (10^{11}, a^2)$. Previous to this, congruences $a^{p-1} \equiv 1 \pmod {p^r}$ are generally considered for any $r \ge 2$ and fixed prime $p$ to see where the smallest prime solution $a$ occurs.

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
N. G. W. H. Beeger, Quelques remarques sur les congruences $r^{p-1} \equiv 1 \pmod {p^2}$ et $(p-1)! \equiv -1 \pmod {p^2}$, Messenger of Math. 43 (1914), 72–84.
David Bressoud and Stan Wagon, A course in computational number theory, Key College Publishing, Emeryville, CA; in cooperation with Springer-Verlag, New York, 2000. With 1 CD-ROM (Windows, Macintosh and UNIX). MR 1756372
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
R. Brown, electronic mail dated 13 June 2001.
Richard Crandall, Karl Dilcher, and Carl Pomerance, A search for Wieferich and Wilson primes, Math. Comp. 66 (1997), no. 217, 433–449. MR 1372002, DOI 10.1090/S0025-5718-97-00791-6
A. Cunningham, Period-lengths of circulates, Messenger of Math. 29 (1900), 145–179.
R. Ernvall and T. Metsänkylä, On the $p$-divisibility of Fermat quotients, Math. Comp. 66 (1997), no. 219, 1353–1365. MR 1408373, DOI 10.1090/S0025-5718-97-00843-0
Y. Gallot, Proth.exe: A Windows program for finding very large primes, http://www.utm.edu /research/primes/programs/gallot/.
K. Inkeri, On Catalan’s conjecture, J. Number Theory 34 (1990), no. 2, 142–152. MR 1042488, DOI 10.1016/0022-314X(90)90145-H
W. Keller, New prime solutions $p$ of $a^{p-1} \equiv 1 \pmod {p^2}$, Abstracts Amer. Math. Soc. 9 (1988), 503.
W. Keller and J. Richstein, Fermat quotients $q_p(a)$ that are divisible by $p$, http://www. informatik.uni-giessen.de/cnth/FermatQuotient.html.
J. Knauer and J. Richstein, The continuing search for Wieferich primes, Math. Comp., to appear.
R. McIntosh, electronic mail dated 23 February 2001.
W. Meissner, Über die Lösungen der Kongruenz $x^{p-1} \equiv 1 \bmod {p^m}$ und ihre Verwertung zur Periodenbestimmung mod $p^\kappa$, Sitzungsber. Berliner Math. Ges. 13 (1914), 96–107.
W. F. Meyer, Ergänzungen zum Fermatschen und Wilsonschen Satze, Arch. Math. Physik (3) 2 (1902), 141–146.
M. Mignotte and Y. Roy, L’équation de Catalan, Prépubl. de l’IRMA 513/P-299, Université Louis Pasteur et CNRS, Strasbourg, 1992.
Peter L. Montgomery, New solutions of $a^{p-1}\equiv 1\pmod {p^2}$, Math. Comp. 61 (1993), no. 203, 361–363. MR 1182246, DOI 10.1090/S0025-5718-1993-1182246-5
Paulo Ribenboim, The new book of prime number records, Springer-Verlag, New York, 1996. MR 1377060, DOI 10.1007/978-1-4612-0759-7
Hans Riesel, Note on the congruence $a^{p-1}=1$ $(\textrm {mod}$ $p^{2})$, Math. Comp. 18 (1964), 149–150. MR 157928, DOI 10.1090/S0025-5718-1964-0157928-6
Worms de Romilly, Équation $a^{p-1} = 1\, +\,$mult. $p^2$, L’Intermédiaire des Math. 8 (1901), 214–215.