If x = y(mod z) denotes that when x is divided by z, the remainder is y, then for a prime number, p,

(p - 1)! + 1 = 0 (mod p)