Skip to main content
OlympiadHQ

Browse · MathNet

Print

Ukrajina 2008

Ukraine 2008 counting and probability

Problem

Take the chequered board and consider all the possible patterns of painting 10 sectors so that there is only one painted sector in every row and every column. For each pattern we find rectangle of maximal area the sides of which are on the lines of the grid. Besides, this rectangle must have no painted sectors. What can be the maximal area of such a rectangle?

Answer: 25.

problem
Solution
Let's consider rectangles with their sides along the grid lines. On the board let there be a rectangle with dimensions , which has no painted sectors ( is its width, is its height). According to the problem statement columns which the rectangle occupies must have painted sectors. On the other hand, these sectors can not be in those rows that the rectangle occupies. The rest is rows. The obligatory condition is (otherwise we are not able to place painted sectors in rows, one at a row). (you'll obtain the same result if you consider rows). Thus rectangle has the maximal area (this area is represented in the Cauchy inequality or as a parabola with its branches down). We can easily draw an example of the board with such a rectangle (fig.3).

Fig.3
Final answer
25

Techniques

Pigeonhole principleColoring schemes, extremal argumentsLinear and quadratic inequalities