Wilson's theorem

In mathematics, Wilson's theorem states that p > 1 is a prime number if and only if

Failed to parse (Missing texvc executable; please see math/README to configure.): (p-1)!\ \equiv\ -1\ (\mbox{mod}\ p)

(see factorial and modular arithmetic for the notation).

History

The theorem was first discovered by the Iraqi mathematician Ibn al-Haytham (known as Alhazen in Medieval Europe) circa 1000 AD, but it is named after John Wilson (a student of the English mathematician Edward Waring) who stated it in the 18th century.^[1] Waring announced the theorem in 1770, although neither he nor Wilson could prove it. Lagrange gave the first proof in 1773. There is evidence that Leibniz was also aware of the result a century earlier, but he never published it.

Proofs

First proof

This proof uses the fact that if p is a prime, then the set of numbers G = (Z/pZ)^× = {1, 2, ... p − 1} forms a group under multiplication modulo p. This means that for each element a in G, there is a unique inverse element b in G such that ab ≡ 1 (mod p). If a ≡ b (mod p), then a² ≡ 1 (mod p), which forces a² − 1 = (a + 1)(a − 1) ≡ 0 (mod p), and since p is prime, this forces a ≡ 1 or −1 (mod p), i.e. a = 1 or a = p − 1.

In other words, 1 and p − 1 are each their own inverse, but every other element of G has a distinct inverse, and so if we collect the elements of G pairwise in this fashion and multiply them all together, we get the product −1. For example, if p = 11, we have

Failed to parse (Missing texvc executable; please see math/README to configure.): 10! = 1(10)(2 \cdot 6)(3 \cdot 4)(5 \cdot 9)(7 \cdot 8) \ \equiv\ -1\ (\mbox{mod}\ 11).\,

The commutative and associative properties are used in above procedure. All elements in the above product will be of the form g g ⁻¹ ≡ 1 (mod p) except 1 (p − 1) which is left.

If p = 2, the result is trivial to check.

For a converse (but see below for a more exact converse result), suppose the congruence holds for a composite n, and note that then n has a proper divisor d with 1 < d < n. Clearly, d divides (n − 1)! But by the congruence, d also divides (n − 1)! + 1, so that d divides 1, a contradiction.

Second proof

Here is another proof of the first direction: Suppose p is prime. Consider the polynomial

Failed to parse (Missing texvc executable; please see math/README to configure.): g(x)=(x-1)(x-2) \cdots (x-(p-1)).\,

Recall that if f(x) is a nonzero polynomial of degree d over a field F, then f(x) has at most d roots over F. Now, with g(x) as above, consider the polynomial

Failed to parse (Missing texvc executable; please see math/README to configure.): f(x)=g(x)-(x^{p-1}-1).\,

Since the leading coefficients cancel, we see that f(x) is a polynomial of degree at most p − 2. Reducing mod p, we see that f(x) has at most p − 2 roots mod p. But by Fermat's little theorem, each of the elements 1, 2, ..., p − 1 is a root of f(x). This is impossible, unless f(x) is identically zero mod p, i.e. unless each coefficient of f(x) is divisible by p.

But since p is odd, the constant term of f(x) is just (p − 1)! + 1, and the result follows.

Applications

Wilson's theorem is useless as a primality test, since computing (n − 1)! is difficult for large n.

Using Wilson's Theorem, we have for any prime p:

Failed to parse (Missing texvc executable; please see math/README to configure.): 1\cdot 2\cdots (p-1)\ \equiv\ -1\ (\mbox{mod}\ p)

Failed to parse (Missing texvc executable; please see math/README to configure.): 1\cdot(p-1)\cdot 2\cdot (p-2)\cdots m\cdot (p-m)\ \equiv\ 1\cdot (-1)\cdot 2\cdot (-2)\cdots m\cdot (-m)\ \equiv\ -1\ (\mbox{mod}\ p)

where p = 2m + 1. This becomes

Failed to parse (Missing texvc executable; please see math/README to configure.): \prod_{j=1}^m\ j^2\ \equiv(-1)^{m+1}\ (\mbox{mod}\ p).

And so primality is determined by the quadratic residues of p. We can use this fact to prove part of a famous result: −1 is a square (quadratic residue) mod p if p ≡ 1 (mod 4). For suppose p = 4k + 1 for some integer k. Then we can take m = 2k above, and we conclude that

Failed to parse (Missing texvc executable; please see math/README to configure.): \left( \prod_{j=1}^{2k}\ j \right)^{2} = \prod_{j=1}^{2k}\ j^2\ \equiv (-1)^{2k+1}\ = -1(\mbox{mod}\ p).

Wilson's theorem has been used to construct formulas for primes, but they are too slow to have practical value.

Generalization

There is also a generalization of Wilson's theorem, due to Carl Friedrich Gauss:

Failed to parse (Missing texvc executable; please see math/README to configure.): \prod_{1 \le a < m \atop (a,m)=1} \!\!a \ \equiv \ \left \{ \begin{matrix} -1\ (\mbox{mod }m) & \mbox{if } m=4,\;p^\alpha,\;2p^\alpha \\ \ \ 1\ (\mbox{mod }m) & \mbox{otherwise} \end{matrix} \right.

where p is an odd prime. This further generalizes to the fact that in any finite abelian group, either the product of all elements is the identity, or there is precisely one element a of order 2. In the latter case, the product of all elements equals a.

Converse

The converse to Wilson's theorem states that for a composite number n > 5,

n divides (n − 1)!.

This leaves the case n = 4, for which 3! is congruent to 2 modulo 4.

In fact if q is a prime factor of n, so that n = qa, the numbers

1, 2, ..., n − 1

include a − 1 multiples of q. Therefore the power of q dividing the factorial is at least n/q − 1; and the power dividing n at most

log n/log q.

The required inequality

log n/log q ≤ n/q − 1

does hold in general, except for the case q = 2 and n = 4.

See also

• Primitive root modulo n

Notes

References

• Ore, Oystein (1988). Number Theory and its History. Dover, 259-271. ISBN 0-486-65620-9. 

External links

• Eric W. Weisstein, Wilson's Theorem at MathWorld.bg:Теорема на Уилсън

ca:Teorema de Wilson cs:Wilsonova věta da:Wilsons sætning de:Satz von Wilson es:Teorema de Wilson fr:Théorème de Wilson ko:윌슨의 정리 it:Teorema di Wilson hu:Wilson-tétel nl:Stelling van Wilson ja:ウィルソンの定理 pl:Twierdzenie Wilsona pt:Teorema de Wilson ru:Теорема Вильсона ro:Teorema lui Wilson fi:Wilsonin lause sv:Wilsons sats th:ทฤษฎีบทของวิลสัน vi:Định lý Wilson