Skip to main content
OlympiadHQ

Browse · MathNet

Print

Second Round of the 73rd Czech and Slovak Mathematical Olympiad (January 16th, 2024)

Czech Republic 2024 counting and probability

Problem

Suppose that we fill a table with natural numbers from to using each of them precisely once. After that, we write down the sums in each of the four squares in the ascending order. Determine whether it is possible to obtain the following quadruples of natural numbers:

a) , , , ,

b) , , , .
Solution
a) Yes, the following table gives us the desired quadruple of sums.
182
695
374
b) No, it is impossible to get this quadruple. Denote the sum of the four numbers as , we shall proceed by proving that and then describing all the cases where we get an equality.

Note that in , the central number contributes four times, the four corner tiles contribute once and the remaining four tiles contribute twice, hence we get: Moreover, it is clear that the upper bound is attained if and only if the number is in the centre and numbers , , , are in the corners in some order.

Suppose that we were able to obtain the quadruple , , , , since the sum of the four numbers is , the placement of the numbers in the big table would have to follow the rules explained above. But this means that the smallest possible sum of a square is , a contradiction, hence we can't obtain this quadruple.
Final answer
a) Yes; b) No.

Techniques

Counting two waysColoring schemes, extremal arguments