What is the Remainder Theorem?

The Remainder Theorem states that when a polynomial P(x) is divided by (x - c), the remainder equals P(c). This means you can find the remainder by simple evaluation instead of performing division. For P(x) = x³ - 4x + 2 divided by (x - 3), the remainder is P(3) = 27 - 12 + 2 = 17.

What is the Factor Theorem?

The Factor Theorem states that (x - c) is a factor of P(x) if and only if P(c) = 0. It connects roots and factors directly: c is a root precisely when (x - c) is a factor. To test if (x - 2) divides a polynomial, evaluate P(2) — if the result is zero, it's a factor.

What is the Rational Root Theorem?

For a polynomial with integer coefficients, any rational root p/q (in lowest terms) has p dividing the constant term and q dividing the leading coefficient. This generates a finite list of candidates. For 2x³ + x² - 13x + 6, candidates are ±1, ±2, ±3, ±6, ±1/2, ±3/2.

How do you use the Rational Root Theorem?

List divisors of the constant term (possible p values) and divisors of the leading coefficient (possible q values). Form all fractions ±p/q. Test each candidate by substitution or synthetic division. When you find a root, divide it out and repeat on the quotient.

What is the Integer Root Theorem?

When the leading coefficient is 1 (monic polynomial), all rational roots must be integers that divide the constant term. For x³ - 6x² + 11x - 6, candidates are only ±1, ±2, ±3, ±6 — no fractions needed. This simplifies the search considerably.

What is Descartes' Rule of Signs?

Descartes' Rule counts sign changes in coefficients to estimate real roots. The number of positive roots equals the sign changes or less by an even number. For negative roots, apply the rule to P(-x). It gives bounds but not exact counts.

What is the Fundamental Theorem of Algebra?

Every polynomial of degree n ≥ 1 has exactly n roots in the complex numbers, counted with multiplicity. A cubic always has 3 roots, a quartic has 4. For real coefficients, complex roots come in conjugate pairs, so odd-degree polynomials always have at least one real root.

What are Vieta's formulas?

Vieta's formulas relate roots to coefficients. For x² + bx + c with roots r₁, r₂: sum r₁ + r₂ = -b and product r₁·r₂ = c. For cubics: sum of roots = -b, sum of pairwise products = c, product of all roots = -d. Useful for verifying answers and solving without finding individual roots.

How do you find upper and lower bounds for polynomial roots?

Use synthetic division. For upper bound: divide by (x - c) with c > 0; if all entries in the bottom row are non-negative, c is an upper bound. For lower bound: divide by (x - c) with c < 0; if entries alternate in sign, c is a lower bound.

Why doesn't the Rational Root Theorem find all roots?

The theorem only identifies rational roots. Irrational roots like √2 and complex roots like 2 + 3i are invisible to it. The polynomial x² - 2 has candidates ±1, ±2, but its actual roots ±√2 are irrational. The theorem is a first filter, not a complete solution.

How does the Factor Theorem help build polynomials from roots?

If a polynomial has roots r₁, r₂, r₃, then (x - r₁)(x - r₂)(x - r₃) is a factor. For roots 1, -2, and 4, the polynomial is (x - 1)(x + 2)(x - 4) = x³ - 3x² - 6x + 8. Any scalar multiple shares the same roots.

What is the relationship between the Remainder Theorem and Factor Theorem?

The Factor Theorem is a special case of the Remainder Theorem. The Remainder Theorem says dividing P(x) by (x - c) gives remainder P(c). The Factor Theorem adds: when that remainder is zero, (x - c) is a factor. One determines remainders; the other identifies factors.

How do you apply Descartes' Rule of Signs to find negative roots?

Replace x with -x in P(x) and count sign changes in P(-x). Odd-powered terms change sign; even-powered terms stay the same. The sign changes in P(-x) give the possible number of negative real roots, following the same 'or less by an even number' rule.

Polynomial Rules

Q: Why doesn't the Rational Root Theorem find all roots?

The theorem only identifies rational roots. Irrational roots like √2 and complex roots like 2 + 3i are invisible to it. The polynomial x² - 2 has candidates ±1, ±2, but its actual roots ±√2 are irrational. The theorem is a first filter, not a complete solution.

Key Terms

The Remainder Theorem

Why the Remainder Theorem Works

The Factor Theorem

Using the Factor Theorem

The Rational Root Theorem

Applying the Rational Root Theorem

Limitations of the Rational Root Theorem

The Integer Root Theorem

Descartes' Rule of Signs

Upper and Lower Bounds

The Fundamental Theorem of Algebra

Vieta's Formulas

Common Mistakes

Master Toolkit of Polynomial Theorems

The Theorems Behind the Toolkit

Working with polynomials involves a great deal of computation — dividing, testing values, searching for roots. But underneath that work sits a collection of theorems that explain why certain shortcuts are valid, why certain searches are guaranteed to terminate, and why the structure of a polynomial's coefficients reveals information about its solutions before a single calculation is performed.

These results connect seemingly separate tasks. Evaluating a polynomial at a point turns out to be the same as finding a division remainder. Knowing one root immediately produces a factor. The coefficients of a polynomial place strict limits on which rational numbers could possibly be roots. Each theorem removes guesswork and replaces it with structure.

Key Terms

Division Theorems

Remainder Theorem— remainder of

P(x) \div (x-c)

P(c)

Factor Theorem—

(x-c)

divides

P(x)

exactly when

P(c) = 0

Root-Finding Theorems

Rational Root Theorem— if

p/q

is a rational root,

p \mid a_0

and

q \mid a_n

Descartes' Rule of Signs— sign changes bound the count of positive and negative roots

Fundamental Theorem of Algebra— every degree-

n

polynomial has exactly

n

complex roots

Coefficient-Root Relations

Vieta's Formulas— root sums and products from coefficients alone

Root (of a Polynomial)— the values these theorems locate

Synthetic Division— the computational tool for testing candidates

Formulas Used on This Page

Remainder Theorem—

P(x) = (x - c) \cdot Q(x) + P(c)

Factor Theorem—

(x - c)

is a factor of

P(x) \iff P(c) = 0

Rational Root Theorem— if

\frac{p}{q}

is a root:

p \mid a_0

and

q \mid a_n

See All Algebra Definitions →

See All Algebra Formulas →

The Remainder Theorem

When a polynomial

P(x)

is divided by a linear binomial

(x - c)

, the remainder is a constant — and that constant equals

P(c)

, the value of the polynomial evaluated at

x = c

.

This means the remainder can be found without performing any division at all. To find the remainder when

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

is divided by

(x - 3)

, simply compute

P(3) = 27 - 12 + 2 = 17

. The remainder is

17

.

The theorem applies to any polynomial and any value of

c

. If

P(x) = 2x^4 - x^2 + 5

and the divisor is

(x + 1)

, read

(x + 1)

(x - (-1))

and evaluate

P(-1) = 2(1) - 1 + 5 = 6

. The remainder is

6

, confirmed instantly without setting up long division or synthetic division.

Why the Remainder Theorem Works

The proof follows directly from the division algorithm. Dividing

P(x)

(x - c)

produces a quotient

Q(x)

and a remainder

R

P(x) = (x - c) \cdot Q(x) + R

Because the divisor

(x - c)

has degree

1

, the remainder

R

must have degree less than

1

— meaning

R

is a constant, independent of

x

.

Now substitute

x = c

into both sides:

P(c) = (c - c) \cdot Q(c) + R = 0 \cdot Q(c) + R = R

The factor

(c - c)

annihilates the quotient term, leaving

P(c) = R

. Evaluation and division are not separate operations — evaluating

P

c

is equivalent to extracting the remainder of division by

(x - c)

The Factor Theorem

The Factor Theorem is a direct consequence of the Remainder Theorem:

(x - c)

is a factor of

P(x)

if and only if

P(c) = 0

.

The logic is immediate. If the remainder when dividing by

(x - c)

is zero, then

P(x) = (x - c) \cdot Q(x)

with no leftover term — so

(x - c)

divides

P(x)

exactly. Conversely, if

(x - c)

is a factor, then

P(c) = (c - c) \cdot Q(c) = 0

.

This creates a bridge between roots and factors. The value

c

is a root of

P(x)

precisely when

(x - c)

is a factor of

P(x)

. Finding one gives the other automatically.

To test whether

(x - 2)

is a factor of

x^3 - 6x^2 + 11x - 6

, evaluate

P(2) = 8 - 24 + 22 - 6 = 0

. Since the result is zero,

(x - 2)

is indeed a factor, and

2

is a root.

Using the Factor Theorem

The Factor Theorem works in both directions — it can verify suspected factors and it can build polynomials from known roots.

To test potential roots, substitute each candidate into

P(x)

and check for zero. For

P(x) = x^3 - 7x + 6

, testing

x = 1

gives

P(1) = 1 - 7 + 6 = 0

, confirming that

(x - 1)

is a factor. Dividing out this factor via synthetic division yields the quotient

x^2 + x - 6

, which factors further as

(x + 3)(x - 2)

. The complete factorization is

(x - 1)(x + 3)(x - 2)

.

To construct a polynomial from its roots, reverse the process. If a cubic polynomial has roots

1

-2

, and

4

, the Factor Theorem guarantees that

(x - 1)

(x + 2)

, and

(x - 4)

are all factors. Their product gives:

(x - 1)(x + 2)(x - 4) = x^3 - 3x^2 - 6x + 8

Any nonzero scalar multiple

a(x - 1)(x + 2)(x - 4)

shares the same roots, so the polynomial is determined up to a constant factor unless additional information — such as a specific function value — pins it down.

The Rational Root Theorem

For polynomials with integer coefficients, the Rational Root Theorem restricts which rational numbers can possibly be roots. If

P(x) = a_nx^n + a_{n-1}x^{n-1} + \cdots + a_1x + a_0

has integer coefficients and

\frac{p}{q}

is a rational root expressed in lowest terms, then

p

divides the constant term

a_0

and

q

divides the leading coefficient

a_n

.

This transforms an infinite search into a finite one. Instead of testing every rational number, only the fractions formed by divisors of

a_0

over divisors of

a_n

need to be checked.

For

P(x) = 2x^3 + x^2 - 13x + 6

, the constant term is

6

with divisors

\pm 1, \pm 2, \pm 3, \pm 6

, and the leading coefficient is

2

with divisors

\pm 1, \pm 2

. The candidate list is:

\pm 1, \pm 2, \pm 3, \pm 6, \pm \frac{1}{2}, \pm \frac{3}{2}

Twelve candidates replace infinitely many possibilities. Each can be tested by substitution or synthetic division until all rational roots are found or the list is exhausted.

Applying the Rational Root Theorem

The theorem produces a candidate list, but the actual work lies in testing each candidate efficiently. A systematic approach avoids redundant effort.

Start by listing all divisors of the constant term

a_0

— these are the possible values of

p

. Then list all divisors of the leading coefficient

a_n

— these are the possible values of

q

. Form every fraction

\pm \frac{p}{q}

and reduce to lowest terms to eliminate duplicates.

For

2x^3 + x^2 - 13x + 6

, begin testing with the simplest candidates.

P(1) = 2 + 1 - 13 + 6 = -4

, so

1

is not a root.

P(2) = 16 + 4 - 26 + 6 = 0

, so

2

is a root. By the Factor Theorem,

(x - 2)

is a factor. Synthetic division gives a quotient of

2x^2 + 5x - 3

, which factors as

(2x - 1)(x + 3)

.

The complete factorization is

(x - 2)(2x - 1)(x + 3)

, giving roots

2

\frac{1}{2}

, and

-3

— all members of the candidate list.

Testing via synthetic division is often more efficient than direct substitution, since each test simultaneously produces the quotient polynomial if the candidate turns out to be a root.

Limitations of the Rational Root Theorem

The Rational Root Theorem identifies only rational roots. Irrational roots and complex roots lie entirely outside its reach.

The polynomial

x^2 - 2

illustrates this clearly. Its constant term is

-2

and its leading coefficient is

1

, producing candidates

\pm 1, \pm 2

. Testing each:

P(1) = -1

P(-1) = -1

P(2) = 2

P(-2) = 2

. None equals zero. The actual roots are

\pm\sqrt{2}

, both irrational — invisible to the theorem.

A polynomial may have no rational roots at all. The polynomial

x^4 + x^3 + x^2 + x + 1

has integer coefficients and candidates

\pm 1

, but neither works. All four of its roots are complex, and no amount of rational testing will find them.

The theorem is best understood as a first filter, not a complete solution. When it finds roots, synthetic division reduces the polynomial's degree, potentially making the remaining roots accessible through the quadratic formula or other methods. When it finds none, it confirms that the roots are irrational or complex and signals the need for different tools.

The Integer Root Theorem

When the leading coefficient of a polynomial is

1

— a monic polynomial — the Rational Root Theorem simplifies considerably. Every rational root

\frac{p}{q}

has

q

dividing

1

, which forces

q = \pm 1

, which means

\frac{p}{q}

is an integer. So all rational roots of a monic polynomial are integers, and they must divide the constant term.

For

x^3 - 6x^2 + 11x - 6

, the only candidates are the divisors of

-6

\pm 1, \pm 2, \pm 3, \pm 6

. No fractions need to be considered.

Testing:

P(1) = 1 - 6 + 11 - 6 = 0

, so

1

is a root. Dividing out

(x - 1)

leaves

x^2 - 5x + 6 = (x - 2)(x - 3)

. All three roots —

1

2

3

— are integers dividing

6

, exactly as the theorem predicts.

This simplification makes monic polynomials particularly approachable. The candidate list is shorter, the candidates are easier to test, and the search is faster. Recognizing that a polynomial is monic before beginning the root search saves unnecessary work with fractions.

Descartes' Rule of Signs

Descartes' Rule of Signs estimates the number of positive and negative real roots of a polynomial by counting sign changes in its coefficients.

To count positive real roots, write

P(x)

in standard form and count how many times the sign of the coefficients changes from one term to the next. For

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

, the coefficient signs are

+, -, -, +

. The sign changes twice: from

+

-

and from

-

+

. The polynomial has either

2

0

positive real roots — the actual count equals the number of sign changes or less by an even number.

To count negative real roots, apply the same procedure to

P(-x)

. Substituting

-x

gives

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

, with signs

-, -, +, +

. One sign change occurs, so the polynomial has exactly

1

negative real root.

The rule does not identify the roots or specify which of the possible counts is correct. For

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

, the actual roots are

1

2

, and

-1

— two positive and one negative, consistent with the prediction. But the rule alone cannot distinguish between

2

positive roots and

0

positive roots without further analysis.

Upper and Lower Bounds

Synthetic division provides a way to establish bounds on the real roots of a polynomial, narrowing the interval where roots can exist.

The upper bound test works as follows: divide

P(x)

(x - c)

where

c > 0

using synthetic division. If every entry in the bottom row is non-negative (positive or zero), then

c

is an upper bound — no real root of

P(x)

exceeds

c

.

The lower bound test is similar but uses a negative value of

c

. Divide

P(x)

(x - c)

where

c < 0

. If the entries in the bottom row alternate in sign (with zeros counting as either sign), then

c

is a lower bound — no real root is less than

c

.

For

P(x) = x^3 - 4x^2 + x + 6

, synthetic division by

(x - 5)

produces the row

1, 1, 6, 36

— all non-negative, so

5

is an upper bound. Synthetic division by

(x + 2)

, meaning

c = -2

, produces

1, -6, 13, -20

— the signs alternate, so

-2

is a lower bound. All real roots of this polynomial lie in the interval

[-2, 5]

.

These bounds are especially useful when combined with the Rational Root Theorem, eliminating candidates that fall outside the established range before any testing begins.

Bound type	Condition on the synthetic-division row	Example (P(x) = x³ − 4x² + x + 6)
Upper bound (c > 0)	every entry in the bottom row is non-negative	c = 5 → row 1, 1, 6, 36 (all ≥ 0) ⇒ 5 is an upper bound
Lower bound (c < 0)	entries alternate in sign (zeros count as either sign)	c = −2 → row 1, −6, 13, −20 (alternating) ⇒ −2 is a lower bound

The Fundamental Theorem of Algebra

The Fundamental Theorem of Algebra makes a sweeping guarantee: every polynomial of degree

n \geq 1

with complex coefficients has exactly

n

roots in the complex numbers, counted with multiplicity.

A quadratic has

2

roots. A cubic has

3

. A degree-

10

polynomial has

10

. No polynomial of positive degree can avoid having roots — the theorem eliminates the possibility of a polynomial that simply never equals zero.

Some roots may repeat. The polynomial

x^3 - 3x^2 + 3x - 1 = (x - 1)^3

has degree

3

but only one distinct root,

x = 1

, appearing with multiplicity

3

. The count of

n

roots includes these repetitions.

For polynomials with real coefficients, an additional constraint applies: complex roots come in conjugate pairs. If

a + bi

is a root, then

a - bi

is also a root. This means a real polynomial of odd degree must have at least one real root — an odd number of roots cannot be paired off entirely into conjugate pairs.

The theorem guarantees existence but offers no method for finding roots. For degree

5

and above, no general formula in radicals exists — a result proven by Abel and Galois. Numerical methods, the Rational Root Theorem, and other tools from this page fill the gap between knowing roots exist and actually computing them.

Vieta's Formulas

Vieta's formulas express symmetric relationships between the roots of a polynomial and its coefficients, without requiring the roots to be known individually.

For a monic quadratic

x^2 + bx + c

with roots

r_1

and

r_2

r_1 + r_2 = -b \qquad r_1 \cdot r_2 = c

The sum of the roots equals the negative of the linear coefficient, and the product equals the constant term.

For a monic cubic

x^3 + bx^2 + cx + d

with roots

r_1

r_2

r_3

r_1 + r_2 + r_3 = -b

r_1r_2 + r_1r_3 + r_2r_3 = c

r_1 \cdot r_2 \cdot r_3 = -d

The pattern extends to any degree: the

k

-th elementary symmetric polynomial of the roots equals

(-1)^k

times the coefficient of

x^{n-k}

in a monic degree-

n

polynomial.

These relationships are useful for verifying factorizations. After finding roots

1

2

, and

3

for

x^3 - 6x^2 + 11x - 6

, Vieta's formulas confirm:

1 + 2 + 3 = 6 = -(-6)

1 \cdot 2 + 1 \cdot 3 + 2 \cdot 3 = 11

, and

1 \cdot 2 \cdot 3 = 6 = -(-6)

. All three match the coefficients. They also allow solving problems where individual roots are not needed — for instance, finding the sum of the squares of the roots using

(r_1 + r_2 + r_3)^2 - 2(r_1r_2 + r_1r_3 + r_2r_3) = 36 - 22 = 14

Monic polynomial	Sum of roots	Sum of pairwise products	Product of all roots
x² + bx + c (roots r₁, r₂)	r₁ + r₂ = −b	—	r₁ · r₂ = c
x³ + bx² + cx + d (roots r₁, r₂, r₃)	r₁ + r₂ + r₃ = −b	r₁r₂ + r₁r₃ + r₂r₃ = c	r₁ · r₂ · r₃ = −d

Common Mistakes

The theorems on this page are closely related, and confusing their roles or misapplying their details produces errors that are easy to make and sometimes hard to spot.

The Remainder Theorem and the Factor Theorem are frequently conflated. The Remainder Theorem says dividing

P(x)

(x - c)

leaves a remainder of

P(c)

. The Factor Theorem adds one specific condition: if that remainder is zero, then

(x - c)

is a factor. Applying the Factor Theorem when

P(c) \neq 0

— concluding that

(x - c)

is somehow a partial factor — reflects a misunderstanding of what the theorem actually states.

With the Rational Root Theorem, two errors dominate. The first is forgetting negative candidates — the divisors of

a_0

and

a_n

include both positive and negative values. The second is omitting fractional candidates when the leading coefficient is not

1

. For

2x^3 + x - 6

, candidates include

\pm\frac{1}{2}

and

\pm\frac{3}{2}

, not just integers.

In Descartes' Rule of Signs, the most common error occurs when computing

P(-x)

. Every odd-powered term changes sign while even-powered terms stay the same. Writing

P(-x)

incorrectly — changing the wrong terms or missing one — corrupts the sign-change count.

With Vieta's formulas, sign errors are persistent. The sum of roots for

x^2 + bx + c

-b

, not

b

. The product of roots for a cubic

x^3 + bx^2 + cx + d

-d

, not

d

. The alternating sign pattern

(-1)^k

is easy to lose track of, especially at higher degrees.

Theorem	Common mistake	Correct version
Remainder vs Factor	treating (x − c) as a "partial factor" when P(c) ≠ 0	Factor Theorem requires P(c) = 0 exactly; otherwise P(c) is just the remainder
Rational Root Theorem	forgetting negative candidates, or skipping fractional candidates when a_n ≠ 1	include ± p ⁄ q for every p \| a₀ and every q \| a_n
Descartes' Rule	computing P(−x) incorrectly (changing wrong terms)	only odd-powered terms flip sign; even-powered terms stay the same
Vieta's formulas	sign errors — writing sum as +b or product as +d	k-th symmetric polynomial = (−1)^k · (coefficient of x^n−k); alternating signs

Master Toolkit of Polynomial Theorems

The theorems on this page form a coordinated toolkit for analyzing polynomials — locating roots, factoring, bounding the search, and relating coefficients to roots. The table below collects every theorem covered above with its purpose, the situation where it applies, and the output it produces.

Theorem	What it does	When to use	Output
Remainder Theorem	replaces division by (x − c) with a single evaluation	find a remainder without long division	remainder = P(c)
Factor Theorem	links roots to linear factors	verify a factor, or build polynomials from known roots	(x − c) is a factor ⟺ P(c) = 0
Rational Root Theorem	restricts rational roots to ± p ⁄ q with p \| a₀, q \| a_n	polynomial has integer coefficients; search for rational roots	finite candidate list
Integer Root Theorem	RRT simplified: all rational roots are integers	monic polynomial (a_n = 1)	candidates are divisors of a₀ only
Descartes' Rule of Signs	counts sign changes in P(x) and P(−x)	estimate count of positive and negative real roots before solving	upper bound on positive / negative roots (or less by an even number)
Upper / Lower Bound Test	brackets the interval containing all real roots via synthetic division	combine with RRT to eliminate candidates outside the bracket	interval [c_low, c_high] containing every real root
Fundamental Theorem of Algebra	guarantees every degree-n polynomial has exactly n roots over ℂ (with multiplicity)	confirm the total number of roots to look for	existence guarantee; complex roots of real polynomials come in conjugate pairs
Vieta's Formulas	express symmetric functions of roots from coefficients alone	verify a factorization, or work with sums/products of roots without finding them	root–coefficient identities (sum, pairwise products, full product)