LCM and HCF Solved Questions
LCM and HCF questions reward knowing the prime-factorization method cold, plus the shortcuts connecting the two and the standard "remainder" variants. This page covers the core method, the two classic remainder patterns, the LCM application for repeating events (like bells ringing together), and several fully worked examples.
Written by Mahesh Srivastava, Founder of Pariksha Saathi. Published: 2026-10-03. Editorial standards & corrections
The concept, quickly
- HCF (Highest Common Factor) is the largest number that divides every given number exactly. LCM (Lowest Common Multiple) is the smallest number that every given number divides into exactly.
- Prime factorization method: break each number into prime factors. HCF = product of the common prime factors, each at its LOWEST power across the numbers. LCM = product of all prime factors (common and uncommon), each at its HIGHEST power.
- Useful shortcut for two numbers a and b: HCF(a, b) × LCM(a, b) = a × b. This lets you find one directly from the other without refactorizing. If a and b are co-prime (HCF = 1), this simplifies further: LCM = a × b directly.
- For "largest number that divides X, Y and Z leaving the same remainder R" questions, find the HCF of (X − R), (Y − R) and (Z − R) instead of X, Y, Z directly.
- "Smallest number divisible by a, b and c" = LCM(a, b, c). "Smallest number that leaves the SAME remainder R when divided by each of a, b and c" = LCM(a, b, c) + R (R itself also leaves remainder R, with quotient 0, but by convention that trivial answer is set aside).
- "Smallest number that, when divided by a, b and c, leaves remainders each exactly k less than their own divisor" (check this holds for every divisor first) = LCM(a, b, c) − k.
- Finding when events that repeat at fixed intervals will coincide again (bells ringing together, runners starting together, lights changing together) is an LCM application: the time until they next coincide is the LCM of their individual intervals.
Worked examples
1. Find the HCF and LCM of 12 and 18.
Solution
- 12 = 2² × 3. 18 = 2 × 3².
- HCF = common factors at their lowest power = 2¹ × 3¹ = 6.
- LCM = all factors at their highest power = 2² × 3² = 4 × 9 = 36.
- Check: HCF × LCM = 6 × 36 = 216, and 12 × 18 = 216 — matches.
Answer: HCF = 6, LCM = 36
2. Find the HCF and LCM of 24, 36, and 60.
Solution
- 24 = 2³ × 3. 36 = 2² × 3². 60 = 2² × 3 × 5.
- HCF = common factors (2 and 3 appear in all three; 5 doesn’t) at their lowest power across all three: 2² × 3¹ = 4 × 3 = 12.
- LCM = all factors at their highest power: 2³ × 3² × 5¹ = 8 × 9 × 5 = 360.
Answer: HCF = 12, LCM = 360
3. Two numbers are in the ratio 3 : 4 and their LCM is 48. Find the HCF and the two numbers.
Solution
- Let the numbers be 3x and 4x. Since 3 and 4 share no common factor, x itself is the HCF, and the LCM is 3 × 4 × x = 12x.
- 12x = 48 → x = 4.
- The numbers are 3 × 4 = 12 and 4 × 4 = 16. HCF = x = 4. Check: HCF(12, 16) = 4 and LCM(12, 16) = 48 — matches.
Answer: HCF = 4, numbers are 12 and 16
4. Find the largest number that divides 70 and 125, leaving remainders 5 and 8 respectively.
Solution
- The required number is the HCF of (70 − 5) and (125 − 8), i.e., HCF(65, 117).
- 65 = 5 × 13. 117 = 3² × 13. HCF = 13.
- Check: 70 ÷ 13 = 5 remainder 5. 125 ÷ 13 = 9 remainder 8 — both match.
Answer: 13
5. Find the smallest number which, when divided by 12, 16 and 24, leaves a remainder of 7 in each case.
Solution
- First find LCM(12, 16, 24): 12 = 2² × 3, 16 = 2⁴, 24 = 2³ × 3 → LCM = 2⁴ × 3 = 48.
- Smallest number leaving the same remainder R = LCM + R = 48 + 7 = 55.
Answer: 55
6. Find the smallest number which, when divided by 20, 25 and 30, leaves remainders 17, 22 and 27 respectively.
Solution
- Check the "k less than divisor" pattern: 20−17=3, 25−22=3, 30−27=3 — consistent, so k = 3.
- LCM(20, 25, 30): 20 = 2² × 5, 25 = 5², 30 = 2 × 3 × 5 → LCM = 2² × 3 × 5² = 300.
- Required number = LCM − k = 300 − 3 = 297.
- Check: 297 ÷ 20 = 14 remainder 17; 297 ÷ 25 = 11 remainder 22; 297 ÷ 30 = 9 remainder 27 — all match.
Answer: 297
7. Three bells ring at intervals of 15, 20 and 30 minutes respectively. If they all ring together at 9:00 AM, when will they next ring together?
Solution
- LCM(15, 20, 30): 15 = 3 × 5, 20 = 2² × 5, 30 = 2 × 3 × 5 → LCM = 2² × 3 × 5 = 60.
- They next ring together after 60 minutes, i.e. at 10:00 AM.
Answer: 10:00 AM
Try these yourself
Work through these the same way, then check against the answer.
1. Find the HCF and LCM of 15 and 20.
Answer: HCF = 5, LCM = 60
2. Find the HCF and LCM of 8, 12, and 20.
Answer: HCF = 4, LCM = 120
3. The HCF of two numbers is 6 and their LCM is 90. If one of the numbers is 18, find the other.
Answer: 30. HCF × LCM = product of numbers = 540; 540/18.
4. Find the smallest number which, when divided by 10, 15 and 20, leaves a remainder of 4 in each case.
Answer: 64. LCM(10,15,20) = 60; 60 + 4.
5. Find the smallest number which, when divided by 15, 20 and 25, leaves remainders 11, 16 and 21 respectively.
Answer: 296. k = 4 in each case (15−11=20−16=25−21=4); LCM(15,20,25) = 300; 300 − 4.
6. Three bells ring at intervals of 6, 8 and 12 minutes. If they ring together at 12:00 noon, when will they next ring together?
Answer: 12:24 PM. LCM(6,8,12) = 24 minutes.
7. Find the LCM of 7 and 11.
Answer: 77. 7 and 11 are co-prime (HCF = 1), so LCM = 7 × 11 directly.
All 14 practice questions on LCM and HCF, with answers →
Where this comes up
LCM and HCF is named in the mathematics, numerical or quantitative syllabus of RRB NTPC, RRB Group D, RRB ALP, UP Police Constable, Haryana CET and DSSSB TGT among the exams Pariksha Saathi covers (for any other exam, check your own exam’s official notification) — a foundational arithmetic topic that other topics, such as time-based and ratio problems, build on.
Keep practising
Solve the questions above before opening the answers. Explain each step in your own words, then revisit any mistakes.
Start this topic’s quiz →