An n by n table has an integer in each cell, such that no two cells within a row share the same number. Prove that it is possible to permute the elements within each row to obtain a table that has n distinct numbers in each column. latin squaresudokucombinatoricstablepermutation