Assume that the prime has an odd primitive root . Prove that must have a primitive root.
Follow Math Help Forum on Facebook and Google+
Originally Posted by dori1123 Assume that the prime has an odd primitive root . Prove that must have a primitive root. for any prime, always has a primitive root because if p = 2, then and if p > 2, then [ here is the (multiplicative) group of units modulo ]
View Tag Cloud