How many primitive roots exist for the moduli 6, 7, 8, 9, and 10?
Added by Tyler B.
Close
Step 1
Step 1: To find the primitive roots for a given modulus, we can use the formula that states that if g is a primitive root modulo n, then g^k is a primitive root modulo n if and only if k and φ(n) are coprime, where φ(n) is Euler's totient function. Show more…
Show all steps
Your feedback will help us improve your experience
Madhur L and 56 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
how many incongruent primitive roots modulo 53 are there
Madhur L.
How many primitive roots does 98 have? Find all of them. (That is, find one primitive root g, and then determine all exponents k such that the least residue of g^k is also a primitive root.)
Sri K.
find all the primitive roots is mod 7
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD