GCD - Euclidean Algorithm (Method 1)

GCD - Euclidean Algorithm (Method 2)

How to Find the Greatest Common Divisor by Using the Euclidian Algorithm

Greatest Common Divisor (GCD) - Ex. 1

Calculator Technique | Greatest Common Divisor

An Example of GCD, and Extended Euclidean Algorithm In Finding the Bezout Coefficients

Lesson 04 Comparing the GCD and the LCM - SimpleStep Learning

(4.10.29) Mathematical Proof: Relationship Between GCD and LCM

Discrete Math - 4.3.2 Greatest Common Divisors and Least Common Multiples