Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools


Polynomial Rules






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)÷(x−c)P(x) \div (x-c) is P(c)P(c)
Factor Theorem— (x−c)(x-c) divides P(x)P(x) exactly when P(c)=0P(c) = 0

Root-Finding Theorems

Rational Root Theorem— if p/qp/q is a rational root, p∣a0p \mid a_0 and q∣anq \mid a_n
Descartes' Rule of Signs— sign changes bound the count of positive and negative roots
Fundamental Theorem of Algebra— every degree-nn polynomial has exactly nn 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)⋅Q(x)+P(c)P(x) = (x - c) \cdot Q(x) + P(c)
Factor Theorem— (x−c)(x - c) is a factor of P(x)  ⟺  P(c)=0P(x) \iff P(c) = 0
Rational Root Theorem— if pq\frac{p}{q} is a root: p∣a0p \mid a_0 and q∣anq \mid a_n

See All Algebra Definitions →

See All Algebra Formulas →


Polynomial Rules Notation

Notation

Polynomial Rules Notation

The shorthand the theorems on this page lean on: division written as a product, evaluation in parentheses, a candidate fraction, and roots counted by subscript.
Coefficients an,…,a0a_n, \ldots, a_0, degree and multiplicity follow polynomial notation; p∣a0p \mid a_0 is read as in divisibility notation.
P(x)=(x−c) Q(x)+RP(x) = (x - c)\,Q(x) + R
P of x equals x minus c times Q of x, plus R
Division written as a product: PP the dividend, (x−c)(x - c) the divisor, Q(x)Q(x) the quotient, RR the remainder — a constant, because the divisor has degree 11. The Remainder Theorem says R=P(c)R = P(c).
CasesWhen R=0R = 0, (x−c)(x - c) is a factor of P(x)P(x) — the Factor Theorem.
Also writtenP(x)x−c=Q(x)+Rx−c\dfrac{P(x)}{x - c} = Q(x) + \dfrac{R}{x - c} — the fraction form; P=DQ+RP = DQ + R with deg⁡R<deg⁡D\deg R < \deg D for a divisor DD of any degree.
Do not confuseThe sign of cc. Dividing by (x+3)(x + 3) means c=−3c = -3, so the remainder is P(−3)P(-3), not P(3)P(3).
P(c),  P(−x)P(c), \; P(-x)
P of c; P of minus x
Parentheses after PP mean put in, not multiply. P(c)P(c) is a number, the value at x=cx = c; P(−x)P(-x) is a new polynomial, with −x-x put in for every xx — Descartes' rule counts its sign changes for the negative roots.
CasesIn P(−x)P(-x) only odd powers change sign: x3−2x2−x+2x^3 - 2x^2 - x + 2 becomes −x3−2x2+x+2-x^3 - 2x^2 + x + 2.
Do not confuse−P(x)-P(x), which flips every sign. P(−x)P(-x) mirrors the graph across the vertical axis, −P(x)-P(x) across the horizontal one — see transformation notation.
±pq,p∣a0,  q∣an\pm\dfrac{p}{q}, \quad p \mid a_0, \; q \mid a_n
plus or minus p over q, with p dividing a sub zero and q dividing a sub n
The candidate list of the Rational Root Theorem: pp runs over the divisors of the constant term, qq over the divisors of the leading coefficient, the fraction in lowest terms.
CasesThe ±\pm doubles every fraction; for 2x3+x2−13x+62x^3 + x^2 - 13x + 6 the list has twelve candidates, ±12\pm\frac{1}{2} and ±32\pm\frac{3}{2} among them.
Do not confusepp as a prime, as in prime number notation. Here pp is any divisor, prime or not: 66 is a valid pp.
r1,r2,…,rnr_1, r_2, \ldots, r_n
r sub one up to r sub n — the roots
Roots named by place in a list, with no order implied. Vieta's formulas combine them into symmetric sums: for x2+bx+cx^2 + bx + c, r1+r2=−br_1 + r_2 = -b and r1r2=cr_1 r_2 = c.
CasesA repeated root is listed once per multiplicity: (x−2)2(x - 2)^2 has r1=r2=2r_1 = r_2 = 2. The sum of the roots is −b-b, not bb.
Do not confuseThe coefficient subscripts a0,…,ana_0, \ldots, a_n. Those name a power of xx; root subscripts only count.
DownloadPNG2×PDF
Notation · Cheat sheet
Polynomials, Equations and Inequalities: Notation at a Glance
The marks from the notation cards across the polynomial, equation and inequality pages: how each is read and what it means. Every group links to the full card on its page.
Polynomial roots
anxn+⋯+a0a_n x^n + \cdots + a_0
a-n x to the n, down to a-zero
Standard form; the subscript of each coefficient is its power of xx.
deg⁡P=n\deg P = n
the degree of P is n
The highest power with a nonzero coefficient.
(x−r)m(x - r)^m
x minus r, to the multiplicity m
The root rr counted mm times.
Polynomial rulesThis page
P=(x−c) Q+RP = (x - c)\,Q + R
quotient and remainder
Division as a product: quotient Q(x)Q(x), remainder R=P(c)R = P(c).
P(c),  P(−x)P(c), \; P(-x)
P of c; P of minus x
Put in, not multiply: a value, and a new polynomial.
±pq\pm\frac{p}{q}
plus or minus p over q
Rational root candidates: p∣a0p \mid a_0, q∣anq \mid a_n.
r1,…,rnr_1, \ldots, r_n
r sub one to r sub n
The roots, listed once per multiplicity.
Quadratic equations
ax2+bx+c=0ax^2 + bx + c = 0
standard form
Descending powers, everything on the left, a≠0a \neq 0.
Δ=b2−4ac\Delta = b^2 - 4ac
delta, the discriminant
Its sign tells how many real roots there are.
x1,  x2x_1, \; x_2
x one and x two
The two roots; the subscripts only count.
Absolute value equations
∣x∣|x|
the absolute value of x
Distance of xx from 00; never negative.
∣a+b∣|a + b|
absolute value of a plus b
The bars cover the whole quantity: add first, then take the size.
∣x∣=x2|x| = \sqrt{x^2}
the root of the square
A second definition, handy with radicals.
Inequalities
(a,b)(a, b)
open interval from a to b
Endpoints left out.
[a,b][a, b]
closed interval from a to b
Endpoints included.
(a,∞)(a, \infty) · (−∞,a](-\infty, a]
rays
Infinity always takes a round bracket.
∪\cup
union
Joins two intervals into one solution set.
Linear inequalities
<< · ≤\leq · >> · ≥\geq
less than … greater than or equal to
The bar under the sign adds equality.
−3<2x+1≤7-3 < 2x + 1 \leq 7
a compound inequality
Both conditions at once: an "and".
(−∞,9](-\infty, 9]
from minus infinity to nine, inclusive
The solution written as an interval.
Same marks, different job
∣x∣, ∣z∣, ∣A∣|x|, \ |z|, \ |A|Absolute value of a number, modulus of a complex number, determinant of a matrix: the same two bars.
(a,b)(a, b)An open interval here; a point in the plane in coordinate geometry.
pp in pq\frac{p}{q}Any divisor of a0a_0, not necessarily a prime.
Polynomials, Equations and Inequalities: Notation at a Glance·/algebra/polynomials/rootsLearn Math Class

The Remainder Theorem

Dividing x³ − 4x + 2 by x − 3 by long division takes several steps. Is there a shortcut to the remainder?
Compare the long-division remainders for three divisors with the values of the polynomial at 11, 22 and 33.
For each divisor x − c, the long-division remainder equals the value of the polynomial at c.
divisorremainder by long divisionP(c)
x − 1−1P(1) = 1 − 4 + 2 = −1
x − 22P(2) = 8 − 8 + 2 = 2
x − 317P(3) = 27 − 12 + 2 = 17
Three divisions, three evaluations, the same three numbers.
The remainder on division by x − c is just P(c).
This means the remainder can be found without performing any division at all.
Example
To find the remainder when P(x)=x3−4x+2P(x) = x^3 - 4x + 2 is divided by (x−3)(x - 3), simply compute P(3)=27−12+2=17P(3) = 27 - 12 + 2 = 17. The remainder is 1717.
The theorem applies to any polynomial and any value of cc.
Example
If P(x)=2x4−x2+5P(x) = 2x^4 - x^2 + 5 and the divisor is (x+1)(x + 1), read (x+1)(x + 1) as (x−(−1))(x - (-1)) and evaluate P(−1)=2(1)−1+5=6P(-1) = 2(1) - 1 + 5 = 6. The remainder is 66, confirmed instantly without setting up long division or synthetic division.
The definition
The remainder theorem states that dividing a polynomial P(x)P(x) by x−cx - c leaves the remainder P(c)P(c).
When a polynomial P(x)P(x) is divided by a linear binomial (x−c)(x - c), the remainder is a constant — and that constant equals P(c)P(c), the value of the polynomial evaluated at x=cx = c.
Formally:
Remainder Theorem
P(x)=(x−c)⋅Q(x)+P(c)P(x) = (x - c) \cdot Q(x) + P(c)
Learn more about this formula: Remainder Theorem →
So dividing x3−4x+2x^3 - 4x + 2 by x−3x - 3 leaves the remainder P(3)=17P(3) = 17.
It holds because the quotient term vanishes at x = c.
In P(x)=(x−c)Q(x)+rP(x) = (x - c)Q(x) + r, setting x=cx = c makes (x−c)Q(x)(x - c)Q(x) equal to 00, so P(c)=rP(c) = r. The full argument is in why the remainder theorem works.
c is the number that makes the divisor zero, so watch its sign.
Pitfall: Using the wrong sign of c
Evaluating at the number shown in the divisor: for x3−4x+2x^3 - 4x + 2 divided by (x+3)(x + 3), P(3)=17P(3) = 17 is the remainder for (x−3)(x - 3). Here c=−3c = -3, so the remainder is P(−3)=−13P(-3) = -13.
In both examples the whole computation is a single evaluation, and the only choice to make is the value of cc. The theorem is stated for a divisor written as (x−c)(x - c), so cc is the number that makes the divisor equal to zero.
The rest of the page covers why the theorem works, the factor theorem, the rational root and integer root theorems, Descartes' rule of signs, bounds on roots, the fundamental theorem of algebra, Vieta's formulas, common mistakes and a summary toolkit.

Why the Remainder Theorem Works

The proof follows directly from the division algorithm. Dividing P(x)P(x) by (x−c)(x - c) produces a quotient Q(x)Q(x) and a remainder RR:

Why the Remainder Theorem Works
P(x)=(x−c)⋅Q(x)+RP(x) = (x - c) \cdot Q(x) + R

Because the divisor (x−c)(x - c) has degree 11, the remainder RR must have degree less than 11 — meaning RR is a constant, independent of xx.

Now substitute x=cx = c into both sides:

Why the Remainder Theorem Works
P(c)=(c−c)⋅Q(c)+R=0⋅Q(c)+R=RP(c) = (c - c) \cdot Q(c) + R = 0 \cdot Q(c) + R = R

The factor (c−c)(c - c) annihilates the quotient term, leaving P(c)=RP(c) = R. Evaluation and division are not separate operations — evaluating PP at cc is equivalent to extracting the remainder of division by (x−c)(x - c).
The proof is three steps from the division algorithm. The chain runs them in order.
DownloadPNG2×PDF
Polynomial theorems

Why the Remainder Theorem works

Evaluation and division are not separate operations.
Why the Remainder Theorem works·/algebra/polynomials/rulesLearn Math Class
Evaluating PP at cc and extracting the remainder of division by (x−c)(x - c) are the same operation.

The Factor Theorem

The Factor Theorem is a direct consequence of the Remainder Theorem: (x−c)(x - c) is a factor of P(x)P(x) if and only if P(c)=0P(c) = 0.

Formally:

Factor Theorem
(x−c) is a factor of P(x)  ⟺  P(c)=0(x - c) \text{ is a factor of } P(x) \iff P(c) = 0
Learn more about this formula: Factor Theorem →


The logic is immediate. If the remainder when dividing by (x−c)(x - c) is zero, then P(x)=(x−c)⋅Q(x)P(x) = (x - c) \cdot Q(x) with no leftover term — so (x−c)(x - c) divides P(x)P(x) exactly. Conversely, if (x−c)(x - c) is a factor, then P(c)=(c−c)⋅Q(c)=0P(c) = (c - c) \cdot Q(c) = 0.

This creates a bridge between roots and factors. The value cc is a root of P(x)P(x) precisely when (x−c)(x - c) is a factor of P(x)P(x). Finding one gives the other automatically.

Example
To test whether (x−2)(x - 2) is a factor of x3−6x2+11x−6x^3 - 6x^2 + 11x - 6, evaluate P(2)=8−24+22−6=0P(2) = 8 - 24 + 22 - 6 = 0. Since the result is zero, (x−2)(x - 2) is indeed a factor, and 22 is a root.
The theorem runs both ways: a root gives a factor, a factor gives a root. The card shows each direction with its reason.
DownloadPNG2×PDF
Polynomial theorems

The Factor Theorem

A bridge between roots and factors.
P(c)=0P(c) = 0
cc is a root
remainder is zero
P(c)=(c−c)⋅Q(c)=0P(c) = (c - c) \cdot Q(c) = 0
(x−c)(x - c) is a factor of P(x)P(x)
P(x)=(x−c)⋅Q(x)P(x) = (x - c) \cdot Q(x) with no leftover term
Remainder Theorem (general case)
P(x)=(x−c)⋅Q(x)+P(c)P(x) = (x - c) \cdot Q(x) + P(c)
Dividing by (x−c)(x - c) leaves remainder P(c)P(c); the Factor Theorem is the case P(c)=0P(c) = 0.
Using the wrong sign of ccFor x3−4x+2x^3 - 4x + 2 divided by (x+3)(x + 3), P(3)=17P(3) = 17 is the remainder for (x−3)(x - 3). Here c=−3c = -3, so the remainder is P(−3)=−13P(-3) = -13.
The Factor Theorem·/algebra/polynomials/rulesLearn Math Class
Finding one gives the other automatically.

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)P(x) and check for zero.

Example
For P(x)=x3−7x+6P(x) = x^3 - 7x + 6, testing x=1x = 1 gives P(1)=1−7+6=0P(1) = 1 - 7 + 6 = 0, confirming that (x−1)(x - 1) is a factor. Dividing out this factor via synthetic division yields the quotient x2+x−6x^2 + x - 6, which factors further as (x+3)(x−2)(x + 3)(x - 2). The complete factorization is (x−1)(x+3)(x−2)(x - 1)(x + 3)(x - 2).

To construct a polynomial from its roots, reverse the process. If a cubic polynomial has roots 11, −2-2, and 44, the Factor Theorem guarantees that (x−1)(x - 1), (x+2)(x + 2), and (x−4)(x - 4) are all factors. Their product gives:

Using the Factor Theorem
(x−1)(x+2)(x−4)=x3−3x2−6x+8(x - 1)(x + 2)(x - 4) = x^3 - 3x^2 - 6x + 8

Any nonzero scalar multiple a(x−1)(x+2)(x−4)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)=anxn+an−1xn−1+⋯+a1x+a0P(x) = a_nx^n + a_{n-1}x^{n-1} + \cdots + a_1x + a_0 has integer coefficients and pq\frac{p}{q} is a rational root expressed in lowest terms, then pp divides the constant term a0a_0 and qq divides the leading coefficient ana_n.

Formally:

Rational Root Theorem
if pq is a root: p∣a0 and q∣an\text{if } \tfrac{p}{q} \text{ is a root: } p \mid a_0 \text{ and } q \mid a_n
Learn more about this formula: Rational Root Theorem →


This transforms an infinite search into a finite one. Instead of testing every rational number, only the fractions formed by divisors of a0a_0 over divisors of ana_n need to be checked.

For P(x)=2x3+x2−13x+6P(x) = 2x^3 + x^2 - 13x + 6, the constant term is 66 with divisors ±1,±2,±3,±6\pm 1, \pm 2, \pm 3, \pm 6, and the leading coefficient is 22 with divisors ±1,±2\pm 1, \pm 2. The candidate list is:

The Rational Root Theorem
±1,±2,±3,±6,±12,±32\pm 1, \pm 2, \pm 3, \pm 6, \pm \frac{1}{2}, \pm \frac{3}{2}

Pitfall: Leaving out the fractions
Listing only the divisors of 66 for 2x3+x2−13x+62x^3 + x^2 - 13x + 6 gives ±1,±2,±3,±6\pm 1, \pm 2, \pm 3, \pm 6 and misses the root 12\frac{1}{2}. Dividing by q=±2q = \pm 2 adds ±12\pm\frac{1}{2} and ±32\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 a0a_0 — these are the possible values of pp. Then list all divisors of the leading coefficient ana_n — these are the possible values of qq. Form every fraction ±pq\pm \frac{p}{q} and reduce to lowest terms to eliminate duplicates.

Example
For 2x3+x2−13x+62x^3 + x^2 - 13x + 6, begin testing with the simplest candidates. P(1)=2+1−13+6=−4P(1) = 2 + 1 - 13 + 6 = -4, so 11 is not a root. P(2)=16+4−26+6=0P(2) = 16 + 4 - 26 + 6 = 0, so 22 is a root. By the Factor Theorem, (x−2)(x - 2) is a factor. Synthetic division gives a quotient of 2x2+5x−32x^2 + 5x - 3, which factors as (2x−1)(x+3)(2x - 1)(x + 3).
The complete factorization is (x−2)(2x−1)(x+3)(x - 2)(2x - 1)(x + 3), giving roots 22, 12\frac{1}{2}, and −3-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.
The theorem as a procedure, on the page’s cubic: a finite list of candidates, then a test that pays twice.
DownloadPNG2×PDF
Polynomial theorems

The Rational Root Theorem

An infinite search becomes a finite one.
TheoremIf P(x)P(x) has integer coefficients and pq\frac{p}{q} is a rational root in lowest terms, then p∣a0p \mid a_0 and q∣anq \mid a_n.
1
Read the ends
2x3+x2−13x+62x^3 + x^2 - 13x + 6: constant term 66, leading coefficient 22.
2
Divisors
pp: ±1,±2,±3,±6\pm 1, \pm 2, \pm 3, \pm 6 · qq: ±1,±2\pm 1, \pm 2
3
Candidates
±1,±2,±3,±6,±12,±32\pm 1, \pm 2, \pm 3, \pm 6, \pm \frac{1}{2}, \pm \frac{3}{2}: twelve in all.
4
Test
P(1)=−4P(1) = -4, not a root. P(2)=16+4−26+6=0P(2) = 16 + 4 - 26 + 6 = 0, so 22 is a root and (x−2)(x - 2) is a factor.
5
Reduce
Synthetic division leaves 2x2+5x−3=(2x−1)(x+3)2x^2 + 5x - 3 = (2x - 1)(x + 3): roots 22, 12\frac{1}{2}, −3-3, all on the list.
Leaving out the fractionsListing only the divisors of 66 gives ±1,±2,±3,±6\pm 1, \pm 2, \pm 3, \pm 6 and misses the root 12\frac{1}{2}. Dividing by q=±2q = \pm 2 adds ±12\pm\frac{1}{2} and ±32\pm\frac{3}{2}.
The Rational Root Theorem, applied·/algebra/polynomials/rulesLearn Math Class
Twelve candidates replace infinitely many possibilities, and each root found lowers the degree by one.

Limitations of the Rational Root Theorem

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

Example
The polynomial x2−2x^2 - 2 illustrates this clearly. Its constant term is −2-2 and its leading coefficient is 11, producing candidates ±1,±2\pm 1, \pm 2. Testing each: P(1)=−1P(1) = -1, P(−1)=−1P(-1) = -1, P(2)=2P(2) = 2, P(−2)=2P(-2) = 2. None equals zero. The actual roots are ±2\pm\sqrt{2}, both irrational — invisible to the theorem.

A polynomial may have no rational roots at all. The polynomial x4+x3+x2+x+1x^4 + x^3 + x^2 + x + 1 has integer coefficients and candidates ±1\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.
x^2 - 2: the candidates 1, -1, 2, -2 all miss; the roots are plus or minus sqrt 2xy−3−2−1123−3−2−112345P(−2) = 2P(−1) = −1P(1) = −1P(2) = 2roots ±√2 ≈ ±1.41 (blue dots): irrationalNo candidate from ±1, ±2 is a root: the roots ±√2 are irrational
Where the theorem cannot see

The section's x² − 2. Its rational candidates are ±1 and ±2, and each one lands off the axis: P(±1) = −1 and P(±2) = 2. The graph still crosses the axis twice, at ±√2 ≈ ±1.41 (blue dots), but these roots are irrational, so the list could never contain them.

An empty candidate list rules out rational roots only, never roots in general.
The theorem filters candidates; it does not promise roots. The card separates the two.
DownloadPNG2×PDF
Polynomial theorems

Limits of the Rational Root Theorem

It identifies only rational roots.
The theorem says
If pq\frac{p}{q} is a rational root of a polynomial with integer coefficients, then pp divides a0a_0 and qq divides ana_n.
✕It does not say
Every polynomial has a rational root, or every candidate on the list is a root.
Reading an empty list as "no roots"
Wrong workingx2−2x^2 - 2 has candidates ±1,±2\pm 1, \pm 2; none is a root, so the polynomial has no roots.
Right workingThe roots are ±2\pm\sqrt{2}, irrational and invisible to the theorem. x4+x3+x2+x+1x^4 + x^3 + x^2 + x + 1 has candidates ±1\pm 1 and four complex roots.
A first filter, not a complete solution: when it finds roots, synthetic division lowers the degree; when it finds none, the roots are irrational or complex.
The Rational Root Theorem: what it does not say·/algebra/polynomials/rulesLearn Math Class
An empty candidate list is information too: the roots are irrational or complex, and other tools take over.

The Integer Root Theorem

When the leading coefficient of a polynomial is 11 — a monic polynomial — the Rational Root Theorem simplifies considerably. Every rational root pq\frac{p}{q} has qq dividing 11, which forces q=±1q = \pm 1, which means pq\frac{p}{q} is an integer.

THEOREMInteger Root Theorem
So all rational roots of a monic polynomial are integers, and they must divide the constant term.

Example
For x3−6x2+11x−6x^3 - 6x^2 + 11x - 6, the only candidates are the divisors of −6-6: ±1,±2,±3,±6\pm 1, \pm 2, \pm 3, \pm 6. No fractions need to be considered.
Testing: P(1)=1−6+11−6=0P(1) = 1 - 6 + 11 - 6 = 0, so 11 is a root. Dividing out (x−1)(x - 1) leaves x2−5x+6=(x−2)(x−3)x^2 - 5x + 6 = (x - 2)(x - 3). All three roots — 11, 22, 33 — are integers dividing 66, exactly as the theorem predicts.

Fact: A square root is whole or irrational
For a whole number nn, the polynomial x2−nx^2 - n is monic, so any rational root it has is an integer. Hence n\sqrt{n} is either a whole number or irrational: no fraction squares to exactly 22, though (75)2=1.96\left(\frac{7}{5}\right)^2 = 1.96 comes close.

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.
For a monic polynomial the candidate list loses its fractions. The chain shows why.
DownloadPNG2×PDF
Polynomial theorems

The Integer Root Theorem

A monic polynomial has only integer rational roots.
From the Rational Root Theorem to the Integer Root Theorem·/algebra/polynomials/rulesLearn Math Class
Recognising a monic polynomial before the search saves the 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.

Fact: Few terms, few real roots
Whatever its degree, a polynomial with kk nonzero terms has at most 2k−12k - 1 distinct real roots: at most k−1k - 1 sign changes for positive roots, as many for negative ones, plus possibly 00. So x100−1x^{100} - 1 has only two real roots, 11 and −1-1, out of its hundred.

To count positive real roots, write P(x)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)=x3−2x2−x+2P(x) = x^3 - 2x^2 - x + 2, the coefficient signs are +,−,−,++, -, -, +. The sign changes twice: from ++ to −- and from −- to ++. The polynomial has either 22 or 00 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)P(-x). Substituting −x-x gives P(−x)=−x3−2x2+x+2P(-x) = -x^3 - 2x^2 + x + 2, with signs −,−,+,+-, -, +, +. One sign change occurs, so the polynomial has exactly 11 negative real root.

Pitfall: Changing the sign of every term
Writing P(−x)P(-x) for x3−2x2−x+2x^3 - 2x^2 - x + 2 as −x3+2x2+x−2-x^3 + 2x^2 + x - 2 flips all four signs and gives 22 changes, so 22 or 00 negative roots. Only odd powers flip: −x3−2x2+x+2-x^3 - 2x^2 + x + 2 has 11 change, exactly 11 negative root.

The rule does not identify the roots or specify which of the possible counts is correct. For P(x)=x3−2x2−x+2P(x) = x^3 - 2x^2 - x + 2, the actual roots are 11, 22, and −1-1 — two positive and one negative, consistent with the prediction. But the rule alone cannot distinguish between 22 positive roots and 00 positive roots without further analysis.
x^3 - 2x^2 - x + 2 has two positive roots and one negative rootxy−2−1123−4−3−2−11234P(x): signs + − − +, 2 changes: 2 or 0 positive rootsP(−x): signs − − + +, 1 change: 1 negative rootactual roots: −1, 1, 2Descartes allows 2 positive, 1 negative root: here 1, 2 and −1
Checking Descartes' count against the graph

The section's x³ − 2x² − x + 2. The coefficients of P(x) change sign twice, so there are 2 or 0 positive roots; those of P(−x) change sign once, so there is exactly 1 negative root. The graph confirms the count: it crosses at x = 1 and x = 2 on the positive side and at x = −1 on the negative side.

The rule gives possible counts; finding the roots still takes the other tools on this page.
The polynomial of this section, one step at a time. Press Next to carry out each step.
DownloadPNG2×PDF
P(x)=x3−2x2−x+2P(x) = x^3 - 2x^2 - x + 2Step 1 of 6
Step
P(x)=x3−2x2−x+2P(x) = x^3 - 2x^2 - x + 2
1
List the coefficient signs of P(x)P(x) in standard form
+,−,−,++, -, -, +
2
Count the sign changes
22 changes
3
Positive real roots: that count, or less by an even number
22 or 00
4
Substitute −x-x and list the signs of P(−x)P(-x)
−x3−2x2+x+2-x^3 - 2x^2 + x + 2: −,−,+,+-, -, +, +
5
Negative real roots: count the sign changes of P(−x)P(-x)
11 change, so exactly 11
✓
Compare with the actual roots
11, 22, −1-1: two positive, one negative
The rule on one polynomialLearn Math Class

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)P(x) by (x−c)(x - c) where c>0c > 0 using synthetic division. If every entry in the bottom row is non-negative (positive or zero), then cc is an upper bound — no real root of P(x)P(x) exceeds cc.

The lower bound test is similar but uses a negative value of cc. Divide P(x)P(x) by (x−c)(x - c) where c<0c < 0. If the entries in the bottom row alternate in sign (with zeros counting as either sign), then cc is a lower bound — no real root is less than cc.

Example
For P(x)=x3−4x2+x+6P(x) = x^3 - 4x^2 + x + 6, synthetic division by (x−5)(x - 5) produces the row 1,1,6,361, 1, 6, 36 — all non-negative, so 55 is an upper bound. Synthetic division by (x+2)(x + 2), meaning c=−2c = -2, produces 1,−6,13,−201, -6, 13, -20 — the signs alternate, so −2-2 is a lower bound. All real roots of this polynomial lie in the interval [−2,5][-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.
DownloadPNG2×PDF
Layout
Bound typeCondition on the synthetic-division rowExample (P(x) = x³ − 4x² + x + 6)
Upper bound (c > 0)every entry in the bottom row is non-negativec = 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
Upper and Lower BoundsLearn Math Class
Two synthetic divisions can fence in every real root, so candidates outside the fence never need testing.

The Fundamental Theorem of Algebra

THEOREMFundamental Theorem of Algebra
The Fundamental Theorem of Algebra makes a sweeping guarantee: every polynomial of degree n≥1n \geq 1 with complex coefficients has exactly nn roots in the complex numbers, counted with multiplicity.

A quadratic has 22 roots. A cubic has 33. A degree-1010 polynomial has 1010. 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 x3−3x2+3x−1=(x−1)3x^3 - 3x^2 + 3x - 1 = (x - 1)^3 has degree 33 but only one distinct root, x=1x = 1, appearing with multiplicity 33. The count of nn roots includes these repetitions.

Pitfall: Expecting all roots to be real
Reading exactly nn roots as nn real roots: x3−x2+x−1x^3 - x^2 + x - 1 would then cross the x-axis three times. It factors as (x−1)(x2+1)(x - 1)(x^2 + 1), so it crosses only at x=1x = 1; the other roots are ±i\pm i.

For polynomials with real coefficients, an additional constraint applies: complex roots come in conjugate pairs. If a+bia + bi is a root, then a−bia - 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 55 and above, no general formula in radicals exists — the Abel–Ruffini theorem, with Galois later explaining which equations are solvable by radicals. Numerical methods, the Rational Root Theorem, and other tools from this page fill the gap between knowing roots exist and actually computing them.
Exactly nn roots, but where they live and how to find them are separate questions. The card keeps them apart.
DownloadPNG2×PDF
Polynomial theorems

The Fundamental Theorem of Algebra

Every polynomial of degree n≥1n \geq 1 has exactly nn complex roots, counted with multiplicity.
The theorem says
A polynomial of degree n≥1n \geq 1 with complex coefficients has exactly nn roots in the complex numbers, counted with multiplicity.
✕It does not say
A polynomial of degree nn has nn real roots and crosses the xx-axis nn times.
Expecting all roots to be real
Wrong workingx3−x2+x−1x^3 - x^2 + x - 1 has three roots, so its graph crosses the xx-axis three times.
Right workingIt factors as (x−1)(x2+1)(x - 1)(x^2 + 1): one crossing at x=1x = 1, the other two roots are ±i\pm i. Repeats count too: (x−1)3(x - 1)^3 has one distinct root with multiplicity 33.
Existence, not a method: for degree 55 and above no general formula in radicals exists (Abel–Ruffini). With real coefficients, complex roots come in conjugate pairs, so odd degree forces at least one real root.
The Fundamental Theorem of Algebra: what it does not say·/algebra/polynomials/rulesLearn Math Class
Existence is guaranteed; the finding is left to the other tools on this page.

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 x2+bx+cx^2 + bx + c with roots r1r_1 and r2r_2:

Vieta's Formulas
r1+r2=−br1⋅r2=cr_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 x3+bx2+cx+dx^3 + bx^2 + cx + d with roots r1r_1, r2r_2, r3r_3:

Vieta's Formulas
r1+r2+r3=−br_1 + r_2 + r_3 = -b

Vieta's Formulas
r1r2+r1r3+r2r3=cr_1r_2 + r_1r_3 + r_2r_3 = c

Vieta's Formulas
r1⋅r2⋅r3=−dr_1 \cdot r_2 \cdot r_3 = -d

THEOREMVieta's Formulas
The pattern extends to any degree: the kk-th elementary symmetric polynomial of the roots equals (−1)k(-1)^k times the coefficient of xn−kx^{n-k} in a monic degree-nn polynomial.

Pitfall: Taking the sum of the roots as b
Reading the sum of the roots of x2−5x+6x^2 - 5x + 6 as b=−5b = -5 clashes with its roots 22 and 33. The sum is −b=5-b = 5 and the product is c=6c = 6.

These relationships are useful for verifying factorizations.

Example
After finding roots 11, 22, and 33 for x3−6x2+11x−6x^3 - 6x^2 + 11x - 6, Vieta's formulas confirm: 1+2+3=6=−(−6)1 + 2 + 3 = 6 = -(-6), 1⋅2+1⋅3+2⋅3=111 \cdot 2 + 1 \cdot 3 + 2 \cdot 3 = 11, and 1⋅2⋅3=6=−(−6)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 (r1+r2+r3)2−2(r1r2+r1r3+r2r3)=36−22=14(r_1 + r_2 + r_3)^2 - 2(r_1r_2 + r_1r_3 + r_2r_3) = 36 - 22 = 14.
DownloadPNG2×PDF
Layout
Monic polynomialSum of rootsSum of pairwise productsProduct 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₃ = −br₁r₂ + r₁r₃ + r₂r₃ = cr₁ · r₂ · r₃ = −d
Vieta's FormulasLearn Math Class
Any symmetric expression in the roots can be computed from the coefficients, without solving for a single root.
The formulas as a check on a factorization, on the page’s cubic.
DownloadPNG2×PDF
Polynomial theorems

Vieta’s Formulas

Symmetric relationships between roots and coefficients.
TheoremFor a monic polynomial of degree nn, the kk-th elementary symmetric polynomial of the roots equals (−1)k(-1)^k times the coefficient of xn−kx^{n-k}.
1
Quadratic
x2+bx+cx^2 + bx + c with roots r1,r2r_1, r_2: r1+r2=−br_1 + r_2 = -b and r1r2=cr_1 r_2 = c.
2
Cubic
x3+bx2+cx+dx^3 + bx^2 + cx + d: r1+r2+r3=−br_1 + r_2 + r_3 = -b, r1r2+r1r3+r2r3=cr_1 r_2 + r_1 r_3 + r_2 r_3 = c, r1r2r3=−dr_1 r_2 r_3 = -d.
3
Check a factorization
x3−6x2+11x−6x^3 - 6x^2 + 11x - 6 with roots 1,2,31, 2, 3: 1+2+3=6=−(−6)1 + 2 + 3 = 6 = -(-6), 1⋅2+1⋅3+2⋅3=111 \cdot 2 + 1 \cdot 3 + 2 \cdot 3 = 11, 1⋅2⋅3=6=−(−6)1 \cdot 2 \cdot 3 = 6 = -(-6).
4
Without the roots
Sum of the squares of the roots: (r1+r2+r3)2−2(r1r2+r1r3+r2r3)=36−22=14(r_1 + r_2 + r_3)^2 - 2(r_1 r_2 + r_1 r_3 + r_2 r_3) = 36 - 22 = 14.
Taking the sum of the roots as bbReading the sum of the roots of x2−5x+6x^2 - 5x + 6 as b=−5b = -5 clashes with its roots 22 and 33. The sum is −b=5-b = 5 and the product is c=6c = 6.
Vieta’s formulas, applied·/algebra/polynomials/rulesLearn Math Class
The coefficients know the roots’ sum and product before the roots themselves are found.

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)P(x) by (x−c)(x - c) leaves a remainder of P(c)P(c). The Factor Theorem adds one specific condition: if that remainder is zero, then (x−c)(x - c) is a factor. Applying the Factor Theorem when P(c)≠0P(c) \neq 0 — concluding that (x−c)(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 a0a_0 and ana_n include both positive and negative values. The second is omitting fractional candidates when the leading coefficient is not 11. For 2x3+x−62x^3 + x - 6, candidates include ±12\pm\frac{1}{2} and ±32\pm\frac{3}{2}, not just integers.

In Descartes' Rule of Signs, the most common error occurs when computing P(−x)P(-x). Every odd-powered term changes sign while even-powered terms stay the same. Writing P(−x)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 x2+bx+cx^2 + bx + c is −b-b, not bb. The product of roots for a cubic x3+bx2+cx+dx^3 + bx^2 + cx + d is −d-d, not dd. The alternating sign pattern (−1)k(-1)^k is easy to lose track of, especially at higher degrees.
DownloadPNG2×PDF
Layout
TheoremCommon mistakeCorrect version
Remainder vs Factortreating (x − c) as a "partial factor" when P(c) ≠ 0Factor Theorem requires P(c) = 0 exactly; otherwise P(c) is just the remainder
Rational Root Theoremforgetting negative candidates, or skipping fractional candidates when aₙ ≠ 1include ± p ⁄ q for every p | a₀ and every q | aₙ
Descartes' Rulecomputing P(−x) incorrectly (changing wrong terms)only odd-powered terms flip sign; even-powered terms stay the same
Vieta's formulassign errors — writing sum as +b or product as +dk-th symmetric polynomial = (−1)ᵏ · (coefficient of xⁿ⁻ᵏ); alternating signs
Common MistakesLearn Math Class
DownloadPNG2×PDF
1Using the wrong sign of c
The divisor has a plus sign, as in (x+3)(x + 3), and the number shown in it is substituted directly. The theorem is stated for (x−c)(x - c), so the evaluation happens at the wrong point.
Wrong turn
Error here
For P(x)=x3−4x+2P(x) = x^3 - 4x + 2 divided by (x+3)(x + 3),
P(3)=27−12+2=17P(3) = 27 - 12 + 2 = 17
Right path
(x+3)=(x−(−3))(x + 3) = (x - (-3)), so c=−3c = -3 and
P(−3)=−27+12+2=−13P(-3) = -27 + 12 + 2 = -13
The remainder is −13-13.
Why it happensThe theorem is written with a minus sign in the divisor, so the sign of cc is the opposite of the sign that appears there. Reading the number straight off the divisor skips that step.
How to checkcc is the value that makes the divisor zero. x=−3x = -3 gives x+3=0x + 3 = 0; x=3x = 3 does not. Synthetic division by (x+3)(x + 3) gives the bottom row 1,−3,5,−131, -3, 5, -13, ending in the same remainder −13-13.
2Expecting all roots to be real
The Fundamental Theorem of Algebra promises nn roots for a polynomial of degree nn, and that is read as nn real roots, so nn crossings of the x-axis are expected.
Wrong turn
Error here
x3−x2+x−1x^3 - x^2 + x - 1 has degree 33, so its graph is expected to cross the x-axis three times. After the root x=1x = 1 is found, two more real roots are searched for, and none exists.
Right path
P(1)=1−1+1−1=0P(1) = 1 - 1 + 1 - 1 = 0, and dividing out (x−1)(x - 1) leaves x2+1x^2 + 1:
x3−x2+x−1=(x−1)(x2+1)x^3 - x^2 + x - 1 = (x - 1)(x^2 + 1)
The factor x2+1x^2 + 1 has roots ±i\pm i. The three roots are 11, ii and −i-i: one real, two complex.
Why it happensThe roots met in early work are real numbers, and the theorem's count of roots in the complex numbers is easy to read as a count of x-intercepts.
How to checkLook for real roots in each factor. x2+1=0x^2 + 1 = 0 needs x2=−1x^2 = -1, which no real number satisfies, and since x2+1>0x^2 + 1 > 0 for every xx, the graph of x3−x2+x−1x^3 - x^2 + x - 1 crosses the x-axis only at x=1x = 1.
Common pitfalls with the polynomial theorems·/algebra/polynomials/rulesLearn Math Class
Both slips read a theorem too quickly. The Remainder Theorem evaluates at the value cc that makes the divisor zero, so dividing by (x+3)(x + 3) means c=−3c = -3. The Fundamental Theorem of Algebra counts complex roots, so degree 33 guarantees three roots but not three real ones. Synthetic division confirms the first answer, and a look at the factor x2+1x^2 + 1 confirms the second.

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.
DownloadPNG2×PDF
Layout
TheoremWhat it doesWhen to useOutput
Remainder Theoremreplaces division by (x − c) with a single evaluationfind a remainder without long divisionremainder = P(c)
Factor Theoremlinks roots to linear factorsverify a factor, or build polynomials from known roots(x − c) is a factor ⟺ P(c) = 0
Rational Root Theoremrestricts rational roots to ± p ⁄ q with p | a₀, q | aₙpolynomial has integer coefficients; search for rational rootsfinite candidate list
Integer Root TheoremRRT simplified: all rational roots are integersmonic polynomial (aₙ = 1)candidates are divisors of a₀ only
Descartes' Rule of Signscounts sign changes in P(x) and P(−x)estimate count of positive and negative real roots before solvingupper bound on positive / negative roots (or less by an even number)
Upper / Lower Bound Testbrackets the interval containing all real roots via synthetic divisioncombine with RRT to eliminate candidates outside the bracketinterval [clow_{low}, chigh_{high}] containing every real root
Fundamental Theorem of Algebraguarantees every degree-n polynomial has exactly n roots over ℂ (with multiplicity)confirm the total number of roots to look forexistence guarantee; complex roots of real polynomials come in conjugate pairs
Vieta's Formulasexpress symmetric functions of roots from coefficients aloneverify a factorization, or work with sums/products of roots without finding themroot–coefficient identities (sum, pairwise products, full product)
Master Toolkit of Polynomial TheoremsLearn Math Class

Skills You Should Learn

Each skill opens its step-by-step method page. Skills marked "On this page" are taught above.
Taught on this page
More polynomial methods

Polynomial Rules FAQ

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

+
One is general, the other is a special case. The Remainder Theorem says dividing P(x)P(x) by (x−c)(x - c) always leaves the remainder P(c)P(c), whatever that value is. The Factor Theorem adds a condition: only when that remainder is zero is (x−c)(x - c) a factor. A nonzero remainder gives you information, not a partial factor.Read more →

Which candidates does the Rational Root Theorem actually list?

+
Every ratio of a divisor of the constant term to a divisor of the leading coefficient, taken with both signs. Two omissions are common: dropping the negative candidates, and forgetting fractions when the leading coefficient is not 11. For 2x3+x−62x^3 + x - 6 the list includes ±12\pm\frac{1}{2} and ±32\pm\frac{3}{2}, not just whole numbers.Read more →

Why do Vieta's formulas alternate signs?

+
Because expanding (x−r1)(x−r2)⋯(x - r_1)(x - r_2)\cdots introduces a factor of −1-1 with each root, giving the pattern (−1)k(-1)^k. So for x2+bx+cx^2 + bx + c the sum of roots is −b-b rather than bb, and for a cubic x3+bx2+cx+dx^3 + bx^2 + cx + d the product is −d-d rather than dd. Losing track of that alternation is the usual source of error at higher degrees.Read more →

How does the Rational Root Theorem show that 2\sqrt{2} is irrational?

+
2\sqrt{2} is a root of x2−2x^2 - 2, which is monic, so any rational root it has must be an integer dividing −2-2: one of ±1\pm 1 and ±2\pm 2. None of them squares to 22, so x2−2x^2 - 2 has no rational root and 2\sqrt{2} is irrational. The same argument shows that n\sqrt{n}, for any whole number nn, is either a whole number or irrational; (75)2=1.96\left(\frac{7}{5}\right)^2 = 1.96 comes close, but no fraction squares to exactly 22.Read more →

How many real roots can a polynomial with only a few terms have?

+
At most 2k−12k - 1 distinct real roots for kk nonzero terms, whatever the degree. Descartes' Rule of Signs allows at most k−1k - 1 sign changes, so at most k−1k - 1 positive roots, as many negative ones, plus possibly the root 00. That is why x100−1x^{100} - 1, with two terms, has only two real roots, 11 and −1-1; the other 9898 of its hundred roots are complex.Read more →

When does Descartes' Rule of Signs give an exact count?

+
When it counts 00 or 11 sign changes. The true number of positive roots is the number of sign changes or less by an even number, and neither 00 nor 11 can drop by 22. For x3−2x2−x+2x^3 - 2x^2 - x + 2, P(−x)=−x3−2x2+x+2P(-x) = -x^3 - 2x^2 + x + 2 has one sign change, so there is exactly one negative root, −1-1; the two changes in P(x)P(x) leave 22 or 00 positive roots undecided by the rule alone.Read more →