For each lattice point on the Cartesian Coordinate Plane, one puts a positive integer at the lattice such that for any given rectangle with sides parallel to coordinate axes, the sum of the number inside the rectangle is not a prime. Find the minimal possible value of the maximum of all numbers.

Let $m,n\geq 2$ be integers. Let $f(x_1,\dots, x_n)$ be a polynomial with real coefficients such that $$f(x_1,\dots, x_n)=\left\lfloor \frac{x_1+\dots + x_n}{m} \right\rfloor\text{ for every } x_1,\dots, x_n\in \{0,1,\dots, m-1\}.$$Prove that the total degree of $f$ is at least $n$.

A point $T$ is chosen inside a triangle $ABC$. Let $A_1$, $B_1$, and $C_1$ be the reflections of $T$ in $BC$, $CA$, and $AB$, respectively. Let $\Omega$ be the circumcircle of the triangle $A_1B_1C_1$. The lines $A_1T$, $B_1T$, and $C_1T$ meet $\Omega$ again at $A_2$, $B_2$, and $C_2$, respectively. Prove that the lines $AA_2$, $BB_2$, and $CC_2$ are concurrent on $\Omega$. Proposed by Mongolia

Given a simple graph with $ 4038 $ vertices. Assume we arbitrarily choose $ 2019 $ vertices as a group (the other $ 2019 $ is another group, of course), there are always $ k $ edges that connect two groups. Find all possible value of $ k $.

Find the maximal value of \[S = \sqrt[3]{\frac{a}{b+7}} + \sqrt[3]{\frac{b}{c+7}} + \sqrt[3]{\frac{c}{d+7}} + \sqrt[3]{\frac{d}{a+7}},\]where $a$, $b$, $c$, $d$ are nonnegative real numbers which satisfy $a+b+c+d = 100$. Proposed by Evan Chen, Taiwan

Given a prime $ p = 8k+1 $ for some integer $ k $. Let $ r $ be the remainder when $ \binom{4k}{k} $ is divided by $ p $. Prove that $ \sqrt{r} $ is not an integer. Proposed by Evan Chen

Given a $ \triangle ABC $ and a point $ P. $ Let $ O$, $D$, $E$, $F $ be the circumcenter of $ \triangle ABC$, $\triangle BPC$, $\triangle CPA$, $\triangle APB, $ respectively and let $ T $ be the intersection of $ BC $ with $ EF. $ Prove that the reflection of $ O $ in $ EF $ lies on the perpendicular from $ D $ to $ PT. $ Proposed by Telv Cohl

Determine all functions $f:(0,\infty)\to\mathbb{R}$ satisfying $$\left(x+\frac{1}{x}\right)f(y)=f(xy)+f\left(\frac{y}{x}\right)$$for all $x,y>0$.

Let $a$ and $b$ be distinct positive integers. The following infinite process takes place on an initially empty board. If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by $a$ and the other by $b$. If no such pair exists, we write two times the number $0$. Prove that, no matter how we make the choices in $(i)$, operation $(ii)$ will be performed only finitely many times. Proposed by Serbia.

Let $n>1$ be a positive integer. Each cell of an $n\times n$ table contains an integer. Suppose that the following conditions are satisfied: Each number in the table is congruent to $1$ modulo $n$. The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to $n$ modulo $n^2$. Let $R_i$ be the product of the numbers in the $i^{\text{th}}$ row, and $C_j$ be the product of the number in the $j^{\text{th}}$ column. Prove that the sums $R_1+\hdots R_n$ and $C_1+\hdots C_n$ are congruent modulo $n^4$.

We have $ n $ kinds of puddings. There are $ a_{i} $ puddings which are $ i $-th type and those $ S = a_{1}+\cdots+a_{n} $ puddings are distinct. Now, for a given arrangement of puddings: $ p_{1}, \dots, p_{n} $. Define $ c_{i} $ to be $$ \#\{1 \le j \le S-1 \ \mid \ p_{j}, p_{j+1} \text{ are the same type.}\} $$Show that if $ S $ is composite, then the sum of $ \prod_{i=1}^{n}{c_{i}} $ over all possible arrangements is a multiple of $ S $.

Given a triangle $ \triangle{ABC} $ with circumcircle $ \Omega $. Denote its incenter and $ A $-excenter by $ I, J $, respectively. Let $ T $ be the reflection of $ J $ w.r.t $ BC $ and $ P $ is the intersection of $ BC $ and $ AT $. If the circumcircle of $ \triangle{AIP} $ intersects $ BC $ at $ X \neq P $ and there is a point $ Y \neq A $ on $ \Omega $ such that $ IA = IY $. Show that $ \odot\left(IXY\right) $ tangents to the line $ AI $.