CAT Quant · Chapter Test
HCF — 25-Question Test
A fresh, mixed-difficulty set drawn from the whole chapter — questions you haven't been asked before. Auto-graded with full solutions; your result is saved to your dashboard.
Building your 25-question test…
Formula Reference Sheet
This chapter
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) |
CAT reference
🖩 Graphing Calculator