EdiShorts

UPSC Prelims 2022 CSAT Q65 · Numeracy

Year2022
PaperCSAT
QuestionQ65
SubjectNumeracy

What is the smallest number greater than 1000 that when divided by any one of the numbers 6, 9, 12, 15, 18 leaves a remainder of 3?

  1. a1063
  2. b1073
  3. c1083
  4. d1183
Show answer & explanationHide answer
Correct answer(c) 1083

The LCM of 6, 9, 12, 15, and 18 is 180, and the smallest multiple of 180 greater than 1000 is 1080, which gives 1083 when adding the remainder 3.

Statement-by-statement analysis

✗ Option (a)
  • Subtracting 3 gives 1060.
  • 1060 is not divisible by 180 because 1060 divided by 180 leaves a remainder of 160.
  • Hence, 1063 does not leave a remainder of 3 for all the given divisors.
✗ Option (b)
  • Subtracting 3 gives 1070.
  • 1070 is not divisible by 180 because 1070 divided by 180 leaves a remainder of 170.
  • Hence, 1073 does not satisfy the required remainder condition.
✓ Option (c)
  • Subtracting 3 gives 1080.
  • 1080 is perfectly divisible by the LCM 180 since 180 multiplied by 6 equals 1080.
  • Adding the required remainder 3 yields 1083, which is the smallest such number greater than 1000.
✗ Option (d)
  • Subtracting 3 gives 1180.
  • 1180 is not divisible by 180 since 1180 divided by 180 leaves a remainder of 100.
  • While larger multiples exist, 1183 is neither divisible nor the smallest candidate.

Concept to know

  • To find a common dividend that leaves a constant remainder r when divided by a set of divisors, the general form of the number is LCM(divisors) × k + r.
  • First compute the Least Common Multiple (LCM) of the given divisors by prime factorization.
  • Prime factorization gives 6 = 2 × 3, 9 = 3 squared, 12 = 2 squared × 3, 15 = 3 × 5, and 18 = 2 × 3 squared.
  • Taking the highest power of each prime factor yields LCM = 2 squared × 3 squared × 5 = 180.
  • Find the integer k such that 180k + 3 is greater than the specified limit of 1000.
  • For k = 6, 180 × 6 + 3 = 1080 + 3 = 1083, which is the smallest value exceeding 1000.

Related facts for revision

  • Option testing shortcut: Subtract remainder 3 from each option and check divisibility by 9 or 5 for quick elimination.
  • Different remainders case: When remainders differ but divisor minus remainder is constant d, the required number form is LCM(divisors) × k - d.
  • Successive division problems: When a number is divided successively, the original number is found by working backward from the final quotient.
  • Range constraints: When a question specifies a range such as between 1000 and 2000, select values of integer k that keep the expression within those boundaries.
How UPSC tests this

Application of LCM concepts, prime factorization, and solving general remainder equations under specific numerical constraints.

Trap: Candidates often forget the constraint greater than 1000 and select 183, or make calculation errors while finding the multiple of the LCM.

More Numeracy PYQs

All Numeracy questions →

Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.