Letr be a primitive root of the odd prime p, and letd = gcd(k, p - 1). Prove that the
Chapter 8, Problem 14(choose chapter or problem)
Letr be a primitive root of the odd prime p, and letd = gcd(k, p - 1). Prove that the valuesof a for which the congruence xk = a (mod p) is solvable are rd,r2d, ... , r[(p-l)/dJd.
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