Number Theory: Euclidean Algorithm - An example

Thanks! Share it with your friends!

You disliked this video. Thanks for the feedback!

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


Recommended age: 12+
Teacher: Michael Harrison
Artist: Katrina de Dios
Category
number theory Mahematics
Tags
number theory, math

Post your comment

Comments

Be the first to comment