Precalculus with Integrated CalculusXYZ Homework Edition

⇩ Download ▾

2.2 The Remainder and Factor Theorems

In Section 2.1 we saw how much of the `local' behavior of the graph of a polynomial function is determined by the zeros of the polynomial function. In that section, the polynomial functions we were given were mostly, if not completely, factored which greatly simplified the process for determining zeros. In this section, we revisit the relationship between zeros and factors with the ultimate aim of taking a polynomial function given to us in the form stated in Definition 2.4 and determining its zeros.

We start by way of example: suppose we wish to determine the zeros of f ( x ) = x 3 + 4 x 2 5 x 14 . Setting f ( x ) = 0 results in the polynomial equation x 3 + 4 x 2 5 x 14 = 0 . Despite all of the factoring techniques we learned (and forgot!) in Intermediate Algebra, this equation foils1 us at every turn. Knowing that the zeros of f correspond to x -intercepts on the graph of y = f ( x ) , we use a graphing utility to produce the graph below on the left.

The graph suggests that the function has three zeros, one of which appears to be x = 2 and two others for whom we are provided what we assume to be decimal approximations: x 4.414 and x 1.586 . We can verify if these are zeros easily enough. We find f ( 2 ) = ( 2 ) 2 + 4 ( 2 ) 2 5 ( 2 ) 14 = 0 , but f ( 4.414 ) 0.0039 and f ( 1.586 ) 0.0022 , While these last two values are probably by some measures, `close' to 0 , they are not exactly equal to 0 . The question becomes: is there a way to use the fact that x = 2 is a zero to obtain the other two zeros?

Based on our experience, if x = 2 is a zero, it seems that there should be a factor of ( x 2 ) lurking around in the factorization of f ( x ) . In other words, we should expect that x 3 + 4 x 2 5 x 14 = ( x 2 ) q ( x ) , where q ( x ) is some other polynomial. How could we find such a q ( x ) , if it even exists? The answer comes from our old friend, polynomial division. (See Section A.8.2.) Below on the right, we perform the long division: ( x 3 + 4 x 2 5 x 14 ) ÷ ( x 2 ) and obtain x 2 + 6 x + 7 .

Image: PolyDiv01
Figure 2.65

x 2 + 6 x + 7 x 2 x 3 + 4 x 2 5 x 14 ( x 3 2 x 2 ) 6 x 2 5 x ( 6 x 2 12 x ) 7 x 14 ( 7 x 14 ) 0

Said differently, f ( x ) = x 3 + 4 x 2 5 x 14 = ( x 2 ) ( x 2 + 6 x + 7 ) . Using this form of f ( x ) , we find the zeros by solving ( x 2 ) ( x 2 + 6 x + 7 ) = 0 . Setting each factor equal to 0 , we get x 2 = 0 (which gives us our known zero, x = 2 ) as well as x 2 + 6 x + 7 = 0 . The latter doesn't factor nicely, so we apply the Quadratic Formula to get x = 3 ± 2 . Sure enough, 3 2 4.414 and 3 + 2 1.586 . We leave it to the reader to show f ( 3 2 ) = 0 and f ( 3 + 2 ) = 0 . (See Exercise.)

The point of this section is to generalize the technique applied here. First up is a friendly reminder of what we can expect when we divide polynomials.

As you may recall, all of the polynomials in Theorem 2.6 have special names. The polynomial p is called the dividend; d is the divisor; q is the quotient; r is the remainder. If r ( x ) = 0 then d is called a factor of p . The word `unique' here is critical in that it guarantees there is only one quotient and remainder for each division problem.2 The proof of Theorem 2.6 is usually relegated to a course in Abstract Algebra, but we can still use the result to establish two important facts which are the basis of the rest of the chapter.

The proof of Theorem 2.7 is a direct consequence of Theorem 2.6. Since x c has degree 1 , when a polynomial function is divided by x c , the remainder is either 0 or degree 0 (i.e., a nonzero constant.) In either case, p ( x ) = ( x c ) q ( x ) + r , where r , the remainder, is a real number, possibly 0 . It follows that p ( c ) = ( c c ) q ( c ) + r = 0 q ( c ) + r = r , so we get r = p ( c ) as required. There is one last `low hanging fruit'3 to collect which we present below.

Once again, we see the phrase `if and only if' which means there are really two things being said in The Factor Theorem: if ( x c ) is a factor of p ( x ) , then c is a zero of p and the only way c is a zero of p is if ( x c ) is a factor of p ( x ) .

We argue the Factor Theorem as follows: if ( x c ) is a factor of p ( x ) , then p ( x ) = ( x c ) q ( x ) for some polynomial q . Hence, p ( c ) = ( c c ) q ( c ) = 0 , so c is a zero of p . Conversely, suppose c is a zero of p , so p ( c ) = 0 . The Remainder Theorem tells us p ( x ) = ( x c ) q ( x ) + p ( c ) = ( x c ) q ( x ) + 0 = ( x c ) q ( x ) . Hence, ( x c ) is a factor of p ( x ) .

We have enough theory to explain why the concept of multiplicity (Definition 2.6) is well-defined. If c is a zero of p , then The Factor Theorem tells us there is a polynomial function q 1 so that p ( x ) = ( x c ) q 1 ( x ) . If q 1 ( c ) = 0 , then we apply the Factor Theorem to q 1 and find a polynomial q 2 so that q 1 ( x ) = ( x c ) q 2 ( x ) . Hence, we have

p ( x ) = ( x c ) q 1 ( x ) = ( x c ) ( x c ) q 2 ( x ) = ( x c ) 2 q 2 ( x ) .

We now `rinse and repeat' this process. Since the degree of p is a finite number, this process has to end at some point. That is we arrive at a factorization p ( x ) = ( x c ) m q ( x ) where q ( c ) 0 . Suppose we arrive at a different factorization of p using other methods. That is, we find p ( x ) = ( x c ) k Q ( x ) , where Q is a polynomial function with Q ( c ) 0 . Then we have ( x c ) m q ( x ) = ( x c ) k Q ( x ) .

If m k , then either m < k or m > k . If m < k , then we may divide both sides by ( x c ) m to get: q ( x ) = ( x c ) k m Q ( x ) . Since k > m , k m > 0 and we would have q ( c ) = ( c c ) k m Q ( c ) = 0 , a contradiction since we are assuming q ( c ) 0 . The assumption that m > k likewise ends in a contradiction. Therefore, we have m = k , so p ( x ) = ( x c ) m q ( x ) = ( x c ) m Q ( x ) . By the uniqueness guaranteed in Theorem 2.6, we must have that q ( x ) = Q ( x ) . Hence, the number m and quotient polynomial q ( x ) are unique.

The process outlined above, in which we coax out factors of p ( x ) one at a time until we have all of them serves as a template for our work to come. Of the things The Factor Theorem tells us, the most pragmatic is that we had better find a more efficient way to divide polynomial functions by quantities of the form x c . Fortunately, people like Ruffini and Horner have already blazed this trail. Let's take a closer look at the long division we performed at the beginning of the section and try to streamline it. First off, let's change all of the subtractions into additions by distributing through the 1 s.

x 2 + 6 x + 7 x 2 x 3 + 4 x 2 5 x 14 x 3 + 2 x 2 6 x 2 5 x 6 x 2 + 12 x 7 x 14 7 x + 14 0

Next, observe that the terms x 3 , 6 x 2 and 7 x are the exact opposite of the terms above them. The algorithm we use ensures this is always the case, so we can omit them without losing any information.

Also note that the terms we `bring down' (namely the 5 x and 14 ) aren't really necessary to recopy, so we omit them, too.

x 2 + 6 x + 7 x 2 x 3 + 4 x 2 5 x 14 2 x 2 6 x 2 12 x 7 x 14 0

Let's move terms up a bit and copy the x 3 into the last row.

x 2 + 6 x + 7 x 2 x 3 + 4 x 2 5 x 14 2 x 2 12 x 14 x 3 6 x 2 7 x 0

Note that by arranging things in this manner, each term in the last row is obtained by adding the two terms above it. Notice also that the quotient polynomial can be obtained by dividing each of the first three terms in the last row by x and adding the results.

If you take the time to work back through the original division problem, you will find that this is exactly the way we determined the quotient polynomial. This means that we no longer need to write the quotient polynomial down, nor the x in the divisor, to determine our answer.

2 x 3 + 4 x 2 5 x 14 2 x 2 12 x 14 x 3 6 x 2 7 x 0

We've streamlined things quite a bit so far, but we can still do more. Let's take a moment to remind ourselves where the 2 x 2 , 12 x and 14 came from in the second row. Each of these terms was obtained by multiplying the terms in the quotient, x 2 , 6 x and 7 , respectively, by the 2 in x 2 , then by 1 when we changed the subtraction to addition.

Multiplying by 2 then by 1 is the same as multiplying by 2 , so we replace the 2 in the divisor by 2 . Furthermore, the coefficients of the quotient polynomial match the coefficients of the first three terms in the last row, so we now take the plunge and write only the coefficients of the terms to get

2 1 4 5 14 2 12 14 1 6 7 0

We have constructed a synthetic division tableau for this polynomial division problem. Let's re-work our division problem using this tableau to see how it greatly streamlines the division process.

To divide x 3 + 4 x 2 5 x 14 by x 2 , we write 2 in the place of the divisor and the coefficients of x 3 + 4 x 2 5 x 14 in for the dividend. Then `bring down' the first coefficient of the dividend.

Next, take the 2 from the divisor and multiply by the 1 that was `brought down' to get 2 . Write this underneath the 4 , then add to get 6 .

Now take the 2 from the divisor times the 6 to get 12 , and add it to the 5 to get 7 .

Finally, take the 2 in the divisor times the 7 to get 14 , and add it to the 14 to get 0 .

The first three numbers in the last row of our tableau are the coefficients of the quotient polynomial. Remember, we started with a third degree polynomial and divided by a first degree polynomial, so the quotient is a second degree polynomial. Hence the quotient is x 2 + 6 x + 7 .

The number in the box is the remainder. Synthetic division is our tool of choice for dividing polynomials by divisors of the form x c . It is important to note that it works only for these kinds of divisors.4

Also take note that when a polynomial (of degree at least 1 ) is divided by x c , the result will be a polynomial of exactly one less degree. Finally, it is worth the time to trace each step in synthetic division back to its corresponding step in long division. While the authors have done their best to indicate where the algorithm comes from, there is no substitute for working through it yourself.

The next example pulls together all of the concepts discussed in this section.

Our next example demonstrates how we can extend the synthetic division tableau to accommodate zeros of multiplicity greater than 1 .

A couple of things about the last example are worth mentioning. First, the extension of the synthetic division tableau for repeated divisions will be a common site in the sections to come. Typically, we will start with a higher order polynomial and peel off one zero at a time until we are left with a quadratic, whose roots can always be found using the Quadratic Formula.

Secondly, we found x = ± 3 are zeros of p . The Factor Theorem guarantees ( x 3 ) and ( x ( 3 ) ) are both factors of p . We can certainly put the Factor Theorem to the test and continue the synthetic division tableau from above to see what happens.

1 2 4 4 11 12 3 2 1 6 3 1 2 4 2 12 6 0 2 0 6 3 4 0 12 0 4 3 12 3 4 4 3 0 4 3 4 0

This gives us

p ( x ) = 4 x 4 4 x 3 11 x 2 + 12 x 3 = ( x 1 2 ) 2 ( x 3 ) ( x ( 3 ) ) ( 4 ) = 4 ( x 1 2 ) 2 ( x 3 ) ( x ( 3 ) )

We have shown that p is a product of its leading coefficient times linear factors of the form ( x c ) where c are zeros of p . It may surprise and delight the reader that, in theory, all polynomials can be reduced to this kind of factorization. We leave that discussion to Section 2.4, because the zeros may not be real numbers. Our final theorem in the section gives us an upper bound on the number of real zeros.

Theorem 2.9 is a consequence of the Factor Theorem and polynomial multiplication. Every zero c of f gives us a factor of the form ( x c ) for f ( x ) . Since f has degree n , there can be at most n of these factors. The next section provides us some tools which not only help us determine where the real zeros are to be found, but which real numbers they may be.

We close this section with a summary of several concepts previously presented. You should take the time to look back through the text to see where each concept was first introduced and where each connection to the other concepts was made.

Connections Between Zeros, Factors and Graphs of Polynomial Functions

Suppose p is a polynomial function of degree n 1 . The following statements are equivalent:

Exercises

In Exercises -, use synthetic division to perform the following polynomial divisions. Identify the quotient and remainder. Write the divisor, quotient and remainder in the form given in Theorem 2.6.

  1. ( 3 x 2 2 x + 1 ) ÷ ( x 1 )
  2. ( x 2 5 ) ÷ ( x 5 )
  3. ( 3 4 t 2 t 2 ) ÷ ( t + 1 )
  4. ( 4 t 2 5 t + 3 ) ÷ ( t + 3 )
  5. ( z 3 + 8 ) ÷ ( z + 2 )
  6. ( 4 z 3 + 2 z 3 ) ÷ ( z 3 )
  7. ( 18 x 2 15 x 25 ) ÷ ( x 5 3 )
  8. ( 4 x 2 1 ) ÷ ( x 1 2 )
  9. ( 2 t 3 + t 2 + 2 t + 1 ) ÷ ( t + 1 2 )
  10. ( 3 t 3 t + 4 ) ÷ ( t 2 3 )
  11. ( 2 z 3 3 z + 1 ) ÷ ( z 1 2 )
  12. ( 4 z 4 12 z 3 + 13 z 2 12 z + 9 ) ÷ ( z 3 2 )
  13. ( x 4 6 x 2 + 9 ) ÷ ( x 3 )
  14. ( x 6 6 x 4 + 12 x 2 8 ) ÷ ( x + 2 )

In Exercises -, find p ( c ) using the Remainder Theorem. If p ( c ) = 0 , use the Factor Theorem to partially factor the polynomial function.

  1. p ( x ) = 2 x 2 x + 1 , c = 4
  2. p ( x ) = 4 x 2 33 x 180 , c = 12
  3. p ( t ) = 2 t 3 t + 6 , c = 3
  4. p ( t ) = t 3 + 2 t 2 + 3 t + 4 , c = 1
  5. p ( z ) = 3 z 3 6 z 2 + 4 z 8 , c = 2
  6. p ( z ) = 8 z 3 + 12 z 2 + 6 z + 1 , c = 1 2
  7. p ( x ) = x 4 2 x 2 + 4 , c = 3 2
  8. p ( x ) = 6 x 4 x 2 + 2 , c = 2 3
  9. p ( t ) = t 4 + t 3 6 t 2 7 t 7 , c = 7
  10. p ( t ) = t 2 4 t + 1 , c = 2 3

In Exercises -, you are given a polynomial function and one of its zeros. Find the remaining real zeros and factor the polynomial.

  1. x 3 6 x 2 + 11 x 6 , c = 1
  2. x 3 24 x 2 + 192 x 512 , c = 8
  3. 3 t 3 + 4 t 2 t 2 , c = 2 3
  4. 2 t 3 3 t 2 11 t + 6 , c = 1 2
  5. z 3 + 2 z 2 3 z 6 , c = 2
  6. 2 z 3 z 2 10 z + 5 , c = 1 2
  7. 4 x 4 28 x 3 + 61 x 2 42 x + 9 , c = 1 2 is a zero of multiplicity 2
  8. t 5 + 2 t 4 12 t 3 38 t 2 37 t 12 , c = 1 is a zero of multiplicity 3
  9. 125 z 5 275 z 4 2265 z 3 3213 z 2 1728 z 324 , c = 3 5 is a zero of multiplicity 3
  10. x 2 2 x 2 , c = 1 3
  11. Find a quadratic polynomial with integer coefficients which has x = 3 5 ± 29 5 as its real zeros.
  12. For f ( x ) = x 3 + 4 x 2 5 x 14 , show f ( 3 2 ) = 0 and f ( 3 + 2 ) = 0 two ways:

    1. By direct substitution.
    2. Using synthetic division and the Factor Theorem
  13. Let f ( x ) = a n x n + a n 1 x n 1 + + a 2 x 2 + a 1 x + a 0 be a polynomial function with the property that a n + a n 1 + + a 1 + a 0 = 0 . (That is, the sum of the coefficients and the constant term is 0 .)

    Prove that ( x 1 ) is a factor of f ( x ) .

    HINT: Show f ( 1 ) = 0 and invoke the Factor Theorem

  14. Verify the result in number with the functions: f ( x ) = x 3 2 x + 1 and f ( x ) = 3 x 4 x 2 .
  15. Suppose a is a nonzero real number. Find the quotients below, using synthetic division as required.

    • x a x a
    • x 2 a 2 x a
    • x 3 a 3 x a
    • x 4 a 4 x a
    • x 5 a 5 x a

    Based on the pattern that evolves, find the quotient: x 10 a 10 x a . What about x n a n x a ?

  16. Use your result from number to rewrite the sum: 1 + r + r 2 + + r n 2 + r n 1 as a quotient. What assumptions need to be made about r ?

Answers

  1. ( 3 x 2 2 x + 1 ) = ( x 1 ) ( 3 x + 1 ) + 2
  2. ( x 2 5 ) = ( x 5 ) ( x + 5 ) + 20
  3. ( 3 4 t 2 t 2 ) = ( t + 1 ) ( 2 t 2 ) + 5
  4. ( 4 t 2 5 t + 3 ) = ( t + 3 ) ( 4 t 17 ) + 54
  5. ( z 3 + 8 ) = ( z + 2 ) ( z 2 2 z + 4 ) + 0
  6. ( 4 z 3 + 2 z 3 ) = ( z 3 ) ( 4 z 2 + 12 z + 38 ) + 111
  7. ( 18 x 2 15 x 25 ) = ( x 5 3 ) ( 18 x + 15 ) + 0
  8. ( 4 x 2 1 ) = ( x 1 2 ) ( 4 x + 2 ) + 0
  9. ( 2 t 3 + t 2 + 2 t + 1 ) = ( t + 1 2 ) ( 2 t 2 + 2 ) + 0
  10. ( 3 t 3 t + 4 ) = ( t 2 3 ) ( 3 t 2 + 2 t + 1 3 ) + 38 9
  11. ( 2 z 3 3 z + 1 ) = ( z 1 2 ) ( 2 z 2 + z 5 2 ) 1 4
  12. ( 4 z 4 12 z 3 + 13 z 2 12 z + 9 ) = ( z 3 2 ) ( 4 z 3 6 z 2 + 4 z 6 ) + 0
  13. ( x 4 6 x 2 + 9 ) = ( x 3 ) ( x 3 + 3 x 2 3 x 3 3 ) + 0
  14. ( x 6 6 x 4 + 12 x 2 8 ) = ( x + 2 ) ( x 5 2 x 4 4 x 3 + 4 2 x 2 + 4 x 4 2 ) + 0
  15. p ( 4 ) = 29
  16. p ( 12 ) = 0 , p ( x ) = ( x 12 ) ( 4 x + 15 )
  17. p ( 3 ) = 45
  18. p ( 1 ) = 2
  19. p ( 2 ) = 0 , p ( z ) = ( z 2 ) ( 3 z 2 + 4 )
  20. p ( 1 2 ) = 0 , p ( z ) = ( z + 1 2 ) ( 8 z 2 + 8 z + 2 )
  21. p ( 3 2 ) = 73 16
  22. p ( 2 3 ) = 74 27
  23. p ( 7 ) = 0 , p ( t ) = ( t + 7 ) ( t 3 + ( 1 7 ) t 2 + ( 1 7 ) t 7 )
  24. p ( 2 3 ) = 0 , p ( t ) = ( t ( 2 3 ) ) ( t ( 2 + 3 ) )
  25. x 3 6 x 2 + 11 x 6 = ( x 1 ) ( x 2 ) ( x 3 )
  26. x 3 24 x 2 + 192 x 512 = ( x 8 ) 3
  27. 3 t 3 + 4 t 2 t 2 = 3 ( t 2 3 ) ( t + 1 ) 2
  28. 2 t 3 3 t 2 11 t + 6 = 2 ( t 1 2 ) ( t + 2 ) ( t 3 )
  29. z 3 + 2 z 2 3 z 6 = ( z + 2 ) ( z + 3 ) ( z 3 )
  30. 2 z 3 z 2 10 z + 5 = 2 ( z 1 2 ) ( z + 5 ) ( z 5 )
  31. 4 x 4 28 x 3 + 61 x 2 42 x + 9 = 4 ( x 1 2 ) 2 ( x 3 ) 2
  32. t 5 + 2 t 4 12 t 3 38 t 2 37 t 12 = ( t + 1 ) 3 ( t + 3 ) ( t 4 )
  33. 125 z 5 275 z 4 2265 z 3 3213 z 2 1728 z 324 = 125 ( z + 3 5 ) 3 ( z + 2 ) ( z 6 )
  34. x 2 2 x 2 = ( x ( 1 3 ) ) ( x ( 1 + 3 ) )
  35. p ( x ) = 5 x 2 6 x 4
    • For f ( x ) = x 3 2 x + 1 , the coefficients 1 + ( 2 ) + 1 = 0 and f ( x ) = ( x 1 ) ( x 2 + x 1 ) .
    • For f ( x ) = 3 x 4 x 2 the coefficients 3 + ( 1 ) + ( 2 ) = 0 and f ( x ) = ( x 1 ) ( 3 x 3 + 3 x 2 + 3 x + 2 ) .
    • x a x a = 1
    • x 2 a 2 x a = x + a
    • x 3 a 3 x a = x 2 + a x + a 2
    • x 4 a 4 x a = x 3 + a x 2 + a 2 x + a 3
    • x 5 a 5 x a = x 4 + a x 3 + a 2 x 2 + a 3 x + a 4

    Following the pattern:

    • x 10 a 10 x a = x 9 + a x 8 + a 2 x 7 + a 3 x 6 + a 4 x 5 + a 5 x 4 + a 6 x 3 + a 7 x 2 + a 8 x + a 9
    • x n a n x a = x n 1 + a x n 2 + a 2 x n 3 + + a n 2 x + a n 1
  36. Put x = 1 and a = r so that 1 + r + r 2 + + r n 2 + r n 1 = 1 r n 1 r . Here, r 1 as otherwise we'd be dividing by 0 .

Adapted from Precalculus, Preliminary 4th Edition (integrated calculus), by Carl Stitz and Jeff Zeager (stitz-zeager.com), licensed under CC BY-NC-SA 3.0. Changes were made: reformatted as an accessible XYZ web edition. License: CC-BY-NC-SA-3.0.

These eBooks are a prerelease and are not yet certified conformant with WCAG 2.1 AA or ADA Title II. Every page is built against an automated accessibility gate, and the published editions will meet ADA Title II requirements when they release in late September 2026. If something is unusable, please tell us.