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

Additional study materials

Stay tuned! Bonus features for this video are under development...

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

Stay tuned! We'll be adding additional learning resources very soon.

No items found.

Stay tuned! Bonus features for this video are under development...

Course Page

Course Description

Number Theory is the study of whole numbers - also called integers. Since math began with the study of shapes and whole numbers, this is one of the oldest subjects around. However, it's also one of the most challenging. Many problems in number theory are easy to understand, but require a lot of cleverness to solve. It also does not require any advanced math to learn! Number Theory is for everyone.