MathDB
question 3

Source: iran tst 2014 first exam

April 13, 2014
LaTeXcombinatorics unsolvedcombinatorics

Problem Statement

we named a nnn*n table selfishselfish if we number the row and column with 0,1,2,3,...,n10,1,2,3,...,n-1.(from left to right an from up to down) for every {i,j0,1,2,...,n1 i,j\in{0,1,2,...,n-1}} the number of cell (i,j)(i,j) is equal to the number of number ii in the row jj. for example we have such table for n=5n=5 1 0 3 3 4 1 3 2 1 1 0 1 0 1 0 2 1 0 0 0 1 0 0 0 0 prove that for n>5n>5 there is no selfishselfish table