show that if r is a primitive root modulo the positive integer m then the r^-1 is also a primitive root modulo m, where r^-1 is an inverse of r modulo m
Follow Math Help Forum on Facebook and Google+
. Now use the fact that is a primitive root if and only if where is a positive integer.
A precision (just in case) : stands for the Euler Totient function. It also designs the cardinal of the subgroup containing the invertible elements taken from Z/mZ.
This is why is always .
View Tag Cloud