Let r be a primitive root of the integer n. Prove that rk is a primitive root of n if
Chapter 8, Problem 10(choose chapter or problem)
Let r be a primitive root of the integer n. Prove that rk is a primitive root of n if and onlyif gcd(k, Q>(n)) = 1.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer