Prove that if non-zero complex numbers $\alpha_1,\alpha_2,\alpha_3$ are distinct and noncollinear on the plane, and satisfy $\alpha_1+\alpha_2+\alpha_3=0$, then there holds \[\sum_{i=1}^{3}\left(\frac{|\alpha_{i+1}-\alpha_{i+2}|}{\sqrt{|\alpha_i|}}\left(\frac{1}{\sqrt{|\alpha_{i+1}|}}+\frac{1}{\sqrt{|\alpha_{i+2}|}}-\frac{2}{\sqrt{|\alpha_{i}|}}\right)\right)\leq 0......(*)\]where $\alpha_4=\alpha_1, \alpha_5=\alpha_2$. Verify further the sufficient and necessary condition for the equality holding in $(*)$.

The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$. Proposed by Croatia

Let $ABCD$ be a convex quadrilateral with pairwise distinct side lengths such that $AC\perp BD$. Let $O_1,O_2$ be the circumcenters of $\Delta ABD, \Delta CBD$, respectively. Show that $AO_2, CO_1$, the Euler line of $\Delta ABC$ and the Euler line of $\Delta ADC$ are concurrent. (Remark: The Euler line of a triangle is the line on which its circumcenter, centroid, and orthocenter lie.) Proposed by usjl

Let $S$ be a set of positive integers such that for every $a,b\in S$, there always exists $c\in S$ such that $c^2$ divides $a(a+b)$. Show that there exists an $a\in S$ such that $a$ divides every element of $S$. Proposed by usjl

Version 1. Let $n$ be a positive integer, and set $N=2^{n}$. Determine the smallest real number $a_{n}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant a_{n}(x-1)^{2}+x . \]Version 2. For every positive integer $N$, determine the smallest real number $b_{N}$ such that, for all real $x$, \[ \sqrt[N]{\frac{x^{2 N}+1}{2}} \leqslant b_{N}(x-1)^{2}+x . \]

Consider any rectangular table having finitely many rows and columns, with a real number $a(r, c)$ in the cell in row $r$ and column $c$. A pair $(R, C)$, where $R$ is a set of rows and $C$ a set of columns, is called a saddle pair if the following two conditions are satisfied: $(i)$ For each row $r^{\prime}$, there is $r \in R$ such that $a(r, c) \geqslant a\left(r^{\prime}, c\right)$ for all $c \in C$; $(ii)$ For each column $c^{\prime}$, there is $c \in C$ such that $a(r, c) \leqslant a\left(r, c^{\prime}\right)$ for all $r \in R$. A saddle pair $(R, C)$ is called a minimal pair if for each saddle pair $\left(R^{\prime}, C^{\prime}\right)$ with $R^{\prime} \subseteq R$ and $C^{\prime} \subseteq C$, we have $R^{\prime}=R$ and $C^{\prime}=C$. Prove that any two minimal pairs contain the same number of rows.

Let $ABC$ be a triangle with circumcircle $\Gamma$, and points $E$ and $F$ are chosen from sides $CA$, $AB$, respectively. Let the circumcircle of triangle $AEF$ and $\Gamma$ intersect again at point $X$. Let the circumcircles of triangle $ABE$ and $ACF$ intersect again at point $K$. Line $AK$ intersect with $\Gamma$ again at point $M$ other than $A$, and $N$ be the reflection point of $M$ with respect to line $BC$. Let $XN$ intersect with $\Gamma$ again at point $S$ other that $X$. Prove that $SM$ is parallel to $BC$. Proposed by Ming Hsiao

For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a p-sequence, if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ United Kingdom

In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color.

Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.

Let $ABC$ be a scalene triangle, and points $O$ and $H$ be its circumcenter and orthocenter, respectively. Point $P$ lies inside triangle $AHO$ and satisfies $\angle AHP = \angle POA$. Let $M$ be the midpoint of segment $\overline{OP}$. Suppose that $BM$ and $CM$ intersect with the circumcircle of triangle $ABC$ again at $X$ and $Y$, respectively. Prove that line $XY$ passes through the circumcenter of triangle $APO$. Proposed by Li4

Let $ABC$ be an isosceles triangle with $BC=CA$, and let $D$ be a point inside side $AB$ such that $AD< DB$. Let $P$ and $Q$ be two points inside sides $BC$ and $CA$, respectively, such that $\angle DPB = \angle DQA = 90^{\circ}$. Let the perpendicular bisector of $PQ$ meet line segment $CQ$ at $E$, and let the circumcircles of triangles $ABC$ and $CPQ$ meet again at point $F$, different from $C$. Suppose that $P$, $E$, $F$ are collinear. Prove that $\angle ACB = 90^{\circ}$.

Let $\|x\|_*=(|x|+|x-1|-1)/2$. Find all $f:\mathbb{N}\to\mathbb{N}$ such that \[f^{(\|f(x)-x\|_*)}(x)=x, \quad\forall x\in\mathbb{N}.\]Here $f^{(0)}(x)=x$ and $f^{(n)}(x)=f(f^{(n-1)}(x))$ for all $n\in\mathbb{N}$. Proposed by usjl

Let $k\leq n$ be two positive integers. IMO-nation has $n$ villages, some of which are connected by a road. For any two villages, the distance between them is the minimum number of toads that one needs to travel from one of the villages to the other, if the traveling is impossible, then the distance is set as infinite. Alice, who just arrived IMO-nation, is doing her quarantine in some place, so she does not know the configuration of roads, but she knows $n$ and $k$. She wants to know whether the furthest two villages have finite distance. To do so, for every phone call she dials to the IMO office, she can choose two villages, and ask the office whether the distance between them is larger than, equal to, or smaller than $k$. The office answers faithfully (infinite distance is larger than $k$). Prove that Alice can know whether the furthest two villages have finite distance between them in at most $2n^2/k$ calls. Proposed by usjl and Cheng-Ying Chang