Maths Olympiad Prep

Library / /20 of 22

, 2024

Combinatorics Difficulty 7.1 National olympiad, round 2 Prove it Turkey

There are 207 boxes on the table numbered 1,2,,2071, 2, \ldots, 207. Asli puts one red ball to each of some 100 boxes and one white ball to each of the remaining 107 boxes. After that Zehra writes NN pairs (i,j)(i, j), 1i<j2071 \le i < j \le 207 to the board. Finally for each pair (i,j)(i, j) on the board Asli informs Zehra whether balls in the boxes ii and jj are same-coloured. Find the minimal value of NN for which Zehra can guarantee to determine the colours of balls in all boxes.

Solution

Answer: 205.

Let us show that Zehra can guarantee to determine the colours of all balls for N=205N = 205. Zehra writes the pairs (1,2),(1,3),,(1,206)(1,2), (1,3), \dots, (1,206) on the board. Let us assign a number ii to the ball contained in the box number ii. Suppose that out of balls numbered 2,3,,2062, 3, \dots, 206 the number of balls same-coloured with ii is aa and the number of differently coloured balls is b=205ab = 205 - a. Then the colours of all balls can be easily determined: One of these numbers aa and bb is greater or equal to 103. If a103a \ge 103 then ball 1 is white. a+1a+1 is either 106 or 107. In the first case ball 207 is white, in the second case ball 207 is red. If b103b \ge 103 then ball 1 is red. bb is either 106 or 107. In the first case ball 207 is white, in the second case ball 207 is red.

Now we show that if N204N \le 204 then Zehra cannot guarantee to determine colours of all balls. Suppose that NN pairs (i,j)(i, j) are already chosen by Zehra. Let us define a graph GG consisting of 207 vertices representing balls where vertices ii and jj are connected by an edge if and only if there is a pair (i,j)(i, j) on the board. Since the total number of edges is N204N \le 204 the graph GG has at least 3 connected components. Asli divides these connected components into 3 non-empty groups C1,C2C_1, C_2 and C3C_3 with number of vertices C1,C2|C_1|, |C_2| and C3|C_3|. Assuming C1C2C3|C_1| \ge |C_2| \ge |C_3| we get that C2+C3138|C_2| + |C_3| \le 138. Obviously at least one of groups C2,C3C_2, C_3 and C2C3C_2 \cup C_3 contains even number of vertices. Asli can divide vertices of this group into two parts A1A_1 and A2A_2, where A1=A2<100|A_1| = |A_2| < 100. Since Zehra is going to guarantee to determine ball colours we can suppose that Asli knows all pairs on the board before her ball distribution. Thus, Asli can make all balls in A1A_1 red coloured and all balls in A2A_2 white coloured or alternatively all balls in A1A_1 white coloured and all balls in A2A_2 red coloured and the remaining balls will have arbitrary colours just to provide 100 red and 107 white balls in total. In both cases the answers of Asli will be the same. Therefore, Zehra cannot determine the ball colours of this group containing even number of boxes. Done.

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 and solution reproduced as published; topic and difficulty added by this site.