Let $A_1A_2 \ldots A_n$ be a convex polygon. Point $P$ inside this polygon is chosen so that its projections $P_1, \ldots , P_n$ onto lines $A_1A_2, \ldots , A_nA_1$ respectively lie on the sides of the polygon. Prove that for arbitrary points $X_1, \ldots , X_n$ on sides $A_1A_2, \ldots , A_nA_1$ respectively, \[\max \left\{ \frac{X_1X_2}{P_1P_2}, \ldots, \frac{X_nX_1}{P_nP_1} \right\} \geq 1.\] [i]Proposed by Nairi Sedrakyan, Armenia[/i]

Let $k,m,n$ be positive integers such that $k > n > 1$ and $(k,n) = 1$. If $k-n | k^m - n^{m-1}$, prove that $k \le 2n - 1$.

Let $ \mathcal{H} \equal{} A_1A_2\ldots A_n$ be a convex $ n$-gon. For $ i \equal{} 1, 2, \ldots, n$, let $ A'_{i}$ be the point symmetric to $ A_i$ with respect to the midpoint of $ A_{i \minus{} 1}A_{i \plus{} 1}$ (where $ A_{n \plus{} 1} \equal{} A_1$). We say that the vertex $ A_i$ is [i]good[/i] if $ A'_{i}$ lies inside $ \mathcal{H}$. Show that at least $ n \minus{} 3$ vertices of $ \mathcal{H}$ are [i]good[/i].

A right-angled triangle has property that, when a square is drawn externally on each side of the triangle, the six vertices of the squares that are not vertices of the triangle are concyclic. Assume that the area of the triangle is $9$ cm$^2$. Determine the length of sides of the triangle.

In an acute triangle $ABC$ the points $D,E$ and $F$ are the feet of the altitudes through $A,B$ and $C$ respectively. The incenters of the triangles $AEF$ and $BDF$ are $I_1$ and $I_2$ respectively; the circumcenters of the triangles $ACI_1$ and $BCI_2$ are $O_1$ and $O_2$ respectively. Prove that $I_1I_2$ and $O_1O_2$ are parallel.

Let $a$, $b$, $c$ be positive real numbers such that $\min(ab,bc,ca) \ge 1$. Prove that $$\sqrt[3]{(a^2+1)(b^2+1)(c^2+1)} \le \left(\frac{a+b+c}{3}\right)^2 + 1.$$ [i]Proposed by Tigran Margaryan, Armenia[/i]

Let $b$, $c$ be integers and $f(x) = x^2 + bx + c$ be a trinomial. Prove, that if for integers $k_1$, $k_2$ and $k_3$ values of $f(k_1)$, $f(k_2)$ and $f(k_3)$ are divisible by integer $n \neq 0$, then product $(k_1 - k_2)(k_2 - k_3)(k_3 - k_1)$ is divisible by $n$ too.

Let set $S$ contain all positive integers that are one less than a perfect square. Find the sum of all powers of $2$ that can be expressed as the product of two (not necessarily distinct) members of $S.$ [i]Proposed by Alex Li[/i]

The numbers $ 1, 2,\ldots, 50 $ are written on a blackboard. Each minute any two numbers are erased and their positive difference is written instead. At the end one number remains. Which values can take this number?

Let $ABCDE$ be a convex pentagon such that $BC \parallel AE,$ $AB = BC + AE,$ and $\angle ABC = \angle CDE.$ Let $M$ be the midpoint of $CE,$ and let $O$ be the circumcenter of triangle $BCD.$ Given that $\angle DMO = 90^{\circ},$ prove that $2 \angle BDA = \angle CDE.$ [i]Proposed by Nazar Serdyuk, Ukraine[/i]

[i]The following problem is open in the sense that the answer to part (b) is not currently known. A proof of part (a) will be awarded 5 points. Up to 7 additional points may be awarded for progress on part (b).[/i] Let $p(x)$ be a polynomial of degree $d$ with coefficients belonging to the set of rational numbers $\mathbb{Q}$. Suppose that, for each $1 \le k \le d-1$, $p(x)$ and its $k$th derivative $p^{(k)}(x)$ have a common root in $\mathbb{Q}$; that is, there exists $r_k \in \mathbb{Q}$ such that $p(r_k) = p^{(k)}(r_k) = 0$. (a) Prove that if $d$ is prime then there exist constants $a, b, c \in \mathbb{Q}$ such that \[ p(x) = c(ax + b)^d. \] (b) For which integers $d \ge 2$ does the conclusion of part (a) hold?

Given a triangle $ABC$ with circumcircle $\Gamma$. Points $E$ and $F$ are the foot of angle bisectors of $B$ and $C$, $I$ is incenter and $K$ is the intersection of $AI$ and $EF$. Suppose that $T$ be the midpoint of arc $BAC$. Circle $\Gamma$ intersects the $A$-median and circumcircle of $AEF$ for the second time at $X$ and $S$. Let $S'$ be the reflection of $S$ across $AI$ and $J$ be the second intersection of circumcircle of $AS'K$ and $AX$. Prove that quadrilateral $TJIX$ is cyclic. [i]Proposed by Alireza Dadgarnia and Amir Parsa Hosseini[/i]

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]

Find all positive integers $n$ such that there exists positive integers $a, b, m$ satisfying$$\left( a+b\sqrt{n}\right)^{2023}=\sqrt{m}+\sqrt{m+2022}.$$

(a) Let $a_1,a_2,...$ be a sequenceof reals with $a_1=1$ and $a_{n+1}>\frac32 a_n$ for all $n$. Prove that $\lim_{n\rightarrow\infty}\frac{a_n}{\left(\frac32\right)^{n-1}}$ exists. (finite or infinite) (b) Prove that for all $\alpha>1$ there is a sequence $a_1,a_2,...$ with the same properties such that $\lim_{n\rightarrow\infty}\frac{a_n}{\left(\frac32\right)^{n-1}}=\alpha$

A man makes a trip by automobile at an average speed of $ 50$ mph. He returns over the same route at an average speed of $ 45$ mph. His average speed for the entire trip is: $ \textbf{(A)}\ 47\frac{7}{19}\qquad \textbf{(B)}\ 47\frac{1}{4}\qquad \textbf{(C)}\ 47\frac{1}{2}\qquad \textbf{(D)}\ 47\frac{11}{19}\qquad \textbf{(E)}\ \text{none of these}$

Olja writes down $n$ positive integers $a_1, a_2, \ldots, a_n$ smaller than $p_n$ where $p_n$ denotes the $n$-th prime number. Oleg can choose two (not necessarily different) numbers $x$ and $y$ and replace one of them with their product $xy$. If there are two equal numbers Oleg wins. Can Oleg guarantee a win? [i]Proposed by Matko Ljulj.[/i]

$8$ ants are placed on the edges of the unit cube. Prove that there exists a pair of ants at a distance not exceeding $1$.

$ABC$ is a triangle with sides $1$, $2$ and $\sqrt3$. Determine the smallest possible area of an equilateral triangle with a vertex on each side of triangle $ABC$.

Find the maximum possible number of edges of a simple graph with $8$ vertices and without any quadrilateral. (a simple graph is an undirected graph that has no loops (edges connected at both ends to the same vertex) and no more than one edge between any two different vertices.)

Let $X$ be the interior point of triangle $ABC$. prove that the product of the distances of point $ X $ from the vertices $ A, B, C $ is at least eight times greater than the product of the distances of this point from the lines $ AB, BC, CA $.

Let $N$ be a positive integer. Prove that there exist three permutations $a_1,\dots,a_N$, $b_1,\dots,b_N$, and $c_1,\dots,c_N$ of $1,\dots,N$ such that \[\left|\sqrt{a_k}+\sqrt{b_k}+\sqrt{c_k}-2\sqrt{N}\right|<2023\] for every $k=1,2,\dots,N$.

$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 ?

Sandwiches at Joe's Fast Food cost $ \$3$ each and sodas cost $ \$2$ each. How many dollars will it cost to purchase 5 sandwiches and 8 sodas? $ \textbf{(A) } 31\qquad \textbf{(B) } 32\qquad \textbf{(C) } 33\qquad \textbf{(D) } 34\qquad \textbf{(E) } 35$

Consider a $ n \times n$ checkerboard with $ n > 1, n \in \mathbb{N}.$ How many possibilities are there to put $ 2n \minus{} 2$ identical pebbles on the checkerboard (each on a different field/place) such that no two pebbles are on the same checkerboard diagonal. Two pebbles are on the same checkerboard diagonal if the connection segment of the midpoints of the respective fields are parallel to one of the diagonals of the $ n \times n$ square.