Let p be an odd prime.
(a) (*) Prove that there is a primitive root
modulo p2 . (Hint: Use that if a, b have orders n, m,
with gcd(n, m) = 1, then ab has order nm.)
(b) Prove that for any n, there is a primitive
root modulo pn.
(c) Explicitly find a primitive root modulo
125.
Please do all parts.
Thank you in advance