What is the GCD?
The Greatest Common Divisor of two or more whole numbers is the largest integer that divides all of them exactly.
GCD(12, 18) = 6
Learn how to find the common divisors of two or more whole numbers and identify the Greatest Common Divisor for perfect equal partitioning without remainders!
Understand the mathematical significance of the GCD and its real-world problem-solving utility.
The Greatest Common Divisor of two or more whole numbers is the largest integer that divides all of them exactly.
GCD(12, 18) = 6
1. List all divisors of each number. 2. Identify the common divisors. 3. Choose the largest common divisor.
Common(12, 18) = { 1, 2, 3, 6 }
If two numbers share no common divisor other than 1, they are called relatively prime or coprime (GCD = 1).
GCD(8, 15) = 1
Choose how many numbers you want to compare (2, 3, or 4) to automatically see all common divisors and the GCD!
Fill in the numbers in the corresponding fields.
Mastered finding the Greatest Common Divisor? Challenge yourself with 10 interactive questions to test your skills!