Browse · MathNet
PrintXXI OBM
Brazil counting and probability
Problem
tokens are to be placed on the squares of a board such that no 4 tokens be the vertices of a rectangle with sides parallel to the sides of the board. Find the greatest value of for which this is possible.

Solution
Let be the set of the positions of the tokens in the k_i\sum_{1 \le i \le 10} \binom{k_i}{2} = \binom{10}{2}\{1, 2, \dots, 10\}A_i\{1, 2, \dots, 10\}A_1 = \{1, 2, 3, 4\}A_2 = \{1, 5, 6, 7\}A_3 = \{1, 8, 9, 10\}\{2, 3, \dots, 10\}A_1A_2A_3\sum_{1\le i\le 10} k_i = 35$.
On the other hand, there exist instances with 34 tokens:
On the other hand, there exist instances with 34 tokens:
Final answer
34
Techniques
Counting two waysColoring schemes, extremal argumentsCauchy-Schwarz