In $\vartriangle ABC, D, E, F$ are the midpoints of $AB, BC, CA$ respectively. Denote by $O_A, O_B, O_C$ the incenters of $\vartriangle ADF, \vartriangle BED, \vartriangle CFE$ respectively. Prove that $O_AE, O_BF, O_CD$ are concurrent.

Suppose that for some $m,n\in\mathbb{N}$ we have $\varphi (5^m-1)=5^n-1$, where $\varphi$ denotes the Euler function. Show that $(m,n)>1$.

In $\vartriangle ABC$ with $AB > AC$, the tangent to the circumcircle at $A$ intersects line $BC$ at $P$. Let $Q$ be the point on $AB$ such that $AQ = AC$, and $A$ lies between $B$ and $Q$. Let $R$ be the point on ray $AP$ such that $AR = CP$. Let $X, Y$ be the midpoints of $AP, CQ$ respectively. Prove that $CR = 2XY$ .

Suppose that $m, n, k$ are positive integers satisfying $$3mk=(m+3)^n+1.$$Prove that $k$ is odd.

Let $\omega_1, \omega_2$ be two circles with different radii, and let $H$ be the exsimilicenter of the two circles. A point X outside both circles is given. The tangents from $X$ to $\omega_1$ touch $\omega_1$ at $P, Q$, and the tangents from $X$ to $\omega_2$ touch $\omega_2$ at $R, S$. If $PR$ passes through $H$ and is not a common tangent line of $\omega_1, \omega_2$, prove that $QS$ also passes through $H$.

$A$ and $B$ plays a game, with $A$ choosing a positive integer $n \in \{1, 2, \dots, 1001\} = S$. $B$ must guess the value of $n$ by choosing several subsets of $S$, then $A$ will tell $B$ how many subsets $n$ is in. $B$ will do this three times selecting $k_1, k_2$ then $k_3$ subsets of $S$ each. What is the least value of $k_1 + k_2 + k_3$ such that $B$ has a strategy to correctly guess the value of $n$ no matter what $A$ chooses?

1.1 Let $f(A)$ denote the difference between the maximum value and the minimum value of a set $A$. Find the sum of $f(A)$ as $A$ ranges over the subsets of $\{1, 2, \dots, n\}$. 1.2 All cells of an $8 × 8$ board are initially white. A move consists of flipping the color (white to black or vice versa) of cells in a $1\times 3$ or $3\times 1$ rectangle. Determine whether there is a finite sequence of moves resulting in the state where all $64$ cells are black. 1.3 Prove that for all positive integers $m$, there exists a positive integer $n$ such that the set $\{n, n + 1, n + 2, \dots , 3n\}$ contains exactly $m$ perfect squares.

Let $f, g$ be bijections on $\{1, 2, 3, \dots, 2016\}$. Determine the value of $$\sum_{i=1}^{2016}\sum_{j=1}^{2016}[f(i)-g(j)]^{2559}.$$

Let $f$ be a function on a set $X$. Prove that $$f(X-f(X))=f(X)-f(f(X)),$$where for a set $S$, the notation $f(S)$ means $\{f(a) | a \in S\}$.

Find all function $f:\mathbb{N}^*\rightarrow \mathbb{N}^*$ that satisfy: $(f(1))^3+(f(2))^3+...+(f(n))^3=(f(1)+f(2)+...+f(n))^2$

Prove that for all polynomials $P \in \mathbb{R}[x]$ and positive integers $n$, $P(x)-x$ divides $P^n(x)-x$ as polynomials.

Find all polynomials $f$ with real coefficients such that for all reals $x, y, z$ such that $x+y+z =0$, the following relation holds: $$f(xy) + f(yz) + f(zx) = f(xy + yz + zx).$$

Find all functions $f : Z \to Z$ satisfying $f(m + n) + f(mn -1) = f(m)f(n) + 2$ for all $m, n \in Z$.

$\text{(i)}$ Does there exist a positive integer $m > 2016^{2016}$ such that $\frac{2016^m-m^{2016}}{m+2016}$ is a positive integer? $\text{(ii)}$ Does there exist a positive integer $m > 2017^{2017}$ such that $\frac{2017^m-m^{2017}}{m+2017}$ is a positive integer? (Serbia MO 2016 P1)

Let $a, b, c \in\mathbb{R}^+$. Prove that $$\sum_{cyc}ab\left(\frac{1}{2a+c}+\frac{1}{2b+c}\right)<\sum_{cyc}\frac{a^3+b^3}{c^2+ab}.$$

The cells of a $8 \times 8$ table are colored either black or white so that each row has a different number of black squares, and each column has a different number of black squares. What is the maximum number of pairs of adjacent cells of different colors?

Let $a, b, c \in \mathbb{R}^+$ such that $a + b + c = 3$. Prove that $$\sum_{cyc}\left(\frac{a^3+1}{a^2+1}\right)\geq\frac{1}{27}(\sqrt{ab}+\sqrt{bc}+\sqrt{ca})^4.$$