Why use the Rational Root Theorem before factoring a polynomial?

The Rational Root Theorem gives a complete, finite list of possible rational roots before you attempt any factoring technique. Instead of guessing or using expensive numerical methods, you systematically test each ±p/q candidate. Once an actual root r is found, (x − r) is a guaranteed factor, and you can use synthetic division to reduce the polynomial's degree, making the remaining factoring much simpler.

What if the polynomial has no rational roots?

If none of the ±p/q candidates are actual roots, the polynomial has no rational roots. This means every root is either irrational (like √2) or complex (like 2+3i). In that case you need alternative methods: the quadratic formula for degree 2 (gives irrational or complex roots), numerical methods like Newton's method, or computer algebra systems for higher degrees.

What is the difference between possible rational roots and actual rational roots?

Possible rational roots are all candidates ±p/q generated by the theorem — every one of these might be a root, but none is guaranteed. Actual rational roots are the subset of those candidates where the remainder equals zero when the polynomial is evaluated at that value, i.e., f(candidate) = 0. The theorem guarantees no rational root outside the candidate list, but many candidates will not be actual roots.

How does synthetic division test a rational root candidate?

Synthetic division is a shorthand algorithm for dividing a polynomial by (x − c). Write the coefficients in a row, bring down the leading coefficient, multiply by c, add to the next coefficient, and repeat. The final number in the row is the remainder. If the remainder is 0, then c is a root and (x − c) is a factor. The other numbers in the row are the coefficients of the deflated (reduced-degree) quotient polynomial.

Can the Rational Root Theorem find irrational or complex roots?

No. The Rational Root Theorem only identifies rational roots — numbers that can be expressed as a ratio of two integers. Irrational roots such as √5 or (1+√3)/2 and complex roots such as 2+3i cannot be expressed as simple fractions and are therefore completely outside the scope of this theorem. For those roots, use the quadratic formula, Descartes' Rule of Signs, or numerical solvers.

Does a polynomial always have as many roots as its degree?

By the Fundamental Theorem of Algebra, a degree-n polynomial has exactly n roots when counted with multiplicity and when complex roots are included. However, not all of these roots need to be rational or even real. For example, x² + 1 has degree 2 but no real roots at all (its roots are i and −i). A degree-3 polynomial always has at least one real root, but that real root may be irrational.

What does it mean for a root to have multiplicity greater than one?

A root r has multiplicity k if (x − r)^k divides the polynomial but (x − r)^(k+1) does not. For example, in (x − 2)²(x + 1), the root x = 2 has multiplicity 2 and x = −1 has multiplicity 1. Geometrically, a root of even multiplicity causes the graph to touch but not cross the x-axis, while an odd multiplicity root crosses it. This calculator detects multiplicity during repeated synthetic division.

√

Rational Root Theorem Calculator

p/q Candidates · Synthetic Division · Actual Roots · Factored Form · Batch Mode

Enter a polynomial to list every ±p/q candidate, test each with the remainder theorem, identify actual rational roots, and display the fully factored form with step-by-step synthetic division.

Quick Examples

Input as:

Polynomial Expression

Use ^ for exponents · coefficients must be integers · degrees 2–8 supported

Step 1 — Factors of Constant Term (p) and Leading Coefficient (q)

p — factors of constant term

q — factors of leading coefficient

Step 2 — All ±p/q Candidates with Remainder Test

Candidate	Decimal	f(candidate)	Result

Actual Rational Roots

Completely Factored Form

Step 3 — Synthetic Division for Each Root

What Is the Rational Root Theorem?

The Rational Root Theorem is a fundamental theorem in algebra that provides a complete, finite list of candidates for all rational roots of a polynomial with integer coefficients. Formally, if the polynomial a_nxⁿ + a_n-1x^n-1 + … + a₁x + a₀ has integer coefficients and a rational root expressed in lowest terms as p/q, then p must be a factor (divisor) of the constant term a₀, and q must be a factor of the leading coefficient a_n.

The theorem was known in various forms to mathematicians in the 16th and 17th centuries, though it appears most prominently in the work of René Descartes and later formalized in modern algebra textbooks. It is a direct consequence of Gauss's Lemma, which states that if a polynomial with integer coefficients factors over the rationals, it factors over the integers. This property forces any rational root to satisfy the divisibility conditions on p and q.

The practical power of the theorem is that it transforms an impossible infinite search (any rational number could theoretically be a root) into a finite, systematic checklist. For a degree-n polynomial with constant term a₀ and leading coefficient a_n, the maximum number of candidates is 2 × d(a₀) × d(a_n), where d(k) is the number of positive divisors of k. After generating this list, each candidate is tested by evaluating the polynomial or by synthetic division. Any candidate where the remainder equals zero is a confirmed rational root.

How to Use This Calculator

Enter the polynomial in the expression box using ^ for exponents (e.g., 2x^3 - 3x^2 - 11x + 6), or switch to Coefficients mode and enter each coefficient in the grid.
Click "Find Rational Roots". The calculator extracts the constant term and leading coefficient, finds all their positive factors, and generates the full ±p/q candidate list.
Review the candidate table. Every candidate is shown with its decimal value, the remainder f(candidate), and whether it is a root (remainder = 0) or not.
See actual roots highlighted in green in the chip panel, with the multiplicity noted if a root appears more than once.
Examine synthetic division for each confirmed root, showing the step-by-step row arithmetic and the deflated quotient polynomial.
Read the factored form combining all linear factors with any remaining irreducible factor.
For multiple polynomials, switch to Batch Mode and paste one polynomial per line.

The p/q Formula Explained

Given a polynomial with integer coefficients, every rational root r = p/q (in lowest terms, with q > 0) must satisfy:

p divides a₀ (the constant term)
q divides a_n (the leading coefficient)

For example, for 2x³ − 3x² − 11x + 6: the constant term is 6, with positive factors {1, 2, 3, 6}; the leading coefficient is 2, with positive factors {1, 2}. The candidate list is: ±1/1, ±2/1, ±3/1, ±6/1, ±1/2, ±3/2 — that is, ±{1, 2, 3, 6, 1/2, 3/2}. Testing each reveals the actual roots are x = 3, x = −2, and x = 1/2, giving the factored form 2(x − 3)(x + 2)(x − 1/2) = (x − 3)(x + 2)(2x − 1).

Worked Example: 2x³ − 3x² − 11x + 6

Candidate	f(candidate)	Root?
1	2−3−11+6 = −6	No
−1	−2−3+11+6 = 12	No
2	16−12−22+6 = −12	No
−2	−16−12+22+6 = 0	Yes: x = −2
3	54−27−33+6 = 0	Yes: x = 3
1/2	2(1/8)−3(1/4)−11(1/2)+6 = 0	Yes: x = 1/2

After finding x = −2, synthetic division gives the quotient 2x² − 7x + 3. Dividing that by (x − 3) gives 2x − 1, which has root x = 1/2. Final factored form: (x + 2)(x − 3)(2x − 1).

Limitations of the Rational Root Theorem

The theorem is powerful, but it only addresses rational roots. It cannot find:

Irrational roots such as √5, 1 + √3, or cube roots. For example, x² − 2 has no rational roots (the candidates ±1 and ±2 all fail), yet has irrational roots ±√2.
Complex roots such as 2 + 3i. The polynomial x² + 1 has no real roots at all.
Roots of polynomials with non-integer coefficients. The theorem requires integer (or rational, after clearing denominators) coefficients. If your polynomial has irrational coefficients like √2·x² + 1, first multiply to clear denominators or use numerical methods.

When the theorem yields no rational roots, you should apply the quadratic formula (degree 2), Descartes' Rule of Signs to bound the number of positive/negative roots, or numerical solvers such as Newton's method or bisection for an approximate answer.

Frequently Asked Questions

What is the Rational Root Theorem?

For a polynomial with integer coefficients, any rational root p/q (in lowest terms) must have p dividing the constant term and q dividing the leading coefficient. This gives a finite set of candidates ±p/q to test, transforming an otherwise infinite search into a manageable checklist.

Why use the Rational Root Theorem before factoring?

The theorem provides a systematic starting point. Without it, finding roots of degree 3 and higher polynomials is guesswork. Once a rational root r is confirmed, (x − r) is a factor, and synthetic division reduces the polynomial's degree. You repeat the process until the remaining factor is quadratic or linear — both of which are solvable with standard formulas.

What if no rational roots exist?

If all ±p/q candidates fail (all remainders non-zero), the polynomial has no rational roots. All roots are either irrational or complex. For a degree-2 polynomial, apply the quadratic formula directly. For higher degrees, use Descartes' Rule of Signs to bound the number of real roots, then apply numerical methods (Newton's method, interval bisection) or a computer algebra system to approximate or symbolically compute the irrational roots.

What is the difference between possible and actual rational roots?

Possible rational roots are all ±p/q candidates generated by the theorem — they might be roots. Actual rational roots are the candidates where f(r) = 0. The theorem guarantees no rational root lies outside the candidate list, but many (often most) candidates will not be actual roots. For example, x³ − 6x² + 11x − 6 has 8 candidates (±1, ±2, ±3, ±6) but only 3 actual roots (1, 2, 3).

How does synthetic division test a candidate?

Write the polynomial coefficients in a row. Bring down the leading coefficient. Multiply it by the candidate c and add to the next coefficient. Repeat for every coefficient. The final number is the remainder. By the Remainder Theorem, if the remainder is 0 then c is a root and (x − c) is a factor. The row of accumulated values (excluding the remainder) are the coefficients of the deflated quotient polynomial of degree n − 1.

Can the theorem find irrational or complex roots?

No. The theorem is exclusively about rational roots — numbers expressible as integer/integer. Irrational roots like √5 and complex roots like 2+3i cannot be expressed as p/q fractions and are completely outside the theorem's scope. Use the quadratic formula for degree-2 irreducible factors, Descartes' Rule of Signs to count real roots, or numerical solvers to approximate irrational roots.

What does root multiplicity mean?

A root r has multiplicity k if (x − r)^k divides the polynomial but (x − r)^k+1 does not. For example, (x − 2)²(x + 1) has root x = 2 with multiplicity 2 and x = −1 with multiplicity 1. Graphically, even-multiplicity roots touch but don't cross the x-axis; odd-multiplicity roots cross it. This calculator detects multiplicity by continuing to apply synthetic division with the same root until the remainder is no longer zero.

Does every degree-n polynomial have n rational roots?

No. The Fundamental Theorem of Algebra guarantees exactly n roots counting multiplicity when complex roots are included, but they need not all be rational or even real. A degree-4 polynomial could have 4 rational roots, 2 rational + 2 complex, 2 rational + 2 irrational, or 0 rational roots with all 4 complex. The Rational Root Theorem only captures the rational subset of those roots.