| 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 |
| 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 |
| 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ₙ ≠ 1 | include ± p ⁄ q for every p | a₀ and every q | aₙ |
| 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)ᵏ · (coefficient of xⁿ⁻ᵏ); alternating signs |
| 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ₙ | polynomial has integer coefficients; search for rational roots | finite candidate list |
| Integer Root Theorem | RRT simplified: all rational roots are integers | monic polynomial (aₙ = 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, c] 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) |