This site is a work in progress. New lessons are added regularly. Contact us
Chapter Review · a rapid pre-test review (speedrun)

Polynomial Division and Roots: Chapter Review

A rapid review before the test: the chapter's vocabulary and notation, every formula with the conditions to use it, the standard problem types step by step, and the traps that cost points.

Vocabulary and notation

Polynomial
A finite sum of terms cxkc\,x^k with real cc and whole-number kk; domain all reals. Ruled out: 3x\tfrac{3}{x}, x\sqrt{x}, 2x2^x. The restriction falls on xx only, so x23+2\tfrac{x^2}{3}+\sqrt{2} qualifies.
Degree names and term counts
Degrees 00 to 55: constant, linear, quadratic, cubic, quartic, quintic. Terms counted: monomial, binomial, trinomial. So x45x2+4x^4-5x^2+4 is a quartic trinomial.
Standard form, degree, leading coefficient, constant term
Terms in descending powers. Degree is the highest power with a nonzero coefficient, the leading coefficient sits on it, the constant term is a0a_0 with its sign. Combine like terms and order them BEFORE reading any of these; the zero polynomial has no degree.
Turning point
Where a graph switches between rising and falling: a local hilltop or valley floor.
Root (zero) versus factor
cc is a root when the single evaluation P(c)P(c) gives 00; DD is a factor when P=DQP = DQ exactly, an identity at every xx. Different claims, and the Factor Theorem is the exchange rate.
Corner number
The cc in a synthetic tableau's corner: the value making the divisor zero, so x+3x + 3 takes c=3c = -3.
Placeholder
An explicit 0xk0x^k written for every power missing from a dividend, so like powers stay aligned.

Formulas and theorems

  • Degree of a product and of a sum

    deg(fg)=degf+deggdeg(f+g)max(degf,degg)\begin{gathered} \deg(fg) = \deg f + \deg g \\ \deg(f+g) \le \max(\deg f, \deg g) \end{gathered}

    Use when f,gf, g nonzero. Leading coefficients MULTIPLY, so a factored form gives its degree and leading term unexpanded. A sum's degree DROPS only when leading terms cancel, possibly to the zero polynomial, which has no degree.

    e.g. (3x22)(x3+4x)(3x^2-2)(x^3+4x) has degree 55, leading term 3x53x^5; (x3+2x)(x3x)=3x(x^3+2x)-(x^3-x) = 3x has degree 11.

  • Two free evaluations

    f(0)=a0f(1)=an+an1++a0\begin{gathered} f(0) = a_0 \\ f(1) = a_n + a_{n-1} + \cdots + a_0 \end{gathered}

    Use when Any polynomial. f(0)f(0) is the constant term with its sign, the yy-intercept; f(1)f(1) adds every coefficient, a missing power contributing 00.

    e.g. 2x4x3+3x92x^4-x^3+3x-9 gives f(0)=9f(0) = -9 and f(1)=5f(1) = -5.

  • End behavior belongs to the leading term

    far right follows the sign of anfar left agrees if n is evenfar left opposes if n is odd\begin{gathered} \text{far right follows the sign of } a_n \\ \text{far left agrees if } n \text{ is even} \\ \text{far left opposes if } n \text{ is odd} \end{gathered}
    The four end behaviours, read off the degree's parity and the leading coefficient's signA two by two grid of miniature graphs, each on a faint horizontal axis with a highlighted arrow at its far left and far right. Even degree, top row: the upward opening curve has both arrows up, the downward opening curve has both arrows down. Odd degree, bottom row: the rising curve has its left arrow down and its right arrow up, and the falling curve the reverse.n even, an positiven even, an negativen odd, an positiven odd, an negative
    Text description

    Four miniature graphs: an even degree sends both ends the same way, up when the leading coefficient is positive and down when it is negative, while an odd degree sends the two ends opposite ways.

    Use when n1n \ge 1, an0a_n \neq 0. Only the highest exponent speaks far out, whatever the lower coefficients' size. So every odd-degree polynomial has a real zero, and an even-degree graph has an ODD number of turning points, hence at least one.

    e.g. 3x4+5x31-3x^4+5x^3-1 falls on both ends; x5+100x4-x^5+100x^4 obeys x5-x^5.

  • Counting ceilings

    #{distinct roots}n#{turning points}n1\begin{gathered} \#\{\text{distinct roots}\} \le n \\ \#\{\text{turning points}\} \le n-1 \end{gathered}

    Use when Nonzero polynomial, degree n1n \ge 1; roots counted distinct, real or nonreal. Ceilings, not quotas: x2+1x^2+1 has no real zero, x3x^3 no turning point. There is also a floor: kk distinct real zeros force at least k1k-1 turns.

  • A sign change traps a zero

    f(a)<0<f(b) f  has a zero between a and b\begin{gathered} f(a) < 0 < f(b) \\ \Longrightarrow \ f \ \text{ has a zero between } a \text{ and } b \end{gathered}
    A sign change between a and b traps a zero between a and bA horizontal axis carrying two tick marks, a on the left and b on the right. One unbroken curve begins at a dot well below the axis above the tick labelled a, rises steadily, passes through a highlighted dot sitting exactly on the axis and labelled zero, and finishes at a dot above the axis over the tick labelled b. The lower endpoint is labelled f of a and the upper endpoint f of b.f(a)f(b)abzero
    Text description

    An unbroken curve running from a point below the axis at a to a point above it at b, with the crossing it is forced to make highlighted between them.

    Use when Polynomial graphs are smooth and unbroken, which is what powers this; a corner or a break rules a curve out. One-way only: x2x^2 has a zero with no sign change.

  • Division algorithm, with the quotient's size

    P=DQ+RR=0  or  degR<degDdegQ=degPdegD\begin{gathered} P = DQ + R \\ R = 0 \ \text{ or } \ \deg R < \deg D \\ \deg Q = \deg P - \deg D \end{gathered}

    Use when D0D \neq 0; the last equation needs degPdegD\deg P \ge \deg D. The degree bound makes the answer finished and (Q,R)(Q, R) unique; R=0R = 0 is separate since the zero polynomial has no degree. QQ's leading coefficient is PP's divided by DD's, and fractions there are legal when DD is not monic. If degP<degD\deg P < \deg D then Q=0Q = 0, R=PR = P. Dividing through gives PD=Q+RD\tfrac{P}{D} = Q + \tfrac{R}{D} where D(x)0D(x) \neq 0, remainder still OVER the divisor.

    e.g. x34x+1x^3 - 4x + 1 over x2x - 2 gives the quadratic x2+2xx^2 + 2x with remainder 11.

  • Synthetic division recurrence

    bn1=anbk1=ak+cbkr=a0+cb0\begin{gathered} b_{n-1} = a_n \\ b_{k-1} = a_k + c\,b_k \\ r = a_0 + c\,b_0 \end{gathered}

    Use when The divisor must be exactly xcx - c: degree 11 AND monic (leading coefficient 11). The top row lists every coefficient with 00 placeholders, and the tableau only ever ADDS, the subtraction baked into the corner's flipped sign. The bottom row is the quotient, one degree lower, then the remainder, and it also computes P(c)P(c) in nn multiplications (Horner's method).

  • Remainder Theorem

    P(x)÷(xc)  leaves remainder  P(c)P(x) \div (x-c) \ \text{ leaves remainder } \ P(c)

    Use when Any polynomial and any cc, real or complex; true whether or not that remainder is zero. For axbax - b with a0a \neq 0 the remainder is P ⁣(ba)P\!\left(\tfrac{b}{a}\right).

    e.g. 2x33x2+42x^3-3x^2+4 over x2x-2 leaves P(2)=8P(2) = 8.

  • Factor Theorem

    xc  is a factor of  P(x)    P(c)=0\begin{gathered} x - c \ \text{ is a factor of } \ P(x) \\ \iff P(c) = 0 \end{gathered}

    Use when Any polynomial, any cc. Both directions hold, so one evaluation settles it: P(c)0P(c) \neq 0 PROVES xcx - c is not a factor. For a0a \neq 0, axbax - b is a factor exactly when P ⁣(ba)=0P\!\left(\tfrac{b}{a}\right) = 0, so test the value killing the candidate factor. It converts roots and factors, never asserting a root exists.

  • Build a polynomial from prescribed roots

    P(x)=a(xr1)(xr2)(xrk)a0\begin{gathered} P(x) = a\,(x-r_1)(x-r_2)\cdots(x-r_k) \\ a \neq 0 \end{gathered}

    Use when Degree kk, with exactly those roots; a repeated root repeats its factor. Roots fix PP only up to aa: (x1)(x3)(x-1)(x-3) and 7(x1)(x3)7(x-1)(x-3) tie until a point or the leading coefficient chooses.

  • Nonreal roots come in conjugate pairs

    P real,P(z)=0  P(zˉ)=0P \ \text{real}, \quad P(z) = 0 \ \Longrightarrow \ P(\bar{z}) = 0

    Use when EVERY coefficient of PP real; otherwise it fails, and x22ix1=(xi)2x^2-2ix-1 = (x-i)^2 has ii twice and i-i never. The pair merges into the real quadratic x22px+p2+q2x^2-2px+p^2+q^2, discriminant negative.

    e.g. The monic cubic with roots 22 and 1i1-i is (x2)(x22x+2)=x34x2+6x4(x-2)(x^2-2x+2) = x^3-4x^2+6x-4.

  • Rational Root Theorem

    pq  a root   pa0  and  qan\tfrac{p}{q} \ \text{ a root } \ \Longrightarrow \ p \mid a_0 \ \text{ and } \ q \mid a_n

    Use when EVERY coefficient an integer, an0a_n \neq 0, pq\tfrac{p}{q} in lowest terms; clear fractional coefficients first, which changes no root. Numerators come from the CONSTANT term, denominators from the LEADING coefficient. One-way only, and blind to irrational and nonreal roots. If a0=0a_0 = 0 it filters nothing: factor out the largest power of xx first.

  • Monic case (integer root theorem)

    an=1 every rational rootis an integer dividing a0\begin{gathered} a_n = 1 \\ \Longrightarrow \ \text{every rational root} \\ \text{is an integer dividing } a_0 \end{gathered}

    Use when Integer coefficients, leading coefficient 11; no fraction can occur. A fully failed list PROVES no rational root, the standard proof that n\sqrt{n} is irrational for non-square nn.

    e.g. x34x+2x^3-4x+2: candidates ±1,±2\pm 1, \pm 2 all fail, so there is no rational root.

Problem types, step by step

Read a polynomial's shape at sight

  1. Tidy first, or, if it arrives factored, add the factors' degrees and multiply their leading terms.
  2. Degree parity plus the sign of the leading coefficient give the two far ends, f(0)f(0) the yy-intercept, and an odd degree guarantees at least one real zero.

e.g. (2x)(x2+1)2(2-x)(x^2+1)^2 has degree 55 and leading term x5-x^5, so it rises left, falls right, and meets the yy-axis at 22.

Deduce the least possible degree from a described graph

  1. From kk distinct xx-intercepts take nkn \ge k, from tt turning points take nt+1n \ge t+1, keep the larger.
  2. Ends agreeing forces nn even, disagreeing forces nn odd; raise the bound by one on a parity clash, and check that an even degree carries an odd number of turns.

e.g. Both ends rising with 44 intercepts and 33 turns gives n4n \ge 4, even, and 33 is odd, so n=4n = 4.

Divide by a divisor of any degree (long division)

  1. Put both polynomials in standard form and fill every missing power of the dividend with 0xk0x^k.
  2. Divide the working remainder's leading term by the DIVISOR'S leading term for the next quotient term.
  3. Multiply the whole divisor by it, subtract the ENTIRE product, repeat.
  4. Stop when the working remainder is 00 or its degree drops below the divisor's, then expand DQ+RDQ + R against PP.

e.g. x4x2+3x^4-x^2+3 over x2x+1x^2-x+1 gives quotient x2+x1x^2+x-1, remainder 2x+4-2x+4.

Divide by a linear divisor (synthetic division)

  1. Check the divisor is linear: corner cc for xcx - c, corner ba\tfrac{b}{a} for axbax - b.
  2. Write every coefficient across the top with 00 placeholders, bring down the leader, multiply by the corner, add down each column.
  3. Read the bottom row as the quotient, one degree lower, last entry the remainder.
  4. For an axbax - b divisor, divide that quotient by aa and leave the remainder alone.

e.g. 3x3+2x27x+43x^3+2x^2-7x+4 over 3x13x-1: corner 13\tfrac{1}{3} gives 3x2+3x63x^2+3x-6, so quotient x2+x2x^2+x-2, remainder 22.

Find a remainder, or solve for an unknown coefficient

  1. Identify the value killing the divisor: cc for xcx - c, ba\tfrac{b}{a} for axbax - b.
  2. Evaluate PP there, wrapping a negative input in parentheses before taking powers; that value IS the remainder.
  3. For an unknown coefficient, set that evaluation equal to the stated remainder (00 if exact) and solve; two remainders give two equations.

e.g. x33x2+kx+8x^3-3x^2+kx+8 divides exactly by x2x-2 when 4+2k=04+2k = 0, so k=2k = -2.

Factor completely from one known root

  1. Confirm the root by evaluating, then divide out xcx - c to get QQ, one degree lower.
  2. Hunt the next root INSIDE QQ, retesting cc there in case it repeats, and peel again.
  3. Once QQ is quadratic, stop hunting: over R\mathbb{R} leave a negative-discriminant quadratic standing, over C\mathbb{C} split it into its conjugate pair.

e.g. x3+3x24x^3+3x^2-4 with root 11 gives quotient x2+4x+4x^2+4x+4, so P(x)=(x1)(x+2)2P(x) = (x-1)(x+2)^2.

Build a polynomial to order

  1. Turn each root rr into the factor xrx - r, minding the sign, adding a nonreal root's conjugate when the coefficients must be real.
  2. Multiply each conjugate pair first, since that product is real, then attach the rest.
  3. Write P(x)=a(product)P(x) = a \cdot (\text{product}), solve for aa from the extra point or the given leading coefficient, expand, check one root.

e.g. Roots 2,1,3-2, 1, 3 with P(0)=12P(0) = 12: 6a=126a = 12, so P(x)=2(x+2)(x1)(x3)P(x) = 2(x+2)(x-1)(x-3).

Find every root of an integer-coefficient polynomial

  1. Clear fractional coefficients, and factor out the largest power of xx if the constant term is 00.
  2. List every ±pq\pm\tfrac{p}{q} with pp a positive divisor of the CONSTANT term and qq one of the LEADING coefficient, reduced and deduplicated.
  3. Test by synthetic division, integers before fractions; remainder 00 means a root, and the same row gives the quotient.
  4. Peel and repeat until the quotient is quadratic, then finish with the quadratic formula, reporting nonreal roots too.

e.g. 2x3x28x+42x^3-x^2-8x+4: 88 candidates, and 12\tfrac{1}{2} works, giving (2x1)(x2)(x+2)(2x-1)(x-2)(x+2).

Exam traps

  • Trap Putting the divisor's own constant in the corner: dividing x3+5x4x^3+5x-4 by x+1x+1 with corner 11, reporting remainder 22.

    Fix The corner holds the value making the divisor zero, so x+1x+1 takes 1-1 and the remainder is P(1)=10P(-1) = -10.

  • Trap Feeding a divisor that is not xcx - c into the corner, or halving the remainder along with the quotient.

    Fix For axbax - b use corner ba\tfrac{b}{a}, divide the QUOTIENT by aa, leave the remainder alone: 3x3+2x27x+43x^3+2x^2-7x+4 over 3x13x-1 has remainder 22, not 23\tfrac{2}{3}. Degree 22 or more has no tableau; use long division.

  • Trap Omitting a placeholder: running x37x+6x^3-7x+6 over x2x-2 from the row 1,7,61, -7, 6.

    Fix The row is 1,0,7,61, 0, -7, 6. The short row returns x5x-5 remainder 4-4 instead of x2+2x3x^2+2x-3 remainder 00.

  • Trap Subtracting only the leading term of qDq\,D, or letting a subtracted negative keep its sign.

    Fix Subtract the entire product, so subtracting 3x-3x ADDS 3x3x. A row that fails to shift right means the leading term never cancelled.

  • Trap Promoting the candidate list to an answer: reporting ±1,±2,±4,±12\pm 1, \pm 2, \pm 4, \pm\tfrac{1}{2} as the roots of 2x3x28x+42x^3-x^2-8x+4.

    Fix Those eight are candidates; substituting leaves only 12\tfrac{1}{2}, 22, and 2-2. Five fail, and a polynomial can fail all eight.

  • Trap Reading a fully failed candidate list as "no roots".

    Fix It proves no RATIONAL roots, nothing more. Every candidate of x22x^2-2 fails, yet it has the real roots ±2\pm\sqrt{2}.

  • Trap Hunting the next root back in PP, or assuming a found root cannot repeat.

    Fix Search inside the quotient and retest cc there: 4x38x2+5x1=(x1)(2x1)24x^3-8x^2+5x-1 = (x-1)(2x-1)^2, where 12\tfrac{1}{2} is a root twice.

Chapter test Questions from across the chapter