Wilson prime

Template:Short description Template:Infobox integer sequence In number theory, a Wilson prime is a prime number $p$ such that $p^2$ divides $(p-1)!+1$, where "$!$" denotes the factorial function; compare this with Wilson's theorem, which states that every prime $p$ divides $(p-1)!+1$. Both are named for 18th-century English mathematician John Wilson; in 1770, Edward Waring credited the theorem to Wilson, although it had been stated centuries earlier by Ibn al-Haytham.

The only known Wilson primes are 5, 13, and 563 Template:OEIS. Costa et al. write that "the case $p=5$ is trivial", and credit the observation that 13 is a Wilson prime to Template:Harvtxt. Early work on these numbers included searches by N. G. W. H. Beeger and Emma Lehmer, but 563 was not discovered until the early 1950s, when computer searches could be applied to the problem. If any others exist, they must be greater than 2 × 10¹³. It has been conjectured that infinitely many Wilson primes exist, and that the number of Wilson primes in an interval $[x,y]$ is about $\log {\log }_{x}y$.

Several computer searches have been done in the hope of finding new Wilson primes. The Ibercivis distributed computing project includes a search for Wilson primes. Another search was coordinated at the Great Internet Mersenne Prime Search forum.

Generalizations

Wilson primes of order Template:Mvar

Wilson's theorem can be expressed in general as $(n-1)!(p-n)!\equiv (-1{)}^{n}modp$ for every integer $n\ge 1$ and prime $p\ge n$. Generalized Wilson primes of order Template:Mvar are the primes Template:Mvar such that $p^2$ divides $(n-1)!(p-n)!-(-1{)}^n$.

It was conjectured that for every natural number Template:Mvar, there are infinitely many Wilson primes of order Template:Mvar.

The smallest generalized Wilson primes of order $n$ are: Template:Bi

Near-Wilson primes

Template:Mvar	Template:Mvar
1282279	+20
1306817	−30
1308491	−55
1433813	−32
1638347	−45
1640147	−88
1647931	+14
1666403	+99
1750901	+34
1851953	−50
2031053	−18
2278343	+21
2313083	+15
2695933	−73
3640753	+69
3677071	−32
3764437	−99
3958621	+75
5062469	+39
5063803	+40
6331519	+91
6706067	+45
7392257	+40
8315831	+3
8871167	−85
9278443	−75
9615329	+27
9756727	+23
10746881	−7
11465149	−62
11512541	−26
11892977	−7
12632117	−27
12893203	−53
14296621	+2
16711069	+95
16738091	+58
17879887	+63
19344553	−93
19365641	+75
20951477	+25
20972977	+58
21561013	−90
23818681	+23
27783521	−51
27812887	+21
29085907	+9
29327513	+13
30959321	+24
33187157	+60
33968041	+12
39198017	−7
45920923	−63
51802061	+4
53188379	−54
56151923	−1
57526411	−66
64197799	+13
72818227	−27
87467099	−2
91926437	−32
92191909	+94
93445061	−30
93559087	−3
94510219	−69
101710369	−70
111310567	+22
117385529	−43
176779259	+56
212911781	−92
216331463	−36
253512533	+25
282361201	+24
327357841	−62
411237857	−84
479163953	−50
757362197	−28
824846833	+60
866006431	−81
1227886151	−51
1527857939	−19
1636804231	+64
1686290297	+18
1767839071	+8
1913042311	−65
1987272877	+5
2100839597	−34
2312420701	−78
2476913683	+94
3542985241	−74
4036677373	−5
4271431471	+83
4296847931	+41
5087988391	+51
5127702389	+50
7973760941	+76
9965682053	−18
10242692519	−97
11355061259	−45
11774118061	−1
12896325149	+86
13286279999	+52
20042556601	+27
21950810731	+93
23607097193	+97
24664241321	+46
28737804211	−58
35525054743	+26
41659815553	+55
42647052491	+10
44034466379	+39
60373446719	−48
64643245189	−21
66966581777	+91
67133912011	+9
80248324571	+46
80908082573	−20
100660783343	+87
112825721339	+70
231939720421	+41
258818504023	+4
260584487287	−52
265784418461	−78
298114694431	+82

A prime $p$ satisfying the congruence $(p-1)!\equiv -1+Bp(\mathrm{mod}{p}^2)$ with small $|B|$ can be called a near-Wilson prime. Near-Wilson primes with $B=0$ are bona fide Wilson primes. The table on the right lists all such primes with $|B|\le 100$ from Template:10^ up to 4Template:E.

Wilson numbers

A Wilson number is a natural number $n$ such that $W(n)\equiv 0(\mathrm{mod}{n}^2)$, where $$W(n)=\pm 1+\prod _{\stackrel{1\le k\le n}{\gcd (k,n)=1}}k,$$and where the $\pm 1$ term is positive if and only if $n$ has a primitive root and negative otherwise. For every natural number $n$, $W(n)$ is divisible by $n$, and the quotients (called generalized Wilson quotients) are listed in Template:Oeis. The Wilson numbers are Template:Bi

If a Wilson number $n$ is prime, then $n$ is a Wilson prime. There are 13 Wilson numbers up to 5Template:E.

See also

• PrimeGrid
• Table of congruences
• Wall–Sun–Sun prime
• Wieferich prime
• Wolstenholme prime

Further reading

• Template:Cite book
• Template:Cite journal

External links

• The Prime Glossary: Wilson prime
• Template:MathWorld
• Status of the search for Wilson primes

Template:Prime number classes