The Extended Euclidean Algorithm to Find GCD
In this video, I will explain the extended euclidean algorithm to find the GCD of two positive numbers. The GCD is the greatest common divisor. This is the extension of the Euclidean Algorithm because it involves a formula GCD(a,b) = ax + by where after you find the gcd, you have to find Bezout's coefficients such that the equation is satisfied. The extended Euclidean Algorithm has lots of applications in science and engineering. Students typically learn this in Discrete Math classes.
▶︎
GCD - Euclidean Algorithm (Method 1)
▶︎
Extended Euclidean Algorithm Example
▶︎
Prime Factorization to find GCD and LCM of two numbers! (So easy!)
▶︎
The Euclidean Algorithm: How and Why, Visually
▶︎
How to Prove or Disprove Big Θ - Introduction to Computer Science
▶︎
Bézout's identity: ax+by=gcd(a,b)
▶︎
Solve a Linear Congruence using Euclid's Algorithm
▶︎
Radix Sort Algorithm: A Step-by-Step Visualization
▶︎
The Man Who Went From Working At A Subway, To Solving An "Impossible" Math Problem
▶︎
Number Theory: The Division Algorithm
▶︎
How to Prove or Disprove Big-O - Introduction to Computer Science
▶︎
Overexplaining the binomial distribution
▶︎
When Genius Teens Destroy Corrupt Cops
▶︎
Chinese Remainder Theorem
▶︎
Extended Euclidean Algorithm - Example (Simplified)
▶︎
GCD, Bezout, and Modular Inverses | The Extended Euclidean Algorithm
▶︎
The Subtle Reason Taylor Series Work | Smooth vs. Analytic Functions
▶︎
The Extended Euclidean algorithm
▶︎
How to Take the Factorial of Any Number
▶︎