Is 2 a primitive root mod 29? Prove O disprove Your answer:
Added by Sebastian F.
Close
Step 1
We can do this by calculating 2^(29-1)/2 mod 29 using Euler's criterion: 2^(29-1)/2 ≡ 2^14 ≡ 16 (mod 29) Since 16 is not a quadratic residue mod 29 (we can check this by trying to solve x^2 ≡ 16 (mod 29) and seeing that there are no solutions), we know that 2 is Show more…
Show all steps
Your feedback will help us improve your experience
Eduard Sanchez and 71 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
Show that 2 is a primitive root mod 11, and then, find all primitive roots mod 11.
Shamshad N.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Watch the video solution with this free unlock.
EMAIL
PASSWORD