Given positive odd number $m$ and integer ${a}.$ Proof: For any real number $c,$ $$\#\left\{x\in\mathbb Z\cap [c,c+\sqrt m]\mid x^2\equiv a\pmod m\right\}\le 2+\log_2m.$$ [i]Proposed by Yinghua Ai[/i]

A palindrome is a number that remains the same when its digits are reversed. Let $n$ be a product of distinct primes not divisible by $10$. Prove that infinitely many multiples of $n$ are palindromes.

Given triangle $ ABC$ and its circumcircle $ \Gamma$, let $ M$ and $ N$ be the midpoints of arcs $ BC$ (that does not contain $ A$) and $ CA$ (that does not contain $ B$), repsectively. Let $ X$ be a variable point on arc $ AB$ that does not contain $ C$. Let $ O_1$ and $ O_2$ be the incenter of triangle $ XAC$ and $ XBC$, respectively. Let the circumcircle of triangle $ XO_1O_2$ meets $ \Gamma$ at $ Q$. (a) Prove that $ QNO_1$ and $ QMO_2$ are similar. (b) Find the locus of $ Q$ as $ X$ varies.

Prove that for $\forall$ $k\geq 2$, $k\in \mathbb{N}$ there exist a natural number that could be presented as a sum of two, three … $k$ cubes of natural numbers.

Bob has $30$ identical unit cubes. He can join two cubes together by gluing a face on one cube to a face on the other cube. He must join all the cubes together into one connected solid. Over all possible solids that Bob can build, what is the largest possible surface area of the solid? [i]Proposed by Nathan Xiong[/i]

Seven polygons of area $1$ lie in the interior of a square with side length $2$. Show that there are two of these polygons whose intersection has an area of at least $1\slash 7.$

Let $P$ and $Q$ be points on the sides $BC$ and $CD$ of a convex quadrilateral $ABCD$, respectively, such that $\angle{BAP}=\angle{ DAQ}$. Prove that the triangles $ABP$ and $ADQ$ have equal area if and only if the line joining their orthocenters is perpendicular to $AC.$

Show that the equation $14x^2 +15y^2 = 7^{2000}$ has no integer solutions.

For each positive integer $n$ let $a_n$ be the largest positive integer satisfying \[(a_n)!\left| \prod_{k=1}^n \left\lfloor \frac{n}{k}\right\rfloor\right.\] Show that there are infinitely many positive integers $m$ for which $a_{m+1}<a_m$.

Professor Oak is feeding his $100$ Pokémon. Each Pokémon has a bowl whose capacity is a positive real number of kilograms. These capacities are known to Professor Oak. The total capacity of all the bowls is $100$ kilograms. Professor Oak distributes $100$ kilograms of food in such a way that each Pokémon receives a non-negative integer number of kilograms of food (which may be larger than the capacity of the bowl). The [i]dissatisfaction level[/i] of a Pokémon who received $N$ kilograms of food and whose bowl has a capacity of $C$ kilograms is equal to $\lvert N-C\rvert$. Find the smallest real number $D$ such that, regardless of the capacities of the bowls, Professor Oak can distribute food in a way that the sum of the dissatisfaction levels over all the $100$ Pokémon is at most $D$. [i]Oleksii Masalitin, Ukraine[/i]

Let $ \sigma \in S_n$ and $ \alpha <2$. Evaluate$ \displaystyle\lim_{n\to\infty} \displaystyle\sum_{k\equal{}1}^{n}\frac{\sigma (k)}{k^{\alpha}}$.

Six numbers are placed on a circle. For every number $A$ we have: $A$ equals the absolute value of $(B- C)$, where $B$ and $C$ follow $A$ clockwise. The total sum of the numbers equals $1$. Find all the numbers. (Folklore)

Given two vectors $v = (v_1,\dots,v_n)$ and $w = (w_1\dots,w_n)$ in $\mathbb{R}^n$, lets define $v*w$ as the matrix in which the element of row $i$ and column $j$ is $v_iw_j$. Supose that $v$ and $w$ are linearly independent. Find the rank of the matrix $v*w - w*v.$

As the number of sides of a polygon increases from $3$ to $ n$, the sum of the exterior formed by extending each side in succession: $\textbf{(A)}\ \text{Increases} \qquad \textbf{(B)}\ \text{Decreases} \qquad \textbf{(C)}\ \text{Remains constant} \qquad \textbf{(D)}\ \text{Cannot be predicted} \qquad\\ \textbf{(E)}\ \text{Becomes }(n-3)\text{ straight angles}$

Let $d(n)$ be the number of divisors of $n,$ where $n$ is a natural number. Prove that the natural numbers can be colured by 2 colours in such way, that for any infinite increasing sequence $\left\{a_{1}, a_{2}, \cdots\right\}$ if $\left\{d\left(a_{1}\right), d\left(a_{2}\right), \cdots\right\}$ is an nonconstant geometric series then $\left\{a_{1}, a_{2}, \cdots\right\}$ does not bear same colour.

A function $f$ is given by $f(x) = x^2 - 2x$ . Prove that there exists a number a which satisfies $f(f(a)) = a$ without satisfying $f(a) = a$ .