Wilson's Theorem

theoremnumber-theory

Formal Statement

For a natural number $n>1$ is prime if and only if

$$(n-1)!\equiv -1\mathrm{mod}n.$$

Note that it is a biconditional, thus goes both ways!

Corollaries