Question 17
Let $n$ and $k$ be strictly positive integers. There are $n k$ objects (of the same size) and $k$ boxes, each of which can hold $n$ objects. Each object is colored with one of $k$ possible colors. Show that it is possible to put the objects in the boxes so that each box contains objects of at most 2 different colors.