The Remainder Theorem connects division and evaluation: the remainder when a polynomial is divided by is exactly . This means synthetic division does double duty as a fast method for evaluating polynomials. Its immediate consequence, the Factor Theorem, characterizes roots in terms of factors and is the foundation for all polynomial factoring.
Quick Reference
| Result | Statement |
|---|---|
| Remainder Theorem | Remainder of equals |
| Factor Theorem | is a factor of |
| Root test | To check if is a root of , divide synthetically and check if |
| Polynomial evaluation | can be computed as the remainder of synthetic division by |
| Corollary | If and , then divides |
| Degree bound | A degree- polynomial has at most roots |
The Remainder Theorem
When a polynomial is divided by , the remainder equals .
Proof
Let be the quotient and the remainder when is divided by . By the division algorithm: Since has degree less than 1 (the degree of ), is a constant. This identity holds for all values of . Setting : Therefore .
Evaluating Polynomials via Synthetic Division
The Remainder Theorem makes synthetic division a rapid evaluation tool. To find , divide by synthetically; the last entry in the bottom row is .
Find where .
Solution
Direct substitution: $f(4) = 5(256) - 12(64) - 20(16) - 43(4) + 6 = 1280 - 768 - 320 - 172 + 6 = 26.$ Synthetic division by : The remainder is . Both methods agree, confirming the Remainder Theorem.
The Factor Theorem
(Factor Theorem) A polynomial vanishes when (i.e., ) if and only if is a factor of .
Proof
By the Remainder Theorem, when is divided by : If , then , so is a factor. Conversely, if is a factor, the division is exact and the remainder is 0, so .If is exactly divisible by , find .
Solution
By the Factor Theorem, must be a root:Show that is exactly divisible by if is odd, but not if is even.
Solution
By the Factor Theorem, is a factor if and only if where . If is odd: , so . Thus is a factor. If is even: , so . This is zero only when . For , is not a factor.
Consequences of the Factor Theorem
If vanishes at and also at (with ), then divides .
Proof
Since , is a factor: . Substituting : . Since , we have , so . By the Factor Theorem applied to , is a factor of : . Therefore .The same reasoning extends to any finite set of distinct roots:
If vanishes at (all distinct), then divides .
Find a degree-2 polynomial that equals 0 when and , and equals 6 when .
Solution
Since vanishes at and , the factor theorem gives for some constant . Using : , so . Therefore .Find a degree-3 polynomial that vanishes at and , equals 6 when , and equals 18 when .
Solution
Since vanishes at and , we have . Using the conditions and : Subtracting: , so and . Therefore .
Degree Bound on the Number of Roots
A polynomial of degree can have at most distinct roots.
Proof
If had more than distinct roots, it would be divisible by the product of more than linear factors . That product has degree greater than , which is impossible for a degree- polynomial.An important corollary gives a very useful identity principle:
If two polynomials of degree at most agree at more than values of , then they are identical: all their corresponding coefficients are equal.
This means that if you know a polynomial of degree by its values at or more points, you know it completely.