Primitive root: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (new entry, just a placeholder, needs more work) |
(No difference)
|
Revision as of 13:10, 2 December 2008
In number theory, a primitive root of a modulus is a number whose powers run through all the residue classes coprime to the modulus. This may be expressed by saying that n has a primitive root if the multiplicative group modulo n is cyclic, and the primitive root is a generator, having an order equal to Euler's totient function φ(n).