The Euclidean Algorithm: How and Why, Visually

Discrete Math - 4.3.3 The Euclidean Algorithm

Euclidean Algorithm (Proof)

Extended Euclidean Algorithm and Inverse Modulo Tutorial

Extended Euclidean Algorithm to find the Inverse Example 1 - Part 2

GCD, Bezout, and Modular Inverses | The Extended Euclidean Algorithm

Diophantine Equations: Strategies and Examples

Diophantine Equation: ax+by=gcd(a,b) ← Number Theory

Mastering Diophantine Equations: Easy Methods for Finding Integer Solutions with Examples