Proving Euler's Theorem for Prime Divisors of the Form 4q+1

In summary, the book tells the student to prove that 1 and -1 are the only two residues that are their own reciprocals mod P, but they don't know what to do next. The student is trying to list all the quadratic residues mod P, but doesn't understand where to go from there.
  • #1
dancergirlie
200
0

Homework Statement



If the divisor P is a prime of the form 4q+1 then the number -1 or P-1 is certainly a residue.

Homework Equations





The Attempt at a Solution



First the book told me to prove that 1 and -1 are the only two remainders that are their own reciprocals modP.

Next, I'm not really sure what to do though.

I know that there has to be P-1/2 quadratic residues meaning 4q+1-1/2= 2q residues, which is an even number.

I suppose next I would assume that -1 is NOT a quad residue modP so that i could prove by contradiction.

Listing the quad residues modp as x1, x2...xp-1/2

That would mean that the product of -1 and x1... xp-1/2 would yield the quadratic non-residues modP.

However, I really don't know where to go from here, the book says to match the residues with the reciprocals, but I really don't know what to do..

any help would be great!
 
Physics news on Phys.org
  • #2
It may just be because I haven't done any number theory in a while, but I don't understand your question. You are saying that P is a prime of the form [itex] P = 4q + 1 [/itex] for some [itex] q \in \mathbb N [/itex].

You say that you want to show that -1 or P-1 must be a residue. With respect to what modulo? Maybe this is obvious, but I personally don't understand what you're trying to say.

Edit: Do you mean a quadratic residue?
 
  • #3
I am trying to show that -1 or P-1 is a quadratic residue modP

sorry I am using exact language from Euler's work- which is a bit outdated.
 
  • #4
Okay, that makes sense.

Sorry for being ignorant, but what "Euler's Theorem" are you trying to prove (there are just so many!). Is it Euler's criterion that states

[tex] \left( \frac ap \right) \equiv a^{\frac{p-1}2} \mod p [/tex]
where
[tex] \left( \frac ap \right) = \begin{cases} 1 & a \text{ is a quad. residue of } p \\
-1 & a \text{ is a non-quad. residue of } p \\
0 & \text{ if } p\mid a \end{cases} [/tex]
is the Legendre symbol?
 
  • #5
Also, do you mean to ask "show that -1 (equivalently p-1) is a..." or that there are two cases "-1" and "p-1." Because both are congruent mod p, so I assume you mean the first sentence.

I know I'm asking a lot of questions but I'm trying (part-time) to figure out how to help you.
 
  • #6
Yes, I am aware that -1 and P-1 are the same in modP.

Thanks for trying to help, but I figured it out on my own!
 

1. What is Euler's Theorem?

Euler's Theorem, also known as Fermat's Little Theorem, is a mathematical theorem that states that if p is a prime number, then for any integer a, ap is congruent to a modulo p. This can also be written as ap ≡ a (mod p).

2. Who discovered Euler's Theorem?

Euler's Theorem was first discovered by the famous Swiss mathematician Leonhard Euler in the 18th century. However, it was later proven by Pierre de Fermat, a French lawyer and amateur mathematician.

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

Euler's Theorem has many applications in number theory and cryptography. It is also a fundamental result in modular arithmetic and has been used to solve many other mathematical problems.

4. How is Euler's Theorem related to the Euler's totient function?

The Euler's totient function, denoted as φ(n), is closely related to Euler's Theorem. It is defined as the number of positive integers less than or equal to n that are relatively prime to n. Euler's Theorem can be used to prove that for any positive integer n, aφ(n) ≡ 1 (mod n), where a is any integer coprime to n.

5. Can Euler's Theorem be extended to non-prime moduli?

Yes, Euler's Theorem can be extended to non-prime moduli, but it requires the use of the Euler's generalization of Fermat's Little Theorem. This states that for any positive integers a and n that are coprime, aφ(n) ≡ 1 (mod n), where φ(n) is the Euler's totient function.

Similar threads

  • Calculus and Beyond Homework Help
Replies
6
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
574
  • Calculus and Beyond Homework Help
Replies
6
Views
1K
  • Precalculus Mathematics Homework Help
Replies
4
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
18
Views
2K
  • Calculus and Beyond Homework Help
Replies
4
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
511
  • Calculus and Beyond Homework Help
Replies
5
Views
2K
Back
Top