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:
“Through the din and desultoriness of noon, even in the most Oriental city, is seen the fresh and primitive and savage nature, in which Scythians and Ethiopians and Indians dwell. What is echo, what are light and shade, day and night, ocean and stars, earthquake and eclipse, there? The works of man are everywhere swallowed up in the immensity of nature. The AEgean Sea is but Lake Huron still to the Indian.”
—Henry David Thoreau (1817–1862)
“To those who despair of everything reason cannot provide a faith, but only passion, and in this case it must be the same passion that lay at the root of the despair, namely humiliation and hatred.”
—Albert Camus (1913–1960)