Problem

Source: Tournament of towns, Junior B-Level paper, Fall 2004

Tags: combinatorics unsolved, combinatorics



A box contains red, green, blue, and white balls, 111 balls in all. If you take out 100 balls without looking, then there will always be 4 balls of different colors among them. What is the smallest number of balls you must take out without looking to guarantee that among them there will always be balls of at least 3 different colors?