Browse · MathNet
PrintArgentina_2018
Argentina 2018 counting and probability
Problem
A grid rectangle that is not a square is cut into 8 different (non-congruent) grid polygons along the grid lines. What is its minimal possible area?
Solution
There is one grid polygon of area ( square), one such polygon of area ( rectangle), such polygons of area ( rectangle and an angle of squares). To satisfy the condition one must then use at least grid polygons of area or greater. Hence the area of the given rectangle is at least . Observe that it cannot be exactly . Otherwise is a square or a rectangle. The first case is excluded by hypothesis. In the second only rectangles can be used in the division, hence would have area at least . In conclusion, has at least area . It can be exactly for a rectangle.
The figure displays a division of such a rectangle into different grid polygons. So the required minimal area is .
| 1 | 3 | 3 | 4 | 5 | 5 | 5 | 6 | 6 | 7 | 7 | 7 | 7 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2 | 2 | 3 | 4 | 4 | 4 | 6 | 6 | 8 | 8 | 8 | 8 | 8 |
Final answer
26
Techniques
Enumeration with symmetryColoring schemes, extremal arguments