EdiShorts

UPSC Prelims 2026 CSAT Q1 · Data Sufficiency

Year2026
PaperCSAT
QuestionQ1
SubjectData Sufficiency

Each item in this section contains a question followed by two statements. Mark (a) if answerable using ONE statement alone but not the other; (b) if either alone suffices; (c) if both together but not either alone; (d) if not answerable even using both.

X receives three coins of different denominations: 1, 2, 5, 10 and 20. If the total amount received by X is m, does X receive a coin of denomination 5?
I. m is not a prime number.
II. The sum of the digits of m is greater than 5.

  1. aSelect this option if the question can be answered using one of these statements alone, but cannot be answered using other statement
  2. bSelect this option if the question can be answered using either statement alone
  3. cSelect this option if the question can be answered using both the statements together, but cannot be answered using either statement alone
  4. dSelect this option if the question cannot be answered even using any of the statements
Show answer & explanationHide answer
Correct answer(a) Select this option if the question can be answered using one of these statements alone, but cannot be answered using other statement

Statement II alone forces a YES, because every total with digit sum greater than 5 contains the 5 coin. Statement I alone fails, because the non-prime total 32 (2+10+20) has no 5 coin while the other non-prime totals all have one.

Statement-by-statement analysis

✓ Option (a)
  • Combinations with the 5 coin: 1+2+5=8, 1+5+10=16, 1+5+20=26, 2+5+10=17, 2+5+20=27 and 5+10+20=35. Combinations without it: 1+2+10=13, 1+2+20=23, 1+10+20=31 and 2+10+20=32.
  • Statement II: the digit sums are 8→8, 16→7, 17→8, 26→8, 27→9 and 35→8, all greater than 5. The totals without the 5 coin have digit sums 13→4, 23→5, 31→4 and 32→5, none greater than 5. So the answer is a definite YES.
  • Statement I: the non-prime totals are 8, 16, 26, 27 and 35 (5 coin present) and 32 (5 coin absent). The answer can be YES or NO, so Statement I is insufficient. Exactly one statement works, which is option (a).
✗ Option (b)
  • Option (b) needs each statement to be sufficient on its own.
  • Statement I fails because m = 32 = 2+10+20 is non-prime yet contains no 5 coin, while m = 8 is non-prime and does contain one.
✗ Option (c)
  • Option (c) applies only when neither statement works alone.
  • Statement II already settles the question by itself, so combining the statements is unnecessary. (Combined, the non-prime totals with digit sum greater than 5 are 8, 16, 26, 27 and 35, all YES.)
✗ Option (d)
  • Option (d) would require the question to stay undecided even with both statements.
  • Statement II alone gives a definite YES, so option (d) is ruled out.

Concept to know

  • In data sufficiency, a Yes/No question is answered when a statement forces a single answer: always YES or always NO. A definite NO also counts as sufficient.
  • When the possibilities are few, enumerate them fully. Choosing 3 distinct coins from 5 denominations gives 5C3 = 10 combinations, which can be listed in under a minute.
  • Split the cases into two groups, here totals with the 5 coin and totals without it. Then test each statement against both groups.
  • A statement is insufficient as soon as one value consistent with it gives YES and another gives NO. A single counter-example, such as m = 32 for Statement I, is enough.
  • Test each statement alone before combining them. Only if both fail alone should you check them together for option (c) versus (d).

Related facts for revision

  • Coin and note selection problems in the form 'does X have coin k?' are best handled by listing all sums first, then filtering them by the given conditions.
  • Number-property filters such as prime or non-prime, odd or even, digit sum, and divisibility by 3 or 9 are common UPSC DS statements. Know the primes up to 50 (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47).
  • Quick digit-sum check: a number whose digit sum is divisible by 9 is divisible by 9. For example, 27 has digit sum 9 and is a multiple of 9, hence not prime.
  • A variant may ask 'what is m?' (a value question) instead of a Yes/No question. Sufficiency then needs a unique value, which is a stricter test.
  • A typical trap is the one odd case. Most non-prime sums contain 5, which tempts candidates to call Statement I sufficient, but a single exception (32) breaks it.
How UPSC tests this

Systematic enumeration of combinations, recognising primes, and the data-sufficiency rule that a statement must force a unique Yes or No.

Trap: Candidates notice that most non-prime totals (8, 16, 26, 27, 35) include the 5 coin and wrongly mark (b), missing 32 = 2+10+20. To save time, list only the four totals without the 5 coin (13, 23, 31, 32) and check them against each statement. If any of them survives a statement, that statement is insufficient.

More Data Sufficiency PYQs

All Data Sufficiency questions →

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