Found problems: 80
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.
How many dominoes can be placed on a at least $3 \times 12$ board, such so that it is impossible to place a $1\times 3$, $3 \times 1$, or $ 2 \times 2$ tile on what remains of the board?
Clarification: Each domino covers exactly two squares on the board. The chips cannot overlap.
Let's call a corner the figure that is obtained by removing one cell from a $2 \times 2$ square. Cut the $6 \times 6$ square into corners so that no two of them form a $2 \times 3$ or $3 \times 2$ rectangle together.
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)
You have a large number of congruent equilateral triangular tiles on a table and you want to fit $n$ of them together to make 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 .
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$.
Two right isosceles triangles of legs equal to $1$ are glued together to form either an isosceles triangle - called [i]t-shape[/i] - of leg $\sqrt2$, or a parallelogram - called [i]p-shape[/i] - of sides $1$ and $\sqrt2$. Find all integers $m$ and $n, m, n \ge 2$, such that a rectangle $m \times n$ can be tilled with t-shapes and p-shapes.
Describe a method to convert any triangle into a rectangle with side 1 and area equal to the original triangle by dividing that triangle into finitely many subtriangles.
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]
(a) A square is cut into right triangles with legs of lengths $3$ and $4$. Prove that the total number of the triangles is even.
(b) A rectangle is cut into right triangles with legs of lengths $1$ and $2$. Prove that the total number of the triangles is even.
(A Shapovalov)
Compute the number of ways of tiling the $2\times 10$ grid below with the three tiles shown. There is an in finite supply of each tile, and rotating or reflecting the tiles is not allowed.
[img]https://cdn.artofproblemsolving.com/attachments/5/a/bb279c486fc85509aa1bcabcda66a8ea3faff8.png[/img]
All cells of the checkered plane are painted in $5$ colors so that in any figure of the species [img]https://cdn.artofproblemsolving.com/attachments/f/f/49b8d6db20a7e9cca7420e4b51112656e37e81.png[/img] all colors are different. Prove that in any figure of the species $ \begin{tabular}{ | l | c| c | c | r| } \hline & & & &\\ \hline \end{tabular}$, all colors are different..
Let's call a corner the figure that is obtained by removing one cell from a $2 \times 2$ square. Cut the $6 \times 6$ square into corners so that no two of them form a $2 \times 3$ or $3 \times 2$ rectangle together.
Daniel has an unlimited supply of tiles labeled “$2$” and “$n$” where $n$ is an integer. Find (with proof) all the values of $n$ that allow Daniel to fill an $8 \times 10$ grid with these tiles such that the sum of the values of the tiles in each row or column is divisible by $11$.
One tiles a floor of $a \times b$ dm$^2$ with square tiles, $a,b \in N$. Tiles do not overlap, and sides of floor and tiles are parallel. Using tiles of $2\times 2$ dm$^2$ leaves the same amount of floor uncovered as using tiles of $4\times 4$ dm$^2$. Using $3\times 3$ dm$^2$ tiles leaves $29$ dm$^2$ floor uncovered. Determine $a$ and $b$.
Prove that you can't split a square into finitely many hexagons, whose inner angles are all less than $180^o$.
Find the maximum number of $3 \times 5\times 7$ boxes that can be placed inside a $11\times 35\times 39$ box. For the number found, indicate how you would place that number of boxes inside the box.
There are eight congruent $1\times 2$ tiles formed of one blue square and one red square. In how many ways can we cover a $4\times 4$ area with these tiles so that each row and each column has two blue squares and two red squares?
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 sword is a figure consisting of $6$ unit squares presented in the picture below (and any other figure obtained from it by rotation).
[img]https://cdn.artofproblemsolving.com/attachments/4/3/08494627d043ea575703564e9e6b5ba63dc2ef.png[/img]
Determine the largest number of swords that can be cut from a $6\times 11$ piece of paper divided into unit squares (each sword should consist of six such squares).
Given a square board with dimensions $1 995 \times 1 995$. These cells are painted with black and white paints in checkerboard order like this. that the corner cells are black. Two black and one white cells were randomly cut out of the board. Prove that the rest of the board can be divided into rectangles of size $1 \times 2$ .
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]
What is the smallest number of $3$-cell corners that you need to paint in a $5 \times5$ square so that you cannot paint more than one corner of one it? (Shaded corners should not overlap.)
The workers laid a floor of size $n\times n$ ($10 <n <20$) with two types of tiles: $2 \times 2$ and $5\times 1$. It turned out that they were able to completely lay the floor so that the same number of tiles of each type was used. For which $n$ could this happen? (You can’t cut tiles and also put them on top of each other.)
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.