Wilson's Theorem

Theorem
A (strictly) positive integer $p$ is a prime :
 * $\paren {p - 1}! \equiv -1 \pmod p$

Proof
If $p = 2$ the result is obvious.

Therefore we assume that $p$ is an odd prime.