Prime Polynomial — Definition, Formula & Examples

A prime polynomial is a polynomial with integer coefficients that cannot be factored into the product of two or more polynomials of lower degree (also with integer coefficients). It is the polynomial equivalent of a prime number.

A polynomial $p(x)$ of degree $n \geq 1$ with integer coefficients is called prime (or irreducible over the integers) if whenever $p(x) = f(x) \cdot g(x)$ for polynomials $f(x)$ and $g(x)$ with integer coefficients, then either $f(x)$ or $g(x)$ is a constant.

How It Works

To determine whether a polynomial is prime, you attempt to factor it using standard techniques: pulling out a GCF, applying difference of squares, using the AC method for trinomials, or trying grouping. If none of these methods produce a valid factorization, the polynomial is prime. For a quadratic

ax^2 + bx + c

, you can check the discriminant

b^2 - 4ac

: if the discriminant is not a perfect square, the trinomial is prime over the integers.

Worked Example

Problem: Determine whether

x^2 + 5x + 7

is a prime polynomial.

Step 1: Compute the discriminant to check if the quadratic factors over the integers.

b^2 - 4ac = 5^2 - 4(1)(7) = 25 - 28 = -3

Step 2: Since the discriminant is

-3

, which is negative (and therefore not a perfect square), no pair of integers multiplies to

7

and adds to

5

. The polynomial cannot be factored over the integers.

Answer:

x^2 + 5x + 7

is a prime polynomial.

Why It Matters

Recognizing prime polynomials prevents you from wasting time searching for a factorization that does not exist. This skill is essential when simplifying rational expressions in Algebra 2 and when applying partial fraction decomposition in calculus.

Common Mistakes

Mistake: Assuming a sum of squares like

x^2 + 9

can be factored the same way as a difference of squares.

Correction:

x^2 + 9

is prime over the integers. The identity

a^2 - b^2 = (a+b)(a-b)

applies only to differences, not sums.