Ad
related to: primitive root theorem meaning in geometry formula sheet georgia
Search results
Results from the WOW.Com Content Network
In modular arithmetic, a number g is a primitive root modulo n if every number a coprime to n is congruent to a power of g modulo n. That is, g is a primitive root modulo n if for every integer a coprime to n, there is some integer k for which g k ≡ a (mod n). Such a value k is called the index or discrete logarithm of a to the base g modulo n.
The torsion subgroup of Z[ζ n] × is the group of roots of unity in Q(ζ n), which was described in the previous item. Cyclotomic units form an explicit finite-index subgroup of Z[ζ n] ×. The Kronecker–Weber theorem states that every finite abelian extension of Q in C is contained in Q(ζ n) for some n.
It may also be defined as the monic polynomial with integer coefficients that is the minimal polynomial over the field of the rational numbers of any primitive nth-root of unity (/ is an example of such a root). An important relation linking cyclotomic polynomials and primitive roots of unity is
Primitive root modulo n, in number theory; Primitive element (field theory), an element that generates a given field extension; Primitive element (finite field), an element that generates the multiplicative group of a finite field; Primitive element (lattice), an element in a lattice that is not a positive integer multiple of another element in ...
In field theory, a simple extension is a field extension that is generated by the adjunction of a single element, called a primitive element. Simple extensions are well understood and can be completely classified. The primitive element theorem provides a characterization of the finite simple extensions.
In field theory, a primitive element of a finite field GF(q) is a generator of the multiplicative group of the field. In other words, α ∈ GF( q ) is called a primitive element if it is a primitive ( q − 1) th root of unity in GF( q ) ; this means that each non-zero element of GF( q ) can be written as α i for some natural number i .
The Carmichael lambda function of a prime power can be expressed in terms of the Euler totient. Any number that is not 1 or a prime power can be written uniquely as the product of distinct prime powers, in which case λ of the product is the least common multiple of the λ of the prime power factors.
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 ...
Ad
related to: primitive root theorem meaning in geometry formula sheet georgia