Number Theory
Advanced

Wilson Theorem

A primality criterion for p.

Formula

(p−1)!≡−1(modp)(p-1)! \equiv -1 \pmod{p}

Variables

pPrime

Example

Holds iff p is prime

Did You Know?

Wilson's theorem gives a perfect but hopelessly slow test for whether a number is prime.

primecongruence