Search results
Results from the WOW.Com Content Network
If g is a primitive root modulo p, then g is also a primitive root modulo all powers p k unless g p −1 ≡ 1 (mod p 2); in that case, g + p is. [14] If g is a primitive root modulo p k, then g is also a primitive root modulo all smaller powers of p. If g is a primitive root modulo p k, then either g or g + p k (whichever one is odd) is a ...
Weisstein, Eric W. "Primitive Root". MathWorld. Web-based tool to interactively compute group tables by John Jones; OEIS sequence A033948 (Numbers that have a primitive root (the multiplicative group modulo n is cyclic)) Numbers n such that the multiplicative group modulo n is the direct product of k cyclic groups:
In analytic number theory and related branches of mathematics, a complex-valued arithmetic function: is a Dirichlet character of modulus (where is a positive integer) if for all integers and : [1]
In mathematics, a primitive root may mean: Primitive root modulo n in modular arithmetic; Primitive nth root of unity amongst the solutions of z n = 1 in a field; See ...
In number theory, a kth root of unity modulo n for positive integers k, n ≥ 2, is a root of unity in the ring of integers modulo n; that is, a solution x to the equation (or congruence) ().
In number theory, Artin's conjecture on primitive roots states that a given integer a that is neither a square number nor −1 is a primitive root modulo infinitely many primes p. The conjecture also ascribes an asymptotic density to these primes. This conjectural density equals Artin's constant or a rational multiple thereof.
Such an element is called a primitive λ-root modulo n. The Carmichael function is named after the American mathematician Robert Carmichael who defined it in 1910. [ 1 ] It is also known as Carmichael's λ function , the reduced totient function , and the least universal exponent function .
In this case, a primitive element is also called a primitive root modulo q. For example, 2 is a primitive element of the field GF(3) and GF(5), but not of GF(7) since it generates the cyclic subgroup {2, 4, 1} of order 3; however, 3 is a primitive element of GF(7). The minimal polynomial of a primitive element is a primitive polynomial.