Factorials and primality
Trivia
This theorem states that a natural number $p > 1$ is prime if and only if $(p-1)! \equiv -1 \pmod{p}$. What is this theorem called?
AWilson's Theorem
BFermat's Little Theorem
CWolstenholme's Theorem
DClement's Theorem