Thread: Order of integers and primitive roots

Let a,m be in Z with m>0. If a' is the inverse of a modulo m, prove that the order of a modulo m is equal to the order of a' modulo m. Deduce that if r is a primitive root modulo m, then r' is a primitive root modulo m.

For the first part, note that for all .

Originally Posted by meshel88

Let a,m be in Z with m>0. If a' is the inverse of a modulo m, prove that the order of a modulo m is equal to the order of a' modulo m. Deduce that if r is a primitive root modulo m, then r' is a primitive root modulo m.

The first part as Tinyboss noted follows easily from consider elements of