Wilson theorem Question Explanation

mathsss2
Messages
38
Reaction score
0
How do I explain this:

Let p be odd prime explain why: 2*4*...*(p-1)\equiv (2-p)(4-p)*...*(p-1-p)\equiv(-1)^{\frac{(p-1)}{2}}*1*3*...*(p-2) mod p.



Relevant equations

Gauss lemma
wilson's theorem [(p-1)!\equiv-1 modp]



The attempt at a solution
pairing? need assistance


Thanks
 
Physics news on Phys.org
Hint: What are 2-(2-p), 4-(4-p), ... (p-1)-(p-1-p)? Are they divisible by p?
 
Thanks, this problem is solved.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top