Primitive Root Modulo n
In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g modulo n. In other words, g is a generator of the multiplicative group of integers modulo n. That is, for every integer a coprime to n, there is an integer k such that gk ≡ a (mod n). Such k is called the index or discrete logarithm of a to the base g modulo n.
Gauss defined primitive roots in Article 57 of the Disquisitiones Arithmeticae (1801), where he credited Euler with coining the term. In Article 56 he stated that Lambert and Euler knew of them, but he was the first to rigorously demonstrate that primitive roots exist. In fact, the Disquisitiones contains two proofs: the one in Article 54 is a nonconstructive existence proof, while the other in Article 55 is constructive.
Read more about Primitive Root Modulo n: Elementary Example, Definition, Examples, Finding Primitive Roots, Order of Magnitude of Primitive Roots, Applications
Famous quotes containing the words primitive and/or root:
“Deep down, the US, with its space, its technological refinement, its bluff good conscience, even in those spaces which it opens up for simulation, is the only remaining primitive society.”
—Jean Baudrillard (b. 1929)
“There is a certain class of unbelievers who sometimes ask me such questions as, if I think that I can live on vegetable food alone; and to strike at the root of the matter at once,—for the root is faith,—I am accustomed to answer such, that I can live on board nails. If they cannot understand that, they cannot understand much that I have to say.”
—Henry David Thoreau (1817–1862)