Wieferich prime
Named after  Arthur Wieferich 

Publication year  1909 
Author of publication  Wieferich, A. 
No. of known terms  2 
Conjectured no. of terms  Infinite 
Subsequence of 

First terms  1093, 3511 
Largest known term  3511 
OEIS index  A001220 
In number theory, a Wieferich prime is a prime number p such that p^{2} divides 2^{p − 1} − 1,^{[4]} therefore connecting these primes with Fermat's little theorem, which states that every odd prime p divides 2^{p − 1} − 1. Wieferich primes were first described by Arthur Wieferich in 1909 in works pertaining to Fermat's Last Theorem, at which time both of Fermat's theorems were already well known to mathematicians.^{[5]}^{[6]}
Since then, connections between Wieferich primes and various other topics in mathematics have been discovered, including other types of numbers and primes, such as Mersenne and Fermat numbers, specific types of pseudoprimes and some types of numbers generalized from the original definition of a Wieferich prime. Over time, those connections discovered have extended to cover more properties of certain prime numbers as well as more general subjects such as number fields and the abc conjecture.
(As of April 2023), the only known Wieferich primes are 1093 and 3511 (sequence A001220 in the OEIS).
Equivalent definitions
The stronger version of Fermat's little theorem, which a Wieferich prime satisfies, is usually expressed as a congruence relation 2^{p 1} ≡ 1 (mod p^{2}). From the definition of the congruence relation on integers, it follows that this property is equivalent to the definition given at the beginning. Thus if a prime p satisfies this congruence, this prime divides the Fermat quotient [math]\displaystyle{ \tfrac{2^{p1}1}{p} }[/math]. The following are two illustrative examples using the primes 11 and 1093:
 For p = 11, we get [math]\displaystyle{ \tfrac{2^{10}1}{11} }[/math] which is 93 and leaves a remainder of 5 after division by 11, hence 11 is not a Wieferich prime. For p = 1093, we get [math]\displaystyle{ \tfrac{2^{1092}1}{1093} }[/math] or 485439490310...852893958515 (302 intermediate digits omitted for clarity), which leaves a remainder of 0 after division by 1093 and thus 1093 is a Wieferich prime.
Wieferich primes can be defined by other equivalent congruences. If p is a Wieferich prime, one can multiply both sides of the congruence 2^{p−1} ≡ 1 (mod p^{2}) by 2 to get 2^{p} ≡ 2 (mod p^{2}). Raising both sides of the congruence to the power p shows that a Wieferich prime also satisfies 2^{p2} ≡2^{p} ≡ 2 (mod p^{2}), and hence 2^{pk} ≡ 2 (mod p^{2}) for all k ≥ 1. The converse is also true: 2^{pk} ≡ 2 (mod p^{2}) for some k ≥ 1 implies that the multiplicative order of 2 modulo p^{2} divides gcd(p^{k} − 1, φ(p^{2})) = p − 1, that is, 2^{p−1} ≡ 1 (mod p^{2}) and thus p is a Wieferich prime. This also implies that Wieferich primes can be defined as primes p such that the multiplicative orders of 2 modulo p and modulo p^{2} coincide: ord_{p2} 2 = ord_{p} 2, (By the way, ord_{1093}2 = 364, and ord_{3511}2 = 1755).
H. S. Vandiver proved that 2^{p−1} ≡ 1 (mod p^{3}) if and only if [math]\displaystyle{ 1 + \tfrac{1}{3} + \dots + \tfrac{1}{p2} \equiv 0 \pmod{p^2} }[/math].^{[7]}^{:187}
History and search status
Unsolved problem in mathematics: Are there infinitely many Wieferich primes? (more unsolved problems in mathematics)

In 1902, Meyer proved a theorem about solutions of the congruence a^{p − 1} ≡ 1 (mod p^{r}).^{[8]}^{:930}^{[9]} Later in that decade Arthur Wieferich showed specifically that if the first case of Fermat's last theorem has solutions for an odd prime exponent, then that prime must satisfy that congruence for a = 2 and r = 2.^{[10]} In other words, if there exist solutions to x^{p} + y^{p} + z^{p} = 0 in integers x, y, z and p an odd prime with p ∤ xyz, then p satisfies 2^{p − 1} ≡ 1 (mod p^{2}). In 1913, Bachmann examined the residues of [math]\displaystyle{ \tfrac{2^{p1}1}{p}\,\bmod\,p }[/math]. He asked the question when this residue vanishes and tried to find expressions for answering this question.^{[11]}
The prime 1093 was found to be a Wieferich prime by Waldemar Meissner (cs) in 1913 and confirmed to be the only such prime below 2000. He calculated the smallest residue of [math]\displaystyle{ \tfrac{2^{t}1}{p}\,\bmod\,p }[/math] for all primes p < 2000 and found this residue to be zero for t = 364 and p = 1093, thereby providing a counterexample to a conjecture by Grave about the impossibility of the Wieferich congruence.^{[12]} Emil Haentzschel (de) later ordered verification of the correctness of Meissner's congruence via only elementary calculations.^{[13]}^{:664} Inspired by an earlier work of Euler, he simplified Meissner's proof by showing that 1093^{2}  (2^{182} + 1) and remarked that (2^{182} + 1) is a factor of (2^{364} − 1).^{[14]} It was also shown that it is possible to prove that 1093 is a Wieferich prime without using complex numbers contrary to the method used by Meissner,^{[15]} although Meissner himself hinted at that he was aware of a proof without complex values.^{[12]}^{:665}
The prime 3511 was first found to be a Wieferich prime by N. G. W. H. Beeger in 1922^{[16]} and another proof of it being a Wieferich prime was published in 1965 by Guy.^{[17]} In 1960, Kravitz^{[18]} doubled a previous record set by CarlErik Fröberg (sv)^{[19]} and in 1961 Riesel extended the search to 500000 with the aid of BESK.^{[20]} Around 1980, Lehmer was able to reach the search limit of 6×10^{9}.^{[21]} This limit was extended to over 2.5×10^{15} in 2006,^{[22]} finally reaching 3×10^{15}. It is now known that if any other Wieferich primes exist, they must be greater than 6.7×10^{15}.^{[23]}
In 2007–2016, a search for Wieferich primes was performed by the distributed computing project Wieferich@Home.^{[24]} In 2011–2017, another search was performed by the PrimeGrid project, although later the work done in this project was claimed wasted.^{[25]} While these projects reached search bounds above 1×10^{17}, neither of them reported any sustainable results.
In 2020, PrimeGrid started another project that searches for Wieferich and Wall–Sun–Sun primes simultaneously. The new project uses checksums to enable independent doublechecking of each subinterval, thus minimizing the risk of missing an instance because of faulty hardware.^{[26]} The project ended in December 2022, definitely proving that a third Wieferich prime must exceed 2^{64} (about 18×10^{18}).^{[27]}
It has been conjectured (as for Wilson primes) that infinitely many Wieferich primes exist, and that the number of Wieferich primes below x is approximately log(log(x)), which is a heuristic result that follows from the plausible assumption that for a prime p, the (p − 1)th degree roots of unity modulo p^{2} are uniformly distributed in the multiplicative group of integers modulo p^{2}.^{[28]}
Properties
Connection with Fermat's Last Theorem
The following theorem connecting Wieferich primes and Fermat's Last Theorem was proven by Wieferich in 1909:^{[10]}
 Let p be prime, and let x, y, z be integers such that x^{p} + y^{p} + z^{p} = 0. Furthermore, assume that p does not divide the product xyz. Then p is a Wieferich prime.
The above case (where p does not divide any of x, y or z) is commonly known as the first case of Fermat's Last Theorem (FLTI)^{[29]}^{[30]} and FLTI is said to fail for a prime p, if solutions to the Fermat equation exist for that p, otherwise FLTI holds for p.^{[31]} In 1910, Mirimanoff expanded^{[32]} the theorem by showing that, if the preconditions of the theorem hold true for some prime p, then p^{2} must also divide 3^{p − 1} − 1. Granville and Monagan further proved that p^{2} must actually divide m^{p − 1} − 1 for every prime m ≤ 89.^{[33]} Suzuki extended the proof to all primes m ≤ 113.^{[34]}
Let H_{p} be a set of pairs of integers with 1 as their greatest common divisor, p being prime to x, y and x + y, (x + y)^{p−1} ≡ 1 (mod p^{2}), (x + ξy) being the pth power of an ideal of K with ξ defined as cos 2π/p + i sin 2π/p. K = Q(ξ) is the field extension obtained by adjoining all polynomials in the algebraic number ξ to the field of rational numbers (such an extension is known as a number field or in this particular case, where ξ is a root of unity, a cyclotomic number field).^{[33]}^{:332} From uniqueness of factorization of ideals in Q(ξ) it follows that if the first case of Fermat's last theorem has solutions x, y, z then p divides x+y+z and (x, y), (y, z) and (z, x) are elements of H_{p}.^{[33]}^{:333} Granville and Monagan showed that (1, 1) ∈ H_{p} if and only if p is a Wieferich prime.^{[33]}^{:333}
Connection with the abc conjecture and nonWieferich primes
A nonWieferich prime is a prime p satisfying 2^{p − 1} ≢ 1 (mod p^{2}). J. H. Silverman showed in 1988 that if the abc conjecture holds, then there exist infinitely many nonWieferich primes.^{[35]} More precisely he showed that the abc conjecture implies the existence of a constant only depending on α such that the number of nonWieferich primes to base α with p less than or equal to a variable X is greater than log(X) as X goes to infinity.^{[36]}^{:227} Numerical evidence suggests that very few of the prime numbers in a given interval are Wieferich primes. The set of Wieferich primes and the set of nonWieferich primes, sometimes denoted by W_{2} and W_{2}^{c} respectively,^{[37]} are complementary sets, so if one of them is shown to be finite, the other one would necessarily have to be infinite, because both are proper subsets of the set of prime numbers. It was later shown that the existence of infinitely many nonWieferich primes already follows from a weaker version of the abc conjecture, called the ABC(k, ε) conjecture.^{[38]} Additionally, the existence of infinitely many nonWieferich primes would also follow if there exist infinitely many squarefree Mersenne numbers^{[39]} as well as if there exists a real number ξ such that the set {n ∈ N : λ(2^{n} − 1) < 2 − ξ} is of density one, where the index of composition λ(n) of an integer n is defined as [math]\displaystyle{ \tfrac{\log n}{\log \gamma (n)} }[/math] and [math]\displaystyle{ \gamma (n) = \prod_{p \mid n} p }[/math], meaning [math]\displaystyle{ \gamma (n) }[/math] gives the product of all prime factors of n.^{[37]}^{:4}
Connection with Mersenne and Fermat primes
It is known that the nth Mersenne number M_{n} = 2^{n} − 1 is prime only if n is prime. Fermat's little theorem implies that if p > 2 is prime, then M_{p−1} (= 2^{p − 1} − 1) is always divisible by p. Since Mersenne numbers of prime indices M_{p} and M_{q} are coprime,
 A prime divisor p of M_{q}, where q is prime, is a Wieferich prime if and only if p^{2} divides M_{q}.^{[40]}
Thus, a Mersenne prime cannot also be a Wieferich prime. A notable open problem is to determine whether or not all Mersenne numbers of prime index are squarefree. If q is prime and the Mersenne number M_{q} is not squarefree, that is, there exists a prime p for which p^{2} divides M_{q}, then p is a Wieferich prime. Therefore, if there are only finitely many Wieferich primes, then there will be at most finitely many Mersenne numbers with prime index that are not squarefree. Rotkiewicz showed a related result: if there are infinitely many squarefree Mersenne numbers, then there are infinitely many nonWieferich primes.^{[41]}
Similarly, if p is prime and p^{2} divides some Fermat number F_{n} = 2^{2n} + 1, then p must be a Wieferich prime.^{[42]}
In fact, there exists a natural number n and a prime p that p^{2} divides [math]\displaystyle{ \Phi_n(2) }[/math] (where [math]\displaystyle{ \Phi_n(x) }[/math] is the nth cyclotomic polynomial) if and only if p is a Wieferich prime. For example, 1093^{2} divides [math]\displaystyle{ \Phi_{364}(2) }[/math], 3511^{2} divides [math]\displaystyle{ \Phi_{1755}(2) }[/math]. Mersenne and Fermat numbers are just special situations of [math]\displaystyle{ \Phi_n(2) }[/math]. Thus, if 1093 and 3511 are only two Wieferich primes, then all [math]\displaystyle{ \Phi_n(2) }[/math] are squarefree except [math]\displaystyle{ \Phi_{364}(2) }[/math] and [math]\displaystyle{ \Phi_{1755}(2) }[/math] (In fact, when there exists a prime p which p^{2} divides some [math]\displaystyle{ \Phi_n(2) }[/math], then it is a Wieferich prime); and clearly, if [math]\displaystyle{ \Phi_n(2) }[/math] is a prime, then it cannot be Wieferich prime. (Any odd prime p divides only one [math]\displaystyle{ \Phi_n(2) }[/math] and n divides p − 1, and if and only if the period length of 1/p in binary is n, then p divides [math]\displaystyle{ \Phi_n(2) }[/math]. Besides, if and only if p is a Wieferich prime, then the period length of 1/p and 1/p^{2} are the same (in binary). Otherwise, this is p times than that.)
For the primes 1093 and 3511, it was shown that neither of them is a divisor of any Mersenne number with prime index nor a divisor of any Fermat number, because 364 and 1755 are neither prime nor powers of 2.^{[43]}
Connection with other equations
Scott and Styer showed that the equation p^{x} – 2^{y} = d has at most one solution in positive integers (x, y), unless when p^{4}  2^{ordp 2} – 1 if p ≢ 65 (mod 192) or unconditionally when p^{2}  2^{ordp 2} – 1, where ord_{p} 2 denotes the multiplicative order of 2 modulo p.^{[44]}^{:215, 217–218} They also showed that a solution to the equation ±a^{x1} ± 2^{y1} = ±a^{x2} ± 2^{y2} = c must be from a specific set of equations but that this does not hold, if a is a Wieferich prime greater than 1.25 x 10^{15}.^{[45]}^{:258}
Binary periodicity of p − 1
Johnson observed^{[46]} that the two known Wieferich primes are one greater than numbers with periodic binary expansions (1092 = 010001000100_{2}=444_{16}; 3510 = 110110110110_{2}=6666_{8}). The Wieferich@Home project searched for Wieferich primes by testing numbers that are one greater than a number with a periodic binary expansion, but up to a "bit pseudolength" of 3500 of the tested binary numbers generated by combination of bit strings with a bit length of up to 24 it has not found a new Wieferich prime.^{[47]}
Abundancy of p − 1
It has been noted (sequence A239875 in the OEIS) that the known Wieferich primes are one greater than mutually friendly numbers (the shared abundancy index being 112/39).
Connection with pseudoprimes
It was observed that the two known Wieferich primes are the square factors of all nonsquare free base2 Fermat pseudoprimes up to 25×10^{9}.^{[48]} Later computations showed that the only repeated factors of the pseudoprimes up to 10^{12} are 1093 and 3511.^{[49]} In addition, the following connection exists:
 Let n be a base 2 pseudoprime and p be a prime divisor of n. If [math]\displaystyle{ \tfrac{2^{n1}1}{n}\not\equiv 0 \pmod{p} }[/math], then also [math]\displaystyle{ \tfrac{2^{p1}1}{p}\not\equiv 0 \pmod{p} }[/math].^{[31]}^{:378} Furthermore, if p is a Wieferich prime, then p^{2} is a Catalan pseudoprime.
Connection with directed graphs
For all primes p up to 100000, L(p^{n+1}) = L(p^{n}) only in two cases: L(1093^{2}) = L(1093) = 364 and L(3511^{2}) = L(3511) = 1755, where L(m) is the number of vertices in the cycle of 1 in the doubling diagram modulo m. Here the doubling diagram represents the directed graph with the nonnegative integers less than m as vertices and with directed edges going from each vertex x to vertex 2x reduced modulo m.^{[50]}^{:74} It was shown, that for all odd prime numbers either L(p^{n+1}) = p · L(p^{n}) or L(p^{n+1}) = L(p^{n}).^{[50]}^{:75}
It was shown that [math]\displaystyle{ \chi_{D_{0}} \big(p \big) = 1 }[/math] and [math]\displaystyle{ \lambda\,\!_p \big( \mathbb{Q} \big(\sqrt{D_{0}} \big) \big) = 1 }[/math] if and only if 2^{p − 1} ≢ 1 (mod p^{2}) where p is an odd prime and [math]\displaystyle{ D_{0} \lt 0 }[/math] is the fundamental discriminant of the imaginary quadratic field [math]\displaystyle{ \mathbb{Q} \big(\sqrt{1  p^2} \big) }[/math]. Furthermore, the following was shown: Let p be a Wieferich prime. If p ≡ 3 (mod 4), let [math]\displaystyle{ D_{0} \lt 0 }[/math] be the fundamental discriminant of the imaginary quadratic field [math]\displaystyle{ \mathbb{Q} \big(\sqrt{1  p} \big) }[/math] and if p ≡ 1 (mod 4), let [math]\displaystyle{ D_{0} \lt 0 }[/math] be the fundamental discriminant of the imaginary quadratic field [math]\displaystyle{ \mathbb{Q} \big(\sqrt{4  p} \big) }[/math]. Then [math]\displaystyle{ \chi_{D_{0}} \big(p \big) = 1 }[/math] and [math]\displaystyle{ \lambda\,\!_p \big( \mathbb{Q} \big(\sqrt{D_{0}} \big) \big) = 1 }[/math] (χ and λ in this context denote Iwasawa invariants).^{[51]}^{:27}
Furthermore, the following result was obtained: Let q be an odd prime number, k and p are primes such that p = 2k + 1, k ≡ 3 (mod 4), p ≡ −1 (mod q), p ≢ −1 (mod q^{3}) and the order of q modulo k is [math]\displaystyle{ \tfrac{k1}{2} }[/math]. Assume that q divides h^{+}, the class number of the real cyclotomic field [math]\displaystyle{ \mathbb{Q} \big( \zeta\,\!_p + \zeta\,\!_p^{1} \big) }[/math], the cyclotomic field obtained by adjoining the sum of a pth root of unity and its reciprocal to the field of rational numbers. Then q is a Wieferich prime.^{[52]}^{:55} This also holds if the conditions p ≡ −1 (mod q) and p ≢ −1 (mod q^{3}) are replaced by p ≡ −3 (mod q) and p ≢ −3 (mod q^{3}) as well as when the condition p ≡ −1 (mod q) is replaced by p ≡ −5 (mod q) (in which case q is a Wall–Sun–Sun prime) and the incongruence condition replaced by p ≢ −5 (mod q^{3}).^{[53]}^{:376}
Generalizations
NearWieferich primes
A prime p satisfying the congruence 2^{(p−1)/2} ≡ ±1 + Ap (mod p^{2}) with small A is commonly called a nearWieferich prime (sequence A195988 in the OEIS).^{[28]}^{[54]} NearWieferich primes with A = 0 represent Wieferich primes. Recent searches, in addition to their primary search for Wieferich primes, also tried to find nearWieferich primes.^{[23]}^{[55]} The following table lists all nearWieferich primes with A ≤ 10 in the interval [1×10^{9}, 3×10^{15}].^{[56]} This search bound was reached in 2006 in a search effort by P. Carlisle, R. Crandall and M. Rodenkirch.^{[22]}^{[57]} Bigger entries are by PrimeGrid.
p  1 or −1  A 

3520624567  +1  −6 
46262476201  +1  +5 
47004625957  −1  +1 
58481216789  −1  +5 
76843523891  −1  +1 
1180032105761  +1  −6 
12456646902457  +1  +2 
134257821895921  +1  +10 
339258218134349  −1  +2 
2276306935816523  −1  −3 
82687771042557349  1  10 
3156824277937156367  +1  +7 
The sign +1 or 1 above can be easily predicted by Euler's criterion (and the second supplement to the law of quadratic reciprocity).
Dorais and Klyve^{[23]} used a different definition of a nearWieferich prime, defining it as a prime p with small value of [math]\displaystyle{ \left\tfrac{\omega(p)}{p}\right }[/math] where [math]\displaystyle{ \omega(p)=\tfrac{2^{p1}1}{p}\,\bmod\,p }[/math] is the Fermat quotient of 2 with respect to p modulo p (the modulo operation here gives the residue with the smallest absolute value). The following table lists all primes p ≤ 6.7 × 10^{15} with [math]\displaystyle{ \left\tfrac{\omega(p)}p\right\leq 10^{14} }[/math].
p  [math]\displaystyle{ \omega(p) }[/math]  [math]\displaystyle{ \left\tfrac{\omega(p)}{p}\right\times 10^{14} }[/math] 

1093  0  0 
3511  0  0 
2276306935816523  +6  0.264 
3167939147662997  −17  0.537 
3723113065138349  −36  0.967 
5131427559624857  −36  0.702 
5294488110626977  −31  0.586 
6517506365514181  +58  0.890 
The two notions of nearness are related as follows. If [math]\displaystyle{ 2^{(p1)/2}\equiv \pm 1 + Ap \pmod{p^2} }[/math], then by squaring, clearly [math]\displaystyle{ 2^{p1}\equiv 1 \pm 2Ap \pmod{p^2} }[/math]. So if A had been chosen with [math]\displaystyle{ A }[/math] small, then clearly [math]\displaystyle{ \!\pm 2A = 2A }[/math] is also (quite) small, and an even number. However, when [math]\displaystyle{ \omega(p) }[/math] is odd above, the related A from before the last squaring was not "small". For example, with [math]\displaystyle{ p=3167939147662997 }[/math], we have [math]\displaystyle{ 2^{(p1)/2}\equiv 1  1583969573831490p \pmod{p^2} }[/math] which reads extremely nonnear, but after squaring this is [math]\displaystyle{ 2^{p1}\equiv 1  17p \pmod{p^2} }[/math] which is a nearWieferich by the second definition.
Basea Wieferich primes
A Wieferich prime base a is a prime p that satisfies
 a^{p − 1} ≡ 1 (mod p^{2}),^{[8]} with a less than p but greater than 1.
Such a prime cannot divide a, since then it would also divide 1.
It's a conjecture that for every natural number a, there are infinitely many Wieferich primes in base a.
Bolyai showed that if p and q are primes, a is a positive integer not divisible by p and q such that a^{p−1} ≡ 1 (mod q), a^{q−1} ≡ 1 (mod p), then a^{pq−1} ≡ 1 (mod pq). Setting p = q leads to a^{p2−1} ≡ 1 (mod p^{2}).^{[58]}^{:284} It was shown that a^{p2−1} ≡ 1 (mod p^{2}) if and only if a^{p−1} ≡ 1 (mod p^{2}).^{[58]}^{:285–286}
Known solutions of a^{p−1} ≡ 1 (mod p^{2}) for small values of a are:^{[59]} (checked up to 5 × 10^{13})
a primes p such that a^{p − 1} = 1 (mod p^{2}) OEIS sequence 1 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, ... (All primes) A000040 2 1093, 3511, ... A001220 3 11, 1006003, ... A014127 4 1093, 3511, ... 5 2, 20771, 40487, 53471161, 1645333507, 6692367337, 188748146801, ... A123692 6 66161, 534851, 3152573, ... A212583 7 5, 491531, ... A123693 8 3, 1093, 3511, ... 9 2, 11, 1006003, ... 10 3, 487, 56598313, ... A045616 11 71, ... 12 2693, 123653, ... A111027 13 2, 863, 1747591, ... A128667 14 29, 353, 7596952219, ... A234810 15 29131, 119327070011, ... A242741 16 1093, 3511, ... 17 2, 3, 46021, 48947, 478225523351, ... A128668 18 5, 7, 37, 331, 33923, 1284043, ... A244260 19 3, 7, 13, 43, 137, 63061489, ... A090968 20 281, 46457, 9377747, 122959073, ... A242982 21 2, ... 22 13, 673, 1595813, 492366587, 9809862296159, ... A298951 23 13, 2481757, 13703077, 15546404183, 2549536629329, ... A128669 24 5, 25633, ... 25 2, 20771, 40487, 53471161, 1645333507, 6692367337, 188748146801, ... 26 3, 5, 71, 486999673, 6695256707, ... A306255 27 11, 1006003, ... 28 3, 19, 23, ... 29 2, ... 30 7, 160541, 94727075783, ... A306256 31 7, 79, 6451, 2806861, ... A331424 32 5, 1093, 3511, ... 33 2, 233, 47441, 9639595369, ... 34 46145917691, ... 35 3, 1613, 3571, ... 36 66161, 534851, 3152573, ... 37 2, 3, 77867, 76407520781, ... A331426 38 17, 127, ... 39 8039, ... 40 11, 17, 307, 66431, 7036306088681, ... 41 2, 29, 1025273, 138200401, ... A331427 42 23, 719867822369, ... 43 5, 103, 13368932516573, ... 44 3, 229, 5851, ... 45 2, 1283, 131759, 157635607, ... 46 3, 829, ... 47 ... 48 7, 257, ... 49 2, 5, 491531, ... 50 7, ...
For more information, see^{[60]}^{[61]}^{[62]} and.^{[63]} (Note that the solutions to a = b^{k} is the union of the prime divisors of k which does not divide b and the solutions to a = b)
The smallest solutions of n^{p−1} ≡ 1 (mod p^{2}) are
 2, 1093, 11, 1093, 2, 66161, 5, 3, 2, 3, 71, 2693, 2, 29, 29131, 1093, 2, 5, 3, 281, 2, 13, 13, 5, 2, 3, 11, 3, 2, 7, 7, 5, 2, 46145917691, 3, 66161, 2, 17, 8039, 11, 2, 23, 5, 3, 2, 3, ... (The next term > 4.9×10^{13}) (sequence A039951 in the OEIS)
There are no known solutions of n^{p−1} ≡ 1 (mod p^{2}) for n = 47, 72, 186, 187, 200, 203, 222, 231, 304, 311, 335, 355, 435, 454, 546, 554, 610, 639, 662, 760, 772, 798, 808, 812, 858, 860, 871, 983, 986, 1002, 1023, 1130, 1136, 1138, ....
It is a conjecture that there are infinitely many solutions of a^{p−1} ≡ 1 (mod p^{2}) for every natural number a.
The bases b < p^{2} which p is a Wieferich prime are (for b > p^{2}, the solutions are just shifted by k·p^{2} for k > 0), and there are p − 1 solutions < p^{2} of p and the set of the solutions congruent to p are {1, 2, 3, ..., p − 1}) (sequence A143548 in the OEIS)
p values of b < p^{2} 2 1 3 1, 8 5 1, 7, 18, 24 7 1, 18, 19, 30, 31, 48 11 1, 3, 9, 27, 40, 81, 94, 112, 118, 120 13 1, 19, 22, 23, 70, 80, 89, 99, 146, 147, 150, 168 17 1, 38, 40, 65, 75, 110, 131, 134, 155, 158, 179, 214, 224, 249, 251, 288 19 1, 28, 54, 62, 68, 69, 99, 116, 127, 234, 245, 262, 292, 293, 299, 307, 333, 360 23 1, 28, 42, 63, 118, 130, 170, 177, 195, 255, 263, 266, 274, 334, 352, 359, 399, 411, 466, 487, 501, 528 29 1, 14, 41, 60, 63, 137, 190, 196, 221, 236, 267, 270, 374, 416, 425, 467, 571, 574, 605, 620, 645, 651, 704, 778, 781, 800, 827, 840
The least base b > 1 which prime(n) is a Wieferich prime are
 5, 8, 7, 18, 3, 19, 38, 28, 28, 14, 115, 18, 51, 19, 53, 338, 53, 264, 143, 11, 306, 31, 99, 184, 53, 181, 43, 164, 96, 68, 38, 58, 19, 328, 313, 78, 226, 65, 253, 259, 532, 78, 176, 276, 143, 174, 165, 69, 330, 44, 33, 332, 94, 263, 48, 79, 171, 747, 731, 20, ... (sequence A039678 in the OEIS)
We can also consider the formula [math]\displaystyle{ (a+1)^{p1}a^{p1} \equiv 0 \pmod{p^2} }[/math], (because of the generalized Fermat little theorem, [math]\displaystyle{ (a+1)^{p1}a^{p1} \equiv 0 \pmod{p^2} }[/math] is true for all prime p and all natural number a such that both a and a + 1 are not divisible by p). It's a conjecture that for every natural number a, there are infinitely many primes such that [math]\displaystyle{ (a+1)^{p1}a^{p1} \equiv 0 \pmod{p^2} }[/math].
Known solutions for small a are: (checked up to 4 × 10^{11}) ^{[64]}
[math]\displaystyle{ a }[/math] primes [math]\displaystyle{ p }[/math] such that [math]\displaystyle{ (a+1)^{p1}a^{p1} \equiv 0 \pmod{p^2} }[/math] 1 1093, 3511, ... 2 23, 3842760169, 41975417117, ... 3 5, 250829, ... 4 3, 67, ... 5 3457, 893122907, ... 6 72673, 1108905403, 2375385997, ... 7 13, 819381943, ... 8 67, 139, 499, 26325777341, ... 9 67, 887, 9257, 83449, 111539, 31832131, ... 10 ... 11 107, 4637, 239357, ... 12 5, 11, 51563, 363901, 224189011, ... 13 3, ... 14 11, 5749, 17733170113, 140328785783, ... 15 292381, ... 16 4157, ... 17 751, 46070159, ... 18 7, 142671309349, ... 19 17, 269, ... 20 29, 162703, ... 21 5, 2711, 104651, 112922981, 331325567, 13315963127, ... 22 3, 7, 13, 94447, 1198427, 23536243, ... 23 43, 179, 1637, 69073, ... 24 7, 353, 402153391, ... 25 43, 5399, 21107, 35879, ... 26 7, 131, 653, 5237, 97003, ... 27 2437, 1704732131, ... 28 5, 617, 677, 2273, 16243697, ... 29 73, 101, 6217, ... 30 7, 11, 23, 3301, 48589, 549667, ... 31 3, 41, 416797, ... 32 95989, 2276682269, ... 33 139, 1341678275933, ... 34 83, 139, ... 35 ... 36 107, 137, 613, 2423, 74304856177, ... 37 5, ... 38 167, 2039, ... 39 659, 9413, ... 40 3, 23, 21029249, ... 41 31, 71, 1934399021, 474528373843, ... 42 4639, 1672609, ... 43 31, 4962186419, ... 44 36677, 17786501, ... 45 241, 26120375473, ... 46 5, 13877, ... 47 13, 311, 797, 906165497, ... 48 ... 49 3, 13, 2141, 281833, 1703287, 4805298913, ... 50 2953, 22409, 99241, 5427425917, ...
Wieferich pairs
A Wieferich pair is a pair of primes p and q that satisfy
 p^{q − 1} ≡ 1 (mod q^{2}) and q^{p − 1} ≡ 1 (mod p^{2})
so that a Wieferich prime p ≡ 1 (mod 4) will form such a pair (p, 2): the only known instance in this case is p = 1093. There are only 7 known Wieferich pairs.^{[65]}
 (2, 1093), (3, 1006003), (5, 1645333507), (5, 188748146801), (83, 4871), (911, 318917), and (2903, 18787) (sequence OEIS: A282293 in OEIS)
Wieferich sequence
Start with a(1) any natural number (>1), a(n) = the smallest prime p such that (a(n − 1))^{p − 1} = 1 (mod p^{2}) but p^{2} does not divide a(n − 1) − 1 or a(n − 1) + 1. (If p^{2} divides a(n − 1) − 1 or a(n − 1) + 1, then the solution is a trivial solution) It is a conjecture that every natural number k = a(1) > 1 makes this sequence become periodic, for example, let a(1) = 2:
 2, 1093, 5, 20771, 18043, 5, 20771, 18043, 5, ..., it gets a cycle: {5, 20771, 18043}.
 (sequence A359952 in the OEIS)
Let a(1) = 83:
 83, 4871, 83, 4871, 83, 4871, 83, ..., it gets a cycle: {83, 4871}.
Let a(1) = 59 (a longer sequence):
 59, 2777, 133287067, 13, 863, 7, 5, 20771, 18043, 5, ..., it also gets 5.
However, there are many values of a(1) with unknown status, for example, let a(1) = 3:
 3, 11, 71, 47, ? (There are no known Wieferich primes in base 47).
Let a(1) = 14:
 14, 29, ? (There are no known Wieferich prime in base 29 except 2, but 2^{2} = 4 divides 29 − 1 = 28)
Let a(1) = 39 (a longer sequence):
 39, 8039, 617, 101, 1050139, 29, ? (It also gets 29)
It is unknown that values for a(1) > 1 exist such that the resulting sequence does not eventually become periodic.
When a(n − 1)=k, a(n) will be (start with k = 2): 1093, 11, 1093, 20771, 66161, 5, 1093, 11, 487, 71, 2693, 863, 29, 29131, 1093, 46021, 5, 7, 281, ?, 13, 13, 25633, 20771, 71, 11, 19, ?, 7, 7, 5, 233, 46145917691, 1613, 66161, 77867, 17, 8039, 11, 29, 23, 5, 229, 1283, 829, ?, 257, 491531, ?, ... (For k = 21, 29, 47, 50, even the next value is unknown)
Wieferich numbers
A Wieferich number is an odd natural number n satisfying the congruence 2^{φ(n)} ≡ 1 (mod n^{2}), where φ denotes the Euler's totient function (according to Euler's theorem, 2^{φ(n)} ≡ 1 (mod n) for every odd natural number n). If Wieferich number n is prime, then it is a Wieferich prime. The first few Wieferich numbers are:
 1, 1093, 3279, 3511, 7651, 10533, 14209, 17555, 22953, 31599, 42627, 45643, 52665, 68859, 94797, 99463, ... (sequence A077816 in the OEIS)
It can be shown that if there are only finitely many Wieferich primes, then there are only finitely many Wieferich numbers. In particular, if the only Wieferich primes are 1093 and 3511, then there exist exactly 104 Wieferich numbers, which matches the number of Wieferich numbers currently known.^{[2]}
More generally, a natural number n is a Wieferich number to base a, if a^{φ(n)} ≡ 1 (mod n^{2}).^{[66]}^{:31}
Another definition specifies a Wieferich number as odd natural number n such that n and [math]\displaystyle{ \tfrac{2^m1}{n} }[/math] are not coprime, where m is the multiplicative order of 2 modulo n. The first of these numbers are:^{[67]}
 21, 39, 55, 57, 105, 111, 147, 155, 165, 171, 183, 195, 201, 203, 205, 219, 231, 237, 253, 273, 285, 291, 301, 305, 309, 327, 333, 355, 357, 385, 399, ... (sequence A182297 in the OEIS)
As above, if Wieferich number q is prime, then it is a Wieferich prime.
Weak Wieferich prime
A weak Wieferich prime to base a is a prime p satisfies the condition
 a^{p} ≡ a (mod p^{2})
Every Wieferich prime to base a is also a weak Wieferich prime to base a. If the base a is squarefree, then a prime p is a weak Wieferich prime to base a if and only if p is a Wieferich prime to base a.
Smallest weak Wieferich prime to base n are (start with n = 0)
 2, 2, 1093, 11, 2, 2, 66161, 5, 2, 2, 3, 71, 2, 2, 29, 29131, 2, 2, 3, 3, 2, 2, 13, 13, 2, 2, 3, 3, 2, 2, 7, 7, 2, 2, 46145917691, 3, 2, 2, 17, 8039, 2, 2, 23, 5, 2, 2, 3, ...
Wieferich prime with order n
For integer n ≥2, a Wieferich prime to base a with order n is a prime p satisfies the condition
 a^{p−1} ≡ 1 (mod p^{n})
Clearly, a Wieferich prime to base a with order n is also a Wieferich prime to base a with order m for all 2 ≤ m ≤ n, and Wieferich prime to base a with order 2 is equivalent to Wieferich prime to base a, so we can only consider the n ≥ 3 case. However, there are no known Wieferich prime to base 2 with order 3. The first base with known Wieferich prime with order 3 is 9, where 2 is a Wieferich prime to base 9 with order 3. Besides, both 5 and 113 are Wieferich prime to base 68 with order 3.
Lucas–Wieferich primes
Let P and Q be integers. The Lucas sequence of the first kind associated with the pair (P, Q) is defined by
 [math]\displaystyle{ \begin{align} U_0(P,Q)&=0, \\ U_1(P,Q)&=1, \\ U_n(P,Q)&=P\cdot U_{n1}(P,Q)Q\cdot U_{n2}(P,Q) \end{align} }[/math]
for all [math]\displaystyle{ n \geq 2 }[/math]. A Lucas–Wieferich prime associated with (P, Q) is a prime p such that U_{p−ε}(P, Q) ≡ 0 (mod p^{2}), where ε equals the Legendre symbol [math]\displaystyle{ \left(\tfrac{P^24Q}p\right) }[/math]. All Wieferich primes are Lucas–Wieferich primes associated with the pair (3, 2).^{[3]}^{:2088}
Fibonacci–Wieferich primes
Let Q = −1. For every natural number P, the Lucas–Wieferich primes associated with (P, −1) are called PFibonacci–Wieferich primes or PWall–Sun–Sun primes. If P = 1, they are called Fibonacci–Wieferich primes. If P = 2, they are called Pell–Wieferich primes.
For example, 241 is a Lucas–Wieferich prime associated with (3, −1), so it is a 3Fibonacci–Wieferich prime or 3Wall–Sun–Sun prime. In fact, 3 is a PFibonacci–Wieferich prime if and only if P congruent to 0, 4, or 5 (mod 9),^{[citation needed]} which is analogous to the statement for traditional Wieferich primes that 3 is a basen Wieferich prime if and only if n congruent to 1 or 8 (mod 9).
Wieferich places
Let K be a global field, i.e. a number field or a function field in one variable over a finite field and let E be an elliptic curve. If v is a nonarchimedean place of norm q_{v} of K and a ∈ K, with v(a) = 0 then v(a^{qv − 1} − 1) ≥ 1. v is called a Wieferich place for base a, if v(a^{qv − 1} − 1) > 1, an elliptic Wieferich place for base P ∈ E, if N_{v}P ∈ E_{2} and a strong elliptic Wieferich place for base P ∈ E if n_{v}P ∈ E_{2}, where n_{v} is the order of P modulo v and N_{v} gives the number of rational points (over the residue field of v) of the reduction of E at v.^{[68]}^{:206}
See also
 Wall–Sun–Sun prime – another type of prime number which in the broadest sense also resulted from the study of FLT
 Wolstenholme prime – another type of prime number which in the broadest sense also resulted from the study of FLT
 Wilson prime
 Table of congruences – lists other congruences satisfied by prime numbers
 PrimeGrid – primes search project
 BOINC
 Distributed computing
References
 ↑ Franco, Z.; Pomerance, C. (1995), "On a conjecture of Crandall concerning the qx + 1 problem", Mathematics of Computation 64 (211): 1333–36, doi:10.2307/2153499, Bibcode: 1995MaCom..64.1333F, http://www.math.dartmouth.edu/~carlp/PDF/paper101.pdf.
 ↑ ^{2.0} ^{2.1} Banks, W.D.; Luca, F.; Shparlinski, I.E. (2007), "Estimates for Wieferich numbers", The Ramanujan Journal 14 (3): 361–378, doi:10.1007/s111390079030z, http://web.science.mq.edu.au/~igor/Wieferich.pdf, retrieved 20110312.
 ↑ ^{3.0} ^{3.1} McIntosh, R.J.; Roettger, E.L. (2007), "A search for Fibonacci–Wieferich and Wolstenholme primes", Mathematics of Computation 76 (260): 2087–2094, doi:10.1090/S0025571807019552, Bibcode: 2007MaCom..76.2087M, http://www.ams.org/journals/mcom/200776260/S0025571807019552/S0025571807019552.pdf
 ↑ The Prime Glossary: Wieferich prime, http://primes.utm.edu/glossary/xpage/WieferichPrime.html
 ↑ Israel Kleiner (2000), "From Fermat to Wiles: Fermat's Last Theorem Becomes a Theorem", Elemente der Mathematik 55: 21, doi:10.1007/PL00000079.
 ↑ Leonhard Euler (1736), "Theorematum quorundam ad numeros primos spectantium demonstratio" (in la), Novi Comm. Acad. Sci. Petropol. 8: 33–37, http://www.math.dartmouth.edu/~euler/docs/translations/E054tr.pdf.
 ↑ Dickson, L. E. (1917), "Fermat's Last Theorem and the Origin and Nature of the Theory of Algebraic Numbers", Annals of Mathematics 18 (4): 161–187, doi:10.2307/2007234
 ↑ ^{8.0} ^{8.1} Wilfrid Keller; Jörg Richstein (2005), "Solutions of the congruence a^{p−1} ≡ 1 (mod p^{r})", Mathematics of Computation 74 (250): 927–936, doi:10.1090/S0025571804016667, http://www.ams.org/journals/mcom/200574250/S0025571804016667/S0025571804016667.pdf.
 ↑ Meyer, W. Fr. (1902). "Ergänzungen zum Fermatschen und Wilsonschen Satze". Arch. Math. Physik. 3 2: 141–146. https://archive.org/details/bub_gb_zaMKAAAAIAAJ/page/n540/mode/2up. Retrieved 20200902.
 ↑ ^{10.0} ^{10.1} Wieferich, A. (1909), "Zum letzten Fermat'schen Theorem" (in de), Journal für die reine und angewandte Mathematik 1909 (136): 293–302, doi:10.1515/crll.1909.136.293, http://gdz.sub.unigoettingen.de/dms/resolveppn/?PPN=GDZPPN002166968.
 ↑ Bachmann, P. (1913). "Über den Rest von [math]\displaystyle{ \tfrac{2^{p1}1}{p}\,\bmod\,p }[/math]" (in de). Journal für Mathematik 142 (1): 41–50. http://resolver.sub.unigoettingen.de/purl?GDZPPN002167646.
 ↑ ^{12.0} ^{12.1} Meissner, W. (1913), "Über die Teilbarkeit von 2^{p} − 2 durch das Quadrat der Primzahl p=1093" (in de), Sitzungsber. D. Königl. Preuss. Akad. D. Wiss. (Berlin) Zweiter Halbband. Juli bis Dezember: 663–667, https://oeis.org/A001917/a001917.pdf
 ↑ Haentzschel, E. (1916), "Über die Kongruenz 2^{1092} ≡ 1 (mod 1093^{2})" (in de), Jahresbericht der Deutschen MathematikerVereinigung 25: 284, http://gdz.sub.unigoettingen.de/dms/load/img/?PPN=GDZPPN00212534X
 ↑ Haentzschel, E. (1925), "Über die Kongruenz 2^{1092} ≡ 1 (mod 1093^{2})" (in de), Jahresbericht der Deutschen MathematikerVereinigung 34: 184, http://gdz.sub.unigoettingen.de/dms/load/img/?PPN=GDZPPN002127695
 ↑ Ribenboim, P. (1983), "1093", The Mathematical Intelligencer 5 (2): 28–34, doi:10.1007/BF03023623
 ↑ Beeger, N. G. W. H. (1922), "On a new case of the congruence 2^{p − 1} ≡ 1 (mod p^{2})", Messenger of Mathematics 51: 149–150, https://archive.org/stream/messengerofmathe5051cambuoft#page/148/mode/2up
 ↑ Guy, R. K. (1965), "A property of the prime 3511", The Mathematical Gazette 49 (367): 78–79, doi:10.2307/3614249
 ↑ Kravitz, S. (1960). "The Congruence 2^{p1} ≡ 1 (mod p^{2}) for p < 100,000". Mathematics of Computation 14 (72): 378. doi:10.1090/S00255718196001213347. http://www.ams.org/journals/mcom/196014072/S00255718196001213347/S00255718196001213347.pdf.
 ↑ Fröberg C. E. (1958). "Some Computations of Wilson and Fermat Remainders". Mathematics of Computation 12 (64): 281. doi:10.1090/S0025571858992706. http://www.ams.org/journals/mcom/195812064/S0025571858992706/S0025571858992706.pdf.
 ↑ Riesel, H. (1964). "Note on the Congruence a^{p−1} ≡ 1 (mod p^{2})". Mathematics of Computation 18 (85): 149–150. doi:10.1090/S00255718196401579286. http://www.ams.org/journals/mcom/196418085/S00255718196401579286/S00255718196401579286.pdf.
 ↑ Lehmer, D. H. (1981). "On Fermat's quotient, base two". Mathematics of Computation 36 (153): 289–290. doi:10.1090/S00255718198105950645. http://www.ams.org/journals/mcom/198136153/S00255718198105950645/S00255718198105950645.pdf.
 ↑ ^{22.0} ^{22.1} Ribenboim, Paulo (2004) (in de), Die Welt der Primzahlen: Geheimnisse und Rekorde, New York: Springer, p. 237, ISBN 9783540342830, https://books.google.com/books?id=nEM9ZVr4CsC&pg=PA237
 ↑ ^{23.0} ^{23.1} ^{23.2} Dorais, F. G.; Klyve, D. (2011). "A Wieferich Prime Search Up to 6.7×10^{15}". Journal of Integer Sequences 14 (9). http://www.cs.uwaterloo.ca/journals/JIS/VOL14/Klyve/klyve3.pdf. Retrieved 20111023.
 ↑ "statistics". 20160902. http://www.elmath.org/index.php?id=statistics.
 ↑ "WSS and WFS are suspended". May 11, 2017. http://www.primegrid.com/forum_thread.php?id=7436.
 ↑ "Message boards : Wieferich and WallSunSun Prime Search". https://www.primegrid.com/forum_forum.php?id=127.
 ↑ "WW Statistics". https://www.primegrid.com/stats_ww.php.
 ↑ ^{28.0} ^{28.1} Crandall, Richard E.; Dilcher, Karl; Pomerance, Carl (1997), "A search for Wieferich and Wilson primes", Mathematics of Computation 66 (217): 433–449, doi:10.1090/S0025571897007916, Bibcode: 1997MaCom..66..433C, http://gauss.dartmouth.edu/~carlp/PDF/paper111.pdf.
 ↑ Coppersmith, D. (1990), "Fermat's Last Theorem (Case I) and the Wieferich Criterion", Mathematics of Computation 54 (190): 895–902, doi:10.1090/s00255718199010105982, Bibcode: 1990MaCom..54..895C, http://www.ams.org/journals/mcom/199054190/S00255718199010105982/S00255718199010105982.pdf.
 ↑ Cikánek, P. (1994), "A Special Extension of Wieferich's Criterion", Mathematics of Computation 62 (206): 923–930, doi:10.2307/2153550, Bibcode: 1994MaCom..62..923C, http://www.ams.org/journals/mcom/199462206/S00255718199412162579/S00255718199412162579.pdf.
 ↑ ^{31.0} ^{31.1} Dilcher, K.; Skula, L. (1995), "A new criterion for the first case of Fermat's last theorem", Mathematics of Computation 64 (209): 363–392, doi:10.1090/s00255718199512489696, Bibcode: 1995MaCom..64..363D, http://www.ams.org/journals/mcom/199564209/S00255718199512489696/S00255718199512489696.pdf
 ↑ Mirimanoff, D. (1910), "Sur le dernier théorème de Fermat" (in fr), Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences 150: 204–206.
 ↑ ^{33.0} ^{33.1} ^{33.2} ^{33.3} Granville, A.; Monagan, M. B. (1988), "The First Case of Fermat's Last Theorem is true for all prime exponents up to 714,591,416,091,389", Transactions of the American Mathematical Society 306 (1): 329–359, doi:10.1090/S00029947198809276945.
 ↑ Suzuki, Jiro (1994), "On the generalized Wieferich criteria", Proceedings of the Japan Academy, Series A 70 (7): 230–234, doi:10.3792/pjaa.70.230, http://projecteuclid.org/DPubS/Repository/1.0/Disseminate?view=body&id=pdf_1&handle=euclid.pja/1195510946
 ↑ Charles, D. X.. "On Wieferich primes". http://pages.cs.wisc.edu/~cdx/Criterion.pdf.
 ↑ Silverman, J. H. (1988), "Wieferich's criterion and the abcconjecture", Journal of Number Theory 30 (2): 226–237, doi:10.1016/0022314X(88)900194
 ↑ ^{37.0} ^{37.1} DeKoninck, J.M.; Doyon, N. (2007), "On the set of Wieferich primes and of its complement", Annales Univ. Sci. Budapest., Sect. Comp. 27: 3–13, http://ac.inf.elte.hu/Vol_027_2007/003.pdf
 ↑ Broughan, K. (2006), "Relaxations of the ABC Conjecture using integer k'th roots", New Zealand J. Math. 35 (2): 121–136, http://www.math.waikato.ac.nz/~kab/papers/abc01.pdf
 ↑ Ribenboim, P. (1979). 13 Lectures on Fermat's Last Theorem. New York: Springer. p. 154. ISBN 9780387904320. https://books.google.com/books?id=w2o67lBGhIC&q=%22Let+me+add+that+Schinzel+has+conjectured%22&pg=PA154.
 ↑ Mersenne Primes: Conjectures and Unsolved Problems, http://primes.utm.edu/mersenne/index.html#unknown
 ↑ Rotkiewicz, A. (1965). "Sur les nombres de Mersenne dépourvus de diviseurs carrés et sur les nombres naturels n, tels que n^{2}2^{n} − 2" (in French). Mat. Vesnik 2 (17): 78–80. http://resolver.sub.unigoettingen.de/purl?PPN311571026_0017.
 ↑ Ribenboim, Paulo (1991), The little book of big primes, New York: Springer, p. 64, ISBN 9780387975085, https://books.google.com/books?id=zUCK7FT4xgAC&pg=PA64
 ↑ Bray, H. G.; Warren, L. J. (1967), "On the squarefreeness of Fermat and Mersenne numbers", Pacific J. Math. 22 (3): 563–564, doi:10.2140/pjm.1967.22.563, http://projecteuclid.org/euclid.pjm/1102992105
 ↑ Scott, R.; Styer, R. (April 2004). "On p^{x} − q^{y} = c and related three term exponential Diophantine equations with prime bases". Journal of Number Theory 105 (2): 212–234. doi:10.1016/j.jnt.2003.11.008.
 ↑ Scott, R.; Styer, R. (2006). "On the generalized Pillai equation ±a^{x}±b^{y} = c". Journal of Number Theory 118 (2): 236–265. doi:10.1016/j.jnt.2005.09.001.
 ↑ Wells Johnson (1977), "On the nonvanishing of Fermat quotients (mod p)", J. Reine Angew. Math. 292: 196–200, http://www.digizeitschriften.de/index.php?id=resolveppn&PPN=GDZPPN002193698
 ↑ Dobeš, Jan; Kureš, Miroslav (2010). "Search for Wieferich primes through the use of periodic binary strings". Serdica Journal of Computing 4: 293–300. https://www.researchgate.net/publication/267166566.
 ↑ Ribenboim, P. (2004). "Chapter 2. How to Recognize Whether a Natural Number is a Prime". The Little Book of Bigger Primes. New York: SpringerVerlag. p. 99. ISBN 9780387201696. http://trex58.files.wordpress.com/2010/01/ribenboimbook1.pdf.
 ↑ Pinch, R. G. E. (2000). The Pseudoprimes up to 10^{13}. Lecture Notes in Computer Science. 1838. pp. 459–473. doi:10.1007/10722028_30. ISBN 9783540676959. http://130.203.133.150/viewdoc/download?doi=10.1.1.32.3849&rep=rep1&type=pdf.^{[yespermanent dead linkdead link}}]}
 ↑ ^{50.0} ^{50.1} Ehrlich, A. (1994), "Cycles in Doubling Diagrams mod m", The Fibonacci Quarterly 32 (1): 74–78, http://www.fq.math.ca/Scanned/321/ehrlich.pdf.
 ↑ Byeon, D. (2006), "Class numbers, Iwasawa invariants and modular forms", Trends in Mathematics 9 (1): 25–29, http://basilo.kaist.ac.kr/mathnet/kms_tex/985999.pdf, retrieved 20120905
 ↑ Jakubec, S. (1995), "Connection between the Wieferich congruence and divisibility of h^{+}", Acta Arithmetica 71 (1): 55–64, doi:10.4064/aa7115564, http://matwbn.icm.edu.pl/ksiazki/aa/aa71/aa7114.pdf
 ↑ Jakubec, S. (1998), "On divisibility of the class number h^{+} of the real cyclotomic fields of prime degree l", Mathematics of Computation 67 (221): 369–398, doi:10.1090/s0025571898009168, http://www.ams.org/journals/mcom/199867221/S0025571898009168/S0025571898009168.pdf
 ↑ Joshua Knauer; Jörg Richstein (2005), "The continuing search for Wieferich primes", Mathematics of Computation 74 (251): 1559–1563, doi:10.1090/S0025571805017230, Bibcode: 2005MaCom..74.1559K, http://www.ams.org/journals/mcom/200574251/S0025571805017230/S0025571805017230.pdf.
 ↑ About project Wieferich@Home
 ↑ PrimeGrid, Wieferich & near Wieferich primes p < 11e15
 ↑ Ribenboim, Paulo (2000), My numbers, my friends: popular lectures on number theory, New York: Springer, pp. 213–229, ISBN 9780387989112
 ↑ ^{58.0} ^{58.1} Kiss, E.; Sándor, J. (2004). "On a congruence by János Bolyai, connected with pseudoprimes". Mathematica Pannonica 15 (2): 283–288. http://ttk.pte.hu/mii/html/pannonica/index_elemei/mp152/mp152283288.pdf.
 ↑ Fermat Quotient at The Prime Glossary
 ↑ "Wieferich primes to base 1052". http://www.fermatquotient.com/FermatQuotienten/FermQ_Sort.
 ↑ "Wieferich primes to base 10125". http://www.fermatquotient.com/FermatQuotienten/FermQ_Sorg.txt.
 ↑ "Fermat quotients q_{p}(a) that are divisible by p". 20140809. http://www1.unihamburg.de/RRZ/W.Keller/FermatQuotient.html.
 ↑ "Wieferich primes with level ≥ 3". http://www.fermatquotient.com/FermatQuotienten/FermatQ3.
 ↑ "Solution of (a + 1)^{p−1} − a^{p−1} ≡ 0 (mod p^{2})". http://www.fermatquotient.com/FermatQuotienten/PQuotient_Sort.txt.
 ↑ Weisstein, Eric W.. "Double Wieferich Prime Pair". http://mathworld.wolfram.com/DoubleWieferichPrimePair.html.
 ↑ Agoh, T.; Dilcher, K.; Skula, L. (1997), "Fermat Quotients for Composite Moduli", Journal of Number Theory 66 (1): 29–50, doi:10.1006/jnth.1997.2162
 ↑ Müller, H. (2009). "Über Periodenlängen und die Vermutungen von Collatz und Crandall" (in de). Mitteilungen der Mathematischen Gesellschaft in Hamburg 28: 121–130. https://books.google.com/books?id=hgYTAQAAMAAJ&q=21%2C+39%2C+55%2C+57%2C+105%2C+111%2C+147%2C+155%2C+165%2C+171%2C+183.
 ↑ Voloch, J. F. (2000), "Elliptic Wieferich Primes", Journal of Number Theory 81 (2): 205–209, doi:10.1006/jnth.1999.2471
Further reading
 Haussner, R. (1926), "Über die Kongruenzen 2^{p−1} − 1 ≡ 0 (mod p^{2}) für die Primzahlen p=1093 und 3511" (in de), Archiv for Mathematik og Naturvidenskab 39 (5): 7, DNB 363953469, http://jfm.sub.unigoettingen.de/cgibin/jfmen/JFM/en/quick.html?first=1&maxdocs=20&type=html&an=JFM%2052.0141.06&format=complete
 Haussner, R. (1927), "Über numerische Lösungen der Kongruenz u^{p−1} − 1 ≡ 0 (mod p^{2})" (in de), Journal für die Reine und Angewandte Mathematik 1927 (156): 223–226, doi:10.1515/crll.1927.156.223, http://resolver.sub.unigoettingen.de/purl?GDZPPN002169924
 Ribenboim, P. (1979), Thirteen lectures on Fermat's Last Theorem, SpringerVerlag, pp. 139, 151, ISBN 9780387904320
 Guy, Richard K. (2004), Unsolved Problems in Number Theory (3rd ed.), Springer Verlag, p. 14, ISBN 9780387208602
 Crandall, R. E.; Pomerance, C. (2005), Prime numbers: a computational perspective, Springer Science+Business Media, pp. 31–32, ISBN 9780387252827, http://thales.doa.fmph.uniba.sk/macaj/skola/teoriapoli/primes.pdf
 Ribenboim, P. (1996), The new book of prime number records, New York: SpringerVerlag, pp. 333–346, ISBN 9780387944579, https://books.google.com/books?id=72eg8bFw40kC&pg=PA333
External links
 Weisstein, Eric W.. "Wieferich prime". http://mathworld.wolfram.com/WieferichPrime.html.
 Fermat/Eulerquotients (a^{p−1} − 1)/p^{k} with arbitrary k
 A note on the two known Wieferich primes
 PrimeGrid's Wieferich Prime Search project page
Original source: https://en.wikipedia.org/wiki/Wieferich prime.
Read more 