Let p be an odd prime. (a) (*) Prove that there is a primitive root modulo p2...

50.1K

Verified Solution

Question

Advance Math

Let p be an odd prime.

(a) (*) Prove that there is a primitive rootmodulo p2 . (Hint: Use that if a, b have orders n, m,with gcd(n, m) = 1, then ab has order nm.)

(b) Prove that for any n, there is a primitiveroot modulo pn.

(c) Explicitly find a primitive root modulo125.

Please do all parts.

Thank you in advance

Answer & Explanation Solved by verified expert
3.8 Ratings (402 Votes)
aClaim If g is a primitive root mod p then either g or g pmust be a primitive root mod    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