2001 USAMO Problems/Problem 1

Problem

Each of eight boxes contains six balls. Each ball has been colored with one of colors, such that no two balls in the same box are the same color, and no two colors occur together in more than one box. Determine, with justification, the smallest integer for which this is possible.

Solution

We claim that is the minimum. Consider the following construction (replacing colors with numbers) which fulfills this:

Suppose a configuration exists with .

Suppose an element appears or more times. Then the remaining elements of the boxes must be distinct, so that there are at least elements, contradiction. If an element appears or more times, the remaining elements of the boxes must be distinct, leading to elements. The fifth box can contain at most four elements from the previous boxes, and then the remaining two elements must be distinct, leading to , contradiction.

However, by the Pigeonhole Principle, at least one element must appear times. Without loss of generality suppose that appears three times, and let the boxes that contain these have the elements . Each of the remaining five boxes can have at most contain elements from each of these boxes. Thus, each of the remaining five boxes must have additional elements . Thus, it is necessary that we use balls to fill a grid by the same rules.

Again, no element may appear times, but by Pigeonhole, one element must appear times. Without loss of generality, let this element be ; then the three boxes containing must have at least elements, contradiction.

Therefore, is the minimum.

See also

2001 USAMO (Problems • Resources)
Preceded by First question	Followed by Problem 2
1 • 2 • 3 • 4 • 5 • 6
All USAMO Problems and Solutions