which holds for allodd primes. The first few Wieferich primes are 1093, 3511, ... (OEIS A001220),
with no other example reported below (Lehmer 1981, Crandall 1994, Crandall et al.
1997). McIntosh (2004) subsequently reported a search limit of . As of Oct. 2026, no other Wieferich
primes are known. PrimeGrid completed a search below in December 2022 without finding another example (PrimeGrid
2022).
The numbers one less than these primes have the binary
representations
(3)
(4)
(Johnson 1977).
If the first case of Fermat's last theorem is false for exponent , then must be a Wieferich prime (Wieferich 1909). For a positive
integer
and an odd primerelatively prime to , if , then is a Wieferich prime iff also divides , with the same choice of
sign. The conjecture that there are no three consecutive
powerful numbers implies that there are infinitely
many non-Wieferich primes (Granville 1986, Vardi 1991; Ribenboim 1996, p. 341).
In addition, the abc conjecture implies that there
are at least
non-Wieferich primes
for some constant
and all sufficiently large (Silverman 1988, Vardi 1991).