Skip to main content
Mathovia

Algebra / Polynomial Functions

The Rational Root Theorem

There are infinitely many numbers a polynomial could have as a root, and testing them one at a time is hopeless. The rational root theorem cuts that search down to a finite list you can write out in under a minute.

Written by
Zohaib
Founder & Mathematics Content Creator
Published

Mathematics verification: Mathematical formulas, calculations, worked examples and solutions are reviewed for accuracy before publication.

The factor theorem tells you what to do once you have a root, but not where to find one. For a cubic that will not factor by inspection, the honest answer used to be guesswork. The rational root theorem replaces the guessing with a short, complete list: if a rational root exists at all, it is on that list, and if it is not on the list it is not rational.

The Rational Root Theorem — key formula
Key formula

What the Root Theorem Says

Take a polynomial with integer coefficients:

If has a rational root written in lowest terms as , then divides the constant term and divides the leading coefficient .

Two things this does not say, both worth pinning down straight away:

  • It does not promise a rational root exists. produces the candidate list , none of which works — correctly, because its roots are .
  • It says nothing about irrational or complex roots. Those are invisible to this test.

What it does guarantee is completeness in one direction: no rational number outside the list can be a root. That is what makes a finite search valid.

Building the Candidate List

Three steps, and the list is done.

StepWhat you do
1List all integer factors of the constant term , positive and negative — call these
2List all integer factors of the leading coefficient , positive and negative — call these
3Form every quotient , discard duplicates, and you have the complete candidate set
Building the rational root candidate list from factors of the constant over factors of the leading coefficient
Factors of the constant on top, factors of the leading coefficient underneath

When the leading coefficient is 1, the work collapses. Every is , so every candidate is a whole number — the possible rational roots are just the factors of the constant term. This special case is common enough to have its own name, the integer root theorem, and it is why monic polynomials are so much friendlier to factor.

Rational Root Theorem Example: A Monic Cubic

Find all roots of .

Step 1 — the leading coefficient is and the constant is , so the candidates are the factors of :

Step 2 — test the smallest candidate first:

A hit. By the factor theorem, is a factor.

Step 3 — divide it out synthetically with root and coefficients :

Step 4 — the quotient is , which factors by inspection:

Step 5 — assemble the full factorisation:

Roots at , and — all three were on the candidate list, as they had to be.

Rational Root Theorem Example: A Non-Monic Cubic

Find all roots of .

Step 1 — factors of the constant give ; factors of the leading coefficient give .

Step 2 — form every :

Eight candidates. Note the halves — a leading coefficient other than is exactly what puts fractions on the list.

Step 3 — test :

Step 4 — divide out synthetically, root , coefficients :

Step 5 — the quotient is . Factor it:

Step 6 — read off the remaining roots:

The three roots are , and . Every one appears on the eight-candidate list — including the fraction, which a monic-only method would never have found.

Testing Candidates Efficiently

A long candidate list is only a problem if you test it badly.

  • Start small and start positive. Small integers are the most common roots in textbook problems, and they are the fastest to evaluate.
  • Use synthetic division, not substitution. A substitution tells you only whether the candidate is a root. A synthetic division tells you that and hands you the reduced polynomial for free when it succeeds.
  • Stop early. Once the quotient reaches degree , abandon the list and use factoring or the quadratic formula — both are faster than continuing to test candidates.
  • Use the signs. If every coefficient is positive, no positive root is possible, because every term of is positive. That halves the list before you start.

Common Mistakes to Avoid

  • Forgetting the negatives. The list is . Writing only positive candidates misses half of them, and negative roots are just as common.
  • Putting the leading coefficient on top. It is factors of the constant over factors of the leading coefficient. Getting it upside down gives a list that usually contains none of the actual roots.
  • Applying it to non-integer coefficients. Clear the fractions first by multiplying through by the common denominator; the roots are unchanged.
  • Concluding “no roots” instead of “no rational roots”. A polynomial that defeats the entire candidate list still has roots — they are simply irrational or complex.
  • Testing candidates after the quotient is quadratic. At that point the quadratic formula finds every remaining root at once, rational or not.

Practice Problems

Work each before opening the answer.

Problem 1. List all possible rational roots of .

Show answer

Step 1 — the leading coefficient is , so and every candidate is an integer.

Step 2 — the constant is , whose factors are .

Answer: — eight candidates

Problem 2. List all possible rational roots of .

Show answer

Step 1 — factors of the constant : .

Step 2 — factors of the leading coefficient : .

Step 3 — form every and drop duplicates:

Answer: eight candidates. (The actual roots are and , both on the list.)

Problem 3. Use the rational roots test to find one root of , then factor completely.

Show answer

Step 1 — candidates are the factors of : .

Step 2 — test :

Step 3 — divide out with root and coefficients :

Step 4 — factor the quotient :

Answer: , with roots

Problem 4. Show that has no rational roots.

Show answer

Step 1 — the candidate list is factors of over factors of :

Step 2 — test all four:

Step 3 — none is zero, and the theorem guarantees no other rational number can be a root.

Answer: no rational roots. The actual roots are , which are irrational — the theorem is silent about them, not wrong.

Problem 5. A cubic has integer coefficients, leading coefficient and constant term . How many candidates does the theorem produce?

Show answer

Step 1 — the factors of are ; the factors of are .

Step 2 — form the distinct positive quotients:

That is nine distinct positive values, with no duplicates among them.

Step 3 — each has a negative partner.

Answer: candidates. A cubic has at most three roots, so at least fifteen of these will fail — which is why testing order matters.

Problem 6. Every coefficient of is positive. What does that tell you before testing anything?

Show answer

Step 1 — substitute any positive number. Every term is a positive coefficient times a positive power, so every term is positive.

Step 2 — a sum of positive numbers is never zero, so no positive value of can be a root.

Answer: all positive candidates can be discarded immediately. Only and need testing — and both turn out to be roots, since .

The candidate list plus the factor theorem is a complete method for any polynomial whose roots happen to be rational. The next lesson puts the pieces together — finding every zero of a polynomial, counting how many there should be, and dealing with the repeated ones that change the shape of the graph without adding new crossings.

Frequently Asked Questions

What does the rational root theorem actually tell you?+

It says that if a polynomial with integer coefficients has a rational root in lowest terms, then must divide the constant term and must divide the leading coefficient. It does not say any of those candidates *is* a root — only that no other rational number can be.

What if none of the candidates works?+

Then the polynomial has no rational roots at all. Its roots are irrational, complex, or both — has roots , and the theorem correctly finds nothing, because neither is rational.

Does the theorem work if the coefficients are fractions?+

Not directly. Multiply the whole equation through by the least common denominator first to clear the fractions, which does not change the roots. becomes , and the theorem applies to that.

Related lessons