Rational Root Theorem — Mathematics Knowledge System

Overview

The Rational Root Theorem narrows the search for rational roots of a polynomial with integer coefficients down to a short, finite list of candidates, built entirely from the polynomial's constant and leading coefficients. Instead of guessing blindly, you can test only p/q ratios where p divides the constant term and q divides the leading coefficient.

Formal Definition

Definition

For a polynomial with integer coefficients aₙxⁿ+...+a₀ (aₙ≠0, a₀≠0), every rational root p/q (in lowest terms) must satisfy:

p \mid a_0 \quad \text{and} \quad q \mid a_n

p divides the constant term a₀; q divides the leading coefficient aₙ

Rational Root Theorem

Properties

Finite candidate list

\text{Possible rational roots} = \left\{\pm\frac{p}{q} : p \mid a_0,\ q \mid a_n\right\}

Necessary, not sufficient

\text{Every candidate must still be tested (e.g. via synthetic division); not all candidates are actual roots}

Integer root corollary

\text{If } a_n = 1 \text{ (monic), every rational root must be an integer dividing } a_0

Worked Examples

p divides a₀=6: ±1,±2,±3,±6. q divides aₙ=2: ±1,±2.
$\frac{p}{q} \in \{\pm1,\pm2,\pm3,\pm6,\pm\tfrac12,\pm\tfrac32\}$
Test x=3 by substitution.
$f(3) = 2(27)-3(9)-11(3)+6 = 54-27-33+6 = 0$

Answer: Candidates: ±1,±2,±3,±6,±1/2,±3/2; x=3 is an actual root

Practice Problems

Difficulty 4/10

Find all rational roots of f(x) = x³ - 4x² + x + 6.

Common Mistakes

Common Mistake

Assuming every candidate from the Rational Root Theorem is guaranteed to be an actual root.

The theorem only narrows the search — it lists NECESSARY candidates. Each one must still be verified, typically by substitution or synthetic division; many candidates will not actually be roots.

Common Mistake

Forgetting that the theorem only finds RATIONAL roots, and concluding a polynomial has no roots if none of the candidates work.

A polynomial can have irrational or complex roots that the Rational Root Theorem cannot detect at all — it only ever lists candidates for rational roots.

Summary

For integer-coefficient polynomials, every rational root p/q (lowest terms) has p dividing the constant term and q dividing the leading coefficient.
This produces a finite, testable list of candidates — not a guarantee that any of them are roots.
For monic polynomials (aₙ=1), every rational root must be an integer factor of the constant term.
Pair with synthetic division to efficiently test each candidate.

References

WebsiteWikipedia — Rational root theorem