Bézout's identity: ax+by=gcd(a,b)
11:29
Number Theory | The GCD as a linear combination.
13:29
The Euclidean Algorithm: How and Why, Visually
14:50
Extended Euclidean Algorithm Example
8:46
Corollary of bezout's lemma Proof
7:09
Bezout's Identity to solve ax+by=1 (a,b) are coprime
5:50
Number Theory: The Euclidean Algorithm Proof
9:49
Solving x^5=1
14:16