Problem #PRU-35506

Problems Fun Problems Word Problems Tables and tournaments Number tables and its properties Methods Pigeonhole principle Pigeonhole principle (other)
 12–13  2.0

Problem

Is it possible to fill an \(n\times n\) table with the numbers \(-1\), \(0\), \(1\), such that the sums of all the rows, columns, and diagonals are unique?