Difference between revisions of "Polynomial remainder theorem"
Etmetalakret (talk | contribs) |
Etmetalakret (talk | contribs) |
||
Line 2: | Line 2: | ||
== Proof == | == Proof == | ||
− | We use | + | We use Euclidean polynomial division with dividend <math>P(x)</math> and divisor <math>x-a</math>. The result states that there exists a quotient <math>Q(x)</math> and remainder <math>R(x)</math> such that <cmath>P(x) = (x-a) Q(x) + R(x),</cmath> with <math>\deg R(x) < \deg (x-a)</math>. We wish to show that <math>R(x)</math> is equal to the constant <math>f(a)</math>. Because <math>\deg (x-a) = 1</math>, <math>\deg R(x) < 1</math>. Hence, <math>R(x)</math> is a constant, <math>r</math>. Plugging this into our original equation and rearranging a bit yields <cmath>r = P(x) - (x-a) Q(x).</cmath> After substituting <math>x=a</math> into this equation, we deduce that <math>r = P(a)</math>; thus, the remainder upon diving <math>P(x)</math> by <math>x-a</math> is equal to <math>P(a)</math>, as desired. <math>\square</math> |
== Generalization == | == Generalization == |
Revision as of 16:27, 5 November 2021
In algebra, the polynomial remainder theorem states that the remainder upon dividing any polynomial by a linear polynomial , both with complex coefficients, is equal to .
Contents
Proof
We use Euclidean polynomial division with dividend and divisor . The result states that there exists a quotient and remainder such that with . We wish to show that is equal to the constant . Because , . Hence, is a constant, . Plugging this into our original equation and rearranging a bit yields After substituting into this equation, we deduce that ; thus, the remainder upon diving by is equal to , as desired.
Generalization
The strategy used in the above proof can be generalized to divisors with degree greater than . A more general method, with any dividend and divisor , is to write , and then substitute the zeroes of to eliminate and find values of . Example 2 showcases this strategy.
Examples
Here are some problems that can be cracked by the remainder theorem or its adjacent ideas.
Example 1
What is the remainder when is divided by ?
Solution: Although one could use long or synthetic division, the remainder theorem provides a significantly shorter solution. Note that , and . A common mistake is to forget to flip the negative sign and assume , but simplifying the linear equation yields . Thus, the answer is , or , which is equal to . .
Example 2
[Insert problem involving the generalization of the remainder theorem]