EdiShorts

UPSC Prelims 2020 CSAT Q60 · Numeracy

Year2020
PaperCSAT
QuestionQ60
SubjectNumeracy

How many different sums can be formed with the denominations ₹ 50, ₹ 100, ₹ 200, ₹ 500 and ₹ 2,000 taking at least three denominations at a time?

  1. a16
  2. b15
  3. c14
  4. d10
Show answer & explanationHide answer
Correct answer(a) 16

Choosing 3, 4, or 5 denominations out of 5 available distinct denominations gives 5C3 + 5C4 + 5C5 = 10 + 5 + 1 = 16 combinations, each yielding a unique sum.

Statement-by-statement analysis

✓ Option (a)
  • Taking 3 denominations at a time gives 5C3 = 10 distinct sums.
  • Taking 4 denominations at a time gives 5C4 = 5 distinct sums, and taking all 5 denominations gives 5C5 = 1 distinct sum.
  • Adding all possible selections gives 10 + 5 + 1 = 16 distinct sums, as no two combinations yield the same total amount.
✗ Option (b)
  • The count 15 represents 5C3 + 5C4 = 10 + 5 = 15, which forgets to include the case of taking all 5 denominations together.
  • Taking all 5 denominations at a time satisfies the condition of taking at least three denominations.
  • Hence 15 is an incomplete count.
✗ Option (c)
  • The count 14 is an undercalculation caused by missing valid combinations.
  • The correct total number of valid combinations is 5C3 + 5C4 + 5C5 = 16.
  • Therefore option c is incorrect.
✗ Option (d)
  • The value 10 corresponds only to selecting exactly 3 denominations at a time where 5C3 = 10.
  • It ignores the cases of taking 4 denominations and 5 denominations.
  • It fails to account for the phrase at least three denominations.

Concept to know

  • The combinations formula nCr represents the number of ways to select r items from a set of n distinct items, given by n! / (r! × (n - r)!).
  • The phrase at least k items means selecting k, k + 1, k + 2, up to n items from the total n available items.
  • Total valid combinations is calculated by summing individual combinations for each valid selection: Sum of nCr for r from k to n.
  • Verification of distinct sums requires checking that no two distinct combinations of denominations produce the exact same numerical sum.
  • For 5 distinct denominations, total combinations with at least 3 denominations is 5C3 + 5C4 + 5C5 = 10 + 5 + 1 = 16.

Related facts for revision

  • Total number of all possible subsets from a set of n distinct items is 2^n.
  • Sum of all combination terms from 0 to n is 5C0 + 5C1 + 5C2 + 5C3 + 5C4 + 5C5 = 2^5 = 32.
  • Subtracting unwanted cases of 0, 1, or 2 items gives 32 - (5C0 + 5C1 + 5C2) = 32 - (1 + 5 + 10) = 16.
  • If denominations are identical or can be repeated, combinations must be adjusted to eliminate duplicate sums.
How UPSC tests this

Combinatorics principle of choosing at least r items from n distinct items and verifying uniqueness of sums.

Trap: Stopping at selecting exactly 3 denominations (giving 10) or forgetting to include the case of taking all 5 denominations (giving 15).

More Numeracy PYQs

All Numeracy questions →

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