Polynomial long division
Summary
Polynomial long division is the algorithm that divides a polynomial by a polynomial with invertible leading coefficient. It produces the quotient and the remainder with and . 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
About this page
| Tag | D6D0SR1FK3 |
|---|---|
| URI | m2://D6D0SR1FK3 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 13F20, 68W30 |
| Same as | |
| Changed | 2 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.