4

Part of 2006 Team Selection Test For CSMO

Problems(1)

Xvii cono sur - peru tst 2006.

Source: Spanish Communities

All the squares of a board of

(n+1)\times(n-1)

squares are painted with three colors such that, for any two different columns and any two different rows, the 4 squares in their intersections they don't have all the same color. Find the greatest possible value of

n

LaTeXcombinatorics unsolvedcombinatorics