Three Techniques for Evaluating and Finding Zeros of Polynomial Functions

In the last section, we learned how to divide polynomials. We can now use polynomial division to evaluate polynomials using the Remainder Theorem. If the polynomial is divided by $x–k$, the remainder may be found quickly by evaluating the polynomial function at $k$, that is, $f(k)$. Let's walk through the proof of the theorem.

Recall that the Division Algorithm states that, given a polynomial dividend $f(x)$ and a non-zero polynomial divisor $d(x)$, there exist unique polynomials $q(x)$ and $r(x)$ such that

$f(x)=d(x) q(x)+r(x)$

and either $r(x)=0$ or the degree of $r(x)$ is less than the degree of $d(x)$. In practice divisors, $d(x)$ will have degrees less than or equal to the degree of $f(x)$. If the divisor, $d(x)$, is $x−k$, this takes the form

$f(x)=(x-k) q(x)+r$

Since the divisor $x−k$ is linear, the remainder will be a constant, $r$. And, if we evaluate this for $x=k$, we have

$\begin{aligned} f(k) &=(k-k) q(k)+r \\ &=0 \cdot q(k)+r \\ &=r \end{aligned}$

In other words, $f(k)$ is the remainder obtained by dividing $f(x)$ by $x−k$.