UPSC Prelims 2025 CSAT Q18 · Numeracy
Year2025
PaperCSAT
QuestionQ18
SubjectNumeracy
A 4-digit number N is such that when divided by 3, 5, 6, 9 leaves a remainder 1, 3, 4, 7 respectively. What is the smallest value of N ?
- a1068
- b1072
- c1078
- d1082
Show answer & explanationHide answer
Correct answer(c) 1078
The difference between each divisor and its corresponding remainder is constant (2), so N is of the form 90m - 2, giving the smallest 4-digit number 1078 when m = 12.
Statement-by-statement analysis
✗ Option (a)
- Adding the common difference 2 to 1068 gives 1070, which is not divisible by the LCM of divisors, 90.
- Dividing 1068 by 9 yields a remainder of 6 instead of the required remainder 7.
✗ Option (b)
- Adding 2 to 1072 gives 1074, which is not divisible by 90 as it is not a multiple of 10.
- Dividing 1072 by 5 leaves a remainder of 2 instead of the required remainder 3.
✓ Option (c)
- The difference between each divisor and remainder is constant: 3 - 1 = 2, 5 - 3 = 2, 6 - 4 = 2, and 9 - 7 = 2.
- The LCM of divisors 3, 5, 6, and 9 is 90, making the general form of N equal to 90m - 2.
- For m = 12, N = 90 × 12 - 2 = 1080 - 2 = 1078, which is the smallest 4-digit number satisfying all condition remainders.
✗ Option (d)
- Adding 2 to 1082 gives 1084, which is not divisible by 90.
- 1082 corresponds to the form 90m + 2, which occurs when positive remainders are equal, not when negative remainders are equal.
Concept to know
- Common Negative Remainder Principle: When dividing a number N by a, b, c leaves remainders r1, r2, r3 such that (a - r1) = (b - r2) = (c - r3) = k, the number is of the form N = LCM(a, b, c) × m - k.
- Step 1: Identify the constant difference k by subtracting each remainder from its respective divisor.
- Step 2: Find the LCM of all the given divisors.
- Step 3: Write the general formula N = LCM × m - k, where m is any positive integer.
- Step 4: Substitute integer values for m to find the smallest value of N that satisfies the specified digit length or range.
Related facts for revision
- Same positive remainder case: When N leaves the same remainder r in each case, the general form is N = LCM(divisors) × m + r.
- Option testing shortcut: Add the constant difference k to each option and test for divisibility by the LCM or its key factors like 5 and 9.
- Finding largest multi-digit number: Determine the maximum integer m such that LCM × m - k stays within the required upper bound.
- Unequal remainders without common difference: Handled using modular arithmetic or Chinese Remainder Theorem.
How UPSC tests this
Application of LCM rules under variable remainder conditions and finding specific digit-length values.
Trap: Candidates often add the constant difference instead of subtracting it, selecting 1082 (90m + 2) instead of 1078 (90m - 2). Testing options by adding 2 and checking divisibility by 90 saves time.
← Previous · Q17The petrol price shot up by 10% as a result of the hike in crude oil prices.…Next · Q19 →Consider the following statements : I. If A ≤ B > C < D > E > F ≥ G = H; then…
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.