Rational root theorem

Template:Short description In algebra, the rational root theorem (or rational root test, rational zero theorem, rational zero test or Template:Math theorem) states a constraint on rational solutions of a polynomial equation $$a_n{x}^n+a_{n-1}{x}^{n-1}+\cdots +a_0=0$$ with integer coefficients $a_i\in \mathbb{\mathbb{Z}}$ and $a_0,a_n\ne 0$. Solutions of the equation are also called roots or zeros of the polynomial on the left side.

The theorem states that each rational solution Template:Tmath written in lowest terms (that is, Template:Math and Template:Math are relatively prime), satisfies:

• Template:Math is an integer factor of the constant term Template:Math, and
• Template:Math is an integer factor of the leading coefficient Template:Math.

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 Template:Math.

Application

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 Template:Math is found, a linear polynomial Template:Math 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

The general cubic equation $$a{x}^3+b{x}^2+cx+d=0$$ 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 Template:Math, then factoring out Template:Math leaves a quadratic polynomial whose two roots, found with the quadratic formula, are the remaining two roots of the cubic, avoiding cube roots.

Proofs

Elementary proof

Let $P(x)=a_n{x}^n+a_{n-1}{x}^{n-1}+\cdots +a_{1}x+a_0$ with $a_0,\dots ,a_n\in \mathbb{\mathbb{Z}},a_0,a_n\ne 0.$

Suppose Template:Math for some coprime Template:Math: $$P\left(\frac{p}{q}\right)=a_n{\left(\frac{p}{q}\right)}^n+a_{n-1}{\left(\frac{p}{q}\right)}^{n-1}+\cdots +a_1\left(\frac{p}{q}\right)+a_0=0.$$

To clear denominators, multiply both sides by Template:Math: $$a_n{p}^n+a_{n-1}{p}^{n-1}q+\cdots +a_{1}p{q}^{n-1}+a_0{q}^n=0.$$

Shifting the Template:Math term to the right side and factoring out Template:Mvar on the left side produces: $$p(a_n{p}^{n-1}+a_{n-1}q{p}^{n-2}+\cdots +a_1{q}^{n-1})=-a_0{q}^n.$$

Thus, Template:Mvar divides Template:Math. But Template:Mvar is coprime to Template:Mvar and therefore to Template:Math, so by Euclid's lemma Template:Mvar must divide the remaining factor Template:Math.

On the other hand, shifting the Template:Math term to the right side and factoring out Template:Mvar on the left side produces: $$q(a_{n-1}{p}^{n-1}+a_{n-2}q{p}^{n-2}+\cdots +a_0{q}^{n-1})=-a_n{p}^n.$$

Reasoning as before, it follows that Template:Mvar divides Template:Math.

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 Template:Math, then it also factors in Template:Math as a product of primitive polynomials. Now any rational root Template:Math corresponds to a factor of degree 1 in Template:Math of the polynomial, and its primitive representative is then Template:Math, assuming that Template:Math and Template:Math are coprime. But any multiple in Template:Math of Template:Math has leading term divisible by Template:Math and constant term divisible by Template:Math, which proves the statement. This argument shows that more generally, any irreducible factor of Template:Math can be supposed to have integer coefficients, and leading and constant coefficients dividing the corresponding coefficients of Template:Math.

Examples

First

In the polynomial $$2x^3+x-1,$$ any rational root fully reduced should have a numerator that divides 1 and a denominator that divides 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.

Second

In the polynomial $$x^3-7x+6$$ 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).

Third

Every rational root of the polynomial $$P=3x^3-5x^2+5x-2$$ must be one of the 8 numbers $$\pm 1,\pm 2,\pm \frac{1}{3},\pm \frac{2}{3}.$$ These 8 possible values for Template:Mvar can be tested by evaluating the polynomial. It turns out there is exactly one rational root, which is $x=2/3.$

However, these eight computations may be rather tedious, and some tricks allow to avoid some of them.

Firstly, if $x<0,$ all terms of Template:Mvar become negative, and their sum cannot be 0; so, every root is positive, and a rational root must be one of the four values $1,2,\frac{1}{3},\frac{2}{3}.$

One has $P(1)=3-5+5-2=1.$ So, Template:Math is not a root. Moreover, if one sets Template:Math, one gets without computation that $Q(t)=P(t+1)$ is a polynomial in Template:Mvar with the same first coefficient Template:Math and constant term Template:Math. The rational root theorem implies thus that a rational root of Template:Mvar must belong to $\{\pm 1,\pm \frac{1}{3}\},$ and thus that the rational roots of Template:Mvar satisfy $x=1+t\in \{2,0,\frac{4}{3},\frac{2}{3}\}.$ This shows again that any rational root of Template:Mvar is positive, and the only remaining candidates are Template:Math and Template:Math.

To show that Template:Math is not a root, it suffices to remark that if $x=2,$ then $3x^3$ and $5x-2$ are multiples of Template:Math, while $-5x^2$ is not. So, their sum cannot be zero.

Finally, only $P(2/3)$ needs to be computed to verify that it is a root of the polynomial.

Fourth

If $a,b$ and $\frac{a^2}{b}+\frac{b^2}{a}$ are integers ($a\ne 0,b\ne 0$), then both $\frac{a^2}{b}$ and $\frac{b^2}{a}$ must be integer.

Consider the quadratic equation whose roots are $\frac{a^2}{b}$ and $\frac{b^2}{a}$:

$$(x-\frac{a^2}{b})(x-\frac{b^2}{a})=x^2-(\frac{a^2}{b}+\frac{b^2}{a})x+\frac{a^2}{b}\cdot \frac{b^2}{a}.$$

Simplify the coefficients:

• The coefficient of $x$ is $m=-(\frac{a^2}{b}+\frac{b^2}{a}),$
• The constant term is $n=\frac{a^2}{b}\cdot \frac{b^2}{a}=ab.$

Thus, the equation becomes: $$x^2+mx+n=0,$$where:

• $m=-(\frac{a^2}{b}+\frac{b^2}{a})$, obviously integer, as negation of an integer,
• $n=ab$, also integer, as the product of two integers.

Apply the rational root theorem:

$a,b$ given to be integers ($a\ne 0,b\ne 0$), i.e. $\frac{a^2}{b}$ and $\frac{b^2}{a}$ are rational. If $\frac{p}{q}$ is a rational root of the equation, then $q$ is an integer factor of the $x^2$ coefficient, i.e. of $1$. Thus, $q=1$. Thus, the rational root is an integer. Thus, $\frac{a^2}{b}$ and $\frac{b^2}{a}$ are integers.

See also

• Fundamental theorem of algebra
• Integrally closed domain
• Descartes' rule of signs
• Gauss–Lucas theorem
• Properties of polynomial roots
• Content (algebra)
• Eisenstein's criterion
• Polynomial root-finding

External links

• Rational root theorem at PlanetMath.
• Another proof that n^th roots of integers are irrational, except for perfect nth powers by Scott E. Brodie
• The Rational Roots Test at purplemath.com