AoPSWiki
Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.

Rational Root Theorem

From AoPSWiki

This article is a stub. Help us out by expanding it.


Given a polynomial P(x) = a_n x^n + a_{n - 1}x^{n - 1} + \ldots + a_1 x + a_0 with integral coefficients, a_n \neq 0. The Rational Root Theorem states that if P(x) has a rational root r = \pm\frac pq with p, q relatively prime positive integers, p is a divisor of a_0 and q is a divisor of a_n.

As a consequence, every rational root of a monic polynomial with integral coefficients must be integral.

This gives us a relatively quick process to find all "nice" roots of a given polynomial, since given the coefficients we have only a finite number of rational numbers to check.

Proof

Given \frac{p}{q} is a rational root of a polynomial f(x)=a_nx^n+x_{n-1}x^{n-1}+\cdots +a_0, we wish to show that p|a_0 and q|a_n. Since \frac{p}{q} is a root, 0=a_n\left(\frac{p}{q}\right)^n+\cdots +a_0 Multiplying by q^n, we have: 0=a_np^n+a_{n-1}p^{n-1}q+\cdots+a_0q^n Examining this in modulo p, we have a_0q^n\equiv 0\pmod p. As q and p are relatively prime, p|a_0. With the same logic, but with modulo q, we have q|a_n, and we are done.

Problems

Intermediate

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

Prove that \sqrt{2} is irrational, using the Rational Root Theorem.

Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us