Related Pages
Finding Greatest Common Factor
Least Common Multiple - LCM
More Arithmetic Lessons
Free Math Worksheets
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.
Greatest Common Divisor
The Greatest Common Divisor (GCD), often also called the Highest Common Factor (HCF), of two or more non-zero integers is the largest positive integer that divides each of the integers without leaving a remainder.
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.
Factors Worksheets
Practice your skills with the following Factors worksheets:
Printable & Online Factors Worksheets
How to find the GCD?
Listing Divisors (Factors) Method
This method is straightforward for smaller numbers.
Steps:
Prime Factorization Method
This method involves breaking down each number into its prime factors.
Steps:
Use the repeated division or ladder method
Greatest Common Divisors (GCDs)
Learn the definition of the “greatest common divisor” and solve three examples.
Examples:
How to find the Greatest Common Divisor, using the factor tree method?
Examples:
Use “repeated division”, “double division” or the “ladder method” to find the GCF or GCD of two numbers
Example:
Find the GCD of 24 and 60
How to Find the Greatest Common Divisor by Using the Euclidean Algorithm?
Examples:
Find GCD(10, 45)
Find GCD(1701, 3768)
Try out our new and fun Fraction Concoction Game.
Add and subtract fractions to make exciting fraction concoctions following a recipe. There are four levels of difficulty: Easy, medium, hard and insane. Practice the basics of fraction addition and subtraction or challenge yourself with the insane level.
We welcome your feedback, comments and questions about this site or page. Please submit your feedback or enquiries via our Feedback page.