Problem

Source: Saudi Arabia IMO TST Day II Problem 3

Tags: induction, algebra, system of equations, number theory unsolved, number theory



Show that it is possible to write a $n \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.