Euclidean Algorithm - An Example in Number Theory
This article explains the Euclidean Algorithm, an efficient method for finding the greatest common divisor of two integers, illustrated with a practical example.
Socratica
199.8K views • Jan 8, 2012
About this video
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
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
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
199.8K
Likes
2.2K
Duration
2:04
Published
Jan 8, 2012
User Reviews
4.5
(39) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now