Polynomial Division Calculator
Free Polynomial division Calculator for algebra. Enter values to get step-by-step solutions with formulas and graphs. Get results you can export or share.
Formula
P(x) = Q(x) * D(x) + R(x)
The division algorithm states that for polynomials P(x) (dividend) and D(x) (divisor, nonzero), there exist unique polynomials Q(x) (quotient) and R(x) (remainder) such that P(x) = Q(x) * D(x) + R(x), where deg(R) < deg(D) or R = 0.
Worked Examples
Example 1: Long Division of Cubic by Linear
Problem: Divide x^3 - 7x + 6 by (x - 1) using polynomial long division.
Solution: Dividend coefficients: 1, 0, -7, 6 (note the 0 for missing x^2 term)\nDivisor coefficients: 1, -1\n\nStep 1: x^3 / x = x^2. Multiply (x-1) by x^2: x^3 - x^2. Subtract.\nStep 2: x^2 / x = x. Multiply (x-1) by x: x^2 - x. Subtract.\nStep 3: -6x / x = -6. Multiply (x-1) by -6: -6x + 6. Subtract.\n\nQuotient: x^2 + x - 6\nRemainder: 0\n\nVerify: P(1) = 1 - 7 + 6 = 0. Factor Theorem confirmed!\nFurther factoring: x^2 + x - 6 = (x + 3)(x - 2)
Result: (x^3 - 7x + 6) / (x - 1) = x^2 + x - 6 | Remainder: 0
Example 2: Synthetic Division with Remainder
Problem: Use synthetic division to divide 2x^3 + x^2 - 13x + 6 by (x - 2).
Solution: Root: c = 2\nCoefficients: 2, 1, -13, 6\n\nBring down 2.\n2 * 2 = 4. Add to 1: 5.\n2 * 5 = 10. Add to -13: -3.\n2 * (-3) = -6. Add to 6: 0.\n\nResult row: 2, 5, -3, 0\nQuotient: 2x^2 + 5x - 3\nRemainder: 0\n\nSince remainder is 0, (x - 2) is a factor.\n2x^2 + 5x - 3 = (2x - 1)(x + 3)
Result: (2x^3 + x^2 - 13x + 6) / (x - 2) = 2x^2 + 5x - 3 | Remainder: 0
Frequently Asked Questions
What is polynomial long division and when should you use it?
Polynomial long division is an algorithm for dividing one polynomial by another, analogous to long division of numbers. It produces a quotient polynomial and a remainder polynomial such that dividend = (quotient)(divisor) + remainder. You should use polynomial long division whenever the divisor has degree 2 or higher, or when you need to see the step-by-step process. The algorithm works by repeatedly dividing the leading term of the current dividend by the leading term of the divisor, multiplying the result through, and subtracting. This process continues until the remaining polynomial has a degree less than the divisor. Polynomial division is fundamental for factoring, finding oblique asymptotes of rational functions, and simplifying complex rational expressions.
What is synthetic division and how does it differ from long division?
Synthetic division is a streamlined shortcut for dividing a polynomial by a linear divisor of the form (x - c). It uses only the coefficients and is significantly faster than long division, but it only works when the divisor is linear with a leading coefficient of 1. The process writes the root c on the left, lists the dividend coefficients across the top, then uses a bring-down-multiply-add pattern. The last number in the result is the remainder, and the other numbers are the quotient coefficients. For example, dividing x^3 - 6x^2 + 11x - 6 by (x - 2): write 2 on the left and coefficients 1, -6, 11, -6 across the top. The result gives quotient x^2 - 4x + 3 with remainder 0, confirming (x - 2) is a factor.
What is the Remainder Theorem and how does it relate to polynomial division?
The Remainder Theorem states that when a polynomial P(x) is divided by (x - c), the remainder equals P(c). This means you can find the remainder without performing the entire division: simply evaluate the polynomial at x = c. For example, dividing P(x) = x^3 + 2x - 5 by (x - 3): P(3) = 27 + 6 - 5 = 28, so the remainder is 28. This theorem has a powerful corollary called the Factor Theorem: (x - c) is a factor of P(x) if and only if P(c) = 0. These theorems together provide a systematic way to test potential factors of a polynomial and are essential in finding roots and factoring higher-degree polynomials.
How do you find oblique (slant) asymptotes using polynomial division?
When the degree of the numerator of a rational function is exactly one more than the degree of the denominator, the function has an oblique or slant asymptote. To find it, perform polynomial long division. The quotient (ignoring the remainder) gives the equation of the oblique asymptote. For example, for f(x) = (x^2 + 3x + 5)/(x + 1), dividing gives x + 2 with remainder 3. The oblique asymptote is y = x + 2. As x approaches infinity, the remainder term 3/(x+1) approaches zero, so the function approaches the line y = x + 2. This technique is essential for sketching the behavior of rational functions and is commonly tested in precalculus and calculus courses.
How do you verify that polynomial division was done correctly?
The primary verification method is the division algorithm identity: dividend = (quotient)(divisor) + remainder. Multiply the quotient by the divisor, add the remainder, and confirm the result equals the original dividend. You can also use numerical substitution: choose a value for x, evaluate all four expressions (dividend, divisor, quotient, remainder), and verify that dividend = quotient times divisor plus remainder at that value. A third check is the Remainder Theorem: if dividing by (x - c), evaluate the dividend at x = c and confirm it equals the remainder. Additionally, check that the degree of the quotient equals (dividend degree minus divisor degree) and that the remainder degree is strictly less than the divisor degree.
How is polynomial division used in factoring polynomials?
Polynomial division is the primary tool for factoring polynomials of degree 3 and higher. The strategy is: first find one root c (using the Rational Root Theorem, graphing, or trial), then divide the polynomial by (x - c) to reduce the degree. If P(c) = 0 by the Factor Theorem, the division gives zero remainder and produces a polynomial one degree lower. Repeat this process on the quotient. For example, to factor x^3 - 6x^2 + 11x - 6: test x = 1, get P(1) = 0, so (x - 1) is a factor. Divide to get x^2 - 5x + 6. Factor this quadratic: (x - 2)(x - 3). Complete factorization: (x - 1)(x - 2)(x - 3). This divide-and-conquer approach systematically reduces any polynomial to its linear and irreducible quadratic factors.