##  [Rational Root Theorem](/rational-root-theorem-0) 

 Definition

For a polynomial with integer coefficients a_n x^n + ... + a_0 where a_n and a_0 are nonzero, any rational root expressed in lowest terms p/q (q>0, gcd(p,q)=1) must have p dividing a_0 and q dividing a_n.

 

 

 

 

 

 





## Principle

Principle

Constraints on numerators and denominators reduce the infinite search for rational roots to a finite set determined by divisors of the leading and constant coefficients; it uses integrality and cancellation properties.

 

 

 

 

 





## Demonstration

Demonstration

Example: for 2x^2 + 3x − 5, possible rational roots p/q satisfy p | −5 and q | 2, so candidates are ±1, ±5, ±1/2, ±5/2. Checking p(1) = 0 shows x=1 is indeed a root and thus a factor (x−1).

 

 

 

 

## Misapplication

Misapplication

Applying the theorem to polynomials whose coefficients are not integers, or treating the listed candidates as guaranteed roots rather than necessary candidates; forgetting to reduce p/q to lowest terms invalidates the divisor conditions.

 

 

 

 

 





## Consequence

Consequence

Turns root search into a concrete finite test, often the first step in factoring integer polynomials; narrows possibilities for rational roots and frequently leads to complete factorization when combined with synthetic division.

 

 

 

 

## Reversal

Reversal

The converse is false: if p divides a_0 and q divides a_n it does not guarantee p/q is a root. The contrast highlights that the theorem gives necessary but not sufficient conditions.

 

 

 

 

 





## Boundary

Boundary

Requires integer coefficients and a rational root written in lowest terms; extensions to other coefficient rings require analogous integrality hypotheses. It does not detect irrational or complex roots.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Tension between necessary candidate lists and actual roots: the theorem can overwhelm with false candidates for high-degree polynomials; it competes with other tests (e.g., modular checks, bounds) for efficient root elimination.

 

 

 

 

 





## Synthesis

Synthesis

The Rational Root Theorem provides a finite, arithmetic sieve for potential rational zeros of integer polynomials: any rational zero must come from divisors of the constant term over divisors of the leading coefficient, converting an a priori infinite search into a manageable finite one.