1.2 The Euclidean Algorithm (FP2 - Chapter 1: Number theory)

#hindsmaths Using the Euclidean algorithm to find the greatest common divisor (gcd) of two numbers. Using Bezout's identity [gcd(a,b)=ax+by] 0:00 Intro 21:27 Example 7 24:14 Example 8 26:46 Example 9 30:36 Example 10 38:06 Example 11 44:16 End/Recap