• In finite field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite field GF(pm). This...
    10 KB (1,353 words) - 03:41, 19 July 2025
  • primitive polynomial may refer to: Primitive polynomial (field theory), a minimal polynomial of an extension of finite fields Primitive polynomial (ring...
    274 bytes (64 words) - 12:26, 15 August 2020
  • 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...
    3 KB (262 words) - 18:49, 23 January 2024
  • 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...
    6 KB (924 words) - 09:49, 31 May 2025
  • coefficients. The primitive part of such a polynomial is the quotient of the polynomial by its content. Thus a polynomial is the product of its primitive part and...
    11 KB (1,725 words) - 06:20, 28 June 2025
  • greater than 1 are never primitive. Even parity polynomial marked as primitive in this table represent a primitive polynomial multiplied by ( x + 1 ) {\displaystyle...
    71 KB (5,839 words) - 04:43, 9 July 2025
  • the theory of factorization and greatest common divisors of such polynomials. Gauss's lemma asserts that the product of two primitive polynomials is primitive...
    23 KB (3,962 words) - 16:23, 11 March 2025
  • (X6 + X + 1). In fact, this generator is a primitive element, and this polynomial is the irreducible polynomial that produces the easiest Euclidean division...
    46 KB (7,582 words) - 11:45, 24 July 2025
  • is called a primitive polynomial if all of its roots are primitive elements of GF(qn). In the polynomial representation of the finite field, this implies...
    25 KB (2,865 words) - 02:35, 11 January 2025
  • In mathematics, an all one polynomial (AOP) is a polynomial in which all coefficients are one. Over the finite field of order two, conditions for the...
    4 KB (455 words) - 08:17, 5 April 2025
  • Field theory is the branch of mathematics in which fields are studied. This is a glossary of some terms of the subject. (See field theory (physics) for...
    16 KB (2,063 words) - 21:47, 28 October 2023
  • 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...
    12 KB (1,911 words) - 03:41, 19 July 2025
  • Thumbnail for Galois theory
    theorem, which asserts that a general polynomial of degree at least five cannot be solved by radicals. Galois theory has been used to solve classic problems...
    33 KB (4,221 words) - 15:58, 21 June 2025
  • field theory, a branch of mathematics, the minimal polynomial of an element α of an extension field of a field is, roughly speaking, the polynomial of...
    10 KB (1,451 words) - 07:22, 28 May 2025
  • complex numbers. Field extensions are fundamental in algebraic number theory, and in the study of polynomial roots through Galois theory, and are widely...
    20 KB (3,321 words) - 22:16, 2 June 2025
  • 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...
    31 KB (5,525 words) - 04:30, 1 August 2025
  • up primitive in Wiktionary, the free dictionary. Primitive may refer to: Primitive element (field theory) Primitive element (finite field) Primitive cell...
    4 KB (476 words) - 19:22, 21 February 2025
  • algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the...
    28 KB (4,408 words) - 00:53, 25 July 2025
  • Thumbnail for Field (mathematics)
    derivative of polynomials forms a differential field. These fields are central to differential Galois theory, a variant of Galois theory dealing with linear...
    86 KB (10,330 words) - 20:24, 2 July 2025
  • polynomials over a field the polynomial GCD may be computed, like for the integer GCD, by the Euclidean algorithm using long division. The polynomial...
    52 KB (7,886 words) - 23:12, 24 May 2025
  • Galois group (category Galois theory)
    extensions and their relationship to the polynomials that give rise to them via Galois groups is called Galois theory, so named in honor of Évariste Galois...
    18 KB (3,238 words) - 16:44, 30 July 2025
  • In algebra, a monic polynomial is a non-zero univariate polynomial (that is, a polynomial in a single variable) in which the leading coefficient (the...
    7 KB (1,157 words) - 07:23, 30 July 2025
  • In mathematics, the Conway polynomial Cp,n for the finite field Fpn is a particular irreducible polynomial of degree n over Fp that can be used to define...
    18 KB (1,777 words) - 21:05, 14 April 2025
  • Thumbnail for Modular arithmetic
    exponentiation) p(a) ≡ p(b) (mod m), for any polynomial p(x) with integer coefficients (compatibility with polynomial evaluation) If a ≡ b (mod m), then it is...
    29 KB (3,646 words) - 23:20, 20 July 2025
  • reversing its coefficients, and (being primitive) is therefore irreducible in Z[x]. An important class of polynomials whose irreducibility can be established...
    25 KB (3,592 words) - 08:27, 14 March 2025
  • any intermediate field between L {\displaystyle L} and K {\displaystyle K} , and let g {\displaystyle g} be the minimal polynomial of α {\displaystyle...
    3 KB (375 words) - 06:33, 28 May 2025
  • Thumbnail for Tschirnhaus transformation
    Tschirnhaus transformation (category Polynomials)
    conveniently by means of field theory, as the transformation on minimal polynomials implied by a different choice of primitive element. This is the most...
    7 KB (1,350 words) - 01:06, 25 July 2025
  • Thumbnail for Root of unity
    primitive.) This implies that z, z2, ..., zn−1, zn = z0 = 1 are all of the nth roots of unity, since an nth-degree polynomial equation over a field (in...
    41 KB (5,950 words) - 18:05, 8 July 2025
  • generating set of an ideal in a polynomial ring K [ x 1 , … , x n ] {\displaystyle K[x_{1},\ldots ,x_{n}]} over a field K {\displaystyle K} . A Gröbner...
    63 KB (10,037 words) - 13:25, 4 August 2025
  • solution of the roots of unity polynomial equations Xm − 1 in the ring Z {\displaystyle \mathbb {Z} } n), or simply a primitive element of Z {\displaystyle...
    22 KB (2,508 words) - 13:55, 18 July 2025