A [i]uniform covering[/i] of the integers $1,2,...,n$ is a finite multiset of subsets of $\{1,2,...,n\}$, so that each number lies in the same amount of sets from the covering. A covering may contain the same subset multiple times, it must contain at least one subset, and it may contain the empty subset. For example, $(\{1\},\{1\},\{2,3\},\{3,4\},\{2,4\})$ is a uniform covering of $1,2,3,4$ (every number occurs in two sets). The covering containing only the empty set is also uniform (every number occurs in zero sets). Given two uniform coverings, we define a new uniform covering, their [i]sum[/i] (denoted by $\oplus$), by adding the sets from both coverings. For example: $(\{1\},\{1\},\{2,3\},\{3,4\},\{2,4\})\oplus(\{1\},\{2\},\{3\},\{4\})=$ $(\{1\},\{1\},\{1\},\{2\},\{3\},\{4\},\{2,3\},\{3,4\},\{2,4\})$ A uniform covering is called [i]non-composite[/i] if it's not a sum of two uniform coverings. Prove that for any $n\geq1$, there are only finitely many non-composite uniform coverings of $1,2,...,n$.

$(GDR 5)$ Given a ring $G$ in the plane bounded by two concentric circles with radii $R$ and $\frac{R}{2}$, prove that we can cover this region with $8$ disks of radius $\frac{2R}{5}$. (A region is covered if each of its points is inside or on the border of some disk.)

A bounded planar region of area $S$ is covered by a finite family $F$ of closed discs. Prove that $F$ contains a subfamily consisting of pairwise disjoint discs, of joint area not less than $S/9$.

A cross with length $p$ (or [i]p-cross[/i] for short) will be called the figure formed by a unit square and 4 rectangles $p-1$ x $1$ on its sides. What’s the least amount of colors one has to use to color the cells of an infinite table, so that each [i]p-cross[/i] on it covers cells, no two of which are in the same color?

A triangle is given on a sphere of radius $1$, the sides of which are arcs of three different circles of radius $1$ centered in the center of a sphere having less than $\pi$ in length and an area equal to a quarter of the area of the sphere. Prove that four copies of such a triangle can cover the entire sphere. A. Zaslavsky

Prove that the interior of a convex pentagon whose sides are all equal, is not covered by the open disks having the sides of the pentagon as diameter.

Given a positive integer $n$, determine the maximum number of lattice points in the plane a square of side length $n +\frac{1}{2n+1}$ may cover.

An $n\times n$ square is divided into $n^2$ unit cells. Is it possible to cover this square with some layers of 4-cell figures of the following shape [img]https://cdn.artofproblemsolving.com/attachments/5/7/d42a8011ec4c5c91c337296d8033d412fade5c.png[/img](i.e. each cell of the square must be covered with the same number of these figures) if a) $n=6$? b) $n=7$? (The sides of each figure must coincide with the sides of the cells; the figures may be rotated and turned over, but none of them can go beyond the bounds of the square.)

$(GDR 5)$ Given a ring $G$ in the plane bounded by two concentric circles with radii $R$ and $\frac{R}{2}$, prove that we can cover this region with $8$ disks of radius $\frac{2R}{5}$. (A region is covered if each of its points is inside or on the border of some disk.)

For some positive integer $n$, consider the board $n\times n$. On this board you can put any rectangles with sides along the sides of the grid. What is the smallest number of such rectangles that must be placed so that all the cells of the board are covered by distinct numbers of rectangles (possibly $0$)? The rectangles are allowed to have the same sizes. [i]Proposed by Anton Trygub[/i]

A domino is a $ 1 \times 2 $ or $ 2 \times 1 $ tile. Let $n \ge 3 $ be an integer. Dominoes are placed on an $n \times n$ board in such a way that each domino covers exactly two cells of the board, and dominoes do not overlap. The value of a row or column is the number of dominoes that cover at least one cell of this row or column. The configuration is called balanced if there exists some $k \ge 1 $ such that each row and each column has a value of $k$. Prove that a balanced configuration exists for every $n \ge 3 $, and find the minimum number of dominoes needed in such a configuration.

For any triple $(a, b, c)$ of positive integers, not all equal, We are given sufficiently many rectangular blocks of size $a \times b \times c$. We use these blocks to fill up a cubic box of edge $10$. (a) Assume we have used at least $100$ blocks. Show that there are two blocks, one of which is a translate of the other. (b) Find a number smaller than $100$ (the smaller, the better) for which the above statement still holds.

For a rectangle $R$ with integral side lengths, denote by $D(a, b)$ the number of ways of covering $R$ by congruent rectangles with integral side lengths formed by a family of cuts parallel to one side of $R$. Determine the perimeter $P$ of the rectangle $R$ for which $\frac{D(a,b)}{a+b}$ is maximal.

It is given $2018$ points in plane. Prove that it is possible to cover them with circles such that: $i)$ sum of lengths of all diameters of all circles is not greater than $2018$ $ii)$ distance between any two circles is greater than $1$

Let $L$ be a figure made of $3$ squares, a right isosceles triangle and a quarter circle (all unit sized) as shown below: [img]https://wiki-images.artofproblemsolving.com//f/f9/Weirwiueripo.png[/img] Prove that any $18$ points in the plane can be covered with copies of $L$, which don't overlap (copies of $L$ may be rotated or flipped)

A chessboard $1000 \times 1000$ is covered by dominoes $1 \times 10$ that can be rotated. We don't know which is the cover, but we are looking for it. For this reason, we choose a few $N$ cells of the chessboard, for which we know the position of the dominoes that cover them. Which is the minimum $N$ such that after the choice of $N$ and knowing the dominoed that cover them, we can be sure and for the rest of the cover? (Bulgaria)

Is it possible to cover a circle of area $1$ with finitely many equilateral triangles whose areas sum to $1.01$, all pointing in the same direction? [i]Proposed by Ethan Tan[/i]

For each positive integer $m$, we define $L_m$ as the figure that is obtained by overlapping two $1 \times m$ and $m \times 1$ rectangles in such a way that they coincide at the $1 \times 1$ square at their ends, as shown in the figure. [asy] pair h = (1, 0), v = (0, 1), o = (0, 0); for(int i = 1; i < 5; ++i) { o = (i*i/2 + i, 0); draw(o -- o + i*v -- o + i*v + h -- o + h + v -- o + i*h + v -- o + i*h -- cycle); string s = "$L_" + (string)(i) + "$"; label(s, o + ((i / 2), -1)); for(int j = 1; j < i; ++j) { draw(o + j*v -- o + j*v + h); draw(o + j*h -- o + j*h + v); } } label("...", (18, 0.5)); [/asy] Using some figures $L_{m_1}, L_{m_2}, \dots, L_{m_k}$, we cover an $n \times n$ board completely, in such a way that the edges of the figure coincide with lines in the board. Among all possible coverings of the board, find the minimal possible value of $m_1 + m_2 + \dots + m_k$. Note: In covering the board, the figures may be rotated or reflected, and they may overlap or not be completely contained within the board.

[b]carpeting[/b] suppose that $S$ is a figure in the plane such that it's border doesn't contain any lattice points. suppose that $x,y$ are two lattice points with the distance $1$ (we call a point lattice point if it's coordinates are integers). suppose that we can cover the plane with copies of $S$ such that $x,y$ always go on lattice points ( you can rotate or reverse copies of $S$). prove that the area of $S$ is equal to lattice points inside it. time allowed for this question was 1 hour.

A median of an acute-angled triangle dissects it into two triangles. Prove that each of them can be covered by a semidisc congruent to a half of the circumdisc of the initial triangle.

A $10 \times 10$ table consists of $100$ unit cells. A [i]block[/i] is a $2 \times 2$ square consisting of $4$ unit cells of the table. A set $C$ of $n$ blocks covers the table (i.e. each cell of the table is covered by some block of $C$ ) but no $n -1$ blocks of $C$ cover the table. Find the largest possible value of $n$.

A [i]tile[/i] $T$ is a union of finitely many pairwise disjoint arcs of a unit circle $K$. The [i]size[/i] of $T$, denoted by $|T|$, is the sum of the lengths of the arcs $T$ consists of, divided by $2\pi$. A [i]copy[/i] of $T$ is a tile $T'$ obtained by rotating $T$ about the centre of $K$ through some angle. Given a positive real number $\varepsilon < 1$, does there exist an infinite sequence of tiles $T_1,T_2,\ldots,T_n,\ldots$ satisfying the following two conditions simultaneously: 1) $|T_n| > 1 - \varepsilon$ for all $n$; 2) The union of all $T_n'$ (as $n$ runs through the positive integers) is a proper subset of $K$ for any choice of the copies $T_1'$, $T_2'$, $\ldots$, $T_n', \ldots$? [hide=Note] In the extralist the problem statement had the clause "three conditions" rather than two, but only two are presented, the ones you see. I am quite confident this is a typo or that the problem might have been reformulated after submission.[/hide]

We have 19 triminos (2 x 2 squares without one unit square) and infinite amount of 2 x 2 squares. Find the greatest odd number $n$ for which a square $n$ x $n$ can be covered with the given figures.

Inside the triangle $A_1A_2A_3$ with sides $a_1$, $a_2$, $a_3$, three points are given, which we label $P_1$, $P_2$, $P_3$ so that the product of their distances from the corresponding sides $a_1$, $a_2$, $a_3$ is as large as possible. Prove that the triangles $P_1A_2A_3$, $A_1P_2A_3$, $A_1A_2P_3$ cover the triangle. [hide=original wording]V trojúhelníku A1A2A3 se stranami a1, a2, a3 jsou dány tři body, které označíme Pi, P2, P3 tak, aby součin jejich vzdáleností od odpovídajících stran a1, a2, a3 byl co největší. Dokažte, že trojúhelníky P1A2A3, A1P2A3, A1A2P3 pokrývají trojúhelník.[/quote]