Wilson's theorem

Show that an integer $p>1$ is prime if and only if
$$(p-1)!\equiv -1(\mathrm{mod}p).$$

The easy half and the hard half are quite different in flavour. One half is a statement about factors; the other is a statement about inverses.