Given positive integers $a_1,a_2,\ldots, a_n$ with $a_1<a_2<\cdots<a_n)$, and a positive real $k$ with $k\geq 1$. Prove that \[\sum_{i=1}^{n}a_i^{2k+1}\geq \left(\sum_{i=1}^{n}a_i^k\right)^2.\]

Let $ABC$ be a triangle with circumcircle $\Omega$, circumcenter $O$ and orthocenter $H$. Let $S$ lie on $\Omega$ and $P$ lie on $BC$ such that $\angle ASP=90^\circ$, line $SH$ intersects the circumcircle of $\triangle APS$ at $X\neq S$. Suppose $OP$ intersects $CA,AB$ at $Q,R$, respectively, $QY,RZ$ are the altitude of $\triangle AQR$. Prove that $X,Y,Z$ are collinear. Proposed by Shuang-Yen Lee

Let $A,B,C$ be the midpoints of the three sides $B'C', C'A', A'B'$ of the triangle $A'B'C'$ respectively. Let $P$ be a point inside $\Delta ABC$, and $AP,BP,CP$ intersect with $BC, CA, AB$ at $P_a,P_b,P_c$, respectively. Lines $P_aP_b, P_aP_c$ intersect with $B'C'$ at $R_b, R_c$ respectively, lines $P_bP_c, P_bP_a$ intersect with $C'A'$ at $S_c, S_a$ respectively. and lines $P_cP_a, P_cP_b$ intersect with $A'B'$ at $T_a, T_b$, respectively. Given that $S_c,S_a, T_a, T_b$ are all on a circle centered at $O$. Show that $OR_b=OR_c$.

Find all functions $ f: \mathbb{Z} \to \mathbb{Z} $ such that $$ f\left(x+f\left(y\right)\right)f\left(y+f\left(x\right)\right)=\left(2x+f\left(y-x\right)\right)\left(2y+f\left(x-y\right)\right) $$holds for all integers $ x,y $

Given a square-free positive integer $n$. Show that there do not exist coprime positive integers $x,y$ such that $x^n+y^n$ is a multiple of $(x+y)^3$.

Let $n > 1$ be a given integer. An $n \times n \times n$ cube is composed of $n^3$ unit cubes. Each unit cube is painted with one colour. For each $n \times n \times 1$ box consisting of $n^2$ unit cubes (in any of the three possible orientations), we consider the set of colours present in that box (each colour is listed only once). This way, we get $3n$ sets of colours, split into three groups according to the orientation. It happens that for every set in any group, the same set appears in both of the other groups. Determine, in terms of $n$, the maximal possible number of colours that are present.

Given a triangle $ABC$ and a point $O$ on a plane. Let $\Gamma$ be the circumcircle of $ABC$. Suppose that $CO$ intersects with $AB$ at $D$, and $BO$ and $CA$ intersect at $E$. Moreover, suppose that $AO$ intersects with $\Gamma$ at $A,F$. Let $I$ be the other intersection of $\Gamma$ and the circumcircle of $ADE$, and $Y$ be the other intersection of $BE$ and the circumcircle of $CEI$, and $Z$ be the other intersection of $CD$ and the circumcircle of $BDI$. Let $T$ be the intersection of the two tangents of $\Gamma$ at $B,C$, respectively. Lastly, suppose that $TF$ intersects with $\Gamma$ again at $U$, and the reflection of $U$ w.r.t. $BC$ is $G$. Show that $F,I,G,O,Y,Z$ are concyclic.

There are $n$ sheep and a wolf in sheep's clothing . Some of the sheep are friends (friendship is mutual). The goal of the wolf is to eat all the sheep. First, the wolf chooses some sheep to make friend's with. In each of the following days, the wolf eats one of its friends. Whenever the wolf eats a sheep $A$: (a) If a friend of $A$ is originally a friend of the wolf, it un-friends the wolf. (b) If a friend of $A$ is originally not a friend of the wolf, it becomes a friend of the wolf. Repeat the procedure until the wolf has no friend left. Find the largest integer $m$ in terms of $n$ satisfying the following: There exists an initial friendsheep structure such that the wolf has $m$ different ways of choosing initial sheep to become friends, so that the wolf has a way to eat all of the sheep.

Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both $$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$are integers.

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. Proposed by Jeck Lim, Singapore

An integer $n \geq 3$ is given. We call an $n$-tuple of real numbers $(x_1, x_2, \dots, x_n)$ Shiny if for each permutation $y_1, y_2, \dots, y_n$ of these numbers, we have $$\sum \limits_{i=1}^{n-1} y_i y_{i+1} = y_1y_2 + y_2y_3 + y_3y_4 + \cdots + y_{n-1}y_n \geq -1.$$Find the largest constant $K = K(n)$ such that $$\sum \limits_{1 \leq i < j \leq n} x_i x_j \geq K$$holds for every Shiny $n$-tuple $(x_1, x_2, \dots, x_n)$.

A convex quadrilateral $ABCD$ has an inscribed circle with center $I$. Let $I_a, I_b, I_c$ and $I_d$ be the incenters of the triangles $DAB, ABC, BCD$ and $CDA$, respectively. Suppose that the common external tangents of the circles $AI_bI_d$ and $CI_bI_d$ meet at $X$, and the common external tangents of the circles $BI_aI_c$ and $DI_aI_c$ meet at $Y$. Prove that $\angle{XIY}=90^{\circ}$.