Bézout, Gauss and Diophantine equations
From Euclid's algorithm to integer solutions: fast GCD computation, Bézout's identity and theorem, Gauss's theorem and Euclid's lemma, and the complete solution of equations ax + by = c.
Advanced 65 min 33 viewsmathématiquesarithmétiquesupérieur
Table of contents
- 01
Euclid and Bézout
- 02
Gauss and equations in integers