1911 Encyclopædia Britannica/Number/Exponents, Primitive Roots, Indices

From Wikisource
Jump to navigation Jump to search
2900931911 Encyclopædia Britannica, Volume 19 — - Number Exponents, Primitive Roots, Indices

29. Exponents, Primitive Roots, Indices. Let denote an odd prime, and any number prime to p. Among the powers there is certainly one, namely , which ; let be the lowest power of such that . Then is said to be the exponent to which appertains : it is always a factor of and can only be when . The residues for which are said to be primitive roots of . They always exist, their number is , and they can be found by a methodical, though tedious, process of exhaustion. If is any one of them, the complete set may be represented by where , are the numbers less than and prime to it, other than . Every number which is prime to is congruent, , to , where is one of the numbers ); this number is called the index of to the base . Indices are analogous to logarithms: thus

.

Consequently tables of primitive roots and indices for different primes are of great value for arithmetical purposes. Jacobi's Canon Arithmeticus gives a primitive root, and a table of numbers and indices for all primes less than .

For moduli of the forms there is an analogous theory (and also for and ); but for a composite modulus of other forms there are no primitive roots, and the nearest analogy is the representation of prime residues in the form , where are selected prime residues, and are indices of restricted range. For instance, all residues prime to can be exhibited in the form , where ; ; ; the total number of distinct residues being , as it should be.