Euclidean Algorithm - An Example in Number Theory

The Euclidean Algorithm is an efficient method for computing the greatest common divisor of two integers. We demonstrate the algorithm with an example.

Teacher: Michael Harrison

♦♦♦♦♦♦♦♦♦♦
Ways to support our channel:

►  Join our Patreon : https://www.patreon.com/socratica
►  Make a one-time PayPal donation: https://www.paypal.me/socratica

♦♦♦♦♦♦♦♦♦♦
Connect with us!

Facebook: https://www.facebook.com/SocraticaStudios/
Instagram: https://www.instagram.com/SocraticaStudios/
Twitter: https://twitter.com/Socratica