Euclidean Algorithm - An example ← 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 : Patreon: socratica
►  Make a one-time PayPal donation: https://www.paypal.me/socratica

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

Facebook: Facebook: SocraticaStudios
Instagram: Instagram: SocraticaStudios
Twitter: Twitter: Socratica

• #education
• #euclid
• #euclidean_algorithm
• #gcd
• #greatest_common_divisor
• #socratica
• #math
• #number_theory
• #mathematics
• #euclids_algorithm
• #maths
• #euclids_algorithm_to_find_gcd
• #euclids_algorithm_for_gcd
• #euclids_algorithm_for_gcd_of_two_numbers