These lessons, with videos, examples and step-by-step solutions, explain how to find the greatest common divisor (GCD) or greatest common factor (GCF) using the definition, factor tree, repeated division, ladder method, Euclidean Algorithm.
The following diagrams show how to find the greatest common divisor (GCD). Scroll down the page for more examples and solutions on finding the greatest common divisor.
Greatest Common Divisors (GCDs)
Learn the definition of the “greatest common divisor” and solve three examples.
How to find the Greatest Common Divisor, using the factor tree method?
Use “repeated division”, “double division” or the “ladder method” to find the GCF or GCD of two numbers
Find the GCD of 24 and 60
How to Find the Greatest Common Divisor by Using the Euclidean Algorithm?
Find GCD(10, 45)
Find GCD(1701, 3768)
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.