The Solution
Calculation: Synthetic Division Calculator
Synthetic Division Calculator
Enter your polynomial coefficients above and click "Perform Synthetic Division" to see results.Cubic Equation Solver
Find real and complex roots, discriminant, and cubic graphs in seconds with our precision solver.
Enter the cubic's coefficients and a divisor value r to perform fast synthetic division by (x − r).
Calculation: Synthetic Division Calculator
Synthetic Division Calculator
Enter your polynomial coefficients above and click "Perform Synthetic Division" to see results.The Treatise
The Formula
The Method
The Illustration
The Deep Dive
Synthetic division works because it is Horner's nested evaluation wearing a disguise. Writing P(x) = ((aₙx + aₙ₋₁)x + aₙ₋₂)x + ... + a₀ shows that evaluating at x = c needs only repeated multiply-by-c-and-add steps. The tableau performs exactly these steps while saving each intermediate result, and those saved intermediates turn out to be the quotient coefficients. Division and evaluation are the same computation viewed from two angles.
The last number of the tableau is the remainder, and the remainder theorem identifies it as P(c). This makes synthetic division two tools in one: a divider and an evaluator. Need P(7) for a degree-6 polynomial? Run the tableau with c = 7 and read the final entry. No powers to compute, no terms to add separately, just one clean cascade.
For a cubic, each successful division drops the degree by one, producing a deflation chain. Find one rational root with the rational root theorem, divide it out, and the remaining quadratic yields to the quadratic formula. Two tableaux can therefore solve a completely factorable cubic from scratch. This chain is precisely what the factorization calculator automates.
The tableau strictly requires a monic linear divisor (x − c). For (2x − 3), rewrite it as 2(x − 3/2): divide by (x − 3/2) with the tableau, then divide every quotient coefficient by 2. The remainder needs no adjustment. Forgetting this correction is the most common serious error, and for anything beyond linear divisors the honest tool is long division.
Paolo Ruffini published the method in 1804 and William Horner independently in 1819, but its real career began with computing. Horner's nested form needs only n multiplications for a degree-n polynomial instead of O(n²), and it rounds more gracefully than naive term-by-term evaluation. Every pocket calculator and math chip evaluates polynomials this way, so the tableau you draw by hand is the same algorithm silicon runs billions of times per second.
The Applications
Each rational candidate from the rational root theorem takes one short tableau to test. A zero in the last column confirms a root in seconds, which is why root hunting always pairs candidate generation with synthetic testing.
After each confirmed root, the quotient row becomes the new dividend for the next round. This deflation cascade reduces a cubic to a quadratic mechanically, with no fresh long division at any stage.
A full long division of a cubic fills half a page; the tableau fits in two lines. For homework and exams, that economy of writing also means fewer places for sign errors to hide.
Building a table of values for graphing means evaluating P(c) repeatedly. Each evaluation is one tableau, far quicker than substituting into the expanded form term by term.
Iterative solvers like Newton's method need P(x) and P′(x) evaluated at every step. Horner-style evaluation, the engine inside synthetic division, is the standard fast and stable choice.
The Cautions
Using the wrong sign for c: The divisor (x + 3) means c = -3, not 3. Read the divisor as (x - c) and solve for c every single time.
Forgetting zero placeholders: In x³ - 8, the x² and x terms are missing but their columns still exist. Write 1, 0, 0, -8, or every column shifts and the answer is garbage.
Applying to non-linear divisors: The tableau only works for divisors of the form (x - c). For quadratics or higher, use polynomial long division instead.
Misreading the quotient row: The bottom row has one fewer coefficient group than the top row. The last number is the remainder, not part of the quotient; its degree starts one lower than the dividend.
Claiming a factor from a nonzero remainder: Only a zero remainder proves (x - c) is a factor. A nonzero remainder is still useful, it equals P(c), but the division was not exact.
The Reference
The Collection
The Questions
Dividing a polynomial by (x - c) quickly, and as a bonus, evaluating P(c). It replaces long division whenever the divisor is linear and monic, which covers the majority of hand computations.
When the divisor is not of the form (x - c): quadratics, higher-degree divisors, or non-monic linears need adjustment. Use our long division calculator for those.
It is the remainder, and by the remainder theorem it equals P(c). Zero means (x - c) is a factor.
Use c = -5. Always rewrite the divisor as (x - c) first and read c off carefully.
Factor out the 3 to get 3(x - 2/3), run the tableau with c = 2/3, then divide the quotient coefficients by 3.
Every power of x owns a column. Skipping a missing term shifts all later columns left and corrupts the entire tableau.
Yes, for linear divisors it performs identical arithmetic with the x's stripped out, roughly half the writing and far fewer sign slips.
It tests candidates but does not invent them. Generate candidates with the rational root theorem, then let synthetic division judge each one.