Find the smallest number which, when divided by , and , leaves a remainder of in each case.
Competency-Based Questions (CBQ) · Question 24 of 87
Find the smallest number which, when divided by 8 , 12 and 15 , leaves a remainder of 3 in each case.
(A)
(B)
- Correct answer
(C)
(D)
Option (C) is correct.
Step 1 — strip the remainder away.
If a number leaves remainder on division by , and , then subtracting gives a number that each of them divides exactly.
So we first need the smallest number divisible by , and — their LCM.
Step 2 — find the LCM.
Take the highest power of each prime:
Step 3 — put the remainder back.
Step 4 — verify all three divisions.
Traps: is the LCM itself (remainder ); uses and ignores ; also leaves remainder but is not the smallest.
The rule: same remainder every time the smallest such number is . (Contrast: for the largest number that divides several given numbers leaving remainders, subtract the remainders and take the HCF.)
