You are doing polynomial division. The arithmetic ends and you look at the last line — there is a number sitting there: the remainder.

This is the moment. Train your eye to notice it. If that remainder is zero, the next step is not "continue the problem" — it is "stop and factor." The division has handed you a factorisation P(x) = D(x) \cdot Q(x) for free. The hard part of the problem is behind you.

This article is about forming that reflex. Not about proving the Factor Theorem (see the sibling article), but about what you do with your attention in the half-second after the remainder appears.

Why this is a recognition moment

In every polynomial factoring problem, the hard part is finding any factor. Once you have one, the rest collapses.

Suppose P(x) has degree n. Finding a first factor of degree 1 leaves a quotient Q(x) of degree n - 1. You have reduced the problem by one rung — and the same method that worked on P often works on Q. A quartic becomes a cubic; the cubic becomes a quadratic; the quadratic factors by the formula you already know. Each zero-remainder event drops the staircase by one step.

So when the remainder turns out to be zero, the correct thought is: the staircase moved. What is the smaller polynomial, and how do I factor it? The division is over. The factorisation has begun.

The reflex sequence

Write this sequence into your habit:

  1. Division complete. You finished the arithmetic — long division, synthetic, or a single P(a) evaluation.
  2. Read the remainder. Look at the last number. Do not skip this step.
  3. If nonzero: the divisor was not a factor. Move on, try a different candidate.
  4. If zero: the divisor is a factor. Write P(x) = D(x) \cdot Q(x). Now focus on Q(x).

The point of step 2 is to train yourself to look. The remainder is the verdict — factor or not — and it decides your next move.

Worked example — a degree-3 polynomial

Take P(x) = x^3 - 3x^2 + 4x - 12. Try dividing by (x - 3). The fastest check is evaluation:

P(3) = 27 - 27 + 12 - 12 = 0 \; \checkmark

Remainder zero. Now the reflex fires — stop hunting, start factoring. Divide P by (x - 3) to get the quotient:

Q(x) = x^2 + 4

Turn attention to Q. It is a quadratic with discriminant 0^2 - 4 \cdot 1 \cdot 4 = -16 < 0, so it has no real roots. Over the reals, Q is irreducible — the staircase stops here. The full real factorisation is

P(x) = (x - 3)(x^2 + 4).

Notice the flow. Zero remainder \rightarrow write factor \rightarrow try to factor quotient \rightarrow stop when no more factoring is possible. All triggered by the single observation that the remainder came out zero.

Worked example — a degree-4 polynomial

Stretch the pattern. Take P(x) = x^4 - 5x^3 + 5x^2 + 5x - 6. Try x = 1:

P(1) = 1 - 5 + 5 + 5 - 6 = 0 \; \checkmark

One factor: (x - 1). Divide to get Q(x) = x^3 - 4x^2 + x + 6. Recursion kicks in — now try small candidates on Q. Try x = 2:

Q(2) = 8 - 16 + 2 + 6 = 0 \; \checkmark

Another factor: (x - 2). Divide: the new quotient is x^2 - 2x - 3 = (x - 3)(x + 1). Stack everything up:

P(x) = (x - 1)(x - 2)(x - 3)(x + 1).

Four roots — 1, 2, 3, -1. Each announced itself with a zero remainder.

The recursive pattern

Factoring a polynomial of any degree becomes a single loop once the reflex is in place:

  1. Find one factor — try small rational candidates, compute P at each, watch for zero.
  2. Divide by the factor you found; the quotient has degree n - 1.
  3. Go back to step 1 on the quotient.
  4. When the quotient is quadratic, factor it directly (discriminant, formula, or inspection).
  5. If the quotient is irreducible (negative discriminant, no real roots), stop.

Every iteration hinges on one zero-remainder event. The moment the remainder is zero, the loop has made progress, and the next thing you do is hand the quotient back to the top.

Which divisors to try

The loop asks you to guess factors. Guess smartly. The Rational Root Theorem narrows the list: for integer-coefficient P, any rational root p/q in lowest terms has p dividing the constant term and q dividing the leading coefficient. Start with small integers — \pm 1, \pm 2, \pm 3 — then the factors of the constant term, then rationals.

A small habit worth forming: if the constant term is 0, then x = 0 is already a root. Factor out x before you start guessing.

Zero remainder in polynomial long division — not just synthetic

The reflex is not restricted to linear divisors. Take (x^4 + 3x^2 + 2) \div (x^2 + 1). Long division gives quotient x^2 + 2 and remainder 0. Reflex fires:

x^4 + 3x^2 + 2 = (x^2 + 1)(x^2 + 2).

Both factors are irreducible over the reals, so you are done. The shape of the divisor does not matter — divide anything by anything, see zero at the end, write down the factorisation.

What if none of your trial divisors give zero remainder?

Sometimes you run through every rational candidate and none give zero. That is a real outcome — the polynomial has no rational roots. Its real roots, if any, are irrational (like \sqrt 2), or all its roots are complex. The reflex has done its job by telling you rational factoring is closed. Switch strategies: numerical methods, special substitutions, or accept that the polynomial will not split into nice pieces.

The habit in exam context

Exam problem: "Factorise x^3 + 2x^2 - 5x - 6." Your first move, always, is to scan rational-root candidates. Try x = 1, -1, 2, -2, 3, -3 in order. At x = -3:

P(-3) = -27 + 18 + 15 - 6 = 0 \; \checkmark

Reflex fires. Divide by (x + 3); the quotient is x^2 - x - 2, which factors as (x - 2)(x + 1). Final answer:

P(x) = (x + 3)(x - 2)(x + 1).

You never had to think "what are the factors?" — you checked candidates, watched the remainder, and acted the moment it was zero.

Zero-remainder checks when factoring by inspection

Sometimes you factor without explicit division — grouping, an identity, a guess. The reflex still applies, just flipped. Multiply your claimed factors back together. If the product equals the original polynomial, your factorisation is correct. Multiplying factors and matching coefficients is a zero-remainder check run in reverse: P - D \cdot Q should be zero. This is always how you verify a factorisation obtained by inspection.

Recognition drill

For each case, divide (or evaluate), state the remainder, and if zero continue factoring.

One reflex applied four times — three zeros triggered the next factoring step, one ruled a candidate out.

The takeaway

Zero remainder means factor found. Factor found means a smaller polynomial Q(x) to factor next. Check the remainder first, every time — the factoring either opens up or it does not, and the remainder is what tells you which.

The reflex is short: finish the division, read the remainder, act. Train the eye to the last line of the arithmetic, and polynomial factoring stops being a search and becomes a loop.