Urgent: Number Theory-Wilson's Theorem

In summary, the conversation discusses the properties of prime numbers and their orders in a group. It also uses Wilson's theorem to prove a statement involving odd primes. The main topics include proving that an integer has a certain order in a group, the properties of odd primes, and using Wilson's theorem to prove a statement involving odd primes.
  • #1
mathsss2
38
0
Urgent:

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

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

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

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

Consequently the right side would be -1 under the circumstances that both powers of a equalled 1.
 
Last edited:
  • #3
I got the rest, I still need help in #2.
 

Related to Urgent: Number Theory-Wilson's Theorem

1. What is Wilson's Theorem?

Wilson's Theorem is a fundamental theorem in number theory that states that a natural number n is a prime number if and only if (n-1)! is congruent to -1 (mod n).

2. Who discovered Wilson's Theorem?

Wilson's Theorem was discovered by the Swiss mathematician John Wilson in 1770.

3. What is the significance of Wilson's Theorem?

Wilson's Theorem is significant because it provides a necessary and sufficient condition for a number to be prime, which can be used to efficiently test for primality.

4. Can Wilson's Theorem be used to find all prime numbers?

No, Wilson's Theorem is not a practical method for finding all prime numbers as it becomes increasingly difficult to compute (n-1)! for larger values of n.

5. Are there any exceptions to Wilson's Theorem?

Yes, there are a few exceptions to Wilson's Theorem, known as Wilson primes, where (n-1)! is congruent to -1 (mod n) but n is not a prime number. The only known Wilson primes are 5, 13, and 563.

Similar threads

  • Calculus and Beyond Homework Help
Replies
6
Views
2K
  • Calculus and Beyond Homework Help
Replies
15
Views
2K
  • Calculus and Beyond Homework Help
Replies
3
Views
759
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
5
Views
1K
  • Calculus and Beyond Homework Help
Replies
6
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
970
  • Calculus and Beyond Homework Help
Replies
4
Views
862
  • Calculus and Beyond Homework Help
Replies
16
Views
1K
  • Calculus and Beyond Homework Help
Replies
13
Views
2K
Back
Top