MATH1010 · Theorem · Chapter 5 · 5. Antiderivatives, integration and accumulated change
Bézout identity
3 steps of prerequisites below it
The Euclidean algorithm gives a greatest common divisor as a polynomial combination, so coprime polynomials A and B satisfy uA + vB = 1; distinct monic irreducibles and their powers are coprime.
Taught in
Uses
- Finite binomial theorem · used in an argument or worked solution, passage 5.3
- Division with remainder · used in an argument or worked solution, passage 5.3
Used by
Everything this builds on, earliest first · 6 steps
Each step comes after its own prerequisites, so reading in this order never needs something you have not met. It is a reading order for these notes, not a diagnosis of what you know.
- Mathematical induction · 1.2
- Binomial coefficient · 1.2
- Pascal's identity · 1.2
- Finite binomial theorem · 1.2
- Polynomial degree · 5.3
- Division with remainder · 5.3
Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.
Longest chain down to a starting point
Each step is used by the one above it, across courses where the notes link them. It ends at a point the notes define without another point.