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 with real and whole-number ; domain all reals. Ruled out: , , . The restriction falls on only, so qualifies.
- Degree names and term counts
- Degrees to : constant, linear, quadratic, cubic, quartic, quintic. Terms counted: monomial, binomial, trinomial. So 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 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
- is a root when the single evaluation gives ; is a factor when exactly, an identity at every . Different claims, and the Factor Theorem is the exchange rate.
- Corner number
- The in a synthetic tableau's corner: the value making the divisor zero, so takes .
- Placeholder
- An explicit written for every power missing from a dividend, so like powers stay aligned.
Formulas and theorems
-
Degree of a product and of a sum
Use when 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. has degree , leading term ; has degree .
-
Two free evaluations
Use when Any polynomial. is the constant term with its sign, the -intercept; adds every coefficient, a missing power contributing .
e.g. gives and .
-
End behavior belongs to the leading term
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 , . 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. falls on both ends; obeys .
-
Counting ceilings
Use when Nonzero polynomial, degree ; roots counted distinct, real or nonreal. Ceilings, not quotas: has no real zero, no turning point. There is also a floor: distinct real zeros force at least turns.
-
A sign change traps a zero
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: has a zero with no sign change.
-
Division algorithm, with the quotient's size
Use when ; the last equation needs . The degree bound makes the answer finished and unique; is separate since the zero polynomial has no degree. 's leading coefficient is 's divided by 's, and fractions there are legal when is not monic. If then , . Dividing through gives where , remainder still OVER the divisor.
e.g. over gives the quadratic with remainder .
-
Synthetic division recurrence
Use when The divisor must be exactly : degree AND monic (leading coefficient ). The top row lists every coefficient with 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 in multiplications (Horner's method).
-
Remainder Theorem
Use when Any polynomial and any , real or complex; true whether or not that remainder is zero. For with the remainder is .
e.g. over leaves .
-
Factor Theorem
Use when Any polynomial, any . Both directions hold, so one evaluation settles it: PROVES is not a factor. For , is a factor exactly when , so test the value killing the candidate factor. It converts roots and factors, never asserting a root exists.
-
Build a polynomial from prescribed roots
Use when Degree , with exactly those roots; a repeated root repeats its factor. Roots fix only up to : and tie until a point or the leading coefficient chooses.
-
Nonreal roots come in conjugate pairs
Use when EVERY coefficient of real; otherwise it fails, and has twice and never. The pair merges into the real quadratic , discriminant negative.
e.g. The monic cubic with roots and is .
-
Rational Root Theorem
Use when EVERY coefficient an integer, , 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 it filters nothing: factor out the largest power of first.
-
Monic case (integer root theorem)
Use when Integer coefficients, leading coefficient ; no fraction can occur. A fully failed list PROVES no rational root, the standard proof that is irrational for non-square .
e.g. : candidates all fail, so there is no rational root.
Problem types, step by step
Read a polynomial's shape at sight
- Tidy first, or, if it arrives factored, add the factors' degrees and multiply their leading terms.
- Degree parity plus the sign of the leading coefficient give the two far ends, the -intercept, and an odd degree guarantees at least one real zero.
e.g. has degree and leading term , so it rises left, falls right, and meets the -axis at .
Deduce the least possible degree from a described graph
- From distinct -intercepts take , from turning points take , keep the larger.
- Ends agreeing forces even, disagreeing forces 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 intercepts and turns gives , even, and is odd, so .
Divide by a divisor of any degree (long division)
- Put both polynomials in standard form and fill every missing power of the dividend with .
- Divide the working remainder's leading term by the DIVISOR'S leading term for the next quotient term.
- Multiply the whole divisor by it, subtract the ENTIRE product, repeat.
- Stop when the working remainder is or its degree drops below the divisor's, then expand against .
e.g. over gives quotient , remainder .
Divide by a linear divisor (synthetic division)
- Check the divisor is linear: corner for , corner for .
- Write every coefficient across the top with placeholders, bring down the leader, multiply by the corner, add down each column.
- Read the bottom row as the quotient, one degree lower, last entry the remainder.
- For an divisor, divide that quotient by and leave the remainder alone.
e.g. over : corner gives , so quotient , remainder .
Find a remainder, or solve for an unknown coefficient
- Identify the value killing the divisor: for , for .
- Evaluate there, wrapping a negative input in parentheses before taking powers; that value IS the remainder.
- For an unknown coefficient, set that evaluation equal to the stated remainder ( if exact) and solve; two remainders give two equations.
e.g. divides exactly by when , so .
Factor completely from one known root
- Confirm the root by evaluating, then divide out to get , one degree lower.
- Hunt the next root INSIDE , retesting there in case it repeats, and peel again.
- Once is quadratic, stop hunting: over leave a negative-discriminant quadratic standing, over split it into its conjugate pair.
e.g. with root gives quotient , so .
Build a polynomial to order
- Turn each root into the factor , minding the sign, adding a nonreal root's conjugate when the coefficients must be real.
- Multiply each conjugate pair first, since that product is real, then attach the rest.
- Write , solve for from the extra point or the given leading coefficient, expand, check one root.
e.g. Roots with : , so .
Find every root of an integer-coefficient polynomial
- Clear fractional coefficients, and factor out the largest power of if the constant term is .
- List every with a positive divisor of the CONSTANT term and one of the LEADING coefficient, reduced and deduplicated.
- Test by synthetic division, integers before fractions; remainder means a root, and the same row gives the quotient.
- Peel and repeat until the quotient is quadratic, then finish with the quadratic formula, reporting nonreal roots too.
e.g. : candidates, and works, giving .
Exam traps
-
Trap Putting the divisor's own constant in the corner: dividing by with corner , reporting remainder .
Fix The corner holds the value making the divisor zero, so takes and the remainder is .
-
Trap Feeding a divisor that is not into the corner, or halving the remainder along with the quotient.
Fix For use corner , divide the QUOTIENT by , leave the remainder alone: over has remainder , not . Degree or more has no tableau; use long division.
-
Trap Omitting a placeholder: running over from the row .
Fix The row is . The short row returns remainder instead of remainder .
-
Trap Subtracting only the leading term of , or letting a subtracted negative keep its sign.
Fix Subtract the entire product, so subtracting ADDS . A row that fails to shift right means the leading term never cancelled.
-
Trap Promoting the candidate list to an answer: reporting as the roots of .
Fix Those eight are candidates; substituting leaves only , , and . 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 fails, yet it has the real roots .
-
Trap Hunting the next root back in , or assuming a found root cannot repeat.
Fix Search inside the quotient and retest there: , where is a root twice.