Rational root theorem
See also: Eisenstein criterion
with integer coefficients.
- p is an integer factor of the constant term a0, and
- q is an integer factor of the leading coefficient an.
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 a special case of the rational root theorem if the leading coefficient an = 1.
Let P(x) = anxn + an−1xn−1 + ... + a1x + a0 for some a0, ..., an ∈ Z, and suppose P(p/q) = 0 for some coprime p, q ∈ Z:
If we shift the constant term to the right hand side, factor out p and multiply both sides by qn, we get
We see that p times the integer quantity in parentheses equals −a0qn, so p divides a0qn. But p is coprime to q and therefore to qn, so by (the generalized form of) Euclid's lemma it must divide the remaining factor a0 of the product.
If we instead shift the leading term to the right hand side and multiply by qn, we get
And for similar reasons, we can conclude that q divides an.
Proof using Gauss's lemma
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 ℚ[X], then it also factors in ℤ[X] as a product of primitive polynomials. Now any rational root p/q corresponds to a factor of degree 1 in ℚ[X] of the polynomial, and its primitive representative is then qx − p, assuming that p and q are coprime. But any multiple in ℤ[X] of qx − p 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.
For example, every rational solution of the equation
must be among the numbers symbolically indicated by
which gives the list of 8 possible answers:
These root candidates can be tested using the Horner's method (for instance). In this particular case there is exactly one rational root. If a root candidate does not satisfy the equation, it can be used to shorten the list of remaining candidates. For example, x = 1 does not satisfy the equation as the left hand side equals 1. This means that substituting x = 1 + t yields a polynomial in t with constant term 1, while the coefficient of t3 remains the same as the coefficient of x3. Applying the rational root theorem thus yields the following possible roots for t:
Root candidates that do not occur on both lists are ruled out. The list of rational root candidates has thus shrunk to just x = 2 and x = 2/3.
If a root r1 is found, Horner's method will also yield a polynomial of degree n − 1 whose roots, together with r1, are exactly the roots of the original polynomial. It may also be the case that none of the candidates is a solution; in this case the equation has no rational solution. If the equation lacks a constant term a0, then 0 is one of the rational roots of the equation.
- D. Arnold, G. Arnold (1993). Four unit mathematics. Edward Arnold. pp. 120–121. ISBN 0-340-54335-3.
- King, Jeremy D. "Integer roots of polynomials", Mathematical Gazette 90, November 2006, 455-456.
- Charles D. Miller, Margaret L. Lial, David I. Schneider: Fundamentals of College Algebra. Scott & Foresman/Little & Brown Higher Education, 3rd edition 1990, ISBN 0-673-38638-4, pp. 216–221
- Phillip S. Jones, Jack D. Bedient: The historical roots of elementary mathematics. Dover Courier Publications 1998, ISBN 0-486-25563-8, pp. 116–117 (online copy, p. 116, at Google Books)
- Ron Larson: Calculus: An Applied Approach. Cengage Learning 2007, ISBN 978-0-618-95825-2, pp. 23–24 (online copy, p. 23, at Google Books)