Factorisation and division methods for HCF and LCM, the product formula, and classic word-problem patterns.
HCF (Highest Common Factor) and LCM (Lowest Common Multiple) questions appear both directly and hidden inside word problems (bell-ringing, tank-filling, and traffic-light-style questions) — a compact but high-utility SSC Quant chapter.
This formula only holds for exactly two numbers — not for three or more.
| Method | Process |
|---|---|
| Factorisation Method | Express each number as a product of primes; HCF = product of common prime factors (lowest powers) |
| Division Method (Euclid's Algorithm) | Divide larger number by smaller; then divide previous divisor by the remainder; repeat until remainder = 0. Last divisor = HCF |
| Method | Process |
|---|---|
| Factorisation Method | LCM = product of all prime factors (highest powers appearing in any number) |
| Formula Method (2 numbers) | LCM = (a × b) ÷ HCF(a,b) |
| Formula |
|---|
| HCF of fractions = HCF(numerators) ÷ LCM(denominators) |
| LCM of fractions = LCM(numerators) ÷ HCF(denominators) |
This free chapter covers the key concepts. For complete coverage with 500+ MCQs, mock tests, and previous year analysis — grab the premium eBook.
📚 Browse Premium eBooks →