Maths Olympiad Prep

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

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

Combinatorics Difficulty 6.8 National Olympiad Prove it Czech Republic

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

a) 2424, 2424, 2525, 2525,

b) 2020, 2323, 2626, 2929.

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 SS, we shall proceed by proving that S≤98S \le 98 and then describing all the cases where we get an equality.

Note that in SS, the central number contributes four times, the four corner tiles contribute once and the remaining four tiles contribute twice, hence we get:
S≤4⋅9+2⋅(8+7+6+5)+(4+3+2+1)=98. S \le 4 \cdot 9 + 2 \cdot (8 + 7 + 6 + 5) + (4 + 3 + 2 + 1) = 98.
Moreover, it is clear that the upper bound is attained if and only if the number 99 is in the centre and numbers 11, 22, 33, 44 are in the corners in some order.

Suppose that we were able to obtain the quadruple 2020, 2323, 2626, 2929, since the sum of the four numbers is 9898, 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 2×22 \times 2 square is 1+5+6+9=211 + 5 + 6 + 9 = 21, a contradiction, hence we can't obtain this quadruple.

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

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