Find One Root, Divide by (x − r), Repeat — How to Tame Higher-Degree Polynomials

When you face a cubic or quartic for the first time, the natural reaction is panic. You know how to handle a quadratic — discriminant, formula, done — but the higher-degree thing in front of you has no obvious shape. Splitting the middle term does not apply. None of the identities fit.

The way out is not a new formula. It is a strategy: shrink the problem, one degree at a time. Find one root r — guess small integers, use the Rational Root Theorem — and trade your degree-n polynomial for a degree-(n-1) quotient. The hard work is finding the first root. After that, you keep applying the same trick to whatever is left, until the leftover is a quadratic you can solve by sight or by formula.

This is the iterative degree-reduction strategy. Once you internalise it, every higher-degree problem in your textbook becomes a sequence of moves you already know.

The Factor Theorem is what makes this work

The whole strategy rests on one fact. For a polynomial P(x):

Why: this is the Factor Theorem. The forward direction says if r is a root, then (x - r) is a factor. The reverse says if (x - r) is a factor, then r is a root. The two are equivalent — finding a root and finding a linear factor are the same operation.

So if you plug in r = 2 and the polynomial evaluates to zero, you have not just found a root — you have found a factor. Long division by (x - 2) will leave a remainder of exactly zero, and the quotient will be a polynomial one degree smaller.

Why long or synthetic division gives an exact quotient: when the remainder is zero, the dividend is precisely the divisor times the quotient. There is no leftover. Symbolically, P(x) = (x - r) \cdot Q(x), where Q(x) has degree exactly one less than P(x). Synthetic division — the shortcut for dividing by linear factors (x - r) — produces the coefficients of Q in a single line of arithmetic.

That degree drop is the engine of the whole method.

The ladder: how degrees collapse

Each time you peel off a linear factor, the polynomial loses one rung of the ladder. A quartic becomes a cubic, then a quadratic, then two linear factors. Visually:

The ladder image is the right one to keep in your head. You do not solve a quartic in one move. You drop it to a cubic, drop the cubic to a quadratic, then close.

The loop, written out

Here is the full strategy in five lines:

1. Find one root. Try x = \pm 1, \pm 2, \pm 3, \dots Check the constant term's divisors first (Rational Root Theorem).
2. Divide. Use synthetic or long division to compute Q(x) = P(x) / (x - r).
3. Look at the quotient. Is it a quadratic? Solve directly. Is it cubic or higher? Recurse — go back to step 1 with Q(x) as your new polynomial.
4. Stop when you reach a quadratic with no rational roots — finish with the quadratic formula.
5. Stack the factors. The full factorisation is (x - r_1)(x - r_2) \cdots \cdot Q_{\text{final}}(x), where Q_{\text{final}} is whatever quadratic you could not split.

That is it. Three pieces of information at every stage: the polynomial, the candidate root, the quotient. Round and round until done.

1 |  1   -6    11    -6
  |       1    -5     6
  |---------------------
     1   -5     6     0

-2 |  1    2    -7    -8    12
   |      -2     0    14   -12
   |-----------------------------
      1    0    -7     6     0

1 |  1    0    -7     6
  |       1     1    -6
  |----------------------
     1    1    -6     0

2 |  1   -4    6    -4
  |       2   -4     4
  |----------------------
     1   -2    2     0

A few habits that make the loop fast

• Try \pm 1 first, always. If the polynomial has a root of \pm 1, you find it with two additions in your head — no division needed. Substitute and check. Many textbook problems are built around this.
• If all coefficients are positive, no positive root exists. P(2) = a sum of positives, never zero. Skip to negative candidates.
• Use synthetic division, not long division, for linear divisors. It is faster, fits in less space, and the remainder appears at the bottom-right corner — easy to spot.
• Halt at the quadratic. Do not try to find a third root by guessing; switch to the quadratic formula. The Rational Root Theorem may produce no candidates that work, and that's expected.
• Keep stacking factors. Each round adds one new (x - r_i) to the product. Do not lose track — write each factor down as you find it.

What if you cannot find any rational root?

Sometimes you exhaust the candidate list and nothing gives zero. The polynomial has no rational roots. That doesn't mean it has no roots — it has irrational or complex roots. Three exits:

• All complex. Possible if the polynomial has even degree and stays positive everywhere (like x^4 + 1). Move to numerical methods or accept the polynomial as irreducible over \mathbb{Q}.
• Irrational real roots. Roots like \sqrt{2} slip past the Rational Root Theorem. Use numerical methods or special substitutions.
• A quadratic factor that is irreducible. As in Example 3, you may end up at a quadratic with negative discriminant; that block is the final irreducible piece over the reals.

The loop's exit conditions are: quadratic reached (close it), or no rational candidate works (switch tools). Either way, you have a clean stopping rule.

The recognition reflex

The whole strategy is one reflex, fired repeatedly: see a polynomial of degree ≥ 3, hunt for one rational root, divide, recurse. No tricks, no special identities — just the Factor Theorem and synthetic division, applied in a loop. Once you've drilled it on a few cubics and a quartic, every higher-degree problem in your textbook follows the same script.

For one-off problems where the leading coefficient is not 1 (so candidate fractions like \pm \tfrac{1}{2} enter the menu), the Rational Root Theorem does the bookkeeping. For the recognition that "remainder zero means stop hunting and start factoring," see Zero Remainder Unlocks Factorisation.

References

1. Factor theorem — Wikipedia
2. Synthetic division — Wikipedia
3. Rational root theorem — Wikipedia
4. Polynomial long division — Wikipedia