Skip to main content
OlympiadHQ

Browse · harp

Print

smc

counting and probability senior

Problem

A box contains red balls, green balls, yellow balls, blue balls, white balls, and black balls. What is the minimum number of balls that must be drawn from the box without replacement to guarantee that at least balls of a single color will be drawn?
(A)
(B)
(C)
(D)
Solution
We try to find the worst case scenario where we can find the maximum number of balls that can be drawn while getting of each color by applying the pigeonhole principle and through this we get a perfect guarantee. Namely, we can draw up to red balls, green balls, yellow balls, blue balls, white balls, and black balls, for a total of balls, without drawing balls of any one color. Drawing one more ball guarantees that we will get balls of one color -- either red, green, or yellow. Thus, the answer is .
Final answer
B