Rational root theorem

From Wikipedia, the free encyclopedia

In algebra, the rational root theorem (or rational root test, rational zero theorem, rational zero test or p/q theorem) states a constraint on rational solutions of a polynomial equation

with integer coefficients and . Solutions of the equation are also called roots or zeros of the polynomial on the left side.

The theorem states that each rational solution x = pq, written in lowest terms so that p and q are relatively prime, satisfies:

The rational root theorem is a special case (for a single linear factor) of Gauss's lemma on the factorization of polynomials. The integral root theorem is the special case of the rational root theorem when the leading coefficient is an = 1.


The theorem is used to find all rational roots of a polynomial, if any. It gives a finite number of possible fractions which can be checked to see if they are roots. If a rational root x = r is found, a linear polynomial (xr) can be factored out of the polynomial using polynomial long division, resulting in a polynomial of lower degree whose roots are also roots of the original polynomial.

Cubic equation[edit]

The general cubic equation

with integer coefficients has three solutions in the complex plane. If the rational root test finds no rational solutions, then the only way to express the solutions algebraically uses cube roots. But if the test finds a rational solution r, then factoring out (xr) leaves a quadratic polynomial whose two roots, found with the quadratic formula, are the remaining two roots of the cubic, avoiding cube roots.


Elementary proof[edit]

Let with

Suppose P(p/q) = 0 for some coprime p, q:

To clear denominators, multiply both sides by qn:

Shifting the a0 term to the right side and factoring out p on the left side produces:

Thus, p divides a0qn. But p is coprime to q and therefore to qn, so by Euclid's lemma p must divide the remaining factor a0.

On the other hand, shifting the an term to the right side and factoring out q on the left side produces:

Reasoning as before, it follows that q divides an.[1]

Proof using Gauss's lemma[edit]

Should there be a nontrivial factor dividing all the coefficients of the polynomial, then one can divide by the greatest common divisor of the coefficients so as to obtain a primitive polynomial in the sense of Gauss's lemma; this does not alter the set of rational roots and only strengthens the divisibility conditions. That lemma says that if the polynomial factors in Q[X], then it also factors in Z[X] as a product of primitive polynomials. Now any rational root p/q corresponds to a factor of degree 1 in Q[X] of the polynomial, and its primitive representative is then qxp, assuming that p and q are coprime. But any multiple in Z[X] of qxp has leading term divisible by q and constant term divisible by p, which proves the statement. This argument shows that more generally, any irreducible factor of P can be supposed to have integer coefficients, and leading and constant coefficients dividing the corresponding coefficients of P.

Proof using Vieta's formulas[edit]

Given a polynomial of degree n:

Let ,,, be roots of , where . By Vieta's formulas:

Suppose there exist some coprime such that . Then must be a factor of because is a root of . Which implies and because and are coprime.



In the polynomial

any rational root fully reduced would have to have a numerator that divides evenly into 1 and a denominator that divides evenly into 2. Hence the only possible rational roots are ±1/2 and ±1; since neither of these equates the polynomial to zero, it has no rational roots.


In the polynomial

the only possible rational roots would have a numerator that divides 6 and a denominator that divides 1, limiting the possibilities to ±1, ±2, ±3, and ±6. Of these, 1, 2, and –3 equate the polynomial to zero, and hence are its rational roots (in fact these are its only roots since a cubic polynomial has only three roots).


Every rational root of the polynomial

must be among the numbers
These 8 root candidates x = r can be tested by evaluating P(r), for example using Horner's method. It turns out there is exactly one with P(r) = 0.

This process may be made more efficient: if P(r) ≠ 0, it can be used to shorten the list of remaining candidates.[2] For example, x = 1 does not work, as P(1) = 1. Substituting x = 1 + t yields a polynomial in t with constant term P(1) = 1, while the coefficient of t3 remains the same as the coefficient of x3. Applying the rational root theorem thus yields the possible roots , so that

True roots must occur on both lists, so list of rational root candidates has shrunk to just x = 2 and x = 2/3.

If k ≥ 1 rational roots are found, Horner's method will also yield a polynomial of degree nk whose roots, together with the rational roots, are exactly the roots of the original polynomial. If none of the candidates is a solution, there can be no rational solution.

See also[edit]


  1. ^ Arnold, D.; Arnold, G. (1993). Four unit mathematics. Edward Arnold. pp. 120–121. ISBN 0-340-54335-3.
  2. ^ King, Jeremy D. (November 2006). "Integer roots of polynomials". Mathematical Gazette. 90: 455–456. doi:10.1017/S0025557200180295.


External links[edit]