Math 2.0

Commutative algebra Concept

Polynomial long division

Summary

Polynomial long division is the algorithm that divides a polynomial ff by a polynomial gg with invertible leading coefficient. It produces the quotient qq and the remainder rr with f=qg+rf = q g + r and deg⁡r<deg⁡g\deg r < \deg g. These are the quotient and remainder of the division algorithm for polynomials. It is the basic step of the Euclidean algorithm for polynomials and of many computations in algebra.

Where this leads

4 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Polynomial_long_division
About this page
TagD6D0SR1FK3
URIm2://D6D0SR1FK3
Kindconcept
WritingW0 stub
MSC13F20, 68W30
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Definitions