Urgent: Number Theory-Wilson's Theorem

  • Thread starter Thread starter mathsss2
  • Start date Start date
  • Tags Tags
    Theorem Urgent
mathsss2
Messages
38
Reaction score
0
Urgent:

1. let p be prime form 4k+3 and let a be an integer. Prove that a has order p-1 in the group U(\frac{\texbb{Z}}{p\texbb{Z}}) iff -a has order \frac{(p-1)}{2}

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

3. Using number 2 and wilson's thereom [(p-1)!\equiv-1 mod p] prove 1^23^25^2*...*(p-2)^2\equiv(-1)^{(p-1)/2} mod p

Thanks.
 
Last edited:
Physics news on Phys.org
For p=3+4k, then (p-1)/2 is an odd number. Thus 1\equiv (-a)^\frac{p-1}{2} =-a^\frac{p-1}{2}

Consequently the right side would be -1 under the circumstances that both powers of a equalled 1.
 
Last edited:
I got the rest, I still need help in #2.
 
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