Let $n$ be positive integer such that there are exactly 36 different prime numbers that divides $n.$ For $k=1,2,3,4,5,$ $c_n$ be the number of integers that are mutually prime numbers to $n$ in the interval $[\frac{(k-1)n}{5},\frac{kn}{5}] .$ $c_1,c_2,c_3,c_4,c_5$ is not exactly the same.Prove that$$\sum_{1\le i<j\le 5}(c_i-c_j)^2\geq 2^{36}.$$

Show that if three points are inside are closed square of unit side, then some pair of them are within $\sqrt{6}-\sqrt{2}$ units apart.

A non-negative integer $n$ is said to be [i]squaredigital[/i] if it equals the square of the sum of its digits. Find all non-negative integers which are squaredigital.

Find all integers x,y,z with $2\leq x\leq y\leq z$ st $xy \equiv 1 $(mod z) $xz\equiv 1$(mod y) $yz \equiv 1$ (mod x)

Let $ABC$ be an acute triangle. Let $\omega$ be a circle whose centre $L$ lies on the side $BC$. Suppose that $\omega$ is tangent to $AB$ at $B'$ and $AC$ at $C'$. Suppose also that the circumcentre $O$ of triangle $ABC$ lies on the shorter arc $B'C'$ of $\omega$. Prove that the circumcircle of $ABC$ and $\omega$ meet at two points. [i]Proposed by Härmel Nestra, Estonia[/i]

Let $p$ and $q$ be two distinct integers. The square trinomial $x^2 + px + q$ is written on the board. At each step, a number is deleted: or the coefficient next to $x$, or the free term, and instead of the deleted number, a number is written, which is obtained from the deleted number by adding or subtracting the number $1$. After several such steps on the board, the square trinomial $x^2 + qx + p$ appeared. Show that at one stage a square trinomial was written on the board, both roots of which are integers.

Two positive valued sequences $\{ a_{n}\}$ and $\{ b_{n}\}$ satisfy: (a): $a_{0}=1 \geq a_{1}$, $a_{n}(b_{n+1}+b_{n-1})=a_{n-1}b_{n-1}+a_{n+1}b_{n+1}$, $n \geq 1$. (b): $\sum_{i=1}^{n}b_{i}\leq n^{\frac{3}{2}}$, $n \geq 1$. Find the general term of $\{ a_{n}\}$.

Given an integer number $n \ge 3$, show that the number of lists of jointly coprime positive integer numbers that sum to $n$ is divisible by $3$. (For instance, if $n = 4$, there are six such lists: $(3, 1), (1, 3), (2, 1, 1), (1, 2, 1), (1, 1, 2)$ and $(1, 1, 1, 1)$.)

Let $a$, $b$, $c$, $d$ be real numbers satisfying \begin{align*} (a + c)(b + d) = \sqrt{2}(ac - 2bd - 1). \end{align*} Show that \begin{align*} (ab - 1)^2 + (bc - 1)^2 + (cd - 1)^2 + (da - 1)^2 + (ac - 1)^2 + (2bd + 1)^2 \ge 4. \end{align*}

A sequence $a_1,\ldots,a_n$ of positive integers is given. For each $l$ from $1$ to $n-1$ the array $(gcd(a_1,a_{1+l}),\ldots,gcd(a_n,a_{n+l}))$ is considered, where indices are taken modulo $n$. It turned out that all this arrays consist of the same $n$ pairwise distinct numbers and differ only,possibly, by their order. Can $n$ be a) $21$ b) $2021$

Let $O$ be the center of the circumcircle $\omega$ of an acute-angle triangle $ABC$. A circle $\omega_1$ with center $K$ passes through $A$, $O$, $C$ and intersects $AB$ at $M$ and $BC$ at $N$. Point $L$ is symmetric to $K$ with respect to line $NM$. Prove that $BL \perp AC$.

The cross-section of a ball bearing consists of two concentric circles $ C $ and $ C_1 $, between which there are $ n $ small circles $ k_1, k_2, \ldots, k_n $, each of which is tangent to the two adjacent circles and to both circles $ C $ and $ C_1 $. Given the radius $ r $ of the inner circle $ C $ and a natural number $ n $, calculate the radius $ x $ of circle $ C_2 $ passing through the points of tangency of circles $ k_1, k_2, \ldots, k_n $ and the sum $ s $ of the lengths of the arcs of circles $ k_1, k_2, \ldots, k_n $ that lie outside circle $ C_2 $.

Compute the number of triangles of different sizes which contain the gray triangle in the figure below. [asy] size(5cm); real n = 4; for (int i = 0; i < n; ++i) { draw((0.5*i,0.866*i)--(n-0.5*i,0.866*i)); } for (int i = 0; i < n; ++i) { draw((n-i,0)--((n-i)/2,(n-i)*0.866)); } for (int i = 0; i < n; ++i) { draw((i,0)--((n+i)/2,(n-i)*0.866)); } filldraw((1.5,0.866)--(2,2*0.866)--(2.5,0.866)--cycle, gray); [/asy] [i]Proposed by Nathan Xiong[/i]

How many ways can you mark 8 squares of an $8\times8$ chessboard so that no two marked squares are in the same row or column, and none of the four corner squares is marked? (Rotations and reflections are considered different.)

Let $f(n)$ denote the largest odd factor of $n$, including possibly $n$. Determine the value of \[\frac{f(1)}{1} + \frac{f(2)}{2} + \frac{f(3)}{3} + \cdots + \frac{f(2048)}{2048},\] rounded to the nearest integer.

The Hawking Space Agency operates $n-1$ space flights between the $n$ habitable planets of the Local Galaxy Cluster. Each flight has a fixed price which is the same in both directions, and we know that using these flights, we can travel from any habitable planet to any habitable planet. In the headquarters of the Agency, there is a clearly visible board on a wall, with a portrait, containing all the pairs of different habitable planets with the total price of the cheapest possible sequence of flights connecting them. Suppose that these prices are precisely $1,2, ... , \binom{n}{2}$ monetary units in some order. prove that $n$ or $n-2$ is a square number.

Aaron the ant walks on the coordinate plane according to the following rules. He starts at the origin $p_0=(0,0)$ facing to the east and walks one unit, arriving at $p_1=(1,0)$. For $n=1,2,3,\dots$, right after arriving at the point $p_n$, if Aaron can turn $90^\circ$ left and walk one unit to an unvisited point $p_{n+1}$, he does that. Otherwise, he walks one unit straight ahead to reach $p_{n+1}$. Thus the sequence of points continues $p_2=(1,1), p_3=(0,1), p_4=(-1,1), p_5=(-1,0)$, and so on in a counterclockwise spiral pattern. What is $p_{2015}$? $ \textbf{(A) } (-22,-13)\qquad\textbf{(B) } (-13,-22)\qquad\textbf{(C) } (-13,22)\qquad\textbf{(D) } (13,-22)\qquad\textbf{(E) } (22,-13) $

Find all functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that verify the equality $$ \int_a^b f(x)dx=f(b)-f(a), $$ for any real numbers $ a,b. $ [i]Cosmin Nitu[/i]

Let $(x_n), n\in\mathbb{N}$ be a sequence such that $x_{n+1}=3x_n^3+x_n, \forall n\in\mathbb{N}$ and $x_1=\frac{a}{b}$ where $a,b$ are positive integers such that $3\not|b$. If $x_m$ is a square of a rational number for some positive integer $m$, prove that $x_1$ is also a square of a rational number.

An L-shape is one of the following four pieces, each consisting of three unit squares: [asy] size(300); defaultpen(linewidth(0.8)); path P=(1,2)--(0,2)--origin--(1,0)--(1,2)--(2,2)--(2,1)--(0,1); draw(P); draw(shift((2.7,0))*rotate(90,(1,1))*P); draw(shift((5.4,0))*rotate(180,(1,1))*P); draw(shift((8.1,0))*rotate(270,(1,1))*P); [/asy] A $5\times 5$ board, consisting of $25$ unit squares, a positive integer $k\leq 25$ and an unlimited supply of L-shapes are given. Two players A and B, play the following game: starting with A they play alternatively mark a previously unmarked unit square until they marked a total of $k$ unit squares. We say that a placement of L-shapes on unmarked unit squares is called $\textit{good}$ if the L-shapes do not overlap and each of them covers exactly three unmarked unit squares of the board. B wins if every $\textit{good}$ placement of L-shapes leaves uncovered at least three unmarked unit squares. Determine the minimum value of $k$ for which B has a winning strategy.

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

Find all triplets $(x, y, z)$ of real numbers for which $$\begin{cases}x^2- yz = |y-z| +1 \\ y^2 - zx = |z-x| +1 \\ z^2 -xy = |x-y| + 1 \end{cases}$$

Let $x$ be a real number selected uniformly at random between 100 and 200. If $\lfloor {\sqrt{x}} \rfloor = 12$, find the probability that $\lfloor {\sqrt{100x}} \rfloor = 120$. ($\lfloor {v} \rfloor$ means the greatest integer less than or equal to $v$.) $\text{(A)} \ \frac{2}{25} \qquad \text{(B)} \ \frac{241}{2500} \qquad \text{(C)} \ \frac{1}{10} \qquad \text{(D)} \ \frac{96}{625} \qquad \text{(E)} \ 1$

Each square of an $n \times n$ grid is coloured either blue or red, where $n$ is a positive integer. There are $k$ blue cells in the grid. Pat adds the sum of the squares of the numbers of blue cells in each row to the sum of the squares of the numbers of blue cells in each column to form $S_B$. He then performs the same calculation on the red cells to compute $S_R$. If $S_B- S_R = 50$, determine (with proof) all possible values of $k$.

The incircle of the triangle ABC touches the sides BC, AC, and AB at points A', B', and C', respectively. It is known that AA'=BB'=CC'. Does the triangle ABC have to be equilateral? (I am very interested in ingenious solution of this problem, because I found an ugly one using Stewart's theorem and tons of algebra during the contest).