Home / Expert Answers / Prealgebra / 2-let-p-be-a-prime-by-using-wilson-39-s-theorem-show-that-p-2-equiv-1-bmod-p-text-pa168

(Solved): 2. Let \( p \) be a prime. By using Wilson's theorem, show that \[ (p-2) ! \equiv 1(\bmod p) \text ...


2. Let \( p \) be a prime. By using Wilsons theorem, show that \[ (p-2) ! \equiv 1(\bmod p) \text {. } \] [7 marks]

2. Let \( p \) be a prime. By using Wilson's theorem, show that \[ (p-2) ! \equiv 1(\bmod p) \text {. } \] [7 marks]


We have an Answer from Expert

View Expert Answer

Expert Answer

Wilson's theo
We have an Answer from Expert

Buy This Answer $5

Place Order

We Provide Services Across The Globe

Order Now
Go To Answered Questions