UPSC Prelims 2023 CSAT Q36 · Numeracy
A box contains 14 black balls, 20 blue balls, 26 green balls, 28 yellow balls, 38 red balls and 54 white balls. Consider the following statements :
1. The smallest number n such that any n balls drawn from the box randomly must contain one full group of at least one colour is 175.
2. The smallest number m such that any m balls drawn from the box randomly must contain at least one ball of each colour is 167.
Which of the above statements is/are correct ?
- a1 only
- b2 only
- cBoth 1 and 2
- dNeither 1 nor 2
Show answer & explanationHide answer
Statement 1 is correct because drawing 175 balls guarantees a full group of at least one colour (worst-case is 13+19+25+27+37+53 = 174 balls), and Statement 2 is correct because drawing 167 balls guarantees at least one ball of each colour (worst-case without all colours is sum of 5 largest groups = 54+38+28+26+20 = 166 balls).
Statement-by-statement analysis
- Incorrect because it considers only Statement 1 to be correct, whereas Statement 2 is also correct.
- Statement 2 evaluates to m = 167 which is mathematically true.
- Incorrect because it considers only Statement 2 to be correct, whereas Statement 1 is also correct.
- Statement 1 evaluates to n = 175 which is mathematically true.
- For Statement 1, the counts are Black=14, Blue=20, Green=26, Yellow=28, Red=38, White=54. Total balls = 180.
- To avoid drawing any complete single colour group, we draw maximum possible balls minus 1 from each group: (14-1) + (20-1) + (26-1) + (28-1) + (38-1) + (54-1) = 13 + 19 + 25 + 27 + 37 + 53 = 174 balls.
- Drawing 1 more ball (174 + 1 = 175 balls) guarantees at least one full group of some colour. Thus n = 175 is correct.
- For Statement 2, to avoid getting all 6 colours, we can draw all balls of the 5 largest groups without drawing any ball from the smallest group (Black = 14).
- Worst-case draw without black = 54 + 38 + 28 + 26 + 20 = 166 balls. Drawing 1 more ball (166 + 1 = 167 balls) guarantees at least one ball of the 6th colour (Black). Thus m = 167 is correct.
- Incorrect because both Statement 1 and Statement 2 are mathematically correct.
Concept to know
- The Pigeonhole Principle states that if you want to guarantee a certain outcome, you must consider the extreme worst-case scenario.
- Worst-Case Scenario for 'One Complete Group': Pick the maximum number of items from each category just 1 short of complete capacity. The formula is Sum(Count_i - 1) for all categories i.
- Adding 1 to this worst-case sum ensures that the next item picked completes at least one full category.
- Worst-Case Scenario for 'At Least One Item of Every Category': Pick all items from all categories except the smallest category.
- The formula for guaranteed presence of all categories is Sum of counts of (k - 1) largest categories + 1, where k is total number of categories.
Related facts for revision
- Socks in a dark room problem: To guarantee a matching pair from n different colours, pick n + 1 socks.
- Deck of cards problem: To guarantee at least one card of each suit from a standard deck of 52 cards, pick 39 + 1 = 40 cards.
- Dice rolling problems: Minimum rolls required to guarantee a specific sum or repetitive outcome under worst-case constraints.
- Threshold problems involving minimum selection to guarantee a majority or specific subgroup distribution.
Application of the Pigeonhole Principle and worst-case scenario optimization in Combinatorics.
Trap: Confusing the two conditions: for complete group, subtract 1 from every color; for all colors present, sum all except the smallest group and add 1.
More Numeracy PYQs
Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.