Problem

Source: Swiss TST 2019 P10

Tags: combinatorics



Let $n \geq 5$ be an integer. A shop sells balls in $n$ different colors. Each of $n + 1 $ children bought three balls with different colors, but no two children bought exactly the same color combination. Show that there are at least two children who bought exactly one ball of the same color.