Find GCF or GCD using the Euclidean Algorithm

Examples, solutions, videos, and worksheets to help Grade 6 students learn how to find the greatest common factor or greatest common divisor by using the Euclidean Algorithm.

The following diagram shows how to use the Euclidean Algorithm to find the GCF/GCD of two numbers. Scroll down the page for more examples and solutions.

 

The Euclidean Algorithm
Here is the Euclidean Algorithm! A great way to find the gcf/gcd of two numbers.

Finding the GCF using the Euclidean Algorithm
Demonstrates how to find the Greatest Common Factor using the Euclidean Algorithm.

Euclidean Algorithm
How do you find the greatest common factors of two numbers? Ask Euclid! Here we demonstrate and explain the famous Euclidean algorithm. (The method shown here uses subtraction instead of division)

Try the free Mathway calculator and problem solver below to practice various math topics. Try the given examples, or type in your own problem and check your answer with the step-by-step explanations.

We welcome your feedback, comments and questions about this site or page. Please submit your feedback or enquiries via our Feedback page.