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 ≤ x < p is invertible (has an inverse) modulo p. Which of these numbers are their own inverse?

1 Answer

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 ≤ x < p is invertible (has an inverse) modulo p. W…

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Please log in or register to add a comment.

Related questions

Categories

Other Questions