Polynomial Long Division¶
Definition¶
Polynomial long division is the procedure that computes the quotient and remainder in the division algorithm for polynomials: for nonzero polynomials , the polynomials with coefficients in a field , there are unique polynomials and such that
with or .
Interpretation¶
Polynomial long division answers the question how often fits into and what is left over, just as integer division with remainder writes with . For polynomials, the size of the remainder is measured by its degree instead of its value.
Each step looks only at leading terms. If what is left of has leading term and has leading term with , the next term of the quotient is . Subtracting cancels the leading term and lowers the degree. The process stops as soon as what is left is or has degree smaller than , and that is . This is where the field matters: the step divides by the leading coefficient , which needs its inverse . With integer coefficients, dividing by would already need the quotient .
The most frequent case is division by . The remainder is then a constant, and substituting in shows that it equals . So is a root of if and only if the division leaves remainder . Repeated division is also the engine of the Euclidean algorithm for the greatest common divisor of two polynomials.
Key Results¶
- The quotient and remainder are uniquely determined.
- Polynomial division gives a quotient and remainder with the remainder of smaller degree.
Examples¶
- Dividing by gives quotient and remainder .
- Dividing by gives quotient and remainder : , with .
Prerequisites¶
Related Concepts¶
Sources¶
- Math II: Linear Algebra · Week 1
Aliases: polynomial division, long division of polynomials Symbols: element of, lambda
Last updated: 20 October 2026 03:02
Polynomial Long DivisionPolynomial Greatest Common DivisorPolynomialFieldRoot of a PolynomialFundamental Theorem of Algebra