Divide a circle into $2n$ equal sections. We call a circle [i]filled[/i] if it is filled with the numbers $0,1,2,\dots,n-1$. We call a filled circle [i] good[/i] if it has the following properties: $i$. Each number $0 \leq a \leq n-1$ is used exactly twice $ii$. For any $a$ we have that there are exactly $a$ sections between the two sections that have the number $a$ in them. Here is an example of a good filling for $n=5$ (View attachment) Prove that there doesn’t exist a good filling for $n=1399$

A paper convex quadrilateral will be called [b]folding[/b] if there are points $P,Q,R,S$ on the interiors of segments $AB,BC,CD,DA$ respectively so that if we fold in the triangles $SAP, PBQ, QCR, RDS$, they will exactly cover the quadrilateral $PQRS$. In other words, if the folded triangles will cover the quadrilateral $PQRS$ but won't cover each other. Prove that if quadrilateral $ABCD$ is folding, then $AC\perp BD$ or $ABCD$ is a trapezoid.

Let $ABC$ be a triangle with circumcenter $O$, incenter $I$, $\angle B=45^\circ$, and $OI\parallel BC$. Find $\cos\angle C$.

Let $a$ be a positive number, and we show decimal part of the $a$ with $\left\{a\right\}$.For a positive number $x$ with $\sqrt 2< x <\sqrt 3$ such that, $\left\{\frac{1}{x}\right\}$=$\left\{x^2\right\}$.Find value of the $$x(x^7-21)$$

Find all functions $f$ defined on the set of positive reals which take positive real values and satisfy: $f(xf(y))=yf(x)$ for all $x,y$; and $f(x)\to0$ as $x\to\infty$.

The sum of two numbers is $ S$. Suppose 3 is added to each number and then each of the resulting numbers is doubled. What is the sum of the final two numbers? $ \textbf{(A)} \ 2S \plus{} 3 \qquad \textbf{(B)} \ 3S \plus{} 2 \qquad \textbf{(C)} \ 3S \plus{} 6 \qquad \textbf{(D)} \ 2S \plus{} 6 \qquad \textbf{(E)} \ 2S \plus{} 12$

$N$ children no two of the same height stand in a line. The following two-step procedure is applied: first, the line is split into the least possible number of groups so that in each group all children are arranged from the left to the right in ascending order of their heights (a group may consist of a single child). Second, the order of children in each group is reversed, so now in each group the children stand in descending order of their heights. Prove that in result of applying this procedure $N - 1$ times the children in the line would stand from the left to the right in descending order of their heights. [i](12 points)[/i]

Find all real solutions to the equation $$(x+1)^{2001}+(x+1)^{2000}(x-2)+(x+1)^{1999}(x-2)^2+...+(x+1)^2(x-2)^{1999}+(x+1)^{2000}(x-2)+(x+1)^{2001}=0$$

Define the [i]ratio[/i] of an ellipse to be the length of the major axis divided by the length of its minor axis. Given a trapezoid $ABCD$ with $AB \parallel DC$ and that $\angle{ADC}$ is a right angle, with $AB=18, AD=33, CD=130,$ find the smallest ratio of any ellipse that goes through all vertices of $ABCD.$

Find all real solutions $(x,y,z)$ of the system of equations: \[ \begin{cases} \tan ^2x+2\cot^22y=1 \\ \tan^2y+2\cot^22z=1 \\ \tan^2z+2\cot^22x=1 \\ \end{cases} \]

The angle formed by the rays $y=x$ and $y=2x$ ($x \ge 0$) cuts off two arcs from a given parabola $y=x^2+px+q$. Prove that the projection of one arc onto the $x$-axis is shorter by $1$ than that of the second arc.

Let $p$ be a prime number. Prove that it is possible to choose a permutation $a_1, a_2,...,a_p$ of $1,2,...,p$ such that the numbers $a_1, a_1a_2, a_1a_2a_3,..., a_1a_2a_3...a_p$ all have different remainder upon division by $p$.

Let positive integers $a,\ b,\ c$ be pairwise coprime. Denote by $g(a, b, c)$ the maximum integer not representable in the form $xa+yb+zc$ with positive integral $x,\ y,\ z$. Prove that \[ g(a, b, c)\ge \sqrt{2abc}\] [i](M. Ivanov)[/i] [hide="Remarks (containing spoilers!)"] 1. It can be proven that $g(a,b,c)\ge \sqrt{3abc}$. 2. The constant $3$ is the best possible, as proved by the equation $g(3,3k+1,3k+2)=9k+5$. [/hide]

Two towns, $A$ and $B$, are connected by a straight road, $15$ miles long. Traveling from town $A$ to town $B$, the speed limit changes every $5$ miles: from $25$ to $40$ to $20$ miles per hour (mph). Two cars, one at town $A$ and one at town $B$, start moving toward each other at the same time. They drive exactly the speed limit in each portion of the road. How far from town $A$, in miles, will the two cars meet? $\textbf{(A) }7.75 \qquad\textbf{(B) }8 \qquad\textbf{(C) }8.25\qquad\textbf{(D) }8.5 \qquad\textbf{(E) }8.75$

Let $ABC$ be a triangle with circumcircle $\omega$. The internal angle bisectors of $\angle ABC$ and $\angle ACB$ intersect $\omega$ at $X\neq B$ and $Y\neq C$, respectively. Let $K$ be a point on $CX$ such that $\angle KAC = 90^\circ$. Similarly, let $L$ be a point on $BY$ such that $\angle LAB = 90^\circ$. Let $S$ be the midpoint of arc $CAB$ of $\omega$. Prove that $SK=SL$.

Answer the following two questions and justify your answers: (a) What is the last digit of the sum $1^{2012}+2^{2012}+3^{2012}+4^{2012}+5^{2012}$? (b) What is the last digit of the sum $1^{2012}+2^{2012}+3^{2012}+4^{2012}+...+2011^{2012}+2012^{2012}$?

Let $ ABCD$ be a trapezoid with parallel sides $ AB > CD$. Points $ K$ and $ L$ lie on the line segments $ AB$ and $ CD$, respectively, so that $AK/KB=DL/LC$. Suppose that there are points $ P$ and $ Q$ on the line segment $ KL$ satisfying \[\angle{APB} \equal{} \angle{BCD}\qquad\text{and}\qquad \angle{CQD} \equal{} \angle{ABC}.\] Prove that the points $ P$, $ Q$, $ B$ and $ C$ are concyclic. [i]Proposed by Vyacheslev Yasinskiy, Ukraine[/i]

A point $E$ lies on the extension of the side $AD$ of the rectangle $ABCD$ over $D$. The ray $EC$ meets the circumcircle $\omega$ of $ABE$ at the point $F\ne E$. The rays $DC$ and $AF$ meet at $P$. $H$ is the foot of the perpendicular drawn from $C$ to the line $\ell$ going through $E$ and parallel to $AF$. Prove that the line $PH$ is tangent to $\omega$. (A. Kuznetsov)

If $x_k \in \mathbb{R}$ ($k=1, 2, \cdots , n$) and $m \in \mathbb{N}$ then [list=1] [*] $\sum \limits_{cyc} \left (x_1^2 -x_1x_2+x_2^2 \right )^m \leq 3^m \sum \limits_{k=1}^n x_k^{2m}$ [*] $\prod \limits_{cyc} \left (x_1^2 -x_1x_2+x_2^2 \right )^m \leq \left (\frac{3^m}{n}\right )^m \left (\sum \limits_{k=1}^n x_k^{2m}\right )^n$ [/list]

How many of the first 1000 positive integers can be expressed in the form \[ \lfloor 2x \rfloor + \lfloor 4x \rfloor + \lfloor 6x \rfloor + \lfloor 8x \rfloor, \] where $x$ is a real number, and $\lfloor z \rfloor$ denotes the greatest integer less than or equal to $z$?

[color=darkred]Let $a$ , $b$ and $c$ be three complex numbers such that $a+b+c=0$ and $|a|=|b|=|c|=1$ . Prove that: \[3\le |z-a|+|z-b|+|z-c|\le 4,\] for any $z\in\mathbb{C}$ , $|z|\le 1\, .$[/color]

Find all functions $f: \mathbb R \to \mathbb R$ such that for all reals $x$ and $y$, \[f(f(x)-y^{2})=f(x)^{2}-2f(x)y^{2}+f(f(y)).\]

Find all $7$-digit numbers which use only the digits $5$ and $7$ and are divisible by $35$.

Find the 2002nd positive integer that is not the difference of two square integers

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )