Here is the habit. You multiply two polynomials, (A)(B) = C, distributing every term of A across every term of B. Before you circle the answer, plug x = 1 into the factored form A \cdot B and into the expanded form C. If the two numbers match, you probably didn't drop a term. If they disagree, go back and retrace — somewhere along the way a coefficient got miscopied or a sign flipped. The check costs ten seconds and catches more errors than any amount of re-reading.

This is the polynomial-specific cousin of the general plug-in-a-number sanity check. Why x = 1 is the star of the show will become clear in a moment.

Why x = 1 specifically

Evaluate any polynomial at x = 1 and something magical happens. Every power of x becomes 1 — x^2 = 1, x^3 = 1, x^{17} = 1. So a polynomial a_n x^n + a_{n-1} x^{n-1} + \cdots + a_1 x + a_0 collapses to

a_n + a_{n-1} + \cdots + a_1 + a_0,

which is just the sum of its coefficients. One number. Trivial arithmetic.

The same collapse happens on the factored side. If A(1) is the sum of A's coefficients and B(1) is the sum of B's coefficients, then A(1) \cdot B(1) is one number times another — again trivial.

So the check reduces to comparing (sum of coefficients of A) × (sum of coefficients of B) against sum of coefficients of the expanded product. If they match, no terms got lost in the distribution and no sign errors survived in a way that changes the total. If they disagree, there is a bug.

Worked example — a correct multiplication

Take (x + 2)(x^2 - 3x + 5).

Check the factored side at x = 1. (1 + 2)(1 - 3 + 5) = 3 \cdot 3 = 9.

Expand. Distribute each term of the first bracket across the second:

x(x^2 - 3x + 5) + 2(x^2 - 3x + 5) = x^3 - 3x^2 + 5x + 2x^2 - 6x + 10.

Collect: x^3 - x^2 - x + 10.

Check the expanded side at x = 1. 1 - 1 - 1 + 10 = 9. Match. Circle it and move on.

Worked example — catching an error

Student claims (x + 2)(x - 3) = x^2 + x - 6.

Factored side at x = 1: (1 + 2)(1 - 3) = 3 \cdot (-2) = -6.

Claimed expanded side at x = 1: 1 + 1 - 6 = -4.

Mismatch. The expanded answer is 2 too large, which — at x = 1 — points at a middle-term sign flip. Scanning back, the student spots it: x \cdot (-3) + 2 \cdot x = -3x + 2x = -x, not +x. The correct expansion is x^2 - x - 6. Re-check: 1 - 1 - 6 = -6. Match. The bug was caught in under a minute.

The check scales to arbitrary polynomials

Try (x^3 - 2x + 1)(x^2 + 3x - 4).

At x = 1: (1 - 2 + 1)(1 + 3 - 4) = 0 \cdot 0 = 0.

So whatever you write for the expanded product, the sum of its coefficients must also be 0. Multiply it out, collect like terms, add up the coefficients — if the total is not zero, you have an error. The check doesn't care how many terms are in each bracket; the arithmetic stays trivial.

The zero-at-x=1 edge case

Notice what just happened: both factors evaluated to 0 at x = 1. Their product is 0 no matter what you wrote on the right-hand side, as long as the total sums to 0. A sign error that preserves the total (say, +3x^4 written instead of -3x^4 somewhere balanced by another flip) would slip through.

Fix: when x = 1 gives zero on either factor, run a second check at x = 2. If the arithmetic there also matches, you are back on solid ground.

Second check — plug in x = -1

Plugging in x = -1 gives different information. Now even powers of x still equal 1 but odd powers flip to -1, so the check becomes the alternating sum of coefficients.

Try (x + 2)(x - 3) at x = -1: (1)(-4) = -4. Expanded x^2 - x - 6 at x = -1: 1 + 1 - 6 = -4. Match.

x = -1 catches different error classes than x = 1 — specifically anything that flips signs on odd-power terms, which the plain sum can miss.

Combined strategy — test at two points

The strongest version of this habit is: after any polynomial multiplication, plug in x = 1 and x = -1. Both sides must match at both values. Twenty seconds total. Catches more than 95% of real algebraic errors — dropped terms, sign flips, off-by-one coefficients, distribution misses.

Applies to more than multiplication

The sum-of-coefficients check works for every polynomial operation.

Every polynomial manipulation you do can be audited at x = 1.

The sum-of-coefficients as an invariant

For any polynomial p(x), the value p(1) is the sum of its coefficients, and evaluation at x = 1 respects the operations:

p(1) \cdot q(1) = (p \cdot q)(1), \qquad p(1) + q(1) = (p + q)(1).

Algebra on polynomials collapses to algebra on single numbers. That is why the check is cheap and effective: you are running the entire operation in miniature and comparing to the full version.

Recognition drill

Run the check on each of these in your head.

After a few minutes of doing this deliberately, the check becomes reflexive — you will do it automatically every time you write an equals sign between two polynomial forms.

When the check fails to catch

The check is not a proof. Two errors can cancel at x = 1 — a coefficient off by +2 balanced by another off by -2. Rare, but real. A second check at x = 2 kills the coincidence.

Sign errors in specific positions can also survive: flipping signs on two terms that contribute equally leaves the sum at x = 1 unchanged. The check at x = -1 catches this because odd and even powers split apart.

The full inspection recipe

After any polynomial manipulation:

  1. Plug x = 1 into both sides.
  2. If they match, you are probably correct.
  3. If they disagree, you have a definite error — go find it.
  4. As backup or when x = 1 gives zero, use x = -1 and x = 2.

That is the whole protocol. Fifteen seconds, a few small-integer multiplications, almost every real polynomial error caught before the grader's red pen.

Close

Polynomial arithmetic is error-prone. Distributing ten terms across ten gives a hundred little multiplications, any one of which can be miscopied. The sum-of-coefficients check at x = 1 audits the whole operation in one line of arithmetic. Ten seconds of your time, ninety percent of errors caught. There is no cheaper insurance in algebra. Don't skip it.