On a $1\times n$ board there are $n-1$ separating edges between neighbouring cells. Initially, none of the edges contain matches. During a move of size $0 < k < n$ a player chooses a $1\times k$ sub-board which contains no matches inside, and places a matchstick on all of the separating edges bordering the sub-board that don’t already have one. A move is considered legal if at least one matchstick can be placed and if either $k = 1$ or $k{}$ is divisible by 4. Two players take turns making moves, the player in turn must choose one of the available legal moves of the largest size $0 < k < n$ and play it. If someone does not have a legal move, the game ends and that player loses. [i]Beat the organisers twice in a row in this game! First the organisers determine the value of $n{}$, then you get to choose whether you want to play as the first or the second player.[/i]

In a triangle $ ABC$ right-angled at $ C$ , the median through $ B$ bisects the angle between $ BA$ and the bisector of $ \angle B$. Prove that \[ \frac{5}{2} < \frac{AB}{BC} < 3\]

Given that in the diagram shown, $\angle ACB = 65^o$, $\angle BAC = 50^o$, $\angle BDC = 25^o$, $AB = 5$, and $AE = 1$, determine the value of $BE \cdot DE$. [img]https://cdn.artofproblemsolving.com/attachments/1/2/130fcce1b383bc0dd005f61852d76e43956d4c.jpg[/img]

Given a $15\times 15$ chessboard. We draw a closed broken line without self-intersections such that every edge of the broken line is a segment joining the centers of two adjacent cells of the chessboard. If this broken line is symmetric with respect to a diagonal of the chessboard, then show that the length of the broken line is $\leq 200$.

The numbers $1, 2,..., 2023$ are written on the board in this order. We can repeatedly perform the following operation with them: We select any odd number of consecutively written numbers and write these numbers in reverse order. How many different orders of these $2023$ numbers can we get? [i]Example[/i]: If we start with only the numbers $1, 2, 3, 4, 5, 6$, we can perform the following steps $$1, 2, 3, 4, 5, 6 \to 3, 2, 1,4, 5, 6 \to 3, 6, 5, 4, 1, 2 \to 3, 6, 1, 4, 5, 2 \to ...$$

Given a rectangle $ABCD$, side $AB$ is longer than side $BC$. Find all the points $P$ of the side line $AB$ from which the sides $AD$ and $DC$ are seen from the point $P$ at an equal angle (i.e. $\angle APD = \angle DPC$)

From a point $P$ exterior of circle $\odot O$, we draw tangents $PA$, $PB$ and the secant $PCD$ . The line passing through point $C$ parallel to $PA$ intersects chords $AB$, $AD$ at points $E$, $F$ respectively. Prove that $CE = EF$. [img]https://cdn.artofproblemsolving.com/attachments/8/c/bf15595bc341b917df30b3aa93067887317c65.png[/img]

Three planets revolve about a star in coplanar circular orbits with the star at the center. All planets revolve in the same direction, each at a constant speed, and the periods of their orbits are 60, 84, and 140 years. The positions of the star and all three planets are currently collinear. They will next be collinear after $n$ years. Find $n$.

A sequence $(a_n)_{n\ge 1}$ of integers is defined by the recurrence \[a_1=1,\ a_2=5,\ a_n=\frac{a_{n-1}^2+4}{a_{n-2}}\ \text{for}\ n\ge 2.\] Prove that all terms of the sequence are integers and find an explicit formula for $a_n$.

Let $S$ be the set of points inside and on the boarder of a regular haxagon with side length 1. Find the least constant $r$, such that there exists one way to colour all the points in $S$ with three colous so that the distance between any two points with same colour is less than $r$.

Define a boomerang as a quadrilateral whose opposite sides do not intersect and one of whose internal angles is greater than $180^{\circ}$. Let $C$ be a convex polygon with $s$ sides. The interior region of $C$ is the union of $q$ quadrilaterals, none of whose interiors overlap each other. $b$ of these quadrilaterals are boomerangs. Show that $q\ge b+\frac{s-2}{2}$.

Let $p$ be a prime number. Prove that it is possible to choose a permutation $a_1, a_2,...,a_p$ of $1,2,...,p$ such that the numbers $a_1, a_1a_2, a_1a_2a_3,..., a_1a_2a_3...a_p$ all have different remainder upon division by $p$.

On a line $p$ which does not meet a circle $K$ with center $O$, point $P$ is taken such that $OP \perp p$. Let $X \ne P$ be an arbitrary point on $p$. The tangents from $X$ to $K$ touch it at $A$ and $B$. Denote by $C$ and $D$ the orthogonal projections of $P$ on $AX$ and $BX$ respectively. (a) Prove that the intersection point $Y$ of $AB$ and $OP$ is independent of the location of $X$. (b) Lines $CD$ and $OP$ meet at $Z$. Prove that $Z$ is the midpoint of $P$.

Consider a sequence of 100 positive integers. Each member of the sequence, starting from the second one, is derived by either multiplying the previous number by 2 or dividing it by 16. Is it possible for the sum of these 100 numbers to be equal to $2^{2023}$? [i]Proposed by Nika Glunchadze, Georgia[/i]

There are four circles $k_1 , k_2 , k_3$ and $k_4$ of equal radius inside the triangle $ABC$. The circle $k_1$ touches the sides $AB, CA$ and the circle $k_4 $, $k_2$ touches the sides $AB,BC$ and $k_4$, and $k_3$ touches the sides $AC, BC$ and $k_4.$ Prove that the center of $k_4$ lies on the line connecting the incenter and circumcenter of $ABC.$

Calculate $$\sum_{n=1}^{1989}\frac{1}{\sqrt{n+\sqrt{n^2-1}}}$$

Let $n$ be a positive integer, and let $S_n = \{1, 2, \ldots, n\}$. For a permutation $\sigma$ of $S_n$ and an integer $a \in S_n$, let $d(a)$ be the least positive integer $d$ for which \[\underbrace{\sigma(\sigma(\ldots \sigma(a) \ldots))}_{d \text{ applications of } \sigma} = a\](or $-1$ if no such integer exists). Compute the value of $n$ for which there exists a permutation $\sigma$ of $S_n$ satisfying the equations \[\begin{aligned} d(1) + d(2) + \ldots + d(n) &= 2017, \\ \frac{1}{d(1)} + \frac{1}{d(2)} + \ldots + \frac{1}{d(n)} &= 2. \end{aligned}\] [i]Proposed by Michael Tang[/i]

A and B are friends at a summer school. When B asks A for his address, he answers: "My house is on XYZ street, and my house number is a 3-digit number with distinct digits, and if you permute its digits, you will have other 5 numbers. The interesting thing is that the sum of these 5 numbers is exactly 2017. That's all.". After a while, B can determine A's house number. And you, can you find his house number?

Let $ABC$ be an acute triangle, and $AA_1$, $BB_1$, and $CC_1$ its altitudes. Let $A_2$ be a point on segment $AA_1$ such that $\angle{BA_2C} = 90^{\circ}$. The points $B_2$ and $C_2$ are defined similarly. Let $A_3$ be the intersection point of segments $B_2C$ and $BC_2$. The points $B_3$ and $C_3$ are defined similarly. Prove that the segments $A_2A_3$, $B_2B_3$, and $C_2C_3$ are concurrent.

In the set of integers solve the equation $\frac{1}{x}+\frac{1}{y}=\frac{1}{p}$, where $p$ is a prime number.

Ken has a six sided die. He rolls the die, and if the result is not even, he rolls the die one more time. Find the probability that he ends up with an even number. [i]Proposed by Gabriel Wu[/i]

Solve in $ \mathbb{Z} $ the following system of equations: $$ \left\{\begin{matrix} 5^x-\log_2 (y+3) = 3^y\\ 5^y -\log_2 (x+3)=3^x\end{matrix}\right. . $$

There are $2010$ cities in country, and every two are connected by road. Businessman and Road Ministry play next game. Every morning Businessman buys one road and every evening Ministry destroys 10 free roads. Can Business create cyclic route without self-intersections through exactly $11$ different cities?

Let $a, b$ and $c$ be positive real numbers such that $a + b + c = 3$. Prove that $$a^a + b^b + c^c \ge 3$$

The nation of CMIMCland consists of 8 islands, none of which are connected. Each citizen wants to visit the other islands, so the government will build bridges between the islands. However, each island has a volcano that could erupt at any time, destroying that island and any bridges connected to it. The government wants to guarantee that after any eruption, a citizen from any of the remaining $7$ islands can go on a tour, visiting each of the remaining islands exactly once and returning to their home island (only at the end of the tour). What is the minimum number of bridges needed?