Consider all the ways of writing exactly ten times each of the numbers 0,1,2,…,9 in the squares of a 10×10 board.
Find the greatest integer n with the property that there is always a row or a column with n different numbers. combinatorics unsolvedcombinatorics