Remember dividing 738 by 3 in grade school? You didn't divide the whole number at once. You worked one digit at a time: divide, multiply, subtract, bring down the next digit, repeat.
Polynomial long division is that exact same algorithm. The only thing that changes is what you're tracking. Instead of place values like 100s, 10s, and 1s, you're tracking powers of : , , , and the constant term.
If you can divide 738 by 3, you already have the muscle memory for this. Let's rebuild it.
Why can't we just divide term by term?
Here's the tempting shortcut: why not divide every term of the top polynomial by every term of the bottom one, like you can with a single-term divisor?
That works fine for something like , because divides cleanly into each piece. But the moment your divisor has more than one term, like , that shortcut breaks. doesn't divide evenly into alone or alone. It only divides evenly into the whole polynomial, if it divides evenly at all.
So we need a real algorithm, one that handles the terms interacting with each other. That's exactly what long division does for numbers, and it's exactly what it does here too.
Watch the whole process happen
Let's divide by . Rather than describing each move in prose, watch it happen.
Press play and watch the divide, multiply, subtract, bring-down cycle repeat, exactly like long division with numbers.
Notice the rhythm. Every single step is the same four moves:
- Divide the leading term of what's left by the leading term of the divisor.
- Multiply that result by the entire divisor.
- Subtract the product from what's left.
- Bring down the next term.
Then you do it again on whatever remains. That's the whole algorithm. Three passes here because we started with a cubic and each pass knocks the degree down by one.
The one decision you make, over and over
But how do you know what to divide by, each time? This is the part that trips people up, so let's isolate it completely.
At every step, you only ever look at the leading term of what's left, and the leading term of the divisor. You ask: what do I need to multiply by to get this term? Whatever that answer is, that's your next quotient term. Nothing else about the polynomial matters for this decision, only the leading terms.
At every step you only look at the leading terms. Slide the remainder's leading coefficient and watch the quotient term update to always cancel it exactly.
And hey, notice what happens after you multiply back and subtract: the leading term always cancels to exactly zero. That's not a coincidence, it's the whole point. You chose the quotient term specifically so it would cancel. That's why the degree drops by at least one every single step, which is what guarantees the algorithm actually finishes.
We write the single-step rule as:
When do you stop?
So the degree keeps dropping each step... but drops to what? When do you actually put the pencil down?
Here's the rule: you stop the moment the remainder's degree is smaller than the divisor's degree. Once that happens, the divisor's leading term can't "go into" the remainder's leading term anymore, not even once, so there's nothing left to divide.
The divisor here is fixed at degree 2. Slide the remainder's degree down and notice exactly where the algorithm has to stop.
This is why dividing by a linear term like (degree 1) always ends with a plain number as the remainder (degree 0), and why dividing by a quadratic can leave a linear remainder behind. The remainder's degree is always strictly less than the divisor's. Same as how dividing integers by 7 always leaves a remainder between 0 and 6, never 7 or more.
Does the answer actually check out?
Here's a healthy question to ask: how do you know the quotient and remainder you got are actually correct?
The same way you check remainder : multiply back. . ✓.
For polynomials, the check is the same identity:
This isn't just a sanity check, it's a guarantee. No matter which divisor you pick, multiplying the quotient back out and adding the remainder has to reconstruct the original polynomial exactly. Let's see that live.
Drag the marker to pick a divisor (x − r). The quotient and remainder update, but q(x)(x − r) + r always reconstructs the exact same curve.
Drag that marker anywhere. The dashed reconstruction curve never once drifts off the solid original curve, because algebraically they're forced to be identical. And watch what happens when you drag it to , , or : the remainder snaps to exactly 0. That's the remainder theorem showing up for free. A remainder of zero means is an exact factor, which is the whole bridge between polynomial division and polynomial factoring.
The short version
Polynomial long division is ordinary long division, just with powers of instead of place values. At every step you divide leading terms to get the next quotient piece, multiply that piece by the full divisor, subtract, and bring down the next term. You stop when the remainder's degree drops below the divisor's degree. And you can always verify your answer the same way you'd verify integer division: multiply the quotient by the divisor, add the remainder, and you should land right back on the polynomial you started with.
Once you see it as "long division, but for 's instead of digits," the notation stops being the hard part. The hard part was never the notation, it was believing the leading terms are all that matter at each step. Now you've watched it happen.
All visualizations are interactive React components running entirely in your browser, built with plain SVG and requestAnimationFrame. No charting libraries, no external math engines.