7TH GRADE • THEORY & LAB
Greatest Common Divisor (GCD)
Learn how to find the greatest common divisor of two, three, or four numbers using divisor sets and prime factorization.
1Definition of Greatest Common Divisor
Greatest Common Divisor (GCD) of two or more non-zero natural numbers is the largest of their common divisors.
GCD(a, b) or GCD(a, b, c) or GCD(a, b, c, d)
Classic Example for numbers 12 and 18:
- Divisors of 12: { 1, 2, 3, 4, 6, 12 }
- Divisors of 18: { 1, 2, 3, 6, 9, 18 }
- Common Divisors: { 1, 2, 3, 6 }
- Therefore: GCD(12, 18) = 6
SPECIAL AND IMPORTANT CONCEPT
Relatively Prime Numbers (Coprime)
Two or more numbers are called coprime (relatively prime) when their only common divisor is 1.
GCD(a, b) = 1
Caution: The numbers do not need to be prime themselves! For instance, 8 and 9 are both composite numbers, but they are coprime because GCD(8, 9) = 1.
2Finding GCD via Prime Factorization
For large numbers, listing all divisors is time-consuming. We apply the prime factorization rule:
GCD CALCULATION RULE
The Greatest Common Divisor equals the product of common prime factors, each raised to its lowest exponent.
- Factor each number into a product of prime factors.
- Identify only the prime factors that are common to all numbers.
- For each common factor, pick the lowest exponent.
- Multiply these powers together.
STEP-BY-STEP EXAMPLE: 24, 36 AND 60
24 = 23 · 3
36 = 22 · 32
60 = 22 · 3 · 5
Rule Application:
Common factor 2: lowest exponent is 2 → 22
Common factor 3: lowest exponent is 1 → 3
Factor 5 is omitted because it is not present in 24 and 36.
GCD(24, 36, 60) = 22 · 3 = 4 · 3 = 12
3Interactive Lab: GCD Calculation for 2, 3, or 4 Numbers
SELECT NUMBER COUNT
Choose whether to calculate GCD for 2, 3, or 4 numbers:
PRIME FACTORIZATION OF EACH NUMBER
Number 24:24 = 23 · 3
Number 36:36 = 22 · 32
Number 60:60 = 22 · 3 · 5
COMMON PRIME FACTORS CHECK
Prime 2✓ Common
Min exp: 2
Prime 3✓ Common
Min exp: 1
Prime 5✗
GCD RESULT
12
GCD(24, 36, 60) = 12
COMMON FACTORS EXPANSION:
GCD = 22 · 3 = 12