- Advanced
- About 16 min
- 5 practice questions
Least number leaving given remainders: the four standard cases
Find the least number that leaves a fixed remainder, remainders short of each divisor by the same amount, a fixed remainder plus exact division by another number, or unrelated remainders.
If something looks wrong, please tell us.
'Find the least number which, when divided by ... leaves ...' is one of the most common hard LCM questions. They look different, but there are only four cases, and each has a one-line formula. The skill is spotting which case you are in within a few seconds.
Case 1: the same remainder for every divisor
If N leaves remainder r when divided by each of a, b and c, then N − r is divisible by all of them, so N − r is a multiple of L = LCM(a, b, c). So N = kL + r. The least such N is L + r. (N = r itself, with k = 0, also leaves remainder r, but questions mean a number that each divisor actually goes into, so it is not counted.)
Worked example 1: least number which, divided by 12, 15, 20 and 54, leaves remainder 8 each time. LCM(12, 15, 20, 54) = 2² × 3³ × 5 = 540. N = 540 + 8 = 548. Check: 548 = 45 × 12 + 8 = 36 × 15 + 8 = 27 × 20 + 8 = 10 × 54 + 8.
Case 2: each remainder falls short by the same amount
When the divisors 5, 6, 7 and 8 leave remainders 3, 4, 5 and 6, notice that divisor − remainder = 2 every time. So N + 2 is divisible by all the divisors: N = kL − d, where d is the common shortfall. The least is L − d.
Worked example 2: LCM(5, 6, 7, 8) = 840, so N = 840 − 2 = 838. Check: 838 = 167 × 5 + 3 = 139 × 6 + 4 = 119 × 7 + 5 = 104 × 8 + 6.
Case 3: a fixed remainder and exactly divisible by another number
Worked example 3: least number which leaves remainder 2 when divided by 6, 9, 15 and 18, but is exactly divisible by 7. LCM(6, 9, 15, 18) = 90, so N = 90k + 2. Try k = 1, 2, 3 ... until 7 divides N: 92 (no, 7 × 13 = 91), then 182 (yes, 7 × 26 = 182). N = 182. Shortcut: 90 leaves remainder 6 when divided by 7, so 90k + 2 leaves the same remainder as 6k + 2. You need 6k + 2 to be a multiple of 7, and k = 2 gives 14.
Case 4: remainders with no pattern
Worked example 4: least number that leaves remainder 3 when divided by 5 and remainder 4 when divided by 7. Here 5 − 3 = 2 but 7 − 4 = 3, so neither Case 1 nor Case 2 applies. List the numbers that leave 4 on division by the larger divisor, 7 - that is 4, 11, 18, 25 ... - and test each against 5: 4 and 11 fail, but 18 = 3 × 5 + 3 works. So N = 18, and every such number is 18 + 35k, because LCM(5, 7) = 35.
| Case | Pattern | Least N |
|---|---|---|
| 1 | Same remainder r | LCM + r |
| 2 | Divisor − remainder = d for every divisor | LCM − d |
| 3 | Same remainder r, and divisible by m | First LCM × k + r that m divides |
| 4 | No pattern | List one form, test against the other |
Same remainder r: N = k × LCM + r. Same shortfall d: N = k × LCM − d. Extra divisibility: step through k. No pattern: list numbers of one form and test against the other.
Traps
- Using the HCF. These questions are about a number that several numbers divide, so the LCM is the base.
- Adding the shortfall instead of subtracting it in Case 2. 840 + 2 = 842 leaves remainders 2, 2, 2, 2, not 3, 4, 5, 6.
- Forgetting the extra condition in Case 3 and stopping at LCM + r.
- Skipping the check. A ten-second division check catches most slips.
Key takeaways: first look at the remainders (all equal?) and then at the shortfalls (all equal?). Case 1 adds, Case 2 subtracts, Case 3 steps through multiples, Case 4 lists and tests. All valid answers repeat every LCM, which is how 'second least' or 'least four-digit' versions are solved.
Check your understanding
-
1. What is the least number which, when divided by 16, 20, 24 and 30, leaves remainder 7 in each case?
- 233
- 247
- 487
- 240
Show answer
Answer: B. LCM(16, 20, 24, 30) = 2⁴ × 3 × 5 = 240. N = 240 + 7 = 247. (233 = 240 − 7 is the Case 2 trap; 487 = 2 × 240 + 7 also works but is not the least.)
-
2. What is the least number which, when divided by 4, 6, 8 and 10, leaves remainders 2, 4, 6 and 8 respectively?
- 122
- 120
- 118
- 238
Show answer
Answer: C. Each remainder is 2 less than its divisor, so N + 2 is a multiple of LCM(4, 6, 8, 10) = 120. N = 120 − 2 = 118.
-
3. What is the least number which leaves remainder 4 when divided by 6, 9, 12 and 18, and is exactly divisible by 7?
- 112
- 76
- 148
- 256
Show answer
Answer: A. LCM(6, 9, 12, 18) = 36, so N = 36k + 4: 40, 76, 112, 148 ... 40 = 7 × 5 + 5 and 76 = 7 × 10 + 6 fail; 112 = 7 × 16 works. N = 112.
-
4. What is the least number that leaves remainder 5 when divided by 7 and remainder 7 when divided by 11?
- 51
- 62
- 117
- 40
Show answer
Answer: D. No common pattern (7 − 5 = 2, 11 − 7 = 4). Numbers leaving 7 on division by 11: 7, 18, 29, 40 ... Their remainders on division by 7: 0, 4, 1, 5. So N = 40 (40 = 5 × 7 + 5). The next is 40 + 77 = 117.
-
5. Which of these numbers leaves remainder 3 when divided by each of 8, 12 and 18?
- 213
- 225
- 219
- 231
Show answer
Answer: C. Such numbers are 72k + 3, since LCM(8, 12, 18) = 72: 75, 147, 219, 291 ... 219 = 3 × 72 + 3. Check the others with 8: 213 leaves 5, 225 leaves 1 and 231 leaves 7.
Sign in to keep track of the lessons you finish.