Prove that if p is prime, then (p-1)! p-1 (mod p).

Hint: Since p is prime, every positive integer less than p has an inverse modulo p. The property proved above tells us which of those integers has an inverse different from itself. Pair them up.