MathDB
Writing and n by n array of non-negative numbers

Source: Saudi Arabia IMO TST Day II Problem 3

July 22, 2014
inductionalgebrasystem of equationsnumber theory unsolvednumber theory

Problem Statement

Show that it is possible to write a n×nn \times n array of non-negative numbers (not necessarily distinct) such that the sums of entries on each row and each column are pairwise distinct perfect squares.