Difference between revisions of "Rational root theorem"

Revision as of 12:16, 15 July 2021

In algebra, the rational root theorem states that given an integer polynomial $P(x)$ with leading coefficent $a_n$ and constant term $a_0$ , if $P(x)$ has a rational root in lowest terms $r = \frac pq$ , then $p|a_0$ and $q|a_n$ .

This theorem aids significantly at finding the "nice" roots of a given polynomial, since the coefficients entail only a finite amount of rational numbers to check as roots.

Proof

Let $\frac{p}{q}$ be a rational root of $P(x) = a_n x^n + a_{n-1} x^{n-1} + \cdots + a_0$ , where all $a_r$ are integers; we wish to show that $p|a_0$ and $q|a_n$ . Since $\frac{p}{q}$ is a root of $P(x)$ , $0 = 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.$ Multiplying by $q^n$ yields $0 = a_n p^n + a_{n-1} p^{n-1} q + \cdots + a_1 p * q^{n-1} + a_0 q^n.$ Using modular arithmetic modulo $p$ , we have $a_0 q^n \equiv 0\pmod p$ , which implies that $p | a_0 q^n$ . Because we've defined $p$ and $q$ to be relatively prime, $\gcd(q^n, p) = 1$ , which implies $p | a_0$ by Euclid's lemma. Via similar logic in modulo $q$ , $q|a_n$ , as required. $\square$

Problems

Here are some problems that are cracked by the rational root theorem. The answers can be found here.

Problem 1

Factor the polynomial $x^3-5x^2+2x+8$ .

Solution: After testing the divisors of 8, we find that it has roots $-1$ , $2$ , and $4$ . Then because it has leading coefficient $1$ , its factorization is $(x-4)(x-2)(x+1)$ . $\square$

Problem 2

Find all rational roots of the polynomial $x^4-x^3-x^2+x+57$ .

Solution: The polynomial has leading coefficient $1$ and constant term $3 \cdot 19$ , so the rational root theorem guarantees that the only possible rational roots are $-57$ , $-19$ , $-3$ , $-1$ , $1$ , $3$ , $19$ , and $57$ . After testing every number, we find that none of these are roots of the polynomial; thus, the polynomial has no rational roots. $\square$

Problem 3

Using the rational root theorem, prove that $\sqrt{2}$ is irrational.

Solution: The polynomial $x^2 - 2$ has roots $-\sqrt{2}$ and $\sqrt{2}$ . The rational root theorem garuntees that the only possible rational roots are $-2, -1, 1$ , and $2$ . Testing these, we find that none are roots of the polynomial, and so it has no rational roots. Then because $\sqrt{2}$ is a root of the polynomial, it cannot be a rational number. $\square$

@@ Line 9: / Line 9: @@
 Here are some problems that are cracked by the rational root theorem. The answers can be found [[Rational root theorem/problems | here]].
-=== Introductory ===
+=== Problem 1 ===
-* Factor the polynomial <math>x^3-5x^2+2x+8</math>.
+''Factor the polynomial <math>x^3-5x^2+2x+8</math>.''
-=== Intermediate ===
+'''Solution''': After testing the divisors of 8, we find that it has roots <math>-1</math>, <math>2</math>, and <math>4</math>. Then because it has leading coefficient <math>1</math>, its factorization is <math>(x-4)(x-2)(x+1)</math>. <math>\square</math>
-* Find all rational roots of the polynomial <math>x^4-x^3-x^2+x+57</math>.
-* Prove that <math>\sqrt{2}</math> is irrational, using the Rational Root Theorem.
-=== Answers ===
+=== Problem 2 ===
-. <math>(x-4)(x-2)(x+1)</math>
+''Find all rational roots of the polynomial <math>x^4-x^3-x^2+x+57</math>.
-. <math>\text{There are no rational roots for the polynomial.} </math>
-. A polynomial with integer coefficients and has a root as <math>\sqrt{2}</math> must also have <math>-\sqrt{2}</math> as a root. The simplest polynomial is <math>(x+\sqrt{2})(x-\sqrt{2})</math> which is <math>x^2-2=0</math>. We see that the only possible rational roots are <math>\pm 1</math> and <math>\pm 2</math>, and when substituted, none of these roots work.
+'''Solution''': The polynomial has leading coefficient <math>1</math> and constant term <math>3 \cdot 19</math>, so the rational root theorem guarantees that the only possible rational roots are <math>-57</math>, <math>-19</math>, <math>-3</math>, <math>-1</math>, <math>1</math>, <math>3</math>, <math>19</math>, and <math>57</math>. After testing every number, we find that none of these are roots of the polynomial; thus, the polynomial has no rational roots. <math>\square</math>
+=== Problem 3 ===
+''Using the rational root theorem, prove that <math>\sqrt{2}</math> is irrational.''
+'''Solution''': The polynomial <math>x^2 - 2</math> has roots <math>-\sqrt{2}</math> and <math>\sqrt{2}</math>. The rational root theorem garuntees that the only possible rational roots are <math>-2, -1, 1</math>, and <math>2</math>. Testing these, we find that none are roots of the polynomial, and so it has no rational roots. Then because <math>\sqrt{2}</math> is a root of the polynomial, it cannot be a rational number. <math>\square</math>
 == See also ==

Page

Toolbox

Search