GCD (HCF)
The greatest common divisor GCD(a, b) — also called the highest common factor, HCF — is the largest integer that divides both a and b. The reliable method is prime factorisation: take each shared prime raised to its lowest power. For 48 = 2⁴·3 and 60 = 2²·3·5, the common primes are 2 (lowest power 2²) and 3, so GCD = 4 × 3 = 12. GCD answers "what is the largest equal group I can make?" — the biggest identical bundles, the largest square tile that fits a rectangle exactly, or the largest number of gift bags with the same contents. If two numbers share no prime factors, their GCD is 1 and they are called coprime (or relatively prime), which is exactly the condition for a fraction to be fully reduced.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Divisibility tests
| By 2 | last digit even |
|---|---|
| By 3 | digit sum divisible by 3 |
| By 4 | last two digits divisible by 4 |
| By 5 | ends in 0 or 5 |
| By 9 | digit sum divisible by 9 |
GCD & LCM
| GCD × LCM | GCD(a,b) × LCM(a,b) = a × b |
|---|---|
| LCM from GCD | LCM = (a × b) / GCD |
| Coprime numbers | GCD = 1 ⇒ LCM = a × b |
| Divisibility by 6 | divisible by 2 AND by 3 |