Wieferich prime

Template:Short description Template:Pp-semi-indef Template:Good article Template:Infobox integer sequence In number theory, a Wieferich prime is a prime number p such that p² divides Template:Math,<ref name="The Prime Glossary">Template:Citation</ref> therefore connecting these primes with Fermat's little theorem, which states that every odd prime p divides Template:Math. 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.<ref name=Kleiner>Template:Citation</ref><ref name=Euler>Template:Citation</ref>

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.

Template:Asof, 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 Template:Math. 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>\tfrac{2^{p-1}-1}{p}</math>. The following are two illustrative examples using the primes 11 and 1093:

For p = 11, we get <math>\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>\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 Template:Math by 2 to get Template:Math. Raising both sides of the congruence to the power p shows that a Wieferich prime also satisfies Template:Math, and hence Template:Math for all Template:Math. The converse is also true: Template:Math for some Template:Math implies that the multiplicative order of 2 modulo p² divides gcdTemplate:Math, φTemplate:Math, that is, Template:Math 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² coincide: Template:Math, (By the way, ord₁₀₉₃2 = 364, and ord₃₅₁₁2 = 1755).

H. S. Vandiver proved that Template:Math if and only if <math>1 + \tfrac{1}{3} + \dots + \tfrac{1}{p-2} \equiv 0 \pmod{p^2}</math>.<ref>Template:Citation</ref>Template:Rp

History and search status

Template:UnsolvedIn 1902, Meyer proved a theorem about solutions of the congruence a^{p − 1} ≡ 1 (mod p^r).<ref name="Solutions">Template:Citation</ref>Template:Rp<ref>Template:Cite journal</ref> 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.<ref name="Wieferich, Arthur">Template:Citation</ref> 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²). In 1913, Bachmann examined the residues of <math>\tfrac{2^{p-1}-1}{p}\,\bmod\,p</math>. He asked the question when this residue vanishes and tried to find expressions for answering this question.<ref>Template:Cite journal</ref>

The prime 1093 was found to be a Wieferich prime by Template:Ill in 1913 and confirmed to be the only such prime below 2000. He calculated the smallest residue of <math>\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.<ref name="Meissner">Template:Citation</ref> Template:Ill later ordered verification of the correctness of Meissner's congruence via only elementary calculations.<ref>Template:Citation</ref>Template:Rp Inspired by an earlier work of Euler, he simplified Meissner's proof by showing that 1093² | (2¹⁸² + 1) and remarked that (2¹⁸² + 1) is a factor of (2³⁶⁴ − 1).<ref>Template:Citation</ref> 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,<ref>Template:Citation</ref> although Meissner himself hinted at that he was aware of a proof without complex values.<ref name="Meissner" />Template:Rp

The prime 3511 was first found to be a Wieferich prime by N. G. W. H. Beeger in 1922<ref>Template:Citation</ref> and another proof of it being a Wieferich prime was published in 1965 by Guy.<ref>Template:Citation</ref> In 1960, Kravitz<ref>Template:Cite journal</ref> doubled a previous record set by Template:Ill<ref>Template:Cite journal</ref> and in 1961 Riesel extended the search to 500000 with the aid of BESK.<ref>Template:Cite journal</ref> Around 1980, Lehmer was able to reach the search limit of 6Template:E.<ref>Template:Cite journal</ref> This limit was extended to over 2.5Template:E in 2006,<ref name="Ribenboim, 2004" /> finally reaching 3Template:E. Eventually, it was shown that if any other Wieferich primes exist, they must be greater than 6.7Template:E.<ref name=Dorais>Template:Cite journal</ref>

In 2007–2016, a search for Wieferich primes was performed by the distributed computing project Wieferich@Home.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> In 2011–2017, another search was performed by the PrimeGrid project, although later the work done in this project was claimed wasted.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> While these projects reached search bounds above 1Template:E, neither of them reported any sustainable results.

In 2020, PrimeGrid started another project that searched for Wieferich and Wall–Sun–Sun primes simultaneously. The new project used checksums to enable independent double-checking of each subinterval, thus minimizing the risk of missing an instance because of faulty hardware.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> The project ended in December 2022, definitely proving that a third Wieferich prime must exceed 2⁶⁴ (about 18Template:E).<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

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 Template:Math degree roots of unity modulo p² are uniformly distributed in the multiplicative group of integers modulo p².<ref name=Crandall />

Properties

Connection with Fermat's Last Theorem

The following theorem connecting Wieferich primes and Fermat's Last Theorem was proven by Wieferich in 1909:<ref name="Wieferich, Arthur" />

Let p be prime, and let x, y, z be integers such that Template:Math. 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)<ref>Template:Citation</ref><ref>Template:Citation</ref> 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.<ref name="Dilcher, Skula">Template:Citation</ref> In 1910, Mirimanoff expanded<ref>Template:Citation</ref> the theorem by showing that, if the preconditions of the theorem hold true for some prime p, then p² must also divide Template:Math. Granville and Monagan further proved that p² must actually divide Template:Math for every prime m ≤ 89.<ref name="Granville, Monagan">Template:Citation</ref> Suzuki extended the proof to all primes m ≤ 113.<ref>Template:Citation</ref>

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²), (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).<ref name="Granville, Monagan" />Template:Rp 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.<ref name="Granville, Monagan" />Template:Rp Granville and Monagan showed that (1, 1) ∈ H_p if and only if p is a Wieferich prime.<ref name="Granville, Monagan" />Template:Rp

Connection with the abc conjecture and non-Wieferich primes

A non-Wieferich prime is a prime p satisfying Template:Math. J. H. Silverman showed in 1988 that if the abc conjecture holds, then there exist infinitely many non-Wieferich primes.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> More precisely he showed that the abc conjecture implies the existence of a constant only depending on α such that the number of non-Wieferich primes to base α with p less than or equal to a variable X is greater than log(X) as X goes to infinity.<ref>Template:Citation</ref>Template:Rp 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 non-Wieferich primes, sometimes denoted by W₂ and W₂^c respectively,<ref name=DeKoninckDoyon>Template:Citation</ref> are complementary sets, so if one of them is shown to be finite, the other one would necessarily have to be infinite. It was later shown that the existence of infinitely many non-Wieferich primes already follows from a weaker version of the abc conjecture, called the ABC-(k, ε) conjecture.<ref>Template:Citation</ref> Additionally, the existence of infinitely many non-Wieferich primes would also follow if there exist infinitely many square-free Mersenne numbers<ref>Template:Cite book</ref> as well as if there exists a real number ξ such that the set {n ∈ N : λ(2ⁿ − 1) < 2 − ξ} is of density one, where the index of composition λ(n) of an integer n is defined as <math>\tfrac{\log n}{\log \gamma (n)}</math> and <math style="vertical-align:-65%;">\gamma (n) = \prod_{p \mid n} p</math>, meaning <math>\gamma (n)</math> gives the product of all prime factors of n.<ref name=DeKoninckDoyon />Template:Rp

Connection with Mersenne and Fermat primes

It is known that the nth Mersenne number Template:Math is prime only if n is prime. Fermat's little theorem implies that if Template:Math is prime, then M_p−1 Template:Math is always divisible by p. Since Mersenne numbers of prime indices M_p and M_q are co-prime,

A prime divisor p of M_q, where q is prime, is a Wieferich prime if and only if p² divides M_q.<ref>Template:Citation</ref>

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 square-free. If q is prime and the Mersenne number M_q is not square-free, that is, there exists a prime p for which p² 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 square-free. Rotkiewicz showed a related result: if there are infinitely many square-free Mersenne numbers, then there are infinitely many non-Wieferich primes.<ref>Template:Cite journal</ref>

Similarly, if p is prime and p² divides some Fermat number F_n Template:Math, then p must be a Wieferich prime.<ref>Template:Citation</ref>

In fact, there exists a natural number n and a prime p that p² divides <math>\Phi_n(2)</math> (where <math>\Phi_n(x)</math> is the n-th cyclotomic polynomial) if and only if p is a Wieferich prime. For example, 1093² divides <math>\Phi_{364}(2)</math>, 3511² divides <math>\Phi_{1755}(2)</math>. Mersenne and Fermat numbers are just special situations of <math>\Phi_n(2)</math>. Thus, if 1093 and 3511 are only two Wieferich primes, then all <math>\Phi_n(2)</math> are square-free except <math>\Phi_{364}(2)</math> and <math>\Phi_{1755}(2)</math> (In fact, when there exists a prime p which p² divides some <math>\Phi_n(2)</math>, then it is a Wieferich prime); and clearly, if <math>\Phi_n(2)</math> is a prime, then it cannot be Wieferich prime. (Any odd prime p divides only one <math>\Phi_n(2)</math> and n divides Template:Math, and if and only if the period length of 1/p in binary is n, then p divides <math>\Phi_n(2)</math>. Besides, if and only if p is a Wieferich prime, then the period length of 1/p and 1/p² 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.<ref>Template:Citation</ref>

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⁴ | 2^{ord_p 2} − 1 if p ≢ 65 (mod 192) or unconditionally when p² | 2^{ord_p 2} − 1, where ord_p 2 denotes the multiplicative order of 2 modulo p.<ref>Template:Cite journal</ref>Template:Rp They also showed that a solution to the equation ±a^x₁ ± 2^y₁ = ±a^x₂ ± 2^y₂ = 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 × 10¹⁵.<ref>Template:Cite journal</ref>Template:Rp

Binary periodicity of p − 1

Johnson observed<ref name=John>Template:Citation</ref> that the two known Wieferich primes are one greater than numbers with periodic binary expansions (1092 = 010001000100₂=444₁₆; 3510 = 110110110110₂=6666₈). 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 pseudo-length" 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.<ref name=DoKu>Template:Cite journal</ref>

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 non-square free base-2 Fermat pseudoprimes up to 25Template:E.<ref>Template:Cite book</ref> Later computations showed that the only repeated factors of the pseudoprimes up to 10¹² are 1093 and 3511.<ref>Template:Cite book</ref> In addition, the following connection exists:

Let n be a base 2 pseudoprime and p be a prime divisor of n. If <math>\tfrac{2^{n-1}-1}{n}\not\equiv 0 \pmod{p}</math>, then also <math>\tfrac{2^{p-1}-1}{p}\not\equiv 0 \pmod{p}</math>.<ref name="Dilcher, Skula" />Template:Rp Furthermore, if p is a Wieferich prime, then p² is a Catalan pseudoprime.

Connection with directed graphs

For all primes Template:Math up to Template:Math, Template:Math only in two cases: Template:Math and Template:Math, where Template:Math is the number of vertices in the cycle of 1 in the doubling diagram modulo Template:Math. Here the doubling diagram represents the directed graph with the non-negative integers less than m as vertices and with directed edges going from each vertex x to vertex 2x reduced modulo m.<ref name="Ehrlich">Template:Citation</ref>Template:Rp It was shown, that for all odd prime numbers either Template:Math or Template:Math.<ref name="Ehrlich" />Template:Rp

Properties related to number fields

It was shown that <math>\chi_{D_{0}} \big(p \big) = 1</math> and <math>\lambda\,\!_p \big( \mathbb{Q} \big(\sqrt{D_{0}} \big) \big) = 1</math> if and only if Template:Math where p is an odd prime and <math>D_{0} < 0</math> is the fundamental discriminant of the imaginary quadratic field <math>\mathbb{Q} \big(\sqrt{1 - p^2} \big)</math>. Furthermore, the following was shown: Let p be a Wieferich prime. If Template:Math, let <math>D_{0} < 0</math> be the fundamental discriminant of the imaginary quadratic field <math>\mathbb{Q} \big(\sqrt{1 - p} \big)</math> and if Template:Math, let <math>D_{0} < 0</math> be the fundamental discriminant of the imaginary quadratic field <math>\mathbb{Q} \big(\sqrt{4 - p} \big)</math>. Then <math>\chi_{D_{0}} \big(p \big) = 1</math> and <math>\lambda\,\!_p \big( \mathbb{Q} \big(\sqrt{D_{0}} \big) \big) = 1</math> (χ and λ in this context denote Iwasawa invariants).<ref>Template:Citation</ref>Template:Rp

Furthermore, the following result was obtained: Let q be an odd prime number, k and p are primes such that Template:Math Template:Math Template:Math Template:Math and the order of q modulo k is <math>\tfrac{k-1}{2}</math>. Assume that q divides h⁺, the class number of the real cyclotomic field <math>\mathbb{Q} \big( \zeta\,\!_p + \zeta\,\!_p^{-1} \big)</math>, the cyclotomic field obtained by adjoining the sum of a p-th root of unity and its reciprocal to the field of rational numbers. Then q is a Wieferich prime.<ref name="Jakubec">Template:Citation</ref>Template:Rp This also holds if the conditions Template:Math and Template:Math are replaced by Template:Math and Template:Math as well as when the condition Template:Math is replaced by Template:Math (in which case q is a Wall–Sun–Sun prime) and the incongruence condition replaced by Template:Math.<ref>Template:Citation</ref>Template:Rp

Generalizations

Near-Wieferich primes

A prime p satisfying the congruence 2^(p−1)/2 Template:Math (mod p²) with small |A| is commonly called a near-Wieferich prime (sequence A195988 in the OEIS).<ref name=Crandall>Template:Citation</ref><ref name=Knauer>Template:Citation</ref> Near-Wieferich primes with A = 0 represent Wieferich primes. Recent searches, in addition to their primary search for Wieferich primes, also tried to find near-Wieferich primes.<ref name=Dorais /><ref name=elmath>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> The following table lists all near-Wieferich primes with |A| ≤ 10 in the interval [1Template:E, 3Template:E].<ref>PrimeGrid, Wieferich & near Wieferich primes p < 11e15 Template:Webarchive</ref> This search bound was reached in 2006 in a search effort by P. Carlisle, R. Crandall and M. Rodenkirch.<ref name="Ribenboim, 2004">Template:Citation</ref><ref>Template:Citation</ref> 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<ref name=Dorais /> used a different definition of a near-Wieferich prime, defining it as a prime p with small value of <math>\left|\tfrac{\omega(p)}{p}\right|</math> where <math>\omega(p)=\tfrac{2^{p-1}-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 ≤ Template:Math with <math>\left|\tfrac{\omega(p)}p\right|\leq 10^{-14}</math>.

p	<math>\omega(p)</math>	\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>2^{(p-1)/2}\equiv \pm 1 + Ap \pmod{p^2}</math>, then by squaring, clearly <math>2^{p-1}\equiv 1 \pm 2Ap \pmod{p^2}</math>. So if Template:Mvar had been chosen with <math>|A|</math> small, then clearly <math>|\!\pm 2A| = 2|A|</math> is also (quite) small, and an even number. However, when <math>\omega(p)</math> is odd above, the related Template:Mvar from before the last squaring was not "small". For example, with <math>p=3167939147662997</math>, we have <math>2^{(p-1)/2}\equiv -1 - 1583969573831490p \pmod{p^2}</math> which reads extremely non-near, but after squaring this is <math>2^{p-1}\equiv 1 - 17p \pmod{p^2}</math> which is a near-Wieferich by the second definition.

Base-a Wieferich primes

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} A Wieferich prime base a is a prime p that satisfies

Template:Math,<ref name="Solutions" /> 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 Template:Math, Template:Math, then Template:Math. Setting p = q leads to Template:Math.<ref name="Kiss">Template:Cite journal</ref>Template:Rp It was shown that Template:Math if and only if Template:Math.<ref name="Kiss" />Template:Rp

Known solutions of Template:Math for small values of a are:<ref>Fermat Quotient at The Prime Glossary</ref> (checked up to 5 × 10¹³)

a	primes p such that ap − 1 = 1 (mod p2)	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<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> and.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> (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 Template:Math 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¹³) (sequence A039951 in the OEIS)

There are no known solutions of Template:Math 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 Template:Math for every natural number a.

The bases b < p² which p is a Wieferich prime are (for b > p², the solutions are just shifted by k·p² for k > 0), and there are Template:Math solutions < p² of p and the set of the solutions congruent to p are {1, 2, 3, ..., Template:Math (sequence A143548 in the OEIS)

p	values of b < p2
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>(a+1)^{p-1}-a^{p-1} \equiv 0 \pmod{p^2}</math>, (because of the generalized Fermat little theorem, <math>(a+1)^{p-1}-a^{p-1} \equiv 0 \pmod{p^2}</math> is true for all prime p and all natural number a such that both a and Template:Math are not divisible by p). It's a conjecture that for every natural number a, there are infinitely many primes such that <math>(a+1)^{p-1}-a^{p-1} \equiv 0 \pmod{p^2}</math>.

Known solutions for small a are: (checked up to 4 × 10¹¹) <ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>

Template:Tmath	primes Template:Tmath such that <math>(a+1)^{p-1}-a^{p-1} \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

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} A Wieferich pair is a pair of primes p and q that satisfy

p^{q − 1} ≡ 1 (mod q²) and q^{p − 1} ≡ 1 (mod p²)

so that a Wieferich prime p ≡ 1 (mod 4) will form such a pair (p, 2): the only known instance in this case is Template:Math. There are only 7 known Wieferich pairs.<ref>{{#invoke:Template wrapper|{{#if:|list|wrap}}|_template=cite web |_exclude=urlname, _debug, id |url = https://mathworld.wolfram.com/{{#if:DoubleWieferichPrimePair%7CDoubleWieferichPrimePair.html}} |title = Double Wieferich Prime Pair |author = Weisstein, Eric W. |website = MathWorld |access-date = |ref = Template:SfnRef }}</ref>

(2, 1093), (3, 1006003), (5, 1645333507), (5, 188748146801), (83, 4871), (911, 318917), and (2903, 18787) (sequence Template:OEIS2C 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²) but p² does not divide a(n − 1) − 1 or a(n − 1) + 1. (If p² 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² = 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^{Template:Φ(n)} ≡ 1 (mod n²), where Template:Φ denotes the Euler's totient function (according to Euler's theorem, 2^{Template:Φ(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.<ref name="Banks, Luca" />

More generally, a natural number n is a Wieferich number to base a, if a^{Template:Φ(n)} ≡ 1 (mod n²).<ref>Template:Citation</ref>Template:Rp

Another definition specifies a Wieferich number as odd natural number n such that n and <math>\tfrac{2^m-1}{n}</math> are not coprime, where m is the multiplicative order of 2 modulo n. The first of these numbers are:<ref>Template:Cite journal</ref>

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²)

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ⁿ)

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>\begin{align}

U_0(P,Q)&=0, \\ U_1(P,Q)&=1, \\ U_n(P,Q)&=P\cdot U_{n-1}(P,Q)-Q\cdot U_{n-2}(P,Q) \end{align} </math> for all <math>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²), where ε equals the Legendre symbol <math>\left(\tfrac{P^2-4Q}p\right)</math>. All Wieferich primes are Lucas–Wieferich primes associated with the pair (3, 2).<ref name="McIntosh, 2007" />Template:Rp

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 non-archimedean place of norm q_v of K and a ∈ K, with v(a) = 0 then Template:Math ≥ 1. v is called a Wieferich place for base a, if Template:Math > 1, an elliptic Wieferich place for base P ∈ E, if N_vP ∈ E₂ and a strong elliptic Wieferich place for base P ∈ E if n_vP ∈ E₂, 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.<ref>Template:Citation</ref>Template:Rp

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

Further reading

• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation
• Template:Citation

External links

• {{#invoke:Template wrapper|{{#if:|list|wrap}}|_template=cite web

|_exclude=urlname, _debug, id |url = https://mathworld.wolfram.com/{{#if:WieferichPrime%7CWieferichPrime.html}} |title = Wieferich prime |author = Weisstein, Eric W. |website = MathWorld |access-date = |ref = Template:SfnRef }}

• Fermat-/Euler-quotients Template:Math with arbitrary k
• A note on the two known Wieferich primes
• PrimeGrid's Wieferich Prime Search project page