Write either 1 or −1 in each of the cells of a (2n)×(2n)-table, in such a way that there are exactly 2n2 entries of each kind. Let the minimum of the absolute values of all row sums and all column sums be M. Determine the largest possible value of M. combinatorics unsolvedcombinatorics