MathDB
A green, blue and white colouring of a board.

Source: South African MO 2014 Q5

October 25, 2014
inequalitiescombinatorics unsolvedcombinatorics

Problem Statement

Let n>1n > 1 be an integer. An n×nn \times n-square is divided into n2n^2 unit squares. Of these unit squares, nn are coloured green and nn are coloured blue, and all remaining ones are coloured white. Are there more such colourings for which there is exactly one green square in each row and exactly one blue square in each column; or colourings for which there is exactly one green square and exactly one blue square in each row?