Number Theory: Let p be an odd number. Recall that a primitive root, mod p, is an...

90.2K

Verified Solution

Question

Advance Math

Number Theory:

Let p be an odd number. Recall that a primitive root, mod p, isan integer g such that gp-1 = 1 mod p, and no smallerpower of g is congruent to 1 mod p. Some results in this chaptercan be proved via the existence of a primitive root(Theorem6.26)

(c) Given a primitive root g, and an integer a such that a isnot congruent to 0 mod p, prove that a is a square modulo p if andonly if a = ge for an even number e. Use this to proveEuler's criterion: a is a square mod p if and only ifa(p-1)/2 = 1 mod p.

Answer & Explanation Solved by verified expert
4.1 Ratings (751 Votes)
    See Answer
Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:
  • Unlimited Question Access with detailed Answers
  • Zin AI - 3 Million Words
  • 10 Dall-E 3 Images
  • 20 Plot Generations
  • Conversation with Dialogue Memory
  • No Ads, Ever!
  • Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!
Become a Member

Other questions asked by students