Find All Irreducible Polynomials of Degrees 2 and 3 in F₂[x]
At a glance
- 1. Use the right field
Work in F₂, where coefficients are 0 or 1 and arithmetic is modulo 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. Check 0 and 1
For each degree, test the only possible roots in F₂ and keep the polynomials with neither root.
- 4. List the survivors
The checks leave one irreducible quadratic and two irreducible cubics.
The notation means polynomials whose coefficients come from the two-element field . In this field, addition and multiplication are performed modulo 2, so . 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 : 0 and 1. Thus a quadratic or cubic over 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 , where . Checking the four possibilities gives:
| Polynomial | Root or factorization in |
|---|---|
| No root in |
For the last polynomial, the root checks are
It has no root, so it is irreducible. Therefore the only irreducible quadratic is
The irreducible cubics
Write a general monic cubic as
If , then , so the polynomial is divisible by and is reducible. For a possible irreducible cubic, we must have . Now evaluate at 1:
where the arithmetic is in . To avoid a root at 1, we need . There are exactly two choices: and . They give
For each one, substituting 0 gives 1, and substituting 1 also gives 1. Neither has a root in , so both are irreducible.
For comparison, the two remaining cubics with constant term 1 have , hence a root at 1. In fact, and 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: .
- Degree 3: and .
As a quick count check, the standard formula for the number of monic irreducible polynomials of degree over a field with elements gives 1 for and 2 for , matching the direct enumeration.
Common mistakes
- Using ordinary integer arithmetic. In , terms such as cancel because their coefficient is .
- 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 ; 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
- Finite Fields, Rudolf Lidl and Harald Niederreiter
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.