Mathwords logoMathwords

Irreducible Polynomial — Definition, Formula & Examples

An irreducible polynomial is a polynomial of degree 1 or higher that cannot be factored into the product of two or more polynomials of lower degree (using coefficients from the same number system). It is the polynomial equivalent of a prime number.

A polynomial f(x)f(x) of degree n≥1n \geq 1 over a given coefficient field (such as Q\mathbb{Q}, R\mathbb{R}, or Zp\mathbb{Z}_p) is irreducible if it cannot be expressed as f(x)=g(x)⋅h(x)f(x) = g(x) \cdot h(x) where both g(x)g(x) and h(x)h(x) have degree at least 1. A polynomial that is not irreducible is called reducible.

How It Works

To test whether a polynomial is irreducible, you attempt to factor it. For a quadratic or cubic over the rationals, check whether it has any rational roots using the Rational Root Theorem — if a cubic or quadratic has no rational roots, it is irreducible over Q\mathbb{Q}. Whether a polynomial is irreducible depends on which number system you allow for coefficients. For example, x2+1x^2 + 1 is irreducible over the real numbers because it has no real roots, but over the complex numbers it factors as (x+i)(x−i)(x + i)(x - i). Every linear polynomial (degree 1) is automatically irreducible.

Worked Example

Problem: Determine whether x2+3x+5x^2 + 3x + 5 is irreducible over the rational numbers.
Step 1: Compute the discriminant to check for rational roots.
Δ=b2−4ac=32−4(1)(5)=9−20=−11\Delta = b^2 - 4ac = 3^2 - 4(1)(5) = 9 - 20 = -11
Step 2: Since the discriminant is negative, the polynomial has no real roots (and therefore no rational roots). A quadratic with no rational roots cannot be factored into two linear factors with rational coefficients.
Answer: x2+3x+5x^2 + 3x + 5 is irreducible over the rational numbers.

Why It Matters

Recognizing irreducible polynomials is essential when simplifying rational expressions and solving equations in Algebra 2 — if a polynomial is irreducible, you know it cannot be factored further. In abstract algebra and cryptography, irreducible polynomials over finite fields are used to construct field extensions, much like primes are used to build modular arithmetic systems.

Common Mistakes

Mistake: Concluding a polynomial is irreducible over all number systems because it cannot be factored over the rationals.
Correction: Irreducibility depends on the coefficient field. x2+1x^2 + 1 is irreducible over R\mathbb{R} but reducible over C\mathbb{C}. Always specify which number system you are working in.

Related Terms