$2018\times 2018$ field is covered with $1 \times 2$ dominos, such that every $2 \times 2$ or $1 \times 4,4 \times 1$ figure is not covered by only two dominos. Can be covered more than $99\%$ of field ?

A circle is divided into $13$ segments, numbered consecutively from $1$ to $13$. Five fleas called $A,B,C,D$ and $E$ are sitting in the segments $1,2,3,4$ and $5$. A flea is allowed to jump to an empty segment five positions away in either direction around the circle. Only one flea jumps at the same time, and two fleas cannot be in the same segment. After some jumps, the fleas are back in the segments $1,2,3,4,5$, but possibly in some other order than they started. Which orders are possible ?

Planes $ \pi _1$ and $ \pi _2$ in Euclidean space $ \mathbb{R} ^3$ partition $ S\equal{}\mathbb{R} ^3 \setminus (\pi _1 \cup \pi _2)$ into several components. Show that for any cube in $ \mathbb{R} ^3$, at least one of the components of $ S$ meets at least three faces of the cube.

Can one paint four points in the plane red and another four points black so that any three points of the same colour are vertices of a parallelogram whose fourth vertex is a point of the other colour? (NB Vassiliev)

There are $2024$ cities in a country, every two of which are bidirectionally connected by exactly one of three modes of transportation - rail, air, or road. A tourist has arrived in this country and has the entire transportation scheme. He chooses a travel ticket for one of the modes of transportation and the city from which he starts his trip. He wants to visit as many cities as possible, but using only the ticket for the specified type of transportation. What is the largest $k$ for which the tourist will always be able to visit at least $k$ cities? During the route, he can return to the cities he has already visited. [i]Proposed by Bogdan Rublov[/i]

Let $n\ge 3$ be a positive integer. Amy wrote all the integers from $1$ to $n^2$ on the $n\times n$ grid, so that each cell contains exactly one number. For $i=1,2,\cdots ,n^2-1$, the cell containing $i$ shares a common side with the cell containing $i+1$. Each turn, Bred can choose one cell, and check what number is written. Bred wants to know where $1$ is written by less than $3n$ turns. Determine whether $n$ such that Bred can always achieve his goal is infinite.

There are $6$ points on the plane such that no three of them are collinear. It's known that between every $4$ points of them, there exists a point that it's power with respect to the circle passing through the other three points is a constant value $k$.(Power of a point in the interior of a circle has a negative value.) Prove that $k=0$ and all $6$ points lie on a circle. [i]Proposed by Morteza Saghafian[/I]

In every cell of a table with $n$ rows and $m$ columns is written one of the letters $a$, $b$, $c$. Every two rows of the table have the same letter in at most $k\geq 0$ positions and every two columns coincide at most $k$ positions. Find $m$, $n$, $k$ if \[\frac{2mn+6k}{3(m+n)}\geq k+1\]

Given is an $n\times n$ board, with an integer written in each grid. For each move, I can choose any grid, and add $1$ to all $2n-1$ numbers in its row and column. Find the largest $N(n)$, such that for any initial choice of integers, I can make a finite number of moves so that there are at least $N(n)$ even numbers on the board.

What is the greatest number of rays in space beginning at one point and forming pairwise obtuse angles?

Find $k \in \mathbb{N}$ such that [b]a.)[/b] For any $n \in \mathbb{N}$, there does not exist $j \in \mathbb{Z}$ which satisfies the conditions $0 \leq j \leq n - k + 1$ and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots, \left( \begin{array}{c} n\\ j + k - 1\end{array} \right)$ forms an arithmetic progression. [b]b.)[/b] There exists $n \in \mathbb{N}$ such that there exists $j$ which satisfies $0 \leq j \leq n - k + 2$, and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots , \left( \begin{array}{c} n\\ j + k - 2\end{array} \right)$ forms an arithmetic progression. Find all $n$ which satisfies part [b]b.)[/b]

A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a row that get no mail on the same day. How many different patterns of mail delivery are possible?

Let $ABC$ be a triangle and $n$ a positive integer. Consider on the side $BC$ the points $A_1, A_2, ..., A_{2^n-1}$ that divide the side into $2^n$ equal parts, that is, $BA_1=A_1A_2=...=A_{2^n-2}A_{2^n-1}=A_{2^n-1}C$. Set the points $B_1, B_2, ..., B_{2^n-1}$ and $C_1, C_2, ..., C_{2^n-1}$ on the sides $CA$ and $AB$, respectively, analogously. Draw the line segments $AA_1, AA_2, ..., AA_{2^n-1}$, $BB_1, BB_2, ..., BB_{2^n-1}$ and $CC_1, CC_2, ..., CC_{2^n-1}$. Find, in terms of $n$, the number of regions into which the triangle is divided.

A rectangle $ABCD$ is given whose sides have lengths $3$ and $2n$, where $n$ is a natural number. Denote by $U(n)$ the number of ways in which one can cut the rectangle into rectangles of side lengths $1$ and $2$. $(a)$ Prove that \[U(n + 1)+U(n -1) = 4U(n);\] $(b)$ Prove that \[U(n) =\frac{1}{2\sqrt{3}}[(\sqrt{3} + 1)(2 +\sqrt{3})^n + (\sqrt{3} - 1)(2 -\sqrt{3})^n].\]

Red, blue, and green children are arranged in a circle. When a teacher asked the red children that have a green neighbor to raise their hands, $20$ children raised their hands. When she asked the blue children that have a green neighbor to raise their hands, $25$ children raised their hands. Prove that some child that raised her hand had two green neighbors.

Five teams participated in the commercial football tournament. Each had to play exactly one match with each other. Due to financial difficulties, the organizers canceled some games. In the end It turned out that all teams scored a different number of points and not a single team in the points column had a zero. What is the smallest number of games could be played in a tournament if three points were awarded for a win, for a draw - one, for a defeat - zero?

Given two positive integers $n$ and $k$, we say that $k$ is [i]$n$-ergetic[/i] if: However the elements of $M=\{1,2,\ldots, k\}$ are coloured in red and green, there exist $n$ not necessarily distinct integers of the same colour whose sum is again an element of $M$ of the same colour. For each positive integer $n$, determine the least $n$-ergetic integer, if it exists.

Nine pawns forming a $3$ by $3$ square are placed in the lower left hand corner of an $8$ by $8$ chessboard. Any pawn may jump over another one standing next to it into a free square, i .e. may be reflected symmetrically with respect to a neighb our's centre (jumps may be horizontal , vertical or diagonal) . It is required to rearrange the nine pawns in another corner of the chessboard (in another $3$ by $3$ square) by means of such jumps. Can the pawns be thus re-arranged in the (a) upper left hand corner? (b) upper right hand corner? (J . E . Briskin)

Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively. Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes. [i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]

Let $A_1A_2...A_{2010}$ be a regular $2010$-gon. Find the number of obtuse triangles whose vertices are among $A_1$, $A_2$,$ ...$, $A_{2010}$.

14 students attend the IMO training camp. Every student has at least $k$ favourite numbers. The organisers want to give each student a shirt with one of the student's favourite numbers on the back. Determine the least $k$, such that this is always possible if: $a)$ The students can be arranged in a circle such that every two students sitting next to one another have different numbers. $b)$ $7$ of the students are boys, the rest are girls, and there isn't a boy and a girl with the same number.

There are ten cards with the number $a$ on each, ten with $b$ and ten with $c$, where $a, b$ and $c$ are distinct real numbers. For every five cards, it is possible to add another five cards so that the sum of the numbers on these ten cards is $0$. Prove that one of $a, b$ and $c$ is $0$.

A cube consists of $4^3$ unit cubes each containing an integer. At each move, you choose a unit cube and increase by $1$ all the integers in the neighbouring cubes having a face in common with the chosen cube. Is it possible to reach a position where all the $4^3$ integers are divisible by $3,$ no matter what the starting position is?

Given a graph with $n \geq 4$ vertices. It is known that for any two of vertices there is a vertex connected with none of these two vertices. Find the greatest possible number of the edges in the graph.

Let there be given real numbers $x_i>1~(i=1,2,\ldots,2n)$. Prove that the interval $[0,2]$ contains at most $\binom{2n}n$ sums of the form $\alpha_1x_1+\ldots+\alpha_{2n}x_{2n}$, where $\alpha_i\in\{-1,1\}$ for all $i$.