Define a domino to be a $1\times 2$ rectangular block. A $2023\times 2023$ square grid is filled with non-overlapping dominoes, leaving a single $1\times 1$ gap. John then repeatedly slides dominoes into the gap; each domino is moved at most once. What is the maximum number of times that John could have moved a domino? (Example: In the $3\times 3$ grid shown below, John could move 2 dominoes: $D$, followed by $A$.) [asy] unitsize(18); draw((0,0)--(3,0)--(3,3)--(0,3)--(0,0)--cycle); draw((0,1)--(3,1)); draw((2,0)--(2,3)); draw((1,1)--(1,3)); label("A",(0.5,2)); label("B",(1.5,2)); label("C",(2.5,2)); label("D",(1,0.5)); [/asy]

An Emperor invited $2015$ wizards to a festival. Each of the wizards knows who of them is good and who is evil, however the Emperor doesn’t know this. A good wizard always tells the truth, while an evil wizard can tell the truth or lie at any moment. The Emperor gives each wizard a card with a single question, maybe different for different wizards, and after that listens to the answers of all wizards which are either “yes” or “no”. Having listened to all the answers, the Emperor expels a single wizard through a magic door which shows if this wizard is good or evil. Then the Emperor makes new cards with questions and repeats the procedure with the remaining wizards, and so on. The Emperor may stop at any moment, and after this the Emperor may expel or not expel a wizard. Prove that the Emperor can expel all the evil wizards having expelled at most one good wizard. [i]($10$ points)[/i]

The leader of an IMO team chooses positive integers $n$ and $k$ with $n > k$, and announces them to the deputy leader and a contestant. The leader then secretly tells the deputy leader an $n$-digit binary string, and the deputy leader writes down all $n$-digit binary strings which differ from the leader’s in exactly $k$ positions. (For example, if $n = 3$ and $k = 1$, and if the leader chooses $101$, the deputy leader would write down $001, 111$ and $100$.) The contestant is allowed to look at the strings written by the deputy leader and guess the leader’s string. What is the minimum number of guesses (in terms of $n$ and $k$) needed to guarantee the correct answer?

Three players Alexander, Beverley and Catherine participate in a tournament (all of them play the same number of games with each other). Is it possible that Alexander gets more points than the others, Catherine gets less points than the others, but Alexander has a smaller number of wins than the others and Catherine has a greater number of wins than the others? (A win scores $1$ point, a draw scores $\frac12$.) (A Rubin,)

Twelve cards lie in a row. The cards are of three kinds: with both sides white, both sides black, or with a white and a black side. Initially, nine of the twelve cards have a black side up. The cards $1-6$ are turned, and subsequently four of the twelve cards have a black side up. Now cards $4-9$ are turned, and six cards have a black side up. Finally, the cards $1-3$ and $10-12$ are turned, after which five cards have a black side up. How many cards of each kind were there?

The $\underline{\text{path number}}$ of a graph is the minimum number of paths we need to partition the vertices of a graph. Given a connected graph with the independence number $k > 1$, what is the maximum possible value for the path number in this graph? Find the answer in terms of $k$. The independence number of a graph $\textbf{G}$ is the maximum possible number $k$, such that there exist $k$ pairwise non-adjacent vertices in $\textbf{G}$.

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

A hilly island has $2023$ lookouts. It is known that each of them is in line of sight with at least $42$ of the other lookouts. For any two distinct lookouts $X$ and $Y$ there is a positive integer $n$ and lookouts $A_1,A_2,\dots,A_{n+1}$ such that $A_1=X$ and $A_{n+1}=Y$ and $A_1$ is in line of sight with $A_2$, $A_2$ with $A_3$, $\dots$ and $A_n$ with $A_{n+1}$. The smallest such number $n$ is called the [i]viewing distance[/i] of $X$ and $Y$. Determine the largest possible viewing distance that can exist between two lookouts under these conditions.

[b]p1.[/b] What is the maximum number of points of intersection between a square and a triangle, assuming that no side of the triangle is parallel to any side of the square? [b]p2.[/b] Two angles of an isosceles triangle measure $80^o$ and $x^o$. What is the sum of all the possible values of $x$? [b]p3.[/b] Let $p$ and $q$ be prime numbers such that $p + q$ and p + $7q$ are both perfect squares. Find the value of $pq$. [b]p4.[/b] Anna, Betty, Carly, and Danielle are four pit bulls, each of which is either wearing or not wearing lipstick. The following three facts are true: (1) Anna is wearing lipstick if Betty is wearing lipstick. (2) Betty is wearing lipstick only if Carly is also wearing lipstick. (3) Carly is wearing lipstick if and only if Danielle is wearing lipstick The following five statements are each assigned a certain number of points: (a) Danielle is wearing lipstick if and only if Carly is wearing lipstick. (This statement is assigned $1$ point.) (b) If Anna is wearing lipstick, then Betty is wearing lipstick. (This statement is assigned $6$ points.) (c) If Betty is wearing lipstick, then both Anna and Danielle must be wearing lipstick. (This statement is assigned $10$ points.) (d) If Danielle is wearing lipstick, then Anna is wearing lipstick. (This statement is assigned $12$ points.) (e) If Betty is wearing lipstick, then Danielle is wearing lipstick. (This statement is assigned $14$ points.) What is the sum of the points assigned to the statements that must be true? (For example, if only statements (a) and (d) are true, then the answer would be $1 + 12 = 13$.) [b]p5.[/b] Let $f(x)$ and $g(x)$ be functions such that $f(x) = 4x + 3$ and $g(x) = \frac{x + 1}{4}$. Evaluate $g(f(g(f(42))))$. [b]p6.[/b] Let $A,B,C$, and $D$ be consecutive vertices of a regular polygon. If $\angle ACD = 120^o$, how many sides does the polygon have? [b]p7.[/b] Fred and George have a fair $8$-sided die with the numbers $0, 1, 2, 9, 2, 0, 1, 1$ written on the sides. If Fred and George each roll the die once, what is the probability that Fred rolls a larger number than George? [b]p8.[/b] Find the smallest positive integer $t$ such that $(23t)^3 - (20t)^3 - (3t)^3$ is a perfect square. [b]p9.[/b] In triangle $ABC$, $AC = 8$ and $AC < AB$. Point $D$ lies on side BC with $\angle BAD = \angle CAD$. Let $M$ be the midpoint of $BC$. The line passing through $M$ parallel to $AD$ intersects lines $AB$ and $AC$ at $F$ and $E$, respectively. If $EF =\sqrt2$ and $AF = 1$, what is the length of segment $BC$? (See the following diagram.) [img]https://cdn.artofproblemsolving.com/attachments/2/3/4b5dd0ae28b09f5289fb0e6c72c7cbf421d025.png[/img] [b]p10.[/b] There are $2011$ evenly spaced points marked on a circular table. Three segments are randomly drawn between pairs of these points such that no two segments share an endpoint on the circle. What is the probability that each of these segments intersects the other two? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $G$ be a planar graph all of whose vertices are of degree $4$. Vasya and Petya walk along its edges. The first time each of them goes as he pleases, and then each of them goes straight (from the three roads they have to choose the middle one). As the result, each vertex was visited by exactly one of them and exactly once. Prove that this graph has an even number of vertices.

Suppose that a point in the plane is called [i]good[/i] if it has rational coordinates. Prove that all good points can be divided into three sets satisfying: 1) If the centre of the circle is good, then there are three points in the circle from each of the three sets. 2) There are no three collinear points that are from each of the three sets.

Let $n\ge 3$ be an integer and $a_1,a_2,\dots ,a_n$ be a finite sequence of positive integers, such that, for $k=2,3,\dots ,n$ $$n(a_k+1)-(n-1)a_{k-1}=1.$$ Prove that $a_n$ is not divisible by $(n-1)^2$.

Let $ p\ge 2 $ be a natural number that divides $ \binom{p}{k} , $ for any natural number $ k $ smaller than $ p. $ Prove that: [b]a)[/b] $ p $ is prime. [b]b)[/b] $ p^2 $ divides $ -2+\binom{2p}{p} . $

Five persons of different heights stand next to the another on numbered booths to take a picture. From how many ways can be arranged so that people in positions $ 1$ and $3$ are both taller than the person in the position $2$?

Every point in the plane is coloured one of seven distinct colours. Is there an inscribed trapezoid whose vertices are all of the same colour?

There are $ 2016 $ positions marked around a circle, with a token on one of them. A legitimate move is to move the token either 1 position or 4 positions from its location, clockwise. The restriction is that the token can not occupy the same position more than once. Players $ A $ and $ B $ take turns making moves. Player $ A $ has the first move. The first player who cannot make a legitimate move loses. Determine which of the two players has a winning strategy.

$n$ balls are placed independently uniformly at random into $n$ boxes. One box is selected at random, and is found to contain $b$ balls. Let $e_n$ be the expected value of $b^4$. Find $$\lim_{n \to \infty}e_n.$$

Call a set of some cells in infinite chess field as board. Set of rooks on the board call as awesome if no one rook can beat another, but every empty cell is under rook attack. There are awesome set with $2008$ rooks and with $2010$ rooks. Prove, that there are awesome set with $2009$ rooks.

Given two positive integers $m$ and $n$, find the largest $k$ in terms of $m$ and $n$ such that the following condition holds: Any tree graph $G$ with $k$ vertices has two (possibly equal) vertices $u$ and $v$ such that for any other vertex $w$ in $G$, either there is a path of length at most $m$ from $u$ to $w$, or there is a path of length at most $n$ from $v$ to $w$. [i]Proposed by Ivan Chan Kai Chin[/i]

We are given a fixed point on the circle of radius $1$, and going from this point along the circumference in the positive direction on curved distances $0, 1, 2, \ldots $ from it we obtain points with abscisas $n = 0, 1, 2, .\ldots$ respectively. How many points among them should we take to ensure that some two of them are less than the distance $\frac 15$ apart ?

A number is written in each cell of the $N \times N$ square. Let's call cell $C$ [i]good[/i] if in one of the cells adjacent to $C$ on the side, there is a number $1$ more than in $C$, and in some other of the cells adjacent to $C$ on the side, there is a number $3$ more than in $C$. What is the largest possible number of good cells? [i] Proposed by A. Chebotarev [/i]

Let $n$ be a positive integer. In an $n \times n$ board, two opposite sides have been joined, forming a cylinder. Determine whether it is possible to place $n$ queens on the board such that no two threaten each other when: $a)\:$ $n=14$. $b)\:$ $n=15$.

Let $n \geq 2$ be a natural. Define $$X = \{ (a_1,a_2,\cdots,a_n) | a_k \in \{0,1,2,\cdots,k\}, k = 1,2,\cdots,n \}$$. For any two elements $s = (s_1,s_2,\cdots,s_n) \in X, t = (t_1,t_2,\cdots,t_n) \in X$, define $$s \vee t = (\max \{s_1,t_1\},\max \{s_2,t_2\}, \cdots , \max \{s_n,t_n\} )$$ $$s \wedge t = (\min \{s_1,t_1 \}, \min \{s_2,t_2,\}, \cdots, \min \{s_n,t_n\})$$ Find the largest possible size of a proper subset $A$ of $X$ such that for any $s,t \in A$, one has $s \vee t \in A, s \wedge t \in A$.

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.

Let $p{}$ and $q{}$ be two coprime positive integers. A frog hops along the integer line so that on every hop it moves either $p{}$ units to the right or $q{}$ units to the left. Eventually, the frog returns to the initial point. Prove that for every positive integer $d{}$ with $d < p + q$ there are two numbers visited by the frog which differ just by $d{}$. [i]Nikolay Belukhov[/i]