Search results
Results from the WOW.Com Content Network
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 primitive root modulo 2 p k. [14] Finding primitive roots modulo p is also equivalent to finding the roots of the (p − 1)st cyclotomic polynomial modulo p.
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 .
For n = 1, the cyclotomic polynomial is Φ 1 (x) = x − 1 Therefore, the only primitive first root of unity is 1, which is a non-primitive n th root of unity for every n > 1. As Φ 2 (x) = x + 1, the only primitive second (square) root of unity is −1, which is also a non-primitive n th root of unity for every even n > 2.
Artin's conjecture on primitive roots The (now proved) conjecture that finite fields are quasi-algebraically closed; see Chevalley–Warning theorem The (now disproved) conjecture that any algebraic form over the p-adics of degree d in more than d 2 variables represents zero: that is, that all p -adic fields are C 2 ; see Ax–Kochen theorem or ...
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
In field theory, the primitive element theorem states that every finite separable field extension is simple, i.e. generated by a single element. This theorem implies in particular that all algebraic number fields over the rational numbers, and all extensions in which both fields are finite, are simple.
The polynomial x 2 + 2x + 2, on the other hand, is primitive. Denote one of its roots by α. Then, because the natural numbers less than and relatively prime to 3 2 − 1 = 8 are 1, 3, 5, and 7, the four primitive roots in GF(3 2) are α, α 3 = 2α + 1, α 5 = 2α, and α 7 = α + 2. The primitive roots α and α 3 are algebraically
The rule states that if the nonzero terms of a single-variable polynomial with real coefficients are ordered by descending variable exponent, then the number of positive roots of the polynomial is either equal to the number of sign changes between consecutive (nonzero) coefficients, or is less than it by an even number.