Least Number Divisible by Given Numbers Leaving a Specified Common Remainder
Quantitative Aptitude › HCF, LCM and Divisibility Rules · Topic 2.7
The least number that leaves the same remainder r when divided by several numbers is LCM of the numbers plus r. If the remainders differ but the gap between each divisor and its remainder is constant, add that constant gap to the number and subtract it from the LCM.
6 min read · Quantitative Aptitude · HCF, LCM and Divisibility Rules
Quick Answer
The least number that leaves the same remainder r when divided by several numbers is LCM of the numbers plus r. If the remainders differ but the gap between each divisor and its remainder is constant, add that constant gap to the number and subtract it from the LCM.
At a Glance
- Same remainder r Number = LCM + r (least)
- General form LCM × k + r
- Constant gap d Number = LCM × k − d
- Digit limit Find the right multiple of the LCM first, then add r
- Extra condition Also divisible by another number: solve for k
- Remainder rule r must be less than every divisor
Where Does It Fit?
This topic uses the LCM of Lowest Common Multiple (LCM) by Division and Prime Factorization Method and the word-problem thinking of Applications of HCF and LCM in Word Problems (Bells Ringing Together, Tank Filling, Traffic Lights). The next two topics, Greatest Number That Divides Given Numbers Leaving the Same Remainder in Each Case and Greatest Number That Exactly Divides Given Numbers After Subtracting Specified Remainders, reverse the question and use the HCF to find the greatest divisor.
How Do You Find the Least Number Leaving the Same Remainder?
In short: a number leaves remainder r with several divisors when it is r more than a common multiple. The least such number is LCM + r.
Rule
- Numbers leaving remainder r with divisors d1, d2, d3 have the form LCM(d1, d2, d3) × k + r.
- The least number is LCM + r, taking k = 1 (or k = 0 only if r itself is allowed).
- The remainder r must be smaller than every divisor.
| Divisors | LCM | Remainder | Least number |
|---|---|---|---|
| 6, 8, 12 | 24 | 5 | 29 |
| 10, 15, 20 | 60 | 2 | 62 |
| 3, 4, 5 | 60 | 1 | 61 |
The LCM itself comes from Lowest Common Multiple (LCM) by Division and Prime Factorization Method.
What If the Remainders Are Different but Follow a Pattern?
In short: when each divisor minus its remainder gives the same value d, then the number plus d is divisible by all the divisors. The least number is LCM − d.
| Divisors | Remainders | Gap (divisor − remainder) | LCM | Least number |
|---|---|---|---|---|
| 4, 5, 6 | 1, 2, 3 | 3, 3, 3 | 60 | 57 |
| 2, 3, 4 | 1, 2, 3 | 1, 1, 1 | 12 | 11 |
If the gaps are not equal, this shortcut does not apply and the problem needs the method of simultaneous congruences.
How Do You Handle Digit Limits and Extra Conditions?
- Smallest four-digit number: find the smallest four-digit multiple of the LCM, then add r.
- Greatest three-digit number: find the greatest three-digit multiple of the LCM, then add r.
- Also divisible by another number: write the number as LCM × k + r and find the smallest k that makes it divisible by the extra number.
- Check: the answer must still have the right number of digits after adding r.
Solved Examples
Example 1
Question: Find the least number which when divided by 6, 8 and 12 leaves a remainder of 5 each time.
- LCM(6, 8, 12) = 24.
- Least number = 24 + 5 = 29.
- Check: 29 ÷ 6 leaves 5, 29 ÷ 8 leaves 5 and 29 ÷ 12 leaves 5.
Answer: 29
Example 2
Question: Find the smallest four-digit number which leaves remainder 3 when divided by 12, 15 and 20.
- LCM(12, 15, 20) = 60.
- Smallest four-digit multiple of 60: 1000 ÷ 60 = 16.67, so take 17 × 60 = 1020.
- Number = 1020 + 3 = 1023.
Answer: 1023
Example 3
Question: Find the greatest three-digit number which leaves remainder 7 when divided by 9, 12 and 15.
- LCM(9, 12, 15) = 180.
- Greatest three-digit multiple of 180: 999 ÷ 180 = 5.55, so take 5 × 180 = 900.
- Number = 900 + 7 = 907.
Answer: 907
Example 4
Question: Find the least number which leaves remainder 3 when divided by 5, 6 and 8 and is exactly divisible by 7.
- LCM(5, 6, 8) = 120, so the number is 120k + 3.
- 120 leaves remainder 1 when divided by 7, so 120k + 3 leaves remainder k + 3. For divisibility by 7 we need k + 3 to be a multiple of 7, so k = 4.
- Number = 120 × 4 + 3 = 483. Check: 483 = 7 × 69.
Answer: 483
Example 5
Question: Find the least number which leaves remainders 1, 2 and 3 when divided by 4, 5 and 6.
- Gaps: 4 − 1 = 3, 5 − 2 = 3, 6 − 3 = 3. All equal 3.
- LCM(4, 5, 6) = 60.
- Least number = 60 − 3 = 57. Check: 57 ÷ 4 leaves 1, ÷ 5 leaves 2, ÷ 6 leaves 3.
Answer: 57
Shortcuts and Tricks
- Same remainder: add the remainder to the LCM. Different remainders with equal gaps: subtract the gap from the LCM.
- For the smallest four-digit number, divide 1000 by the LCM, round up, multiply back, then add the remainder.
- For the greatest three-digit number, divide 999 by the LCM, round down, multiply back, then add the remainder.
- For an extra divisibility condition, use k + (remainder pattern) arithmetic and test small values of k.
- Always check that the final number actually leaves the stated remainder with each divisor.
Common Mistakes
- Giving the LCM as the answer and forgetting to add the remainder.
- Adding the remainder before applying the digit limit, which can push the number outside the allowed range.
- Using the shortcut when the divisor-remainder gaps are unequal.
- Allowing a remainder that is larger than a divisor.
- Finding the multiple of the LCM with the wrong rounding direction for four-digit and three-digit limits.
Practice Questions
- Least number leaving remainder 2 when divided by 10, 15 and 20.
- Least number leaving remainder 1 when divided by 3, 4 and 5.
- Smallest three-digit number leaving remainder 5 when divided by 8, 12 and 16.
- Least number leaving remainders 1, 2 and 3 when divided by 2, 3 and 4.
- Greatest four-digit number leaving remainder 2 when divided by 6, 9 and 12.
Answers: 1) 62; 2) 61; 3) 149; 4) 11; 5) 9974.
Why Is This Topic Important?
- Frequent Remainder problems appear in SSC CGL and CAT every year.
- Pattern The LCM plus remainder idea solves many variants.
- Speed A three-line method replaces long trial and error.
- Link It reverses into the HCF problems of Greatest Number That Divides Given Numbers Leaving the Same Remainder in Each Case.
What Comes Next?
The next topic is Greatest Number That Divides Given Numbers Leaving the Same Remainder in Each Case, which finds the greatest number that divides given numbers leaving the same remainder.
Key Terms and Formulas
- Remainder What is left after division
- LCM plus r Least number leaving remainder r with all divisors
- Gap Divisor minus remainder
- Common multiple A number every divisor divides
- Four-digit number A number from 1000 to 9999
- Congruence Two numbers leaving the same remainder
Related Topics
- Verification Using the Rule: Product of Two Numbers = HCF × LCM
- Greatest Number That Divides Given Numbers Leaving the Same Remainder in Each Case
- Highest Common Factor (HCF) by Division and Prime Factorization Method
- Lowest Common Multiple (LCM) by Division and Prime Factorization Method
Exam Corner
Points to Remember
- Same remainder r: least number = LCM + r.
- Equal gaps d: least number = LCM − d.
- The remainder must be smaller than every divisor.
- Apply the digit limit to the multiple of the LCM first.
- Check the answer with each divisor.
Do Not Confuse With
- LCM vs LCM + r The LCM is divisible by all numbers; LCM + r leaves remainder r.
- Same remainder vs equal gap Add r for the same remainder; subtract d for equal gaps.
- Least vs greatest Least uses round-up; greatest uses round-down of the LCM multiple.
- Divisor vs remainder A remainder is always less than the divisor.
Memory Hook
Same remainder: LCM plus r. Equal gap: LCM minus d.
GS Relevance
Frequently Asked Questions
How do you find the least number that leaves the same remainder?
To find the least number that leaves the same remainder when divided by several numbers, find the LCM of the divisors and add the remainder. For divisors 6, 8 and 12 with remainder 5, the LCM is 24, so the least number is 24 plus 5, which is 29.
What if the remainders are different?
If the remainders are different but each divisor minus its remainder gives the same gap, the least number is the LCM minus that gap. For divisors 4, 5 and 6 with remainders 1, 2 and 3, the gap is 3 and the LCM is 60, so the number is 57.
How do you find the smallest four-digit number with a given remainder?
Find the LCM of the divisors, then the smallest four-digit multiple of it by dividing 1000 by the LCM and rounding up, and finally add the remainder. For divisors 12, 15 and 20 with remainder 3, the multiple is 1020, so the number is 1023.
How do you find the greatest three-digit number with a given remainder?
Find the LCM, then the greatest three-digit multiple of it by dividing 999 by the LCM and rounding down, and finally add the remainder. For divisors 9, 12 and 15 with remainder 7, the LCM is 180, the multiple is 900, and the number is 907.
How do you add an extra divisibility condition?
To add an extra divisibility condition, write the number as the LCM times k plus the remainder and find the smallest k that makes it divisible by the extra number. For remainder 3 with divisors 5, 6 and 8 and an extra divisor 7, the least number is 483.
PYQ Practice — Statement Analysis
1 The least number leaving remainder 5 when divided by 6, 8 and 12 is 29.
LCM(6, 8, 12) = 24 and 24 + 5 = 29.
2 The least number leaving remainder r with several divisors is the LCM minus r.
It is the LCM plus r for the same remainder.
3 The number 57 leaves remainders 1, 2 and 3 when divided by 4, 5 and 6.
57 = 4 × 14 + 1 = 5 × 11 + 2 = 6 × 9 + 3.
4 The LCM of the divisors itself leaves a remainder of 1 with each divisor.
The LCM is divisible by each divisor, so the remainder is 0.
Related Topics
Browse the full Quantitative Aptitude index