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

Zeros of Polynomials: 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

Multiplicity, simple, repeated
The exponent mm in p(x)=(xr)mq(x)p(x) = (x - r)^m q(x), q(r)0q(r) \neq 0: how many times (xr)(x - r) divides pp. m=1m = 1 is simple, m2m \ge 2 repeated.
Counted with multiplicity, versus distinct
The root list repeats a root as often as its multiplicity; the distinct roots are the values on it. (x2)3(x+1)(x - 2)^3(x + 1): four with multiplicity, two distinct.
Complex conjugate z\overline{z}
a+bi=abi\overline{a + bi} = a - bi. Respects ++ and ×\times, and fixes exactly the reals: z=z\overline{z} = z if and only if zz is real.
Surd partner ss^{*}
(a+bd)=abd(a + b\sqrt{d})^{*} = a - b\sqrt{d}, from the swap dd\sqrt{d} \mapsto -\sqrt{d}. A DIFFERENT swap from the bar, fixing exactly the rationals: 2+52 + \sqrt{5} is real, so 2+5\overline{2 + \sqrt{5}} is itself.
Elementary symmetric function eke_k
The sum of every product of kk different ENTRIES of the root list: e1e_1 the roots, e2e_2 all pairwise products, ene_n the product of all. Swapping two roots leaves it unchanged.
Depressed polynomial
The quotient left after dividing out a root, one degree lower. The remaining roots are hunted there.
Sign chart, test point
The real zeros cut the line into intervals; the chart records the sign PP holds on each. A test point is one value strictly inside an interval, never a zero.
Turning point
Where the graph stops rising and starts falling, or the reverse. It need not lie on the axis, and a zero need not be one.

Formulas and theorems

  • Fundamental Theorem of Algebra, and complete factorization

    p(x)=a(xr1)(xr2)(xrn)p(x) = a(x - r_1)(x - r_2)\cdots(x - r_n)

    Use when Degree n1n \ge 1; coefficients may be complex, as the induction needs. a0a \neq 0 is the leading coefficient; the rir_i are listed with multiplicity and are the ONLY roots. Existence only: it names no root, and for n5n \ge 5 no general radical formula exists. A constant such as p(x)=7p(x) = 7 has none.

  • Root Counting Theorem

    m1+m2++mk=nm_1 + m_2 + \cdots + m_k = n

    Use when s1,,sks_1, \ldots, s_k the DISTINCT roots with multiplicities mim_i, over C\mathbb{C}, n1n \ge 1. So exactly nn roots counted with multiplicity, at most nn distinct, and exactly nn distinct precisely when every root is simple. The REAL count is unconstrained, from 00 to nn.

  • Conjugate root theorem, and the real quadratic it forces

    p(z)=0  p(z)=0(xz)(xz)=x22ax+(a2+b2)\begin{gathered} p(z) = 0 \ \Longrightarrow \ p(\overline{z}) = 0 \\ (x - z)(x - \overline{z}) \\ = x^2 - 2ax + (a^2 + b^2) \end{gathered}

    Use when EVERY coefficient real, and z=a+biz = a + bi with b0b \neq 0 for the factor. Strip that and it dies: xix - i has root ii and not i-i. Not reversible: i(x2+1)i(x^2 + 1) pairs i,ii, -i with nonreal coefficients. Real roots are their own conjugates; nonreal ones pair with EQUAL multiplicity. The factor's discriminant 4b2<0-4b^2 < 0 keeps it unsplittable over R\mathbb{R}.

  • Surd conjugate theorem, and its factor

    p(a+bd)=0 p(abd)=0\begin{gathered} p\big(a + b\sqrt{d}\,\big) = 0 \\ \Longrightarrow \ p\big(a - b\sqrt{d}\,\big) = 0 \end{gathered}

    Use when Coefficients RATIONAL, strictly more than real; aa, bb, dd all rational, b0b \neq 0, d\sqrt{d} irrational. The pair forces the factor x22ax+(a2b2d)x^2 - 2ax + (a^2 - b^2d). That dd is rational is load-bearing: with d=3+22d = 3 + 2\sqrt{2}, so d=1+2\sqrt{d} = 1 + \sqrt{2}, the root 1+21 + \sqrt{2} of x22x1x^2 - 2x - 1 has no partner 12-1 - \sqrt{2}.

    e.g. A root 2+52 + \sqrt{5} forces the factor x24x1x^2 - 4x - 1.

  • Factoring a real polynomial over R\mathbb{R}, and the parity it forces

    p(x)=a(xr1)(xrk) d1(x)dm(x)n=k+2m\begin{gathered} p(x) = a(x - r_1)\cdots(x - r_k) \\ \cdot\ d_1(x)\cdots d_m(x) \\ n = k + 2m \end{gathered}

    Use when Real coefficients, n1n \ge 1, each rir_i real and each djd_j a real quadratic of negative discriminant. The nonreal roots number 2m2m, always EVEN, so kk and nn share a parity. Odd nn forces k1k \ge 1: at least one real root, possibly exactly one. A real cubic has 11 or 33 real roots WITH MULTIPLICITY, never 00.

  • Vieta's formulas

    ek=(1)kankan,k=1,2,,ne_k = (-1)^k\,\frac{a_{n-k}}{a_n}, \qquad k = 1, 2, \ldots, n

    Use when an0a_n \neq 0, and r1,,rnr_1, \ldots, r_n the COMPLETE list over C\mathbb{C}, repeats repeated and nonreal roots kept. The sign counts how many roots the term collects, not sum versus product: the product of the roots is a0an-\frac{a_0}{a_n} for a cubic but +a0an+\frac{a_0}{a_n} for a quartic. A missing term means aj=0a_j = 0. Monic template: x3e1x2+e2xe3x^3 - e_1x^2 + e_2x - e_3.

    e.g. (x1)(x2)(x3)=x36x2+11x6(x - 1)(x - 2)(x - 3) = x^3 - 6x^2 + 11x - 6, and e1=6e_1 = 6, e2=11e_2 = 11, e3=6e_3 = 6.

  • Symmetric quantities built from the eke_k

    r12++rn2=e122e21r1++1rn=en1en\begin{gathered} r_1^2 + \cdots + r_n^2 = e_1^2 - 2e_2 \\ \frac{1}{r_1} + \cdots + \frac{1}{r_n} = \frac{e_{n-1}}{e_n} \end{gathered}

    Use when Any degree n2n \ge 2; the first holds at every degree. The second needs every root nonzero, failing exactly when a0=0a_0 = 0.

  • Multiplicity decides how the graph meets the axis

    P(x)=(xr)mG(x), G(r)0m odd    crossesm even    touches and turns back\begin{gathered} P(x) = (x - r)^m G(x), \ G(r) \neq 0 \\ m \ \text{odd} \iff \text{crosses} \\ m \ \text{even} \iff \text{touches and turns back} \end{gathered}
    An odd multiplicity crosses the axis; an even multiplicity touches it and turns backA single curve drawn across a horizontal axis. On the left it rises from below the axis and continues upward through a marked point on the axis, so the sign changes there. It arches over, comes back down to a second marked point, meets the axis without going below it, and turns back upward, so the sign does not change. Labels beneath the two marked points read m odd, crosses and m even, touches, turns back.xm oddcrossesm eventouches, turns back
    Text description

    A curve passing straight through the axis at a zero of odd multiplicity, and meeting the axis at a zero of even multiplicity without crossing, turning back the way it came.

    Use when PP real, rr a REAL zero. Both run both ways, and m=1m = 1 is odd, so a simple zero crosses. Even mm makes (r,0)(r, 0) a turning point. A larger mm only flattens the curve; it never changes which happens. Nonreal roots give no xx-intercept: (x2)2(x2+1)-(x - 2)^2(x^2 + 1) has degree 44 and one intercept.

    e.g. (x3)2(x+1)(x - 3)^2(x + 1): P(2)=3P(2) = 3, P(4)=5P(4) = 5, so it touches at 33; P(2)=25P(-2) = -25, P(0)=9P(0) = 9, so it crosses at 1-1.

  • End behavior, all four cases

    P(x) follows anxn for large xP(x) \ \text{follows} \ a_nx^n \ \text{for large} \ |x|
    The four end behaviours, set by the parity of n and the sign of the leading coefficientA two by two grid of miniature graphs, each drawn on its own short horizontal axis and labelled underneath. The top row shows even degree: on the left both ends of the curve point upward, on the right both point downward. The bottom row shows odd degree: on the left the curve enters low and leaves high, on the right it enters high and leaves low.even n, an > 0even n, an < 0odd n, an > 0odd n, an < 0
    Text description

    Four miniature graphs in a grid: even degree sends both arms the same way, up for a positive leading coefficient and down for a negative one, while odd degree sends them opposite ways.

    Use when Real PP of degree n1n \ge 1, leading coefficient an0a_n \neq 0. Even nn: both arms up if an>0a_n > 0, both down if an<0a_n < 0. Odd nn: left down and right up if an>0a_n > 0, left up and right down if an<0a_n < 0.

  • Sign changes, and which turning points are reachable

    P(u)P(v)<0 P(c)=0 for some cbetween u and v\begin{gathered} P(u)\,P(v) < 0 \\ \Longrightarrow \ P(c) = 0 \ \text{for some} \ c \\ \text{between} \ u \ \text{and} \ v \end{gathered}

    Use when Real PP, unbroken graph. The converse fails, an even zero having no sign change: a change REQUIRES a real zero, a real zero does not force one. So PP holds one sign on any interval free of real zeros, and one test point settles it. At most n1n - 1 turning points, at least one strictly between consecutive real zeros; their coordinates are beyond algebra apart from a parabola's vertex and the even zeros themselves.

Problem types, step by step

Factor completely and list every root

  1. Rational Root Theorem: candidates ±pq\pm\frac{p}{q}, pp dividing the constant term, qq the leading coefficient. Test by synthetic division.
  2. If a nonreal or surd root is given, check the coefficient system, pair it, and divide by the quadratic that pair forces.
  3. Divide out each confirmed root and continue on the depressed polynomial; at a quadratic use the quadratic formula, keeping nonreal roots.
  4. Expand the factorization, and substitute each root into the ORIGINAL polynomial.

e.g. x34x2+9x10x^3 - 4x^2 + 9x - 10 has root 22, quotient x22x+5x^2 - 2x + 5, so the roots are 22, 1+2i1 + 2i, 12i1 - 2i.

Measure the multiplicity of a known root

  1. Divide pp by (xr)(x - r) and confirm remainder 00.
  2. Divide the QUOTIENT by (xr)(x - r) again, not the original.
  3. Repeat until a remainder is nonzero; the multiplicity is the number of clean divisions.
  4. Check the multiplicities of all distinct roots add to the degree.

e.g. x45x3+6x2+4x8=(x2)3(x+1)x^4 - 5x^3 + 6x^2 + 4x - 8 = (x - 2)^3(x + 1), so 22 has multiplicity 33 and 3+1=43 + 1 = 4.

Build the polynomial of least degree from a root list

  1. Read which coefficient system is demanded: real forces conjugate partners, rational forces surd partners too, complex forces nothing.
  2. Add every partner, matching multiplicities, and count factors for the least degree.
  3. Multiply each pair into its quadratic first, clearing the ii or the radical.
  4. Multiply the remaining linear factors in, then fix the leading coefficient from a given point or a monic requirement.

e.g. Real coefficients, roots 22 and 14i1 - 4i: (x2)(x22x+17)=x34x2+21x34(x - 2)(x^2 - 2x + 17) = x^3 - 4x^2 + 21x - 34.

Extract a symmetric quantity without finding the roots

  1. Standard form, listing every coefficient, with 00 entered for missing terms.
  2. Compute the eke_k needed from ek=(1)kankane_k = (-1)^k\frac{a_{n-k}}{a_n}, dividing by ana_n and reading the parity of kk each time.
  3. Rewrite the requested expression in the eke_k BEFORE substituting numbers, then substitute.

e.g. 2x36x2+x52x^3 - 6x^2 + x - 5: e1=3e_1 = 3, e2=12e_2 = \frac{1}{2}, so r12+r22+r32=91=8r_1^2 + r_2^2 + r_3^2 = 9 - 1 = 8.

Sketch a polynomial from its factored form

  1. Multiply the leading terms for the degree and leading coefficient, and fix the two arms.
  2. Mark each real zero with its multiplicity: odd crosses, even touches and turns back, large flattens.
  3. Test one point strictly inside each interval, unbounded ones included, and plot P(0)P(0) as an anchor.
  4. Reconcile: outer signs must match the arms, and the sign must flip at exactly the odd zeros.

e.g. (x+2)(x1)2(x3)(x + 2)(x - 1)^2(x - 3): both arms up, crosses at 2-2 and 33, touches at 11, P(0)=6P(0) = -6.

Recover a polynomial from a graph

  1. Each crossing gives a factor of odd multiplicity, smallest 11; each touch one of even multiplicity, smallest 22.
  2. Add the exponents for the LEAST possible degree; a stated degree can leave no room to spend, forcing uniqueness.
  3. Read the leading coefficient's sign and the degree parity from the arms, then substitute one extra point to pin that coefficient.
  4. Name what is unrecoverable: the true degree may exceed the least by any even amount, and nonreal roots are invisible.

e.g. A cubic crossing at 2-2, touching at 11, through (0,6)(0, 6): P(x)=3(x+2)(x1)2P(x) = 3(x + 2)(x - 1)^2.

Exam traps

  • Trap "A degree-nn polynomial has nn roots", so x22x+1x^2 - 2x + 1 is given 22 distinct roots and x2+1x^2 + 1 is given 22 real ones.

    Fix (x1)2(x - 1)^2 has one distinct root, and x2+1x^2 + 1 has no real root. Exactly nn roots, counted with multiplicity, over C\mathbb{C}.

  • Trap Pairing a nonreal root without checking the coefficients: reading 2(x3)2(x+i)2(x - 3)^2(x + i) as having roots 3,3,i,i3, 3, -i, i.

    Fix That is degree 33, and ii is not a root. The pairing needs EVERY coefficient real; expanded, this one carries 2i122i - 12 and 18i18i.

  • Trap Using the surd pairing when the coefficients are merely real, or putting a bar on a surd.

    Fix x2(2+2)x+22=(x2)(x2)x^2 - (2 + \sqrt{2})x + 2\sqrt{2} = (x - 2)(x - \sqrt{2}) is real with 2\sqrt{2} a root and 2-\sqrt{2} not. Real buys the complex pairing; the surd pairing costs rational.

  • Trap Vieta from memory: the product of the roots of x43x3+7x2x^4 - 3x^3 + 7x - 2 read as 22, or the sum for 2x36x2+x52x^3 - 6x^2 + x - 5 read as 66.

    Fix The product is 2-2: the sign is (1)k(-1)^k and k=4k = 4 is even. The sum is 62=3-\frac{-6}{2} = 3: every symmetric sum divides by ana_n.

  • Trap Feeding Vieta an incomplete list: x35x2+8x4=(x1)(x2)2x^3 - 5x^2 + 8x - 4 = (x - 1)(x - 2)^2 summed as 1+2=31 + 2 = 3.

    Fix The list is 1,2,21, 2, 2, summing to 55. Nonreal roots count too: x35x2+8x6x^3 - 5x^2 + 8x - 6 has list 3,1+i,1i3, 1 + i, 1 - i, again 55.

  • Trap Treating every real zero as a crossing, so (x3)2(x+1)(x - 3)^2(x + 1) is drawn punching through the axis at 33.

    Fix That multiplicity is even, so it touches and turns back, and (3,0)(3, 0) is a turning point. Test points on both sides give the same sign.

  • Trap Labelling a hump never evaluated, or placing it midway between two zeros.

    Fix For (x+2)(x1)2(x3)(x + 2)(x - 1)^2(x - 3) the midpoint P(0.5)=11.8125P(-0.5) = -11.8125 sits above P(1)=16P(-1) = -16, so the low point is elsewhere. Claim only evaluated heights.

Chapter test Questions from across the chapter