This rational root theorem calculator lists every possible rational root of a cubic polynomial a₃x³ + a₂x² + a₁x + a₀ — all p/q where p divides the constant term and q divides the leading coefficient, reduced and deduplicated — and then tests each candidate in the polynomial, marking the ones that are actual roots. The theorem doesn’t solve the equation; it shrinks the search from infinitely many fractions to a short, complete list.

p (factors of constant) –
q (factors of leading coeff.) –
All possible rational roots ±p/q –
Actual roots among them –

Any candidate that tests as a root gives a factor (x − root) — divide it out (the Polynomial Division / Synthetic Division route) and the cubic collapses to a quadratic.

The Theorem: A Short List With a Guarantee

The rational root theorem states that for a polynomial with integer coefficients, any rational root — written in lowest terms as p/q — must satisfy: p divides the constant term and q divides the leading coefficient. The proof is a three-line divisibility argument (substitute p/q, clear denominators, and watch p forced to divide a₀ while q is forced to divide a₃), but the consequence is enormous: root-hunting becomes finite. Instead of testing fractions forever, you list the factors of two integers, form the reduced combinations, and test only those — for our default cubic, 12 candidates (±1, ±2, ±3, ±6, ±1/2, ±3/2), three of which are actual roots. Every candidate that succeeds hands you a linear factor; dividing it out drops the degree, and a cubic collapses to a quadratic the formula finishes. This is the standard opening move for solving higher-degree equations exactly, and the standard closing argument for proving roots irrational: if √2 were rational it would have to be on the list for x² − 2 (±1, ±2), and it isn't — a proof of irrationality by checklist.

Two refinements belong in a careful toolkit. Descartes' rule of signs bounds how many positive (and negative) roots to expect, pruning the candidate list before testing. And candidates can repeat-test efficiently via synthetic division, which simultaneously tests and deflates — the site's Synthetic Division Calculator is the natural partner tool once this page names the candidates.

Worked Example (Verified)

  • 2x³ + 3x² − 11x − 6 (defaults): p | 6 → ±1, 2, 3, 6; q | 2 → ±1, 2 → candidates ±1, ±2, ±3, ±6, ±1/2, ±3/2. Testing: f(2) = 16 + 12 − 22 − 6 = 0 ✔, f(−1/2) = −1/4 + 3/4 + 11/2 − 6 = 0 ✔, f(−3) = −54 + 27 + 33 − 6 = 0 ✔ — the cubic factors as (x − 2)(2x + 1)(x + 3), all three roots rational and all present in the list, as the theorem promises.
  • The empty-handed case: x³ − 2 has candidates ±1, ±2; none works (∛2 is irrational) — the theorem correctly reports “no rational roots” rather than failing: a complete list with no hits IS a result.
  • Leading coefficient 1: monic polynomials (q = 1) can only have integer rational roots — the integer root special case behind most textbook cubics.

Rational-Root Discipline

  • Integer coefficients are the theorem's contract: clear fractions/decimals by multiplying through (roots don't change) before listing p and q.
  • Reduce every p/q and dedupe — ±6/2 and ±3 are the same candidate; testing duplicates wastes the effort the theorem saved.
  • If a₀ = 0, don't list: x is a root by inspection — factor x out and restart on the smaller polynomial (the calculator flags this case).
  • A candidate that works can work twice: repeated roots exist, so after dividing one out, retest remaining candidates against the deflated polynomial rather than assuming novelty.
  • “Not on the list” ≠ “no roots”: cubics always have at least one real root; absence from the list certifies irrationality, not absence.

Related Tools

Frequently Asked Questions

What does the rational root theorem say?

For a polynomial with integer coefficients, every rational root in lowest terms p/q satisfies: p is a factor of the constant term and q is a factor of the leading coefficient. It converts root-finding into a finite checklist: form all reduced ±p/q, test each. This calculator generates the list for a cubic, deduplicates it, and tests every candidate in the polynomial for you.

How do you use the theorem to solve a cubic?

List candidates, test them (synthetic division is fastest by hand — testing and dividing in one motion), and each successful candidate contributes a factor (x − root). Divide it out; a cubic becomes a quadratic, finished by factoring or the quadratic formula. Our example: candidates ±1, ±2, ±3, ±6, ±1/2, ±3/2 yield roots 2, −1/2, −3 and the factorization (x − 2)(2x + 1)(x + 3) — the complete solution from one list.

Why must p divide the constant and q the leading coefficient?

Substitute x = p/q into a₃x³ + a₂x² + a₁x + a₀ = 0 and clear denominators: a₃p³ + a₂p²q + a₁pq² + a₀q³ = 0. Every term except a₀q³ contains p, so p | a₀q³ — and since gcd(p, q) = 1, p | a₀. Symmetrically, every term except a₃p³ contains q, so q | a₃p³, hence q | a₃. The conditions are forced by arithmetic itself — which is why the candidate list, though small, is guaranteed complete.

What if no candidate works?

Then the polynomial has no rational roots — full stop. Its real roots (a cubic always has at least one) are irrational, reportable only numerically or in radicals. This is a proof-grade outcome: x³ − 2's empty checklist proves ∛2 irrational. Numerically, switch to graphing/bisection/Newton methods; the theorem's job was to settle the rational question, and an empty list settles it completely.

Does the theorem apply to any degree?

Yes — the p | constant, q | leading-coefficient rule holds for polynomials of every degree with integer coefficients (the proof you read above generalizes term by term). This calculator's widget is set for cubics, the degree where the method does the most coursework heavy lifting; quartics use the identical list with one more deflation round, and quadratics with integer coefficients are its silent daily application (factoring x² + bx + c is the q = 1 case).

What is Descartes' rule of signs?

A companion pruning device: the number of positive real roots equals the number of sign changes in the coefficient sequence, or less by an even number; negative roots follow by evaluating at −x (sign changes in the flipped sequence). For our default cubic (+, +, −, −): one sign change → exactly one positive root (it's 2 ✔). Negative sequence for f(−x): −, +, +, − → two sign changes → 2 or 0 negative roots (actual: 2 ✔). Use it to prioritize which candidates to test first.

Why clear fractions before applying the theorem?

The theorem's divisibility conditions are statements about integers; with fractional coefficients “factors of the constant” is meaningless. Multiplying the whole equation by the common denominator rescales coefficients to integers without moving any root (the equation is = 0), after which p and q exist. Skipping this step and eyeballing “factors” of 0.5 is the commonest way the checklist gets corrupted.

Is this rational root theorem calculator free?

Yes — free, instant, no sign-up. Enter the cubic's integer coefficients for the complete candidate list with every candidate tested and actual roots flagged.