Let be an odd prime and a primitive root modulo . Then is a primitive root modulo every prime power if and only if it is a primitive root modulo . In that case
The condition at says with . The odd-prime case of the lifting-the-exponent lemma, obtained here by repeated use of the binomial theorem and then raising to an exponent not divisible by , gives
Here is the prime valuation. To see the induction step, the first term in has prime valuation , while every later term has strictly greater prime valuation when is odd and .
Any return must have , by its order modulo . Writing , the displayed valuation forces , with equality giving a return. This proves the claimed multiplicative order. The reverse implication follows by taking .

Articles by others on the same topic (0)

There are currently no matching articles.