Wilson's Theorem: for any prime p, there are (p-1) ≡-1 (mod p);!
If (p-1)! ≡-1 (mod p), p is a prime number it certainly has.
Wilson's Theorem: for any prime p, there are (p-1) ≡-1 (mod p);!
If (p-1)! ≡-1 (mod p), p is a prime number it certainly has.