Given a sequence $x_1,x_2,x_3,\cdots$ of positive integers, Ali proceed the following algorythm: In the i-th step he markes all rational numbers in the interval $[0,1]$ which have denominator equal to $x_i$. Then he write down the number $a_i$ equal to the length of the smallest interval in $[0,1]$ which both two ends of that is a marked number. Find all sequences $x_1,x_2,x_3,\cdots$ with $x_5=5$ and such that for all $n\in \mathbb N$ we have $$ a_1+a_2+\cdots+a_n= 2-\dfrac{1}{x_n}. $$ Proposed by [i]Mojtaba Zare[/i]

There are $n$ teams in a football league. During a championship, every two teams play exactly one match, but no team can play more than one match in a week. At least, how many weeks are necessary for the championship to be held? Give an schedule for such a championship.

Let $A=(a_{ij})\in \mathcal{M}_p(\mathbb{C})$ such that $a_{12}=a_{23}=\ldots=a_{p-1,p}=1$ and $a_{ij}=0$ for any other entry. a)Prove that $A^{p-1}\neq O_p$ and $A^p=O_p$. b)If $X\in \mathcal{M}_{p}(\mathbb{C})$ and $AX=XA$, prove that there exist $a_1,a_2,\ldots,a_p\in \mathbb{C}$ such that: \[X=\left( \begin{array}{ccccc} a_1 & a_2 & a_3 & \ldots & a_p \\ 0 & a_1 & a_2 & \ldots & a_{p-1} \\ 0 & 0 & a_1 & \ldots & a_{p-2} \\ \ldots & \ldots & \ldots & \ldots & \ldots \\ 0 & 0 & 0 & \ldots & a_1 \end{array} \right)\] c)If there exist $B,C\in \mathcal{M}_p(\mathbb{C})$ such that $(I_p+A)^n=B^n+C^n,\ (\forall)n\in \mathbb{N}^*$, prove that $B=O_p$ or $C=O_p$.

Let $ABC$ be an acute angled triangle, $O$ be the circumcenter of $ABC$, and $R$ be the cicumradius. $AO$ meets the circumcircle of $BOC$ at $A'$, $BO$ meets the circumcircle of $COA$, and $CO$ meets the circumcircle of $AOB$ at $C'$. Prove that \[OA' \cdot OB' \cdot OC' \geq 8R^3.\] When does inequality occur?

Let $A$ be a finite set of positive numbers , $B=\{\frac{a+b}{c+d} |a,b,c,d \in A \}$. Show that: $\left | B \right | \ge 2\left | A \right |^2-1 $, where $|X| $ be the number of elements of the finite set $X$. (High School Affiliated to Nanjing Normal University )

Given three distinct positive integers such that one of them is the average of the two others. Can the product of these three integers be the perfect 2008th power of a positive integer?

Prove that for every positive integer n the number $(n^3 -n)(5^{8n+4} +3^{4n+2})$ is a multiple of $3804$.

Find all positive integers $ m,n $ that satisfy the equation \[ 3.2^m +1 = n^2 \]

Let $S$ be a set of $2020$ distinct points in the plane. Let \[M=\{P:P\text{ is the midpoint of }XY\text{ for some distinct points }X,Y\text{ in }S\}.\] Find the least possible value of the number of points in $M$.

Which species is polar? $ \textbf{(A) }\ce{CO2} \qquad\textbf{(B) }\ce{SO2}\qquad\textbf{(C) }\ce{SO3}\qquad\textbf{(D) }\ce{O2}\qquad $

In a sequence of natural numbers $ a_1,a_2,...,a_n$ every number $ a_k$ represents sum of the multiples of the $ k$ from sequence. Find all possible values for $ n$.

Given is an acute $\triangle ABC$ with orthocenter $H$. The point $H'$ is symmetric to $H$ over the side $AB$. Let $N$ be the intersection point of $HH'$ and $AB$. The circle passing through $A$, $N$ and $H'$ intersects $AC$ for the second time in $M$, and the circle passing through $B$, $N$ and $H'$ intersects $BC$ for the second time in $P$. Prove that $M$, $N$ and $P$ are collinear. [i]Proposed by Petar Filipovski[/i]

Let $a$ be rational and $b,c,d$ are real numbers, and let $f: \mathbb{R}\to [-1.1]$ be a function satisfying $f(x+a+b)-f(x+b)=c[x+2a+[x]-2[x+a]-[b]]+d$ for all $x$. Show that $f$ is periodic.

Richard comes across an infinite row of magic hats, $H_1, H_2, \dots$ each of which may contain a dollar bill with probabilities $p_1, p_2, \dots$. If Richard draws a dollar bill from $H_i$, then $p_{i+1} = p_i$, and if not, $p_{i+1}=\frac{1}{2}p_i$. If $p_1 = \frac{1}{2}$ and $E$ is the expected amount of money Richard makes from all the hats, compute $\lfloor 100E \rfloor$. [i]Proposed by Alex Li[/i]

Let $P_n = (19 + 92)(19^2 +92^2) \cdots(19^n +92^n)$ for each positive integer $n$. Determine, with proof, the least positive integer $m$, if it exists, for which $P_m$ is divisible by $33^{33}.$

There are $10$ birds on the ground. For any $5$ of them, there are at least $4$ birds on a circle. Determine the least possible number of birds on the circle with the most birds.

Let $f\left(x\right)=10^{10x}, g\left(x\right)=\log_{10}\left(\frac{x}{10}\right), h_1\left(x\right)=g\left(f\left(x\right)\right),$ and $h_n\left(x\right)=h_1\left(h_{n-1}\left(x\right)\right)$ for integers $n \ge 2$. What is the sum of the digits of $h_{2011}\left(1\right)$? $ \textbf{(A)}\ 16,081 \qquad \textbf{(B)}\ 16,089 \qquad \textbf{(C)}\ 18,089 \qquad \textbf{(D)}\ 18,098 \qquad \textbf{(E)}\ 18,099 $

In the plane, there are $n \geqslant 6$ pairwise disjoint disks $D_{1}, D_{2}, \ldots, D_{n}$ with radii $R_{1} \geqslant R_{2} \geqslant \ldots \geqslant R_{n}$. For every $i=1,2, \ldots, n$, a point $P_{i}$ is chosen in disk $D_{i}$. Let $O$ be an arbitrary point in the plane. Prove that \[O P_{1}+O P_{2}+\ldots+O P_{n} \geqslant R_{6}+R_{7}+\ldots+R_{n}.\] (A disk is assumed to contain its boundary.)

Given triangle $ABC$ . From the $P$ point three lines $(PA),(PB),(PC)$ are drawn. They cross the circumscribed circle at $A_1, B_1,C_1$ points respectively. It comes out that the $A_1B_1C_1$ triangle equals to the initial one. Prove that there are not more than eight such a points $P$ in a plane.

Find all prime numbers $p$ such that the number $$3^p+4^p+5^p+9^p-98$$ has at most $6$ positive divisors.

Let $m$ and $n$ be positive integers. Fuming Zeng gives James a rectangle, such that $m-1$ lines are drawn parallel to one pair of sides and $n-1$ lines are drawn parallel to the other pair of sides (with each line distinct and intersecting the interior of the rectangle), thus dividing the rectangle into an $m\times n$ grid of smaller rectangles. Fuming Zeng chooses $m+n-1$ of the $mn$ smaller rectangles and then tells James the area of each of the smaller rectangles. Of the $\dbinom{mn}{m+n-1}$ possible combinations of rectangles and their areas Fuming Zeng could have given, let $C_{m,n}$ be the number of combinations which would allow James to determine the area of the whole rectangle. Given that \[A=\sum_{m=1}^\infty \sum_{n=1}^\infty \frac{C_{m,n}\binom{m+n}{m}}{(m+n)^{m+n}},\] then find the greatest integer less than $1000A$. [i]Proposed by James Lin

Consider a $2018 \times 2019$ board with integers in each unit square. Two unit squares are said to be neighbours if they share a common edge. In each turn, you choose some unit squares. Then for each chosen unit square the average of all its neighbours is calculated. Finally, after these calculations are done, the number in each chosen unit square is replaced by the corresponding average. Is it always possible to make the numbers in all squares become the same after finitely many turns?

Let $AA', BB'$ and $CC'$ be the altitudes of an acute-angled triangle $ABC$. Points $C_a, C_b$ are symmetric to $C' $ wrt $AA'$ and $BB'$. Points $A_b, A_c, B_c, B_a$ are defined similarly. Prove that lines $A_bB_a, B_cC_b$ and $C_aA_c$ are parallel.

Three spheres $s_1$, $s_2$, $s_3$ intersect along one circle $\omega$. Let $A $be an arbitrary point lying on the circle $\omega$. Ray $AB$ intersects spheres $s_1$, $s_2$, $s_3$ at points $B_1$, $B_2$, $B_3$, respectively, ray $AC$ intersects spheres $s_1$, $s_2$, $s_3$ at points $C_1$, $C_2$, $C_3$, respectively ($B_i \ne A_i$, $C_i \ne A_i$, $i=1,2,3$). It is known that $B_2$ is the midpoint of the segment $B_1B_3$. Prove that $C_2$ is the midpoint of the segment $C_1C_3$.

Let $p_n$ be a bounded sequence of integers which satisfies the recursion $$p_n =\frac{p_{n-1} +p_{n-2} + p_{n-3}p _{n-4}}{p_{n-1} p_{n-2}+ p_{n-3} +p_{n-4}}.$$ Show that the sequence eventually becomes periodic.