EdiShorts

UPSC Prelims 2023 CSAT Q5 · Numeracy

Year2023
PaperCSAT
QuestionQ5
SubjectNumeracy

In how many ways can a batsman score exactly 25 runs by scoring single runs, fours and sixes only, irrespective of the sequence of scoring shots?

  1. a18
  2. b19
  3. c20
  4. d21
Show answer & explanationHide answer
Correct answer(b) 19

Systematic evaluation of non-negative integer solutions to x + 4y + 6z = 25 yields exactly 19 valid combinations.

Statement-by-statement analysis

✗ Option (a)
  • This option miscounts the total ways by missing the edge case where z = 4 and y = 0.
  • Under-counting occurs when zero values for variables are omitted.
✓ Option (b)
  • Let x be single runs, y be fours, and z be sixes, giving x + 4y + 6z = 25.
  • For z = 0, 4y <= 25 gives y = 0, 1, 2, 3, 4, 5, 6 (7 ways).
  • For z = 1, 4y <= 19 gives y = 0, 1, 2, 3, 4 (5 ways).
  • For z = 2, 4y <= 13 gives y = 0, 1, 2, 3 (4 ways).
  • For z = 3, 4y <= 7 gives y = 0, 1 (2 ways).
  • For z = 4, 4y <= 1 gives y = 0 (1 way).
  • Total ways = 7 + 5 + 4 + 2 + 1 = 19 ways.
✗ Option (c)
  • This option results from overcounting valid y values for z = 3 or z = 4.
  • It exceeds the exact total of 19 combinations.
✗ Option (d)
  • This option overcounts by assuming incorrect upper bounds for fours.
  • It fails to satisfy the target sum equation x + 4y + 6z = 25.

Concept to know

  • The phrasing irrespective of sequence means shot order does not matter, requiring non-negative integer solutions to a linear Diophantine equation.
  • The equation is x + 4y + 6z = 25 where x, y, z are non-negative integers representing singles, fours, and sixes.
  • Always fix the variable with the largest coefficient first to minimize the number of cases to analyze.
  • For each fixed value of z, determine the range of valid non-negative integer values for y.
  • Since x = 25 - 4y - 6z, each non-negative choice of (y, z) automatically defines exactly one valid integer x >= 0.

Related facts for revision

  • Coin change problem variant involving specific denominations.
  • Linear Diophantine equations with non-negative constraints.
  • Distinction between combinations where order does not matter and permutations where order matters.
  • Partitioning numbers into fixed subsets of integers.
How UPSC tests this

Systematic counting of solutions for multi-variable linear constraints.

Trap: Permuting the order of shots or forgetting that 0 is a valid count for a run type.

More Numeracy PYQs

All Numeracy questions →

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