Interactive Math & Science Lessons

Polynomial Division Trainer

Enter coefficients highest degree first, comma-separated.

Loading interactive simulation...

Dividing by x − r needs no x at all 🖖

When the divisor is x − r, the whole long-division layout collapses into a single row of arithmetic on the coefficients: bring one down, multiply by r, add, repeat. That is synthetic division, and it is the same procedure as Horner’s method for evaluating a polynomial — which is why the last number you write is both the remainder and the value of the polynomial at r. The efficiency is real, not cosmetic: a degree-10 polynomial takes 10 multiplications this way against 19 if you compute each power separately. It is how numerical libraries actually evaluate polynomials, because fewer operations also means less rounding error accumulating.

The remainder is a hidden value 🖖

Polynomial long division works just like the long division of whole numbers you already know: peel off one term at a time and subtract. The neat payoff appears when you divide by a simple factor like (x - c) — the leftover remainder equals exactly p(c), the polynomial evaluated at c. So a remainder of zero means c is a root, and you found it without ever plugging the number in.

Your files are checked by this 🖖

Every CRC checksum — the error check on a saved file, a ZIP archive, or an Ethernet packet — is polynomial long division in disguise. The data bits become coefficients of a giant polynomial over the field GF(2), where arithmetic is done modulo 2 so addition is just an XOR. That polynomial is divided by a fixed generator polynomial, and the remainder is the checksum. The same algorithm this trainer walks through by hand runs billions of times a second inside network hardware.

Problem solved in full

  1. Dividing 2x³ − 3x² + 4x − 5 by x − 2 5 steps

    Dividing 2x³ − 3x² + 4x − 5 by x − 2 leaves a remainder of 7. Get there by synthetic division, and then obtain the same 7 without dividing at all.

    1. Synthetic division is long division with the bookkeeping removed. Only the coefficients matter, and dividing by x − r means the multiplier is r.

    2. Bring down the 2, multiply by 2 and add to −3 to get 1, multiply by 2 and add to 4 to get 6, multiply by 2 and add to −5 to get 7. The first three are the quotient; the last is the remainder.

    3. Written out, that is the division algorithm for polynomials — and the identity holds for every x, not just convenient ones.

    4. So substitute x = 2. The (x − 2) factor annihilates the entire quotient, whatever it happens to be, and the identity collapses to P(2) = the remainder.

    5. Evaluating P(2) directly gives 7, matching the division without any division having been done.

    Answer

    The tool prints a quotient of 2x² + x + 6 and a remainder of 7. The remainder theorem is what step 4 proves, and it is worth more than the shortcut it provides: because the remainder is P(r), asking whether (x − r) divides a polynomial is the same as asking whether P(r) = 0. Here it is 7, so it does not. That equivalence turns factor-hunting into evaluation — try divisor values until the remainder reads 0, and you have found a root and factored the polynomial in the same step.

Learning path

Beyond the quadratic

Leads to Rational functions the factor theorem, working in both directions.

References (1)

· Updated

Reviewed against published sources. Corrections welcome. Editorial policy · Corrections

All Mathematics lessons →

Example problems