The Factor Theorem

Learning goals

  • State the master identity P(x)=(x−c)Q(x)+P(c)P(x) = (x - c)Q(x) + P(c)
  • Decide whether any linear expression, monic or not, is a factor of P(x)P(x) with one evaluation
  • Turn one known root into a factor by division, then keep searching inside the smaller quotient
  • Build a polynomial from prescribed real and nonreal roots plus one extra condition
  • Explain why a nonzero polynomial of degree nn has at most nn roots

Roots and factors, two languages

The small example above is the pattern; here is the general rule behind it. Two definitions sit at the center of this chapter, and they live in different worlds. A number cc is a root (or zero) of the polynomial P(x)P(x) when P(c)=0P(c) = 0. That is an arithmetic statement: plug in one number, get zero out. By contrast, a polynomial D(x)D(x) is a factor of P(x)P(x) when

P(x)=D(x) Q(x)for some polynomial Q(x),P(x) = D(x)\,Q(x) \qquad \text{for some polynomial } Q(x),

exactly as 33 is a factor of 1212 because 12=3⋅412 = 3 \cdot 4 with nothing left over. That is an algebraic statement about an identity that must hold for every value of xx at once. One definition asks about a single evaluation; the other asks about an exact division. There is no obvious reason these two ideas should have anything to do with each other. Yet the theorem of this lesson says that, for linear divisors, they are the very same thing.

The bridge between the two worlds was built in the last two lessons. Dividing P(x)P(x) by x−cx - c produces a quotient and a remainder,

P(x)=(x−c) Q(x)+R,P(x) = (x - c)\,Q(x) + R,

where the remainder has degree smaller than the divisor x−cx - c, so RR is a constant. The remainder theorem then identifies which constant: substituting x=cx = c kills the first term and leaves R=P(c)R = P(c). So for every polynomial P(x)P(x) and every number cc there is a single master identity,

P(x)=(x−c) Q(x)+P(c),P(x) = (x - c)\,Q(x) + P(c),

and everything in this lesson is a consequence of reading it carefully.

Check your understanding

Dividing P(x)P(x) by x−4x - 4 gives a quotient Q(x)Q(x) and leaves remainder 77. What is P(4)P(4)?

Answer choices

The Factor Theorem

The Factor Theorem. Let P(x)P(x) be a polynomial and let cc be a number. Then x−cx - c is a factor of P(x)P(x) if and only if P(c)=0P(c) = 0.

Take the phrase “if and only if” seriously: it is two separate claims bundled into one sentence. It claims that a root produces a factor, and it also claims that a factor produces a root. A statement of this shape is only proved when both directions are proved, so the proof below does them one at a time.

Proof of the Factor Theorem, both directions#

Divide P(x)P(x) by x−cx - c. As recalled above, the division algorithm and the remainder theorem together give the identity

P(x)=(x−c) Q(x)+P(c),P(x) = (x - c)\,Q(x) + P(c),

valid for every xx, where Q(x)Q(x) is the quotient.

First suppose P(c)=0P(c) = 0. The identity collapses to P(x)=(x−c) Q(x)P(x) = (x - c)\,Q(x), which is precisely the definition of ”x−cx - c is a factor of P(x)P(x)”: the division came out exact, and Q(x)Q(x) is the other factor. This is the direction that manufactures factorizations out of roots.

Now suppose instead that x−cx - c is a factor of P(x)P(x), so that P(x)=(x−c) S(x)P(x) = (x - c)\,S(x) for some polynomial S(x)S(x). A factorization is an identity, true for every value of xx, so it is in particular true at x=cx = c:

P(c)=(c−c) S(c)=0⋅S(c)=0.P(c) = (c - c)\,S(c) = 0 \cdot S(c) = 0.

So cc is a root. Notice this direction did not even need the remainder theorem, only the freedom to evaluate an identity at the most convenient point. You can also see it through remainders: if the division by x−cx - c is exact, the remainder is 00, and the remainder theorem says the remainder is P(c)P(c), so P(c)=0P(c) = 0. Both directions are established, so the theorem holds as a genuine biconditional.

The two directions do different jobs, and you will use both constantly. Read left to right, a known factorization hands you roots for free: from P(x)=(x−2)(x+7)Q(x)P(x) = (x - 2)(x + 7)Q(x) you may write down P(2)=0P(2) = 0 and P(−7)=0P(-7) = 0 without computing anything. Read right to left, a known root hands you a factor, together with a genuine factorization P(x)=(x−c) Q(x)P(x) = (x - c)\,Q(x) whose quotient you can compute by synthetic or long division. And because the theorem is a biconditional, one evaluation settles the factor question in either direction: P(c)=0P(c) = 0 means x−cx - c is a factor, and P(c)≠0P(c) \neq 0 means it is not. Nothing is left undecided.

One small generalization is worth recording now, because factors are not always monic. To test whether 2x−12x - 1 is a factor of P(x)P(x), find the number that makes 2x−12x - 1 equal to 00: that is x=12x = \tfrac{1}{2}. Evaluate there. P ⁣(12)=0P\!\left(\tfrac{1}{2}\right) = 0 means 2x−12x - 1 is a factor; anything else means it is not. The rule of thumb covers every case: test the value that kills the candidate factor. For x+5x + 5 that value is −5-5, because x+5=x−(−5)x + 5 = x - (-5).

The general version, for anyone who wants to see why it works: for a≠0a \neq 0,

ax−b=a(x−ba),ax - b = a\left(x - \tfrac{b}{a}\right),

and multiplying a divisor by a nonzero constant never changes whether a division is exact: if P(x)=(x−ba)Q(x)P(x) = \left(x - \tfrac{b}{a}\right)Q(x), then P(x)=(ax−b)⋅1aQ(x)P(x) = (ax - b) \cdot \tfrac{1}{a}Q(x), and 1aQ(x)\tfrac{1}{a}Q(x) is still a polynomial. So ax−bax - b is a factor of P(x)P(x) exactly when P ⁣(ba)=0P\!\left(\tfrac{b}{a}\right) = 0, matching the shortcut above.

Check your understanding

Is x+3x + 3 a factor of P(x)=x3+2x2−5x−6P(x) = x^3 + 2x^2 - 5x - 6?

Answer choices

Check your understanding

Is 2x−12x - 1 a factor of P(x)=2x3+x2−5x+2P(x) = 2x^3 + x^2 - 5x + 2?

Answer choices

One root unlocks the whole factorization

Here is the workflow that makes the factor theorem the workhorse of this chapter. Suppose you know, or are told, a single root cc of a polynomial of degree nn. The theorem promises the factorization P(x)=(x−c) Q(x)P(x) = (x - c)\,Q(x), and division delivers Q(x)Q(x) explicitly, a polynomial of degree n−1n - 1. You have traded one problem for a strictly smaller one. Now hunt for a root of QQ, peel again, and keep going until what remains is a quadratic, where factoring, the quadratic formula, and complex numbers finish the job completely.

Worked example 1 Factor a cubic from one known root

Factor P(x)=x3−4x2+x+6P(x) = x^3 - 4x^2 + x + 6 completely, given that 22 is a root.

First confirm the given root, since one evaluation is cheap insurance:

P(2)=8−16+2+6=0.P(2) = 8 - 16 + 2 + 6 = 0.

The factor theorem now guarantees P(x)=(x−2) Q(x)P(x) = (x - 2)\,Q(x). Find QQ by synthetic division with c=2c = 2 on the coefficients 1,−4,1,61, -4, 1, 6:

21−4162−4−61−2−30\begin{array}{c|cccc} 2 & 1 & -4 & 1 & 6 \\ & & 2 & -4 & -6 \\ \hline & 1 & -2 & -3 & 0 \end{array}

The remainder 00 in the corner re-confirms the root, and the other entries spell out the quotient Q(x)=x2−2x−3Q(x) = x^2 - 2x - 3. That quadratic factors by the Chapter 4 methods, since −3-3 and 11 multiply to −3-3 and add to −2-2:

x2−2x−3=(x−3)(x+1),x^2 - 2x - 3 = (x - 3)(x + 1),

so the complete factorization is

P(x)=(x−2)(x−3)(x+1),P(x) = (x - 2)(x - 3)(x + 1),

and the roots of PP are 22, 33, and −1-1. Multiplying the three factors back together, or evaluating P(3)P(3) and P(−1)P(-1) directly, checks the answer.

Worked example 2 The quotient does not have to cooperate

Factor P(x)=x3−5x2+9x−5P(x) = x^3 - 5x^2 + 9x - 5 completely, given that 11 is a root.

Confirm: P(1)=1−5+9−5=0P(1) = 1 - 5 + 9 - 5 = 0. Peel off the factor x−1x - 1 by synthetic division on 1,−5,9,−51, -5, 9, -5:

11−59−51−451−450\begin{array}{c|cccc} 1 & 1 & -5 & 9 & -5 \\ & & 1 & -4 & 5 \\ \hline & 1 & -4 & 5 & 0 \end{array}

So P(x)=(x−1)(x2−4x+5)P(x) = (x - 1)\left(x^2 - 4x + 5\right). The quotient refuses to factor over the reals: its discriminant is

Δ=(−4)2−4(1)(5)=−4<0,\Delta = (-4)^2 - 4(1)(5) = -4 < 0,

so it has no real roots, and over the real numbers the factorization above is already complete. But the previous chapter taught you exactly what a negative discriminant means. The quadratic formula runs to completion with −4=2i\sqrt{-4} = 2i and gives the conjugate pair

x=4±2i2=2±i,x = \frac{4 \pm 2i}{2} = 2 \pm i,

so over the complex numbers the cubic splits fully into linear factors:

P(x)=(x−1) (x−(2+i)) (x−(2−i)).P(x) = (x - 1)\,\bigl(x - (2 + i)\bigr)\,\bigl(x - (2 - i)\bigr).

The real root 11 appears as a real linear factor; the nonreal pair hides inside the real quadratic factor until you allow complex factors. Both lines are correct answers, to two different questions: “factor over the reals” and “factor over the complex numbers”.

Check your understanding

The cubic x3−7x+6x^3 - 7x + 6 has 11 as a root. What is the quotient when it is divided by x−1x - 1?

Answer choices

Worked example 3 Solve for an unknown coefficient

Find the value of kk so that x−2x - 2 is a factor of P(x)=x3−3x2+kx−8P(x) = x^3 - 3x^2 + kx - 8.

This runs the factor theorem backward from every example so far. Instead of a finished polynomial, PP has an unknown kk sitting inside it, and the factor condition is what pins it down. The theorem still says exactly the same thing: x−2x - 2 is a factor precisely when P(2)=0P(2) = 0. So evaluate at x=2x = 2, unknown kk and all:

P(2)=(2)3−3(2)2+k(2)−8=8−12+2k−8=2k−12.P(2) = (2)^3 - 3(2)^2 + k(2) - 8 = 8 - 12 + 2k - 8 = 2k - 12.

Setting the factor condition P(2)=0P(2) = 0 turns the question into a linear equation for kk:

2k−12=0⟹k=6.2k - 12 = 0 \quad\Longrightarrow\quad k = 6.

Check by substituting back: with k=6k = 6, P(x)=x3−3x2+6x−8P(x) = x^3 - 3x^2 + 6x - 8, and synthetic division by c=2c = 2 on 1,−3,6,−81, -3, 6, -8 leaves remainder 00, confirming the factor. The move to remember: an unknown coefficient inside PP does not change the rule at all. Evaluate at the number that kills the factor, set the result equal to 00, and solve the resulting equation for the unknown.

Check your understanding

For which value of kk is x+2x + 2 a factor of P(x)=x3+kx2+3x+2P(x) = x^3 + kx^2 + 3x + 2?

Answer choices

Building a polynomial to order

The factor theorem also runs in reverse: instead of dissecting a given polynomial, you can manufacture one with any roots you choose. Each prescribed root rr contributes a factor x−rx - r, and the product of those factors has every prescribed number as a root. The reason is the easy direction of the theorem: evaluate the product at rr, and the factor x−rx - r makes the whole product zero.

A graph shows what you are really building. The real roots of a polynomial are exactly the xx-intercepts of its graph, because “the graph meets the axis at cc” and "P(c)=0P(c) = 0" are the same sentence. So a factored polynomial is a curve whose axis crossings you have pinned down in advance. The cubic below crosses cleanly through the axis at each root because each factor appears only once; a root can also touch the axis without crossing it when its factor repeats, which the next chapter takes up.

A cubic’s x-intercepts are its linear factorsA cubic curve rises through x equals negative 1, peaks, falls through x equals 2, dips, and rises again through x equals 4. The three crossings are dotted and labeled with the factors x plus 1, x minus 2, and x minus 4.xx = −1x = 2x = 4(x + 1)(x − 2)(x − 4)
The monic cubic with roots -1, 2, and 4. The graph crosses the x-axis exactly where a linear factor vanishes, so each intercept on the graph is a factor on the page: x + 1, x - 2, and x - 4.

One caution before the examples: a list of roots does not pin down one polynomial. The cubics (x+1)(x−2)(x−4)(x + 1)(x - 2)(x - 4) and 2(x+1)(x−2)(x−4)2(x + 1)(x - 2)(x - 4) have identical roots, and so does every other nonzero multiple. The construction really produces a whole family,

P(x)=a (x−r1)(x−r2)⋯(x−rk),a≠0,P(x) = a\,(x - r_1)(x - r_2)\cdots(x - r_k), \qquad a \neq 0,

one polynomial for each choice of the leading coefficient aa, every one of them of degree kk.

Leaving the degree free is worse than just an open leading coefficient: a higher-degree polynomial can repeat one of the factors and still have the same distinct roots and pass through the same point. Compare P(x)=(x−1)(x−3)P(x) = (x - 1)(x - 3) with R(x)=−(x−1)2(x−3)R(x) = -(x - 1)^2(x - 3). Both have exactly the roots 11 and 33, and both satisfy P(0)=R(0)=3P(0) = R(0) = 3, yet PP has degree 22 and RR has degree 33. So a problem that wants one specific polynomial has to do two things. It has to hold the degree at kk, which is what asking for a cubic with three roots, or for the least degree those roots allow, already does. And it has to supply one more condition to choose aa, such as the leading coefficient itself or a point the graph passes through. That point has to earn its keep. If its xx-value is one of the prescribed roots, P=0P = 0 there no matter what aa is, so it settles nothing. And its yy-value should not be 00 at a new xx-value either: solving for aa would then force a=0a = 0, which breaks the rule a≠0a \neq 0 and means no polynomial of that exact degree with exactly those roots reaches that point. A usable extra point has an xx-value outside the root list and a nonzero yy-value.

Worked example 4 Prescribed roots plus one point

Find the cubic polynomial with roots −1-1, 22, and 44 whose graph passes through (0,16)(0, 16).

The three roots force the shape P(x)=a (x+1)(x−2)(x−4)P(x) = a\,(x + 1)(x - 2)(x - 4) for some nonzero constant aa, and the extra point pins down aa. Evaluate at x=0x = 0:

P(0)=a (1)(−2)(−4)=8a=16⟹a=2.P(0) = a\,(1)(-2)(-4) = 8a = 16 \quad\Longrightarrow\quad a = 2.

Now expand step by step. First the last two factors:

(x−2)(x−4)=x2−6x+8,(x - 2)(x - 4) = x^2 - 6x + 8,

then multiply by (x+1)(x + 1):

(x+1)(x2−6x+8)=x3−6x2+8x+x2−6x+8=x3−5x2+2x+8,(x + 1)\left(x^2 - 6x + 8\right) = x^3 - 6x^2 + 8x + x^2 - 6x + 8 = x^3 - 5x^2 + 2x + 8,

and finally scale by a=2a = 2:

P(x)=2x3−10x2+4x+16.P(x) = 2x^3 - 10x^2 + 4x + 16.

Check the point: P(0)=16P(0) = 16. Check a root: P(2)=16−40+8+16=0P(2) = 16 - 40 + 8 + 16 = 0. The monic cubic in the figure above is this polynomial’s a=1a = 1 sibling; the point (0,16)(0, 16) is what selected a=2a = 2 from the whole family sharing those three crossings.

Check your understanding

For which value of aa does the quadratic P(x)=a(x−1)(x+3)P(x) = a(x - 1)(x + 3) pass through (0,−12)(0, -12)?

Answer choices

Worked example 5 Building with a nonreal root

Find the monic cubic with real coefficients that has 33 and 1+2i1 + 2i among its roots.

Two roots are given, but a cubic needs three linear factors, and the missing one comes for free. For a polynomial with real coefficients, a nonreal root always arrives with its conjugate: since 1+2i1 + 2i is a root, 1−2i1 - 2i must be one too. (The reason: conjugating both sides of the equation P(z)=0P(z) = 0 conjugates nothing but zz itself, because conjugation passes through sums and products and leaves real coefficients fixed. That argument, proved for quadratics in the complex numbers chapter, uses nothing about degree, so it applies here as well.)

Multiply the conjugate pair of factors first, because that product is guaranteed to come out real:

(x−(1+2i))(x−(1−2i))=((x−1)−2i)((x−1)+2i)=(x−1)2−(2i)2,\begin{aligned} \bigl(x - (1 + 2i)\bigr)\bigl(x - (1 - 2i)\bigr) &= \bigl((x - 1) - 2i\bigr)\bigl((x - 1) + 2i\bigr) \\ &= (x - 1)^2 - (2i)^2, \end{aligned}

and since (2i)2=−4(2i)^2 = -4, this is (x−1)2+4=x2−2x+5(x - 1)^2 + 4 = x^2 - 2x + 5. Now attach the real root’s factor:

P(x)=(x−3)(x2−2x+5)=x3−2x2+5x−3x2+6x−15=x3−5x2+11x−15.\begin{aligned} P(x) = (x - 3)\left(x^2 - 2x + 5\right) &= x^3 - 2x^2 + 5x - 3x^2 + 6x - 15 \\ &= x^3 - 5x^2 + 11x - 15. \end{aligned}

Every coefficient is real, as promised. The pattern is worth remembering: a real root shows up as a real linear factor. A nonreal root and its conjugate instead merge into a real quadratic factor, here x2−2x+5x^2 - 2x + 5, whose discriminant is negative. The next chapter builds its whole theory of real polynomials on this pairing.

Check your understanding

A monic cubic with real coefficients has 55 and ii among its roots. What is its factorization over the reals?

Answer choices

A ceiling on the number of roots

The factor theorem’s first big structural consequence is a hard limit. A quadratic never has three roots, a cubic never has four, and the pattern is completely general.

Here is why, in one small case. Take a cubic, degree 33, and suppose it has three different roots. Each root peels off one linear factor, and each peel drops the degree by exactly 11: start at degree 33, peel once to reach degree 22, peel again to reach degree 11, peel a third time to reach degree 00, a nonzero constant with no xx left in it to make it vanish anywhere. There is no degree left to peel a fourth time, so a fourth distinct root is impossible, unless the cubic was the zero polynomial to begin with. The general argument below just runs this same budget for any degree nn.

A nonzero polynomial of degree nn has at most nn roots#

Let P(x)P(x) be a nonzero polynomial of degree nn, and let r1,r2,…,rkr_1, r_2, \ldots, r_k be distinct roots of it. Because r1r_1 is a root, the factor theorem writes

P(x)=(x−r1) Q1(x),P(x) = (x - r_1)\,Q_1(x),

and comparing degrees on the two sides, Q1Q_1 has degree n−1n - 1. Now evaluate this identity at the second root:

0=P(r2)=(r2−r1) Q1(r2).0 = P(r_2) = (r_2 - r_1)\,Q_1(r_2).

The first factor is not zero, because the roots are distinct, and a product of two numbers is zero only when one of them is zero. So Q1(r2)=0Q_1(r_2) = 0, and the factor theorem applies again, this time to Q1Q_1: we get Q1(x)=(x−r2) Q2(x)Q_1(x) = (x - r_2)\,Q_2(x) with Q2Q_2 of degree n−2n - 2, hence

P(x)=(x−r1)(x−r2) Q2(x).P(x) = (x - r_1)(x - r_2)\,Q_2(x).

Repeat the same evaluation argument with r3,r4,…r_3, r_4, \ldots, each time inside the newest quotient. Every distinct root peels off one more linear factor, and every peel lowers the quotient’s degree by exactly 11. After all kk roots are used,

P(x)=(x−r1)(x−r2)⋯(x−rk) Qk(x),P(x) = (x - r_1)(x - r_2)\cdots(x - r_k)\,Q_k(x),

where QkQ_k is not the zero polynomial (otherwise PP would be) and has degree n−kn - k. A degree is never negative, so n−k≥0n - k \geq 0, which is the claim: k≤nk \leq n.

Read the theorem for what it is: a ceiling, not a promise. It says a degree-nn polynomial cannot have more than nn roots; it is silent about how many actually exist. The quadratic x2+1x^2 + 1 has no real roots at all, and no theorem in this lesson objects, because zero is comfortably at most two. The factor theorem converts roots into factors and factors into roots, but it never manufactures a root out of nothing. Two questions stay open here: whether roots must exist at all, and how many a degree-nn polynomial is guaranteed once complex numbers are allowed. Both are the business of the Fundamental Theorem of Algebra, the headline of the next chapter.

The ceiling still has real bite. If someone hands you a cubic and four distinct numbers where it vanishes, you may conclude the “cubic” is actually the zero polynomial, no computation required. And in Worked Example 1, once the roots 22, 33, and −1-1 were in hand, the search was legitimately over: a cubic has no room for a fourth root.

Check your understanding

A polynomial P(x)P(x) is claimed to have degree at most 33, and it is also known to vanish at the five distinct numbers −2,−1,0,1,2-2, -1, 0, 1, 2. What must be true?

Answer choices

There is one honest gap left in the workflow, and you should notice it. Everything above starts from one known root, and in this lesson the root was always handed to you. Where does the first root come from when nobody supplies it? Testing numbers blindly could take forever. The next lesson closes exactly this gap: for polynomials with integer coefficients, the Rational Root Theorem shrinks the infinite search to a short finite list of rational candidates. The factor theorem then processes each of those candidates with a single evaluation.

Common mistakes

Practice

Multiple Choice Questions (MCQ)

Progressively harder sets of questions. Each opens on its own page.

Core practice

Practice problems at the level of the course, to be worked out on paper. Hints one at a time, then the answer or the full worked solution, with your progress kept in this browser.

Core practice Work it out on paper 10 problems Start →
More practice (optional)

Extra sets, as hard as the Challenge set. Each one opens on its own page.

More resources (optional)

Other explanations of this lesson, if you want a second take.

A bit of history (optional)

For most of algebra’s history an equation was a thing to solve, never a thing to build. You were handed a heap of terms and asked which value made it true.

Thomas Harriot, an English mathematician who had surveyed the Roanoke colony in Virginia, worked the other way. He wrote down two factors and multiplied them out. Then he read the equation he had just made. Its solutions sat in plain view, inside the factors he began with. Harriot published almost nothing. Colleagues assembled his pages years after his death. That is the build to order section of this lesson, arriving four centuries early.

Rene Descartes turned the observation into a rule. La Geometrie, the mathematical appendix to his 1637 book on how to reason, states the trade both ways. A polynomial that vanishes at a value is divisible by the matching linear factor. A polynomial divisible by that factor vanishes there. Descartes then used the rule as you will. Find one root, divide it away, and work on the smaller thing left.

The idea was rawer then than it looks now. Descartes still called negative roots false roots. So half the numbers you feed this theorem were, on his own page, faintly disreputable. The biconditional you proved today did not arrive as tidy theory. It arrived as a practical way to wear an equation down, one degree at a time.