Japan 2007

Question

There is a grid of 5 5. And write the integers 1,2,,16 in all the grids (each number can be written only once) in the upper left grid of 4 4 (♣). About the 4 rows, write the sum of four numbers that are written in each row at the right end of each row. Similarly, about the 4 columns, write the sum of four numbers that are written in each column at the lower end of each column. And nothing is written in the lower right grid. Find the maximum integer m which satisfies the following condition. Conditions: About step (♣), there exists a way of writing the numbers such that you can choose two numbers a, b which |a-b| m hold from the right end column and also from the lower end row.

Accepted Answer

Define the numbers written to each grid as shown in the table 1. I can assume that A_1 is the minimum and A_4 is the maximum in A_1, A_2, A_3, A_4, and that B_1 is the minimum and B_4 is the maximum in B_1, B_2, B_3, B_4, by rearranging rows and columns appropriately. Now m A_4 - A_1, m B_4 - B_1, so aligned m & (A_4 - A_1) + (B_4 - B_1)2 &= 12(a_4,4 - a_1,1) + 12(a_4,4 + a_4,2 + a_4,3 + a_2,4 + a_3,4 - a_1,1 - a_1,2 - a_1,3 - a_2,1 - a_3,1) & 12(16 - 1) + 12(16 + 15 + 14 + 13 + 12 - 1 - 2 - 3 - 4 - 5) &= 35 aligned And there exists a way of writing if m = 35 (table 2). So the maximum m is 35. This is table 1. | a_1,1 | a_1,2 | a_1,3 | a_1,4 | A_1 | |-----------|-----------|-----------|-----------|-------| | a_2,1 | a_2,2 | a_2,3 | a_2,4 | A_2 | | a_3,1 | a_3,2 | a_3,3 | a_3,4 | A_3 | | a…

$a_{1, 1}$	$a_{1, 2}$	$a_{1, 3}$	$a_{1, 4}$	$A_{1}$
$a_{2, 1}$	$a_{2, 2}$	$a_{2, 3}$	$a_{2, 4}$	$A_{2}$
$a_{3, 1}$	$a_{3, 2}$	$a_{3, 3}$	$a_{3, 4}$	$A_{3}$
$a_{4, 1}$	$a_{4, 2}$	$a_{4, 3}$	$a_{4, 4}$	$A_{4}$
$B_{1}$	$B_{2}$	$B_{3}$	$B_{4}$

1	2	5	11	19
3	6	7	12	28
4	8	9	14	35
10	13	15	16	54
18	29	36	53