Skip to main content
OlympiadHQ

Browse · MathNet

Print

Belarus2022

Belarus 2022 counting and probability

Problem

The board was cut into tetraminoes of two types: L-tetramino and Z-tetramino . Each tetramino consists of four unit squares, tetriminoes can be rotated and flipped. Find the smallest number of -tetriminoes that could be obtained.

problem
Solution
Answer: . Let's label the columns of the table from bottom to top with the numbers from to and color all the cells of the rows with odd numbers in yellow, and with even numbers — in blue. Each -tetromino consists of three squares of one color and one square of another. Let's assume that not a single -tetromino has been obtained. Since the numbers of yellow and blue cells in the table are equal, the number of -tetrominoes consisting of three yellow cells and one blue cell is equal to the number of -tetrominoes consisting of three blue cells and one yellow cell. This means that the board is divided into an even number of -tetrominoes, but this implies that the total number of cells on the board is a multiple of , which is not true. Hence at least one -tetromino has been obtained. Let's give an example showing what exactly one -tetromino can be obtained.



The picture shows how to cut a board into seven -tetrominoes and one -tetromino. If we cut off such board from the corner of the board, then the rest of the board can be easily cut into and rectangles, which are made up of two -tetrominoes.
Final answer
1

Techniques

Coloring schemes, extremal argumentsInvariants / monovariants