MathDB
Good Problem.

Source: IMO ShortList 2004, combinatorics problem 6

March 23, 2005
linear algebramatrixcombinatoricsExtremal combinatoricsIMO Shortlist

Problem Statement

For an n×n{n\times n} matrix AA, let XiX_{i} be the set of entries in row ii, and YjY_{j} the set of entries in column jj, 1i,jn{1\leq i,j\leq n}. We say that AA is golden if X1,,Xn,Y1,,Yn{X_{1},\dots ,X_{n},Y_{1},\dots ,Y_{n}} are distinct sets. Find the least integer nn such that there exists a 2004×2004{2004\times 2004} golden matrix with entries in the set {1,2,,n}{\{1,2,\dots ,n\}}.