Maths Olympiad Prep

Library / /14 of 24

Combinatorics Difficulty 6.7 National olympiad Prove it Argentina

A positive integer is written in each box of a 4×44 \times 4 board, so that the 16 numbers are all different. For every row and every column, the number written in one of its boxes equals the sum of the remaining three. Let MM be the greatest of the 16 numbers. Find the minimum possible value of MM.

Solution

For i=1,,4i = 1, \dots, 4, let aia_i be the maximum number in column ii, and let b1,b2,,b12b_1, b_2, \dots, b_{12} be the remaining 12 numbers written on the board (different from a1,a2,a3,a4a_1, a_2, a_3, a_4). Then, for every ii, aia_i is the sum of the other three numbers in column ii; therefore,
a1+a2+a3+a4=b1+b2++b12.(2) a_1 + a_2 + a_3 + a_4 = b_1 + b_2 + \dots + b_{12}. \qquad (2)
Since b1,b2,,b12b_1, b_2, \dots, b_{12} are different positive integers, we have that
b1+b2++b121+2++12=78.(3) b_1 + b_2 + \dots + b_{12} \ge 1 + 2 + \dots + 12 = 78. \qquad (3)
On the other hand, since a1,a2,a3,a4a_1, a_2, a_3, a_4 are also different positive integers, and MM is the largest number on the board, then
a1+a2+a3+a4M+(M1)+(M2)+(M3)4M6.(4) a_1 + a_2 + a_3 + a_4 \le M + (M-1) + (M-2) + (M-3) \le 4M - 6. \qquad (4)
From (2), (3) and (4), it follows that
4M6a1+a2+a3+a4=b1+b2++b1278, 4M - 6 \ge a_1 + a_2 + a_3 + a_4 = b_1 + b_2 + \dots + b_{12} \ge 78,
which implies that M21M \ge 21.
The following is an example with M=21M = 21:

181221
79204
101936
182511

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.