Ma · Mathematics

Find All Irreducible Polynomials of Degrees 2 and 3 in F₂[x]

Updated 13 October 2026

At a glance

  1. 1. Use the right field

    Work in F₂, where coefficients are 0 or 1 and arithmetic is modulo 2.

  2. 2. Test for roots

    A polynomial of degree 2 or 3 is reducible over a field exactly when it has a root there.

  3. 3. Check 0 and 1

    For each degree, test the only possible roots in F₂ and keep the polynomials with neither root.

  4. 4. List the survivors

    The checks leave one irreducible quadratic and two irreducible cubics.

The notation F2[x]\mathbb{F}_2[x] means polynomials whose coefficients come from the two-element field F2={0,1}\mathbb{F}_2 = \{0,1\}. In this field, addition and multiplication are performed modulo 2, so 1+1=01+1=0. The complete list of irreducibles of the requested degrees is short: there is one of degree 2 and two of degree 3.

Why checking roots is enough

A nonconstant polynomial is irreducible over a field if it cannot be written as a product of two polynomials of smaller positive degree over that field. A reducible quadratic must factor into two linear factors, and a reducible cubic must factor into a linear factor and a quadratic factor. In either case, it has a linear factor, which is equivalent to having a root in the field.

There are only two possible roots to check in F2\mathbb{F}_2: 0 and 1. Thus a quadratic or cubic over F2\mathbb{F}_2 is irreducible exactly when its values at both 0 and 1 are nonzero. The only nonzero value in this field is 1.

Also, every polynomial in this list is monic: its leading coefficient must be the only nonzero field element, 1.

The irreducible quadratic

The general monic quadratic is x2+ax+bx^2+ax+b, where a,b∈{0,1}a,b\in\{0,1\}. Checking the four possibilities gives:

PolynomialRoot or factorization in F2[x]\mathbb{F}_2[x]
x2x^2x⋅xx\cdot x
x2+1x^2+1(x+1)2(x+1)^2
x2+xx^2+xx(x+1)x(x+1)
x2+x+1x^2+x+1No root in F2\mathbb{F}_2

For the last polynomial, the root checks are

f(0)=1,f(1)=1+1+1=1in F2.\begin{aligned} f(0)&=1,\\ f(1)&=1+1+1=1 \quad\text{in }\mathbb{F}_2. \end{aligned}

It has no root, so it is irreducible. Therefore the only irreducible quadratic is

x2+x+1.x^2+x+1.

The irreducible cubics

Write a general monic cubic as

f(x)=x3+ax2+bx+c,a,b,c∈{0,1}.f(x)=x^3+ax^2+bx+c,\qquad a,b,c\in\{0,1\}.

If c=0c=0, then f(0)=0f(0)=0, so the polynomial is divisible by xx and is reducible. For a possible irreducible cubic, we must have c=1c=1. Now evaluate at 1:

f(1)=1+a+b+1=a+b,f(1)=1+a+b+1=a+b,

where the arithmetic is in F2\mathbb{F}_2. To avoid a root at 1, we need a+b=1a+b=1. There are exactly two choices: (a,b)=(0,1)(a,b)=(0,1) and (a,b)=(1,0)(a,b)=(1,0). They give

x3+x+1andx3+x2+1.x^3+x+1 \quad\text{and}\quad x^3+x^2+1.

For each one, substituting 0 gives 1, and substituting 1 also gives 1. Neither has a root in F2\mathbb{F}_2, so both are irreducible.

For comparison, the two remaining cubics with constant term 1 have a=ba=b, hence a root at 1. In fact, x3+1=(x+1)(x2+x+1)x^3+1=(x+1)(x^2+x+1) and x3+x2+x+1=(x+1)3x^3+x^2+x+1=(x+1)^3 in this field. Together with the four cubics having constant term 0, this accounts for all eight monic cubics.

Complete list

The answer is

  • Degree 2: x2+x+1x^2+x+1.
  • Degree 3: x3+x+1x^3+x+1 and x3+x2+1x^3+x^2+1.

As a quick count check, the standard formula for the number of monic irreducible polynomials of degree nn over a field with qq elements gives 1 for q=2,n=2q=2,n=2 and 2 for q=2,n=3q=2,n=3, matching the direct enumeration.

Common mistakes

  • Using ordinary integer arithmetic. In F2\mathbb{F}_2, terms such as x+xx+x cancel because their coefficient is 1+1=01+1=0.
  • Checking only the constant term. A nonzero constant term rules out a root at 0, but you must also test 1.
  • Looking for factors with integer coefficients. Irreducibility here is specifically over F2\mathbb{F}_2; coefficients and factorizations are taken in that field.
  • Assuming “no root” always proves irreducible. It does for degree 2 and 3 because any proper factorization of either degree must include a linear factor. For degree 4 or higher, a polynomial can factor into higher-degree pieces without having a root in the base field.

References

  1. Finite Fields, Rudolf Lidl and Harald Niederreiter

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.