When.com Web Search

  1. Ads

    related to: table of primitive polynomials practice quiz free worksheets pdf

Search results

  1. Results From The WOW.Com Content Network
  2. Primitive polynomial (field theory) - Wikipedia

    en.wikipedia.org/wiki/Primitive_polynomial...

    Over GF(2), x + 1 is a primitive polynomial and all other primitive polynomials have an odd number of terms, since any polynomial mod 2 with an even number of terms is divisible by x + 1 (it has 1 as a root). An irreducible polynomial F(x) of degree m over GF(p), where p is prime, is a primitive polynomial if the smallest positive integer n ...

  3. Primitive part and content - Wikipedia

    en.wikipedia.org/wiki/Primitive_part_and_content

    A polynomial is primitive if its content equals 1. Thus the primitive part of a polynomial is a primitive polynomial. Gauss's lemma for polynomials states that the product of primitive polynomials (with coefficients in the same unique factorization domain) also is primitive. This implies that the content and the primitive part of the product of ...

  4. List of polynomial topics - Wikipedia

    en.wikipedia.org/wiki/List_of_polynomial_topics

    Coefficient: An expression multiplying one of the monomials of the polynomial. Root (or zero) of a polynomial : Given a polynomial p ( x ), the x values that satisfy p ( x ) = 0 are called roots (or zeroes) of the polynomial p .

  5. Primitive polynomial - Wikipedia

    en.wikipedia.org/wiki/Primitive_polynomial

    In different branches of mathematics, primitive polynomial may refer to: Primitive polynomial (field theory), a minimal polynomial of an extension of finite fields; Primitive polynomial (ring theory), a polynomial with coprime coefficients

  6. Primitive element (finite field) - Wikipedia

    en.wikipedia.org/wiki/Primitive_element_(finite...

    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 .

  7. Conway polynomial (finite fields) - Wikipedia

    en.wikipedia.org/wiki/Conway_polynomial_(finite...

    The Conway polynomial C p,n is defined as the lexicographically minimal monic primitive polynomial of degree n over F p that is compatible with C p,m for all m dividing n.This is an inductive definition on n: the base case is C p,1 (x) = x − α where α is the lexicographically minimal primitive element of F p.