✦ScienexySCIENCE KNOWLEDGE LIBRARY
General science · SCI-FORM-ALG-021

Rational Root Theorem

The Rational Root Theorem states that any rational root of a polynomial with integer coefficients must have a numerator that divides the constant term and a denominator that divides the leading coefficient, when written in lowest terms.

\(\text{ if } P(x) = a_{n}x^{n} + ... + a_{1}x + a_{0} has integer coefficients, then every rational root p/q in lowest terms satisfies p | a_{0} and q | a_{n}.\)

What this formula means

Definition

The Rational Root Theorem states that any rational root of a polynomial with integer coefficients must have a numerator that divides the constant term and a denominator that divides the leading coefficient, when written in lowest terms.

Interpretation

The theorem provides a finite list of possible rational roots that can be tested instead of searching through all rational numbers.

Mathematical Significance

It reduces the search for rational roots of a polynomial to a finite set of candidates and supports polynomial factorisation.

Special Cases

Monic Polynomial

If the leading coefficient is 1, every rational root must be an integer divisor of the constant term.

Integer Root

An integer root is a rational root whose denominator is 1.

Zero Constant Term

If a₀ = 0, then x = 0 is a root and x can be factored out before applying the theorem to the remaining polynomial.

Scientific principle

Principle

Divisibility Properties of Integer Polynomial Coefficients

Derivation

StepExplanationExpression

1

Consider a polynomial with integer coefficients and suppose p/q is a rational root in lowest terms.

P(p/q) = 0, where gcd(p,q) = 1 and q > 0

2

Substitute p/q into the polynomial.

aₙ(p/q)ⁿ + aₙ₋₁(p/q)ⁿ⁻¹ + ... + a₁(p/q) + a₀ = 0

3

Multiply the equation by qⁿ to eliminate denominators.

aₙpⁿ + aₙ₋₁pⁿ⁻¹q + ... + a₁pqⁿ⁻¹ + a₀qⁿ = 0

4

Rearrange to isolate the term containing the constant coefficient.

aₙpⁿ + aₙ₋₁pⁿ⁻¹q + ... + a₁pqⁿ⁻¹ = -a₀qⁿ

5

Every term on the left is divisible by p. Therefore, p divides a₀qⁿ. Since p and q are coprime, p must divide a₀.

p | a₀

6

The original equation can also be rearranged so that every term except the leading term contains q. Since p and q are coprime, q must divide aₙ.

q | aₙ

Result

Every rational root p/q in lowest terms must have p as a divisor of the constant coefficient and q as a divisor of the leading coefficient.

Variables and their meanings

SymbolMeaningDescription

P(x)

Polynomial

A polynomial with integer coefficients.

aₙ

Leading coefficient

The coefficient of the highest-degree term.

a₀

Constant coefficient

The constant term of the polynomial.

p

Numerator

The integer numerator of a rational root written in lowest terms.

q

Denominator

The positive integer denominator of a rational root written in lowest terms.

n

Polynomial degree

The highest exponent of the polynomial.

|

Divisibility symbol

The notation p | a₀ means that p divides a₀ exactly.

SI units and conversions

Si Unit

Not applicable

Dimensional Formula

Not applicable

Unit Explanation

The theorem is purely algebraic and uses integer coefficients and rational numbers rather than physical quantities.

Unit Conversions

No items supplied.

Conditions of use

  • The polynomial must have integer coefficients.

  • The leading coefficient must be non-zero.

  • The candidate rational root p/q must be written in lowest terms.

  • The denominator q must be positive.

  • The theorem identifies possible rational roots but does not guarantee that every candidate is an actual root.

Limitations and assumptions

  • The theorem only identifies possible rational roots.

  • An irrational or non-real root cannot be identified using this theorem.

  • A polynomial may have no rational roots even when several candidates are available.

  • The theorem does not directly provide the complete factorisation of a polynomial.

  • The polynomial should be expressed with integer coefficients before applying the standard form.

Step-by-step worked examples

ProblemGivenSolutionAnswer

Find all possible rational roots of P(x) = 2x³ - 3x² - 8x + 12.

  • Leading coefficient aₙ = 2

  • Constant coefficient a₀ = 12

StepExplanationCalculation

1

List the integer factors of the constant coefficient.

p = ±1, ±2, ±3, ±4, ±6, ±12

2

List the positive factors of the leading coefficient.

q = 1, 2

3

Form all distinct fractions p/q and simplify them.

±1, ±2, ±3, ±4, ±6, ±12, ±1/2, ±3/2

4

Test the candidates in the original polynomial. For example, P(2) = 16 - 12 - 16 + 12 = 0.

P(2) = 0

5

Factorise the polynomial to identify its actual rational roots.

P(x) = (x - 2)(2x - 3)(x + 2)

Possible rational roots are ±1, ±2, ±3, ±4, ±6, ±12, ±1/2 and ±3/2. Actual roots are 2, 3/2 and -2.

Determine the possible rational roots of P(x) = x³ - 5x + 6.

  • Leading coefficient = 1

  • Constant coefficient = 6

StepExplanationCalculation

1

The numerator must divide 6.

p = ±1, ±2, ±3, ±6

2

The denominator must divide 1.

q = 1

3

Form the possible rational roots.

x = ±1, ±2, ±3, ±6

4

These values are candidates and must be tested in P(x).

P(1) = 2, P(-1) = 10, P(2) = 4, P(-2) = 8

The possible rational roots are ±1, ±2, ±3 and ±6. None of the four values tested is a root.

Real-world applications

ApplicationExplanation

Polynomial Factorisation

The theorem helps identify possible rational linear factors when factorising integer-coefficient polynomials.

Algebraic Equation Solving

It reduces the number of candidate values that need to be tested when solving polynomial equations.

Computer Algebra Systems

Symbolic algebra algorithms can use rational-root candidates as part of polynomial factorisation procedures.

Number Theory

The theorem demonstrates how divisibility properties of integers constrain solutions of polynomial equations.

Formula Meaning

Definition

The Rational Root Theorem states that any rational root of a polynomial with integer coefficients must have a numerator that divides the constant term and a denominator that divides the leading coefficient, when written in lowest terms.

Interpretation

The theorem provides a finite list of possible rational roots that can be tested instead of searching through all rational numbers.

Mathematical Significance

It reduces the search for rational roots of a polynomial to a finite set of candidates and supports polynomial factorisation.

Special Cases

Monic Polynomial

If the leading coefficient is 1, every rational root must be an integer divisor of the constant term.

Integer Root

An integer root is a rational root whose denominator is 1.

Zero Constant Term

If a₀ = 0, then x = 0 is a root and x can be factored out before applying the theorem to the remaining polynomial.

Sources and further reading

No source has been supplied for this item yet. Treat the claim as needing editorial verification.

← Back to Formula Hub · Suggest a correction or source