The Extended Euclidean algorithm
14:50
Extended Euclidean Algorithm Example
6:58
The Euclidean Algorithm
8:31
Using Euclidean algorithm to write gcd as linear combination
14:23
Solve a Linear Congruence using Euclid's Algorithm
10:16
Extended Euclidean Algorithm (Solved Example 1)
9:43
Diophantine Equation: ax+by=gcd(a,b) ← Number Theory
18:20
Bézout's identity: ax+by=gcd(a,b)
13:22