Assume $ a_{1} \ge a_{2} \ge \dots \ge a_{107} > 0 $ satisfy $ \sum\limits_{k=1}^{107}{a_{k}} \ge M $ and $ b_{107} \ge b_{106} \ge \dots \ge b_{1} > 0 $ satisfy $ \sum\limits_{k=1}^{107}{b_{k}} \le M $. Prove that for any $ m \in \{1,2, \dots, 107\} $, the arithmetic mean of the following numbers $$ \frac{a_{1}}{b_{1}}, \frac{a_{2}}{b_{2}}, \dots, \frac{a_{m}}{b_{m}} $$is greater than or equal to $ \frac{M}{N} $

Given a positive integer $ n $, let $ A, B $ be two co-prime positive integers such that $$ \frac{B}{A} = \left(\frac{n\left(n+1\right)}{2}\right)!\cdot\prod\limits_{k=1}^{n}{\frac{k!}{\left(2k\right)!}} $$Prove that $ A $ is a power of $ 2 $.

Given a triangle $ \triangle{ABC} $ with orthocenter $ H $. On its circumcenter, choose an arbitrary point $ P $ (other than $ A,B,C $) and let $ M $ be the mid-point of $ HP $. Now, we find three points $ D,E,F $ on the line $ BC, CA, AB $, respectively, such that $ AP \parallel HD, BP \parallel HE, CP \parallel HF $. Show that $ D, E, F, M $ are colinear.

Alice and Bob play a game on a Cartesian Coordinate Plane. At the beginning, Alice chooses a lattice point $ \left(x_{0}, y_{0}\right) $ and places a pudding. Then they plays by turns (B goes first) according to the rules a. If $ A $ places a pudding on $ \left(x,y\right) $ in the last round, then $ B $ can only place a pudding on one of $ \left(x+2, y+1\right), \left(x+2, y-1\right), \left(x-2, y+1\right), \left(x-2, y-1\right) $ b. If $ B $ places a pudding on $ \left(x,y\right) $ in the last round, then $ A $ can only place a pudding on one of $ \left(x+1, y+2\right), \left(x+1, y-2\right), \left(x-1, y+2\right), \left(x-1, y-2\right) $ Furthermore, if there is already a pudding on $ \left(a,b\right) $, then no one can place a pudding on $ \left(c,d\right) $ where $ c \equiv a \pmod{n}, d \equiv b \pmod{n} $. 1. Who has a winning strategy when $ n = 2018 $ 1. Who has a winning strategy when $ n = 2019 $

Find all functions $ f: \mathbb{R} \to \mathbb{R} $ such that $$ f\left(xf\left(y\right)-f\left(x\right)-y\right) = yf\left(x\right)-f\left(y\right)-x $$holds for all $ x,y \in \mathbb{R} $

Given a convex pentagon $ ABCDE. $ Let $ A_1 $ be the intersection of $ BD $ with $ CE $ and define $ B_1, C_1, D_1, E_1 $ similarly, $ A_2 $ be the second intersection of $ \odot (ABD_1),\odot (AEC_1) $ and define $ B_2, C_2, D_2, E_2 $ similarly. Prove that $ AA_2, BB_2, CC_2, DD_2, EE_2 $ are concurrent. Proposed by Telv Cohl

Let $ABC$ be a triangle with $AB=AC$, and let $M$ be the midpoint of $BC$. Let $P$ be a point such that $PB<PC$ and $PA$ is parallel to $BC$. Let $X$ and $Y$ be points on the lines $PB$ and $PC$, respectively, so that $B$ lies on the segment $PX$, $C$ lies on the segment $PY$, and $\angle PXM=\angle PYM$. Prove that the quadrilateral $APXY$ is cyclic.

Find all positive integers $ n $ such that there exists an integer $ m $ satisfying $$ \frac{1}{n}\sum\limits_{k=m}^{m+n-1}{k^2} $$is a perfect square.

Let $k$ be a positive integer. The organising commitee of a tennis tournament is to schedule the matches for $2k$ players so that every two players play once, each day exactly one match is played, and each player arrives to the tournament site the day of his first match, and departs the day of his last match. For every day a player is present on the tournament, the committee has to pay $1$ coin to the hotel. The organisers want to design the schedule so as to minimise the total cost of all players' stays. Determine this minimum cost.

Find all positive integers $ n $ with the following property: It is possible to fill a $ n \times n $ chessboard with one of arrows $ \uparrow, \downarrow, \leftarrow, \rightarrow $ such that 1. Start from any grid, if we follows the arrows, then we will eventually go back to the start point. 2. For every row, except the first and the last, the number of $ \uparrow $ and the number of $ \downarrow $ are the same. 3. For every column, except the first and the last, the number of $ \leftarrow $ and the number of $ \rightarrow $ are the same.

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

Given a triangle $ \triangle ABC $. Denote its incenter and orthocenter by $ I, H $, respectively. If there is a point $ K $ with $$ AH+AK = BH+BK = CH+CK $$Show that $ H, I, K $ are collinear. Proposed by Evan Chen