The Solution
Calculation: Rational Root Theorem Calculator
Rational Root Theorem Calculator
Enter your polynomial coefficients above and click "Find Rational Root Candidates" to see results.Graph will appear here after you solve.
Cubic Equation Solver
Rational Root Theorem solver
Find real and complex roots, discriminant, and cubic graphs in seconds with our precision solver.
The Equation
Input integer coefficients to generate all possible rational root candidates using the ±p/q theorem.
f(x) = 0 = 0
The Treatise
What isRational Root Theorem Calculator?
- For a school student: The rational root theorem gives you a guest list of every "nice" answer a polynomial equation could possibly have. The actual roots are somewhere on that list, but not every guest shows up, so you still have to check each name. A short, finite list beats infinite guessing.
- For a college student: For P(x) = aₙxⁿ + ... + a₁x + a₀ with integer coefficients, any rational root p/q in lowest terms must satisfy p | a₀ and q | aₙ. The candidate set ±(factors of a₀) / (factors of aₙ) is finite and exhaustive: every rational root is on it.
- For the advanced reader: The theorem is the degree-one shadow of Gauss's lemma: a primitive integer polynomial factors over Q exactly when it factors over Z. The proof clears denominators to get aₙpⁿ + ... + a₀qⁿ = 0, then p | a₀qⁿ forces p | a₀ since gcd(p, q) = 1, and symmetrically for q | aₙ.
- Why it matters in practice: It converts an infinite search into a finite checklist. Generate the candidates here, test each with synthetic division or the remainder theorem, and every hit becomes a factor in the factorization calculator. If the whole list fails, the discriminant tells you what kind of irrational or complex roots to expect instead.
The Formula
Formula / Method
- General form: Candidates = ±(factors of the constant term a₀) / (factors of the leading coefficient aₙ), always reduced to lowest terms with duplicates removed.
- Shortcut: For monic polynomials (aₙ = 1), every rational root is an integer dividing the constant term. Most textbook cubics are monic, so the list is just ±(factors of a₀).
- Reading the result: The list is a shortlist, not a promise. Candidates are suspects; testing decides. Finding all n roots of a degree-n polynomial means you can stop early.
- A common trap: Reduce fractions and drop duplicates: ±2/2 is just ±1, already on the list. An unreduced list wastes tests on repeats.
The Method
How To Use
- Step 1. Enter the integer coefficients of your polynomial in descending order.
- Step 2. Press "List Candidates". The tool builds every ±p/q from the factor pairs.
- Step 3. Test each candidate by substitution or with synthetic division; a zero result is a root.
- Step 4. Feed each confirmed root into the factorization calculator to divide it out and continue.
Key Features
- Builds the complete candidate list with duplicates and unreduced fractions removed.
- Counts the candidates so you know the testing workload up front.
- One-click testing of each candidate by direct evaluation.
- Detects monic polynomials and applies the integer-only shortcut automatically.
- Hands confirmed roots straight to factorization with one click.
The Illustration
Visual Diagram
Example Concept
Solve 2x³ + x² − 7x − 6 = 0. Here a = 2 and d = −6. Factors of 6: 1, 2, 3, 6. Factors of 2: 1, 2.
Candidates: ±1, ±2, ±3, ±6, ±1/2, ±3/2.
Test x = 2: 2(8) + 4 − 14 − 6 = 0, a root. Test x = −1: −2 + 1 + 7 − 6 = 0, a root. Test x = −3/2: 2(−27/8) + 9/4 + 21/2 − 6 = (−27 + 9 + 42 − 24)/4 = 0, a root.
Full factorization: (x − 2)(x + 1)(2x + 3). Note the fractional root −3/2: with a non-monic leading coefficient, the full p/q list is essential.
The Deep Dive
Interactive Deep Dive
The proof is a divisibility argument. Suppose p/q in lowest terms satisfies aₙ(p/q)ⁿ + ... + a₀ = 0. Clearing denominators gives aₙpⁿ + aₙ₋₁pⁿ⁻¹q + ... + a₀qⁿ = 0. Every term except a₀qⁿ contains a factor of p, so p divides a₀qⁿ; since gcd(p, q) = 1, p | a₀. The mirror argument on the other end gives q | aₙ. Two lines of divisibility, and the infinite search collapses to a finite list.
The monic case deserves its spotlight: when the leading coefficient is 1, every denominator q must divide 1, so q = ±1 and all rational roots are integers dividing the constant term. This is why textbook problems feel easy: they are almost always monic. The moment a problem like 6x³ − 5x² − 2x + 1 appears, the fractional candidates return, and the full theorem earns its keep.
Large coefficients can produce daunting lists, sometimes hundreds of candidates. Test smartly: try small integers first, since problems are often constructed with them. Use the bound that all real roots lie within 1 + max|aᵢ/aₙ| to skip absurd values. And remember you may stop the moment you have found as many roots as the degree, each confirmed root deflating the problem via synthetic division. A useful habit is testing ±1 first: they are the cheapest evaluations and surprisingly often hit in constructed problems.
Gauss's lemma says a primitive integer polynomial factors over Q exactly when it factors over Z. The rational root theorem is this lemma in degree one: a linear factor over Q can be cleared to a linear factor over Z, whose root is the p/q the theorem describes. This is why integer-coefficient methods are theoretically complete for rational questions, a fact computer algebra systems rely on constantly.
The theorem is silent about everything it does not cover: irrational roots like ∛2 and complex roots never appear on the candidate list. x³ − 2 = 0 has candidates ±1, ±2, all failures, yet the real root ∛2 ≈ 1.26 exists. When the full list fails, switch tools: the discriminant classifies the root types, Cardano's method gives closed forms, and the roots calculator gives values.
The Applications
Real-World Applications
🔎
First-Line Root Finding
Before reaching for heavy machinery, spend two minutes on the candidate list. A large share of contest, exam, and textbook cubics were constructed with rational roots, and finding one by hand is faster than any formula.
🎓
Exam Preparation
Examiners love monic cubics precisely because the integer-candidate shortcut applies. Knowing the theorem turns "solve the cubic" into a quick divisibility exercise followed by routine testing.
💻
Algorithm Design
Root-finding algorithms in computer algebra open with the rational root test: exact rational roots are cheaper than any numerical iteration, so the candidate list is always exhausted before Newton or bisection begins. One exact root found here is one fewer dimension for the numerical solver.
⚡
CAS Root Isolation
Symbolic systems isolate rational roots first to deflate the polynomial, shrinking the problem before deploying expensive exact solvers like Cardano's method.
🎨
Quick Triage
In engineering, ruling out nice roots in seconds tells you whether to expect a clean closed form or reach for numerical methods immediately, saving the effort of doomed exact attempts.
The Cautions
Common Mistakes to Avoid
MISTAKE Nº 1
Forgetting negative candidates: Every factor p and q comes with a ± sign. The root -3/2 is missed by anyone who only tests positive candidates.
MISTAKE Nº 2
Not reducing fractions: Candidates must be in lowest terms. Testing 2/4 after testing 1/2 doubles the work for zero new information.
MISTAKE Nº 3
Confusing which divides which: Numerators p divide the constant term; denominators q divide the leading coefficient. Swapping them builds a list that the theorem never promised.
MISTAKE Nº 4
Assuming every candidate is a root: The list contains suspects, not convictions. Each candidate must be tested, usually by substitution or synthetic division, before it earns root status.
MISTAKE Nº 5
Ignoring the leading coefficient: When a ≠ 1, fractional candidates like ±3/2 appear. Testing only integers in a non-monic problem can miss every root.
The Reference
Quick Reference Table
Quick Reference TableREF
Rulep divides d, q divides a
Candidate Form±p/q (all combinations)
Testing MethodSubstitute or synthetic division
LimitationOnly finds rational roots, not irrational
After Finding RootUse synthetic division to reduce degree
The Questions
Frequently Asked Questions
Does every polynomial have a rational root? +
No. The cubic x³ - 2 has none at all; its real root ∛2 is irrational. The theorem lists candidates, it does not guarantee winners.
Why do both p and q matter? +
The denominator of a root in lowest terms must divide the leading coefficient, just as the numerator must divide the constant term. Both constraints come from the same proof.
How many candidates can there be? +
At most (divisors of the constant term) × (divisors of the leading coefficient), counting ± once, minus duplicates from unreduced fractions.
Must I test every candidate? +
No. Stop as soon as you have found as many roots as the degree. Each find also deflates the polynomial via synthetic division, shrinking later tests, and the quadratic formula finishes whatever remains.
What if no candidate works? +
The roots are irrational or complex. Use the cubic roots calculator for values and the discriminant for their types. An empty candidate result is itself information: it rules out the easy cases.
Does it work with decimal coefficients? +
Multiply through to clear decimals into integers first, then apply the theorem to the scaled polynomial.
Why do textbooks favor monic cubics? +
Because then every rational root is an integer dividing the constant term, which keeps candidate lists short and hand-testing pleasant.
Is -3/2 really a rational root? +
Yes. Any p/q in lowest terms counts as rational, including negatives and fractions. The theorem was built exactly for cases like this.