In a N×N array of numbers, all rows are different (two rows are said to be different even if they differ only in one entry). Prove that there is a column which can be deleted in such a way that the resulting rows will still be different. (A Andjans, Riga) combinatoricssquare tabletable