List all possible rational roots ±p/q from factors of the constant term (p) and leading coefficient (q) — then test each one to find which candidates are actual zeros of the polynomial.
| Candidate x | Fraction | p(x) value | Result |
|---|
If p(x) = aₙxⁿ + … + a₀ has integer coefficients,
then every rational root = ± (factor of a₀) / (factor of aₙ)
The theorem gives you a finite list of candidates to check. If p(x) has a rational root r = p/q (in lowest terms), then p must divide the constant term a₀ and q must divide the leading coefficient aₙ.
Not every candidate IS a root — they are just the only fractions that could be rational roots. You still need to test each one by evaluating p(candidate) and checking whether the result is 0.
Common ways to test a candidate k: substitute directly, or use synthetic division (remainder = 0 means k is a root).
Once you find a rational root r, you can reduce the problem:
One-on-one Algebra 2 tutoring turns the Rational Root Theorem from a guessing game into a clear, reliable strategy — with synthetic division, factoring, and the full picture of a polynomial's zeros.