EdiShorts

UPSC Prelims 2024 CSAT Q18 · Numeracy

Year2024
PaperCSAT
QuestionQ18
SubjectNumeracy

421 and 427, when divided by the same number, leave the same remainder 1. How many numbers can be used as the divisor in order to get the same remainder 1?

  1. a1
  2. b2
  3. c3
  4. d4
Show answer & explanationHide answer
Correct answer(c) 3

The valid divisors are the factors of HCF(420, 426) = 6 that are strictly greater than the remainder 1, which gives exactly 3 numbers (2, 3, and 6).

Statement-by-statement analysis

✗ Option (a)
  • This option incorrectly assumes that only the HCF itself (which is 6) can act as the divisor.
  • It misses other valid common factors 2 and 3 which also leave remainder 1.
✗ Option (b)
  • This option results from considering only the prime factors of 6, which are 2 and 3.
  • It overlooks the composite factor 6 which is also a valid divisor.
✓ Option (c)
  • Subtracting remainder 1 gives 421 - 1 = 420 and 427 - 1 = 426.
  • The common factors of 420 and 426 are the factors of HCF(420, 426) = 6, which are 1, 2, 3, and 6.
  • Since the divisor must be strictly greater than the remainder (d > 1), the valid divisors are 2, 3, and 6, making a total of 3 numbers.
✗ Option (d)
  • This option results from counting all factors of 6 (1, 2, 3, and 6) without applying the condition that divisor must be greater than remainder.
  • If the divisor is 1, the remainder is always 0, not 1.

Concept to know

  • If numbers N1 and N2 leave remainder r when divided by d, then d must divide (N1 - r) and (N2 - r).
  • The possible divisors d are the common factors of (N1 - r) and (N2 - r).
  • All common factors of two numbers are the factors of their Highest Common Factor (HCF).
  • Crucial condition: Divisor d must always be strictly greater than remainder r (d > r).
  • Step 1: Subtract remainder from given numbers: 421 - 1 = 420 and 427 - 1 = 426.
  • Step 2: Find HCF(420, 426) = 6 and list its factors: 1, 2, 3, 6; then filter out factors less than or equal to 1.

Related facts for revision

  • Finding the greatest number that leaves the same remainder when dividing given numbers requires calculating HCF directly.
  • Questions with different remainders: subtract respective remainders from the numbers, then find HCF of the results.
  • Division algorithm relation: Dividend = Divisor × Quotient + Remainder, where 0 ≤ Remainder < Divisor.
  • LCM-based remainder problems where numbers are divided by different divisors leaving a constant remainder.
How UPSC tests this

Understanding the fundamental division rule that the divisor must be strictly greater than the remainder.

Trap: Including 1 in the list of factors (1, 2, 3, 6) to choose option (d) 4, forgetting that dividing by 1 leaves remainder 0.

More Numeracy PYQs

All Numeracy questions →

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