Show that we cannot tile a $10 x 10$ board with $25$ pieces of type $A$, or with $25$ pieces of type $B$, or with $25$ pieces of type $C$.

For a positive integer $n$, we consider an $n \times n$ board and tiles with dimensions $1 \times 1, 1 \times 2, ..., 1 \times n$. In how many ways exactly can $\frac12 n (n + 1)$ cells of the board are colored red, so that the red squares can all be covered by placing the $n$ tiles all horizontally, but also by placing all $n$ tiles vertically? Two colorings that are not identical, but by rotation or reflection from the board into each other count as different.

Prove that you can't split a square into finitely many hexagons, whose inner angles are all less than $180^o$.

On an infinite sheet of tiles, an infinite number of $1 \times 2$ tile rectangles are placed, their edges follow the lines of the tiles, and they do not touch each other, not even the corners. Is it true that the remaining checkered sheet can be completely covered with $1 \times 2$ checkered rectangles? [hide=original wording]Uz bezgalīgas rūtiņu lapas ir novietoti bezgaglīgi daudzi 1 x 2 rūtiņu taisnstūri, to malas iet pa rūtiņu līnijām, un tie nesaskaras cits ar citu pat ne ar stūriem. Vai tiesa, ka atlikušo rūtiņu lapu var pilnībā noklāt ar 1 x 2 rūtiņu tainstūriem? [/hide]

An angle of size $n \times m$, where $m, n \ge 2$, is called a figure, resulting from a rectangle of size $n \times m$ cells by removing the rectangle size $(n - 1) \times (m - 1)$ cells. Two players take turns making moves consisting in painting in a corner an arbitrary non-zero number of cells forming a rectangle or square.

We call a tiling of an $m\times$ n rectangle with arabos (see figure below) [i]regular[/i] if there is no sub-rectangle which is tiled with arabos. Prove that if for some $m$ and $n$ there exists a [i]regular[/i] tiling of the $m\times n$ rectangle then there exists a [i]regular[/i] tiling also for the $2m \times 2n$ rectangle. [img]https://cdn.artofproblemsolving.com/attachments/1/1/2ab41cc5107a21760392253ed52d9e4ecb22d1.png[/img]

The $U$-tile is made up of $1 \times 1$ squares and has the following shape: [img]https://cdn.artofproblemsolving.com/attachments/8/7/5795ee33444055794119a99e675ef977add483.png[/img] where there are two vertical rows of a squares, one horizontal row of $b$ squares, and also $a \ge 2$ and $b \ge 3$. Notice that there are different types of tile $U$ . For example, some types of $U$ tiles are as follows: [img]https://cdn.artofproblemsolving.com/attachments/0/3/ca340686403739ffbbbb578d73af76e81a630e.png[/img] Prove that for each integer $n \ge 6$, the board of $n\times n$ can be completely covered with $U$-tiles , with no gaps and no overlapping clicks. Clarifications: The $U$-tiles can be rotated. Any amount can be used in the covering of tiles of each type.

You have a large number of congruent equilateral triangular tiles on a table and you want to fit $n$ of them together to ma€ke a convex equiangular hexagon (i.e. one whose interior angles are $120^o$) . Obviously, $n$ cannot be any positive integer. The first three feasible $n$ are $6, 10$ and $13$. Determine if $19$ and $20$ are feasible .

A $5\times 5$ board is covered by eight hooks (a three unit square figure, shown in the picture) so that one unit square remains free. Determine all squares of the board that can remain free after such covering. [img]https://cdn.artofproblemsolving.com/attachments/6/8/a8c4e47ba137b904bd28c01c1d2cb765824e6a.png[/img]

Let $n\geq 3$ a positive integer. In each cell of a $n\times n$ chessboard one must write $1$ or $2$ in such a way the sum of all written numbers in each $2\times 3$ and $3\times 2$ sub-chessboard is even. How many different ways can the chessboard be completed?

Basil has an unrestricted supply of straight bricks $1 \times 1 \times 3$ and Γ-shape bricks made of three cubes $1\times 1\times 1$. Basil filled a whole box $m \times n \times k$ with these bricks, where $m, n$ and $k$ are integers greater than $1$. Prove that it was sufficient to use only Γ-shape bricks. (Mikhail Evdokimov)

Show that a convex polygon with more than four sides cannot be decomposed into two others, both similar to the first (directly or inversely), by means of a single rectilinear cut. Reasonably specify which are the quadrilaterals and triangles that admit a decomposition of this type.

A $50 \times 50$ square board is tiled by the tetrominoes of the following three types: [img]https://cdn.artofproblemsolving.com/attachments/2/9/62c0bce6356ea3edd8a2ebfe0269559b7527f1.png[/img] Find the greatest and the smallest possible number of $L$ -shaped tetrominoes In the tiling. (Folklore)

A [i]triminó[/i] is a rectangular tile of $1\times 3$. Is it possible to cover a $8\times8$ chessboard using $21$ triminós, in such a way there remains exactly one $1\times 1$ square without covering? In case the answer is in the affirmative, determine all the possible locations of such a unit square in the chessboard.

Pieces are placed in some squares of an $8 \times 8$ board sothat: a) There is at least one token in any rectangle with sides $2 \times 1$ or $1\times 2$. b) There are at least two neighboring pieces in any rectangle with sides $7\times 1$ or $1\times 7$. Find the smallest number of tokens that can be taken to fulfill with both conditions.

Consider a $ 2018\times 2018$. board. An "LC-tile" is a tile consisting of $9$ unit squares, having the shape as in the gure below. What is the maximum number of "LC-tiles" that can be placed on the board without superposing them? (Each of the $9$ unit squares of the tile must cover one of the unit squares of the board; a tile may be rotated, turned upside down, etc.) [img]https://cdn.artofproblemsolving.com/attachments/7/4/a2f992bc0341def1a6e5e26ba8a9eb3384698a.png [/img] Alexandru Girban

A rectangle is tiled with rectangles of size $6\times 1$. Prove that one of its side lengths is divisible by $6$.

We consider tilings of a rectangular $m \times n$-board with $1\times2$-tiles. The tiles can be placed either horizontally, or vertically, but they aren't allowed to overlap and to be placed partially outside of the board. All squares on theboard must be covered by a tile. (a) Prove that for every tiling of a $4 \times 2010$-board with $1\times2$-tiles there is a straight line cutting the board into two pieces such that every tile completely lies within one of the pieces. (b) Prove that there exists a tiling of a $5 \times  2010$-board with $1\times 2$-tiles such that there is no straight line cutting the board into two pieces such that every tile completely lies within one of the pieces.

You are given a rectangular playing field of size $13 \times 2$ and any number of dominoes of sizes $2\times 1$ and $3\times 1$. The playing field should be seamless with such dominoes and without overlapping, with no domino protruding beyond the playing field may. Furthermore, all dominoes must be aligned in the same way, i. e. their long sides must be parallel to each other. How many such coverings are possible? (Walther Janous)

The next board is completely covered with dominoes in an arbitrary manner. [img]https://cdn.artofproblemsolving.com/attachments/8/9/b4b791e55091e721c8d6040a65ae6ba788067c.png[/img] a) Prove that we can paint $21$ dominoes in such a way that there are not two dominoes painted forming a $S$-tetramino. b) What is the largest positive integer $k$ for which it is always possible to paint $k$ dominoes (without matter how the board is filled) in such a way that there are not two painted dominoes forming a $S$-tetramine? Clarification: A domino is a $1 \times 2$ or $2 \times 1$ rectangle; the $S$-tetraminos are the figures of the following types: [img]https://cdn.artofproblemsolving.com/attachments/d/f/8480306382d6b87ddb8b2a7ca96c91ee45bc6e.png[/img]

A $300\times 300$ board is arbitrarily filled with $2\times 1$ dominoes with no overflow, underflow, or overlap. (Tokens can be placed vertically or horizontally.) Decide if it is possible to paint the tiles with three different colors, so that the following conditions are met: $\bullet$ Each token is painted in one and only one of the colors. $\bullet$ The same number of tiles are painted in each color. $\bullet$ No piece is a neighbor of more than two pieces of the same color. Note: Two dominoes are [i]neighbors [/i]if they share an edge.

The workers laid a floor of size $n \times n$ with tiles of two types: $2 \times 2$ and $3 \times 1$. It turned out that they were able to completely lay the floor in such a way that the same number of tiles of each type was used. Under what conditions could this happen? (You can’t cut tiles and also put them on top of each other.)

A $7\times 7$ square is cut into pieces following types: [img]https://cdn.artofproblemsolving.com/attachments/e/d/458b252c719946062b655340cbe8415d1bdaf9.png[/img] Show that exactly one of the pieces is of type (b). [img]https://cdn.artofproblemsolving.com/attachments/4/9/f3dd0e13fed9838969335c82f5fe866edc83e8.png[/img]

In a checkered square $101 \times 101$, each cell of the inner square $99 \times 99$ is painted in one of ten colors (cells adjacent to the border of the square, not painted). Could it turn out that in every in a $3\times 3$ square, is exactly one more cell painted the same color as the central cell?

For what smallest $n$ can a $n \times n$ square be cut into squares $40 \times 40$ and $49 \times 49$ so that squares of both types are present?