UPSC Prelims 2020 CSAT Q54 · Numeracy
Year2020
PaperCSAT
QuestionQ54
SubjectNumeracy
What is the least four-digit number when divided by 3, 4, 5 and 6 leaves a remainder 2 in each case?
- a1012
- b1022
- c1122
- d1222
Show answer & explanationHide answer
Correct answer(b) 1022
The LCM of 3, 4, 5, and 6 is 60, and the smallest four-digit multiple of 60 is 1020, making 1020 + 2 = 1022 the required number.
Statement-by-statement analysis
✗ Option (a)
- Subtracting 2 from 1012 gives 1010.
- 1010 is not divisible by 3 because the sum of its digits is 2.
- Hence, 1012 does not leave remainder 2 when divided by 3.
✓ Option (b)
- Subtracting 2 from 1022 gives 1020.
- 1020 is divisible by 3, 4, 5, and 6 as 1020 divided by 60 equals 17.
- 1022 is the smallest four-digit number satisfying the condition.
✗ Option (c)
- Subtracting 2 from 1122 gives 1120.
- 1120 is not divisible by 3 because the sum of its digits is 4.
- Though it satisfies the remainder condition for some divisors, it fails for 3 and 6.
✗ Option (d)
- Subtracting 2 from 1222 gives 1220.
- 1220 is not divisible by 3 because the sum of its digits is 5.
- It is larger than 1022 and therefore not the least four-digit number.
Concept to know
- LCM Rule: A number divisible by a set of numbers must be a multiple of their Least Common Multiple (LCM).
- Constant Remainder General Form: Any number leaving a constant remainder r when divided by divisors d1, d2, d3 is represented as LCM(d1, d2, d3) × k + r.
- Finding Range-Specific Numbers: To find the smallest n-digit number of this form, divide the smallest n-digit number (1000 for 4 digits) by the LCM to determine the required multiplier k.
- LCM Calculation: Prime factorization of 3, 4 (2 × 2), 5, and 6 (2 × 3) gives LCM = 2 × 2 × 3 × 5 = 60.
- Verification Step: 1000 divided by 60 gives quotient 16 and remainder 40, so the next multiple above 1000 is 1000 + (60 - 40) = 1020.
Related facts for revision
- Different Remainders Case: When divisors minus remainders yield a constant difference d, the required number form is LCM × k - d.
- Greatest N-digit Number Problems: To find the largest 4-digit number leaving remainder r, divide 9999 by the LCM, subtract the remainder of that division, and add r.
- Elimination Shortcut: Subtract the given remainder from each option and check divisibility using basic rules like sum of digits for 3.
How UPSC tests this
Application of LCM concepts to remainder problems and finding range-bounded numbers efficiently.
Trap: Candidates often forget to add the remainder 2 after finding the multiple 1020, or wrongly add 2 to 1000 first. A fast option-elimination trick is to subtract 2 from each option and check which result is divisible by 3.
← Previous · Q53The recurring decimal representation 1·272727... is equivalent toNext · Q55 →In adult population of a city, 40% men and 30% women are married. What is the…
More Numeracy PYQs
How many words can one form by shuffling the letters of the word QUEUE, if Q is always followed by U? The words thus formed need not necessarily have any meaning.
See the answer & explanation →
X, Y and Z jump forward 4', 6' and 5', respectively. At 8 AM, they all land on mark 199'. How many times will they all land on the same mark (need not be at the same moment) between mark 195' and 1000', if all of them cross mark…
See the answer & explanation →
A toy T jumps forward or backward. In each forward jump, it moves 5' forward whereas in each backward jump, it moves 2' backward. If in 31 jumps, T moves exactly 15' forward, then what is the difference of the number of forward…
See the answer & explanation →
If 10^m × 1000 × n = 75^25 × 25^32 × 32^75, where n is not divisible by 10, then the value of m is
See the answer & explanation →Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.