Register
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?
37.0k views
1 vote
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?

User Amarouni
by
4.7k points

1 Answer

2 votes

Answer:

The answer to this question can be explained below as:

Wilson’s theorem says that a number N is prime if and only if (N − 1)! ≡ −1 (mod N-example-1
User Peter HIRT
by
4.9k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

5.2m questions

6.7m answers

Other Questions

Pizza planet is running a special 3 pizzas for 16.50. What is the unit rate for one pizza
What number is halfway between 0 and 18
If the 9-inch wheel of cheese costs $18.60, what is the cost per square inch? If the cost is less than a dollar, put a zero to the left of the decimal point?
I need to simplify this expression.
Need answer to math problem!!!​
Link Copied!