{
  "id": "polynomial-division",
  "title": "Polynomial Division",
  "lang": "en",
  "source_lang": "en",
  "summary": "Polynomial division expresses a polynomial as a multiple of a nonzero divisor plus a remainder of smaller degree, providing a fundamental algorithm for algebra and symbolic computation.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Division of polynomials"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/polynomial-division/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/polynomial-division/",
      "json": "https://aiwiki.page/zh/polynomial-division.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Polynomial division is the process of dividing one polynomial by another, producing a quotient and a remainder. For polynomials in one variable with coefficients in a field, such as the rational, real, or complex numbers, it gives a unique identity\n\n\\[f(x)=g(x)q(x)+r(x),\\]\n\nwhere the divisor \\(g(x)\\) is nonzero and the remainder \\(r(x)\\) is either zero or has degree smaller than that of \\(g(x)\\). This is the polynomial counterpart of division with remainder for integers. It underlies polynomial factorization, the computation of greatest common divisors, and arithmetic with polynomial congruences."
    },
    {
      "heading": "Division theorem",
      "text": "Let \\(K\\) be a field, and let \\(f,g\\in K[x]\\), where \\(K[x]\\) denotes the polynomials in one variable with coefficients in \\(K\\). If \\(g\\ne 0\\), there exist unique polynomials \\(q,r\\in K[x]\\) such that\n\n\\[f=gq+r, \\qquad r=0\\ \\text{or}\\ \\deg r<\\deg g.\\]\n\nHere \\(f\\) is the dividend, \\(g\\) the divisor, \\(q\\) the quotient, and \\(r\\) the remainder. The degree condition is essential: without it, many different quotient–remainder pairs could satisfy the identity.\n\nSeveral boundary cases follow directly:\n\n- If \\(f=0\\), then \\(q=r=0\\).\n- If \\(f\\ne 0\\) and \\(\\deg f<\\deg g\\), then \\(q=0\\) and \\(r=f\\).\n- If \\(g\\) is a nonzero constant, then \\(q=f/g\\) and \\(r=0\\).\n- Division by the zero polynomial is undefined.\n\nWhen \\(r=0\\), the division is exact, and \\(g\\) is said to divide \\(f\\).\n\nWhy existence and uniqueness hold\n\nExistence follows by repeatedly canceling the highest-degree term of the current remainder. Because every nonzero coefficient in a field has a multiplicative inverse, the leading coefficient of the divisor can always be divided into the leading coefficient of the current remainder. Each cancellation lowers the degree, so the process terminates.\n\nFor uniqueness, suppose\n\n\\[f=gq_1+r_1=gq_2+r_2.\\]\n\nThen\n\n\\[g(q_1-q_2)=r_2-r_1.\\]\n\nIf \\(q_1-q_2\\ne0\\), the left side has degree at least \\(\\deg g\\), whereas the right side is either zero or has degree less than \\(\\deg g\\). This is impossible, so \\(q_1=q_2\\) and consequently \\(r_1=r_2\\)."
    },
    {
      "heading": "Polynomial long division",
      "text": "Polynomial long division is a direct implementation of the division theorem. It resembles long division in elementary arithmetic, but terms are organized by powers of a variable rather than by place value.\n\nInitialize\n\n\\[q=0,\\qquad r=f.\\]\n\nWhile \\(r\\ne0\\) and \\(\\deg r\\ge\\deg g\\), form\n\n\\[t=\\frac{\\operatorname{lc}(r)}{\\operatorname{lc}(g)} x^{\\deg r-\\deg g},\\]\n\nwhere \\(\\operatorname{lc}\\) denotes the leading coefficient, and update\n\n\\[q\\leftarrow q+t,\\qquad r\\leftarrow r-tg.\\]\n\nThe expression \\(t\\) is the next term of the quotient. At every stage, the identity \\(f=gq+r\\) remains valid.\n\nWorked example\n\nDivide\n\n\\[f(x)=x^3-2x^2-4x+8\\]\n\nby\n\n\\[g(x)=x^2-3x+2.\\]\n\nFirst divide the leading terms:\n\n\\[\\frac{x^3}{x^2}=x.\\]\n\nSubtract \\(xg(x)\\) from \\(f(x)\\):\n\n\\[f(x)-xg(x)=x^2-6x+8.\\]\n\nThe next quotient term is \\(1\\). Subtracting \\(g(x)\\) gives\n\n\\[(x^2-6x+8)-(x^2-3x+2)=-3x+6.\\]\n\nSince the remaining polynomial has degree \\(1\\), smaller than the divisor’s degree \\(2\\), the procedure stops:\n\n\\[x^3-2x^2-4x+8 =(x^2-3x+2)(x+1)+(-3x+6).\\]\n\nThus the quotient is \\(x+1\\), and the remainder is \\(-3x+6\\). Missing powers in a dividend or divisor should be treated as having zero coefficients so that terms remain correctly aligned."
    },
    {
      "heading": "Synthetic division and linear divisors",
      "text": "Synthetic division is a compact coefficient-based form of polynomial division. Its standard form applies to a monic linear divisor \\(x-c\\), where monic means that the leading coefficient is \\(1\\).\n\nWrite\n\n\\[f(x)=a_nx^n+\\cdots+a_1x+a_0.\\]\n\nFor \\(n\\ge1\\), define\n\n\\[b_{n-1}=a_n,\\]\n\nthen compute, in descending order,\n\n\\[b_{k-1}=a_k+cb_k \\qquad (k=n-1,\\ldots,1).\\]\n\nThe quotient and remainder are\n\n\\[q(x)=b_{n-1}x^{n-1}+\\cdots+b_1x+b_0, \\qquad r=a_0+cb_0.\\]\n\nFor example, dividing \\(x^3-2x^2-4x+8\\) by \\(x-3\\) uses the coefficient sequence \\(1,-2,-4,8\\). Bringing down the first coefficient and repeatedly multiplying by \\(3\\) and adding gives\n\n\\[1,\\quad 1,\\quad -1,\\quad 5.\\]\n\nTherefore,\n\n\\[x^3-2x^2-4x+8=(x-3)(x^2+x-1)+5.\\]\n\nThese multiply-and-add operations are also the basis of Horner’s method for evaluating polynomials.\n\nRemainder and factor theorems\n\nDivision by \\(x-c\\) gives\n\n\\[f(x)=(x-c)q(x)+r,\\]\n\nwhere \\(r\\) is constant. Substituting \\(x=c\\) yields\n\n\\[r=f(c).\\]\n\nThis is the polynomial remainder theorem.\n\nConsequently,\n\n\\[(x-c)\\mid f(x)\\quad\\Longleftrightarrow\\quad f(c)=0.\\]\n\nThis statement, called the factor theorem, connects roots with linear factors. Once a root is known, exact division removes its corresponding factor and lowers the degree of the polynomial."
    },
    {
      "heading": "Dependence on the coefficient system",
      "text": "The coefficient system determines which divisions are possible. Division over the rational numbers, real numbers, complex numbers, or a finite field satisfies the theorem because each of these systems is a field.\n\nOver a general commutative ring, division with a degree-bounded remainder still works if the divisor’s leading coefficient is a unit, meaning that it has a multiplicative inverse in the ring. In particular, division by a monic polynomial works over every commutative ring.\n\nThe theorem can fail if the leading coefficient is not invertible. For example, dividing \\(x\\) by \\(2x\\) in \\(\\mathbb Z[x]\\), the polynomials with integer coefficients, would require\n\n\\[x=(2x)q+r, \\qquad r=0\\ \\text{or}\\ \\deg r<1.\\]\n\nDegree considerations force \\(q\\) to be constant, but matching the coefficient of \\(x\\) requires \\(q=1/2\\), which is not an integer. Over \\(\\mathbb Q[x]\\), the division is valid.\n\nPseudo-division\n\nFor integer coefficients and other integral domains, pseudo-division avoids introducing fractions by first multiplying the dividend by a power of the divisor’s leading coefficient.\n\nIf \\(\\deg f=m\\ge n=\\deg g\\) and \\(b=\\operatorname{lc}(g)\\), there are polynomials \\(Q,R\\) over the same domain such that\n\n\\[b^{m-n+1}f=gQ+R, \\qquad R=0\\ \\text{or}\\ \\deg R<n.\\]\n\nThe additional scaling preserves the coefficient domain, although intermediate coefficients may become large. Pseudo-division is useful in exact symbolic algorithms."
    },
    {
      "heading": "Algebraic applications",
      "text": "Greatest common divisors\n\nRepeated division gives the polynomial Euclidean algorithm:\n\n\\[f=gq_1+r_1,\\qquad g=r_1q_2+r_2,\\qquad \\ldots\\]\n\nThe degrees of successive nonzero remainders strictly decrease. The last nonzero remainder is a greatest common divisor of the original polynomials, up to multiplication by a nonzero constant. It is commonly normalized to be monic.\n\nThe extended algorithm also produces polynomials \\(a,b\\) satisfying\n\n\\[af+bg=d,\\]\n\nwhere \\(d\\) is a greatest common divisor. This identity is used to compute multiplicative inverses modulo a polynomial.\n\nPolynomial congruences and quotient rings\n\nFor a fixed nonconstant polynomial \\(g\\), define\n\n\\[f\\equiv h\\pmod g\\]\n\nwhen \\(g\\) divides \\(f-h\\). This parallels modular arithmetic for integers. Polynomial division assigns each congruence class a unique representative of degree less than \\(\\deg g\\).\n\nThese classes form the quotient ring \\(K[x]/(g)\\), where \\((g)\\) is the ideal consisting of all polynomial multiples of \\(g\\). If \\(g\\) is irreducible over \\(K\\), this quotient is a field. This construction is central to finite-field arithmetic.\n\nRational expressions\n\nThe division identity also gives\n\n\\[\\frac{f(x)}{g(x)} =q(x)+\\frac{r(x)}{g(x)},\\]\n\nwherever \\(g(x)\\ne0\\). It separates a rational expression into a polynomial part and a part whose numerator has smaller degree than its denominator. This is often an initial step in symbolic integration and partial-fraction decomposition."
    },
    {
      "heading": "Computational complexity and numerical issues",
      "text": "For a dividend of degree \\(m\\) and a divisor of degree \\(n\\), with \\(m\\ge n\\), classical long division requires\n\n\\[O\\bigl((m-n+1)(n+1)\\bigr)\\]\n\ncoefficient operations in big-O notation. This count treats each coefficient operation as having unit cost; with large exact integers or fractions, coefficient sizes also matter.\n\nFast division algorithms reverse the coefficient order and reduce quotient computation to truncated power-series inversion and multiplication. With fast polynomial multiplication, including suitable methods based on the fast Fourier transform, large dense divisions can be substantially faster than classical long division.\n\nExact algebraic identities do not guarantee accurate results in floating-point arithmetic. Cancellation, coefficient scaling, and rounding can affect computed quotients and remainders. A mathematically zero remainder may appear as a small nonzero polynomial, while a small computed remainder alone does not establish exact divisibility. Numerical stability therefore matters when division is performed with approximate coefficients."
    },
    {
      "heading": "Multivariable division",
      "text": "For polynomials in several variables, division requires a chosen ordering of monomials. A leading term can be canceled only when its monomial is divisible by the leading monomial of an available divisor.\n\nUnlike the one-variable field case, division by an arbitrary list of multivariable polynomials need not produce a unique remainder: the result can depend on both the monomial ordering and the order of the divisors. Gröbner bases address this problem. For a fixed monomial ordering, complete reduction by a Gröbner basis gives a unique reduced remainder, providing a systematic method for testing ideal membership and performing computations in algebraic geometry."
    }
  ],
  "links": [
    "polynomial",
    "field-mathematics",
    "arithmetic",
    "horners-method",
    "rational-number",
    "real-number",
    "complex-number",
    "finite-field",
    "ring-mathematics",
    "integer",
    "euclidean-algorithm",
    "greatest-common-divisor",
    "modular-arithmetic",
    "ideal-ring-theory",
    "big-o-notation",
    "power-series",
    "fast-fourier-transform",
    "floating-point-arithmetic",
    "numerical-stability",
    "groebner-basis",
    "algebraic-geometry"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}