Wilsons theorem says that a number N is prime if and only if:

Please use the hints.

Problem 1: Wilson's theorem says that a number N is prime if and only if (N - 1)! = -1 (mod N) (a) If p is prime, then every number 1