Rational Root Theorem

The theorem narrows an infinite search to a finite candidate list and supports exact polynomial factorization and root finding.

Intuition and core definition

The rational root theorem lists possible rational zeros of an integer-coefficient polynomial. If $p/q$ in lowest terms is a root of $a_nx^n+\cdots+a_0$, then $p$ divides the constant $a_0$ and $q$ divides the leading coefficient $a_n$. The theorem supplies candidates, not guaranteed roots.

Notation, language, and conditions

Candidates are $\pm p/q$, reduced to avoid duplicates. The theorem requires integer coefficients; rational coefficients can first be cleared. A root $r$ corresponds to factor $x-r$, and evaluation or synthetic division determines whether a candidate is genuine.

Why this idea matters

The rational root theorem narrows possible rational zeros to a finite factor list, turning an open-ended search into structured testing.

A dependable method

1. Write the polynomial in standard form with integer coefficients. If the constant term is zero, factor out the greatest available power of $x$ and record zero as a root first.
2. For the remaining polynomial with nonzero constant term, list positive and negative factors $p$ of that constant term.
3. List factors $q$ of the leading coefficient.
4. Form and reduce every distinct $\pm p/q$ candidate.
5. Test strategically by substitution or synthetic division and factor further when a zero remainder occurs.

Worked example

Representations and interpretation

A candidate table crosses constant factors with leading-coefficient factors, then a remainder column records tests. The graph can suggest which candidates are plausible but does not replace exact verification.

Reasoning about variations

A polynomial may have irrational or complex roots not on the list. If no candidate works, the theorem has proved only that there are no rational roots, not that there are no roots.

Common mistakes

How to check your work

• Substitute a claimed root and obtain exactly zero.
• Use the factor theorem: synthetic-division remainder must be zero.
• Multiply final factors to reconstruct the polynomial.

Practice

1. List the possible rational roots of $2x^2-5x+3$.
2. Is $x=1$ a root of $2x^2-5x+3$?
3. If no theorem candidate works, what can be concluded?

Answers and brief solutions

Synthesis and transfer

For a polynomial with integer coefficients, reduce each constant-factor over leading-factor candidate before synthetic substitution; a zero remainder confirms a root, not merely its candidacy.

For $2x^3+x^2-8x-4$, the reduced candidates are $\pm1,\pm2,\pm4,\pm\frac12$. Synthetic substitution at $x=2$ gives zero remainder, so $x-2$ is a factor; candidates that give nonzero remainders are simply rejected. The list is a completeness guarantee for rational roots, not a promise that the polynomial has one. If the constant term is zero, factor out $x$ first and record zero before applying the theorem to the remaining factor. Irrational or complex roots may remain after every rational candidate is exhausted, so subsequent quadratic or numerical methods can still be necessary.

Related topics

• Synthetic Division
• Roots and Zeros
• Factor Theorem

Teaching and accessibility note