
Primitive root question
ok, so I am really confused on this question and have been searching google for an example with no luck. I am hoping someone can help me out here.
This is the problem,
Find by hand all primitive roots mod 197. I cant imagine I have to go through every number n to check if its a primitive root as that would be a lot of numbers.
Thanks


Quote:
Originally Posted by
Plato
Yea, I did read that. did I have to calculate each number individually though or is there a way that I can assume that since that 2 is a primitive root, then 4 is also since its 2^2?
