HCF Applications
Most CAT HCF marks come from recognising the application, not the arithmetic. Three patterns dominate. First, the "largest equal piece" family: the biggest square tile that paves an L×B floor exactly, or the largest container that measures out several volumes — both equal the HCF of the dimensions. Second, the "greatest number dividing a, b, c exactly" is simply HCF(a, b, c). Third, the remainder trick: the greatest number that divides a, b, c leaving the SAME remainder is HCF of the differences, HCF(a−b, b−c, a−c); and the greatest number leaving DIFFERENT remainders r1, r2, r3 is HCF(a−r1, b−r2, c−r3), because subtracting each remainder makes the division exact. A fourth, smaller idea is the HCF of fractions = HCF(numerators)/LCM(denominators), useful when "the largest length that measures these fractional pieces" appears. The exam skill is translation: spot the words "largest", "greatest", "exactly", "leaving remainder" and reach for HCF.
✅ 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
Core HCF rules
| Prime factorization HCF | product of each common prime raised to its LOWEST power |
|---|---|
| Euclidean algorithm | HCF(a, b) = HCF(b, a mod b), until remainder = 0 |
| HCF × LCM (two numbers) | HCF(a, b) × LCM(a, b) = a × b |
| HCF of fractions | HCF(numerators) / LCM(denominators) |
| Co-prime check | a, b are co-prime ⇔ HCF(a, b) = 1 |
CAT application formulas
| Largest tile / container | side or capacity = HCF of the given dimensions |
|---|---|
| Greatest number dividing a, b, c exactly | HCF(a, b, c) |
| Greatest number leaving same remainder r | HCF(a − r, b − r, c − r) |
| Greatest number leaving remainders r1, r2, r3 | HCF(a − r1, b − r2, c − r3) |
| HCF scales with a common factor | HCF(ka, kb) = k × HCF(a, b) |