A positive integer is written in each box of a 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 be the greatest of the 16 numbers. Find the minimum possible value of .
Solution
For , let be the maximum number in column , and let be the remaining 12 numbers written on the board (different from ). Then, for every , is the sum of the other three numbers in column ; therefore,
Since are different positive integers, we have that
On the other hand, since are also different positive integers, and is the largest number on the board, then
From (2), (3) and (4), it follows that
which implies that .
The following is an example with :
| 1 | 8 | 12 | 21 |
|---|---|---|---|
| 7 | 9 | 20 | 4 |
| 10 | 19 | 3 | 6 |
| 18 | 2 | 5 | 11 |
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.