Polynomial division writes a polynomial as a product plus a remainder. The remainder is zero or has lower degree than the divisor.
The process is useful well beyond obtaining a quotient. It connects evaluation and remainders, factors and zeros, and the long-run behaviour of rational functions. The important result is an identity that can be checked by multiplication.
On this page
State the division identity
For polynomials and with real coefficients and , there are unique polynomials and such that
where either or . This is the polynomial division algorithm. The restriction concerns the degree of a nonzero remainder, not the numerical size of its coefficients. A constant remainder of 100 is acceptable when the divisor is linear.
When , divide the identity by :
These two statements have different domains. The polynomial identity holds for every real . The quotient expression is undefined at zeros of the divisor, even if the remainder is zero. Keep that distinction when moving from polynomial algebra to a rational function.
If the dividend has lower degree than the divisor, take and . A nonzero constant divisor gives a zero remainder. The zero polynomial is allowed as a dividend or remainder; it does not need a degree assigned here. OpenStax’s division treatment provides the standard algorithm and notation.
Divide by cancelling the leading term
Divide
by . Write terms in descending powers. Each step removes the current highest power.
First term of the quotient
Divide by to obtain . Multiply the divisor by this quotient term, then subtract the entire product:
The cubic term has disappeared. The next quotient term must remove the remaining quadratic term.
Continue until the remainder has lower degree
Divide by to obtain . The subtraction is
Finally, divide by to obtain :
A constant has lower degree than a linear divisor, so the procedure stops. Thus
Reconstruct the original dividend:
This expansion checks every coefficient, rather than merely checking one selected input. As a rational expression, the result is , with .
Use synthetic division as a coefficient algorithm
For a divisor , synthetic division records the same calculation using coefficients. In the previous example, , so use , not .
| Step | Cubic coefficient | Quadratic coefficient | Linear coefficient | Constant |
|---|---|---|---|---|
| Dividend coefficients | 2 | 3 | −5 | 7 |
| Multiply preceding result by −2 | −4 | 2 | 6 | |
| Running totals | 2 | −1 | −3 | 13 |
Bring down 2. Multiply by −2 and add to 3, giving −1. Multiply −1 by −2 and add to −5, giving −3. Multiply −3 by −2 and add to 7, giving 13. The first three running totals form the quotient coefficients; the last is the remainder.
The shorter notation does not remove the need to align powers. For , the coefficients are . Omitting the two zeros would change the polynomial being divided.
Handle a non-monic linear divisor correctly
Consider
Long division gives the quotient and remainder zero. One check is
A synthetic calculation at divides by , not by . It gives the quotient . Since , divide that quotient by 2 to obtain the quotient for the original divisor.
The remainder is unchanged by this scaling. More generally, if
then
This explains both adjustments. Substituting finds the correct remainder for either linear divisor, but their quotient polynomials differ by a factor of .
Allow a polynomial remainder for a higher-degree divisor
Divide by . Successive leading-term cancellations use , and :
The result is
Stop at the linear remainder. Requiring a constant would impose a condition that belongs only to linear divisors. Here is nonzero for every real input, so the associated real quotient has no excluded input.
Understand why the answer is unique
Repeated leading-term cancellation lowers the degree at each step, so it must stop. This establishes the procedure’s existence over the real numbers, where dividing by a nonzero leading coefficient is possible.
For uniqueness, suppose two valid answers satisfy . Subtract:
If were nonzero, the left side would have degree at least . The right side is either zero or has degree below . They cannot be the same nonzero polynomial. Therefore the quotients agree, and then the remainders agree.
That argument also explains the stopping rule. Without the degree restriction, many product-plus-remainder descriptions would be possible.
Check algebra and interpretation separately
Check the identity by expanding . Check the stopping rule by comparing degrees. Finally, check the domain when the answer is written as a quotient. These tests answer different questions.
A zero remainder establishes a factor. It does not assign a value to at a zero of . An omitted zero coefficient changes the synthetic calculation. A sign mistake while subtracting a product usually contaminates all later coefficients, so keep parentheses around that product until the subtraction is complete.
Practice questions
- Divide by and verify the answer.
- Divide by . State the quotient and remainder.
- Divide by . What input must be excluded from the associated rational expression?
Check your answers
- and , since . The polynomial identity includes ; the quotient expression does not.
- Use coefficients and synthetic value . The running totals are , so and . Multiplying returns .
- , , because . The quotient is for .
Related topics
Use the Remainder Theorem when only a remainder is needed. The Factor Theorem turns zero remainders into factorisations, and Asymptotes uses the quotient to describe end behaviour.
