(a) Show that 3 is a primitive root of 17. (b) Using part (a), find ALL primitive roots of 17 in U(17).
Added by Jimmy W.
Close
Step 1
A primitive root modulo n is an integer g such that every number coprime to n is congruent to a power of g modulo n. In other words, g is a generator of the multiplicative group of integers modulo n, denoted by U(n). Show more…
Show all steps
Your feedback will help us improve your experience
Hoan Nguyen and 86 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
(a) Find two primitive roots of 10. (b) Use the information that 3 is a primitive root of 17 to obtain the eight primitive roots of 17.
Adi S.
8. (a) Verify that 2 is a primitive root of 19 but not 17. (b) Show that 15 has no primitive roots (without using the Theorem proved in our notes or in the book).
Sri K.
Find a primitive root mod 17
Aparna S.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD