Maths Olympiad Prep

Library / /42 of 49

, 2022

Combinatorics Difficulty 6.9 National Olympiad Prove it Bulgaria

At an IMO prep camp there are 14 participants. Each participant has at least kk favorite numbers. The organizers want to give to each student a T-shirt with one of their favorite numbers on it. Find the smallest kk for which this is always plausible under the restriction:

a) the participants form a circle and the T-shirts must then be distributed in such a way that no two neighbors share the same number.

b) There are 7 boys and 7 girls and neither of the boys share their T-shirt number with neither of the girls.

Solution

a) Obviously k=1k=1 fails (e.g., whenever a couple of neighbors share their favorite number). We will show that k=2k=2 works. If all of them share the same favorite numbers, say 1 and 2, then we can easily solve the problem via providing 7 T-shirts of each kind, since 14 is even. If this is not the case, WLOG we can order the participants, such that the first one has a favorite number AA, which is not among the favorites of the last one. Then we give an AA T-shirt to the first. For each consecutive participant, we choose a favorite number, different than the one ahead of him. This will always be possible, thus the answer is k=2k=2.

b) First, k3k \le 3 fails when the favorite numbers of both boys and girls form the triples {1,2,3}\{1,2,3\}, {1,4,5}\{1,4,5\}, {1,6,7}\{1,6,7\}, {2,4,6}\{2,4,6\}, {2,5,7}\{2,5,7\}, {3,4,7}\{3,4,7\}, {3,5,6}\{3,5,6\}. We will show that k=4k=4 works. It is enough to consider exactly 4 favorite numbers for each of the boys, and all the different ways to assign a symbol BB or GG to each of the numbered T-shirts, for which there are no T-shirts with different symbols but identical numbers. Such a labeling will be referred as "good". Note that, there are at least 24=162^4 = 16 "good" labelings (when all the girls and all the boys share the same set of favorite numbers), and the probability for a boy to have all his favorite T-shirts labeled GG is exactly 116\frac{1}{16} from all good cases. Analogously, for a girl to have BB on all her favorite T-shirts. Therefore, in at most 14116=7814 \cdot \frac{1}{16} = \frac{7}{8} of the "good" cases the organizers will fail to distribute the T-shirts; hence in at least 18\frac{1}{8} of the good cases (in particular, in at least two) the organizers can accomplish their goal.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.