Polynomial division and greatest common divisors
Over a field F, f=gq+r has unique q,r for nonzero g, with r=0 or deg r<deg g.
Key knowledge
Over a field F, f=gq+r has unique q,r for nonzero g, with r=0 or deg r<deg g. Repeated division computes a greatest common divisor and expresses it as af+bg; choosing a monic divisor fixes its scalar ambiguity.
Conditions and scope
- The coefficient field supplies division by nonzero leading coefficients.
- Polynomial arithmetic is relative to that field; roots and factorization can change after field extension.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Section 6.3 Theorem 6.13, gcd definition and Euclidean/Bézout consequences.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- math-polynomial-euclidean-division
- Revision
- university-core.1
- Structured reference record
- University core expansion