Wilson’s Theorm

Back

If n is a prime number then

(n-1)! ≡-1 (mod p)

Have used this in a Project Euler problem