- Rational root theorem
In
algebra , the rational root theorem (or 'rational root test' to find the zeros) states a constraint on solutions (or roots) to thepolynomial equation:
with
integer coefficients.Let "a""0" and "a""n" be nonzero.Then each rational solution "x"can be written in the form "x" = "p"/"q" for "p" and "q" satisfying two properties:
* "p" is an integerfactor of theconstant term "a"0, and
* "q" is an integer factor of the leadingcoefficient "a""n".Thus, a list of possible rational roots of the equation can be derived using the formula .
For example, every rational solution of the equation
:must be among the numbers symbolically indicated by
:±
which gives the list of possible answers:
:
These root candidates can be tested, for example using the
Horner scheme . In this particular case there is exactly one rational root.If a root "r""1"is found, the Horner scheme will also yield a polynomial of degree "n" − 1 whose roots, together with "r""1", 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. The
fundamental theorem of algebra states that any polynomial with integer (or real, or even complex)coefficients must have at least one root in the set of complex numbers.Any polynomial of odd degree (degree being "n" in the example above) with real coefficients must have a root in the set of real numbers.If the equation lacks a constant term "a"0, then 0 is one of the rational roots of the equation.
The 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 "a""n"=1.
External links
* [http://www.cut-the-knot.org/Generalization/RationalRootTheorem.shtml Another proof that nth roots of integers are irrational, except for perfect nth powers] by Scott E. Brodie
Wikimedia Foundation. 2010.