$A_0A_1\ldots A_n$ is a regular polygon with $n+1$ vertices ($n>2$). Initially $n$ stones are placed at vertex $A_0$. In each allowed operation, $2$ stones are moved simultaneously, at the player's choice: each stone is moved from the vertex where it is located to one of the adjacent $2$ vertices. Find all the values of $n$ for which it is possible to have, after a succession of permitted operations, a stone at each of the vertices $A_1,A_2,\ldots ,A_n$. Clarification: The two stones that move in an allowed operation can be at the same vertex or at different vertices.

Two equilateral triangles are glued, and their opposite vertices are connected. If the larger equilateral triangle has an area of $225$ and the smaller equilateral triangle has an area of $100$, what is the area of the shaded region? [asy] size(4cm); draw((0,0)--(3,0)--(3/2,3sqrt(3)/2)--(0,0)); draw((0,0)--(2,0)--(1,-sqrt(3))--(0,0)); draw((1,-sqrt(3))--(3/2,3sqrt(3)/2)); filldraw((0,0)--(6/5,0)--(3/2,3sqrt(3)/2)--cycle, gray); [/asy] $\textbf{(A) }60\qquad\textbf{(B) }90\qquad\textbf{(C) }96\qquad\textbf{(D) }108\qquad\textbf{(E) }120$

Consider a right circular cylinder with radius $ r$ of the base, hight $ h$. Find the volume of the solid by revolving the cylinder about a diameter of the base.

For a positive integer $k$, define the sequence $\{a_n\}_{n\ge 0}$ such that $a_0=1$ and for all positive integers $n$, $a_n$ is the smallest positive integer greater than $a_{n-1}$ for which $a_n\equiv ka_{n-1}\pmod {2017}$. What is the number of positive integers $1\le k\le 2016$ for which $a_{2016}=1+\binom{2017}{2}?$ [i]Proposed by James Lin[/i]

Given a positive integer $n$. Consider a $3 \times n$ grid, a set $S$ of squares is called [i]connected[/i] if for any points $A \neq B$ in $S$, there exists an integer $l \ge 2$ and $l$ squares $A=C_1,C_2,\dots ,C_l=B$ in $S$ such that $C_i$ and $C_{i+1}$ shares a common side ($i=1,2,\dots,l-1$). Find the largest integer $K$ satisfying that however the squares are colored black or white, there always exists a [i]connected[/i] set $S$ for which the absolute value of the difference between the number of black and white squares is at least $K$.

Prove that circles which have sides of a convex quadrilateral as diameters cover its interior. (Convex polygon is the one which contains with any two points the whole segment, joining them).

Inscribe a rectangle of base $b$ and height $h$ in a circle of radius one, and inscribe an isosceles triangle in the region of the circle cut off by one base of the rectangle (with that side as the base of the triangle). For what value of $h$ do the rectangle and triangle have the same area?

A set of $n$ points in Euclidean 3-dimensional space, no four of which are coplanar, is partitioned into two subsets $\mathcal{A}$ and $\mathcal{B}$. An $\mathcal{AB}$-tree is a configuration of $n-1$ segments, each of which has an endpoint in $\mathcal{A}$ and an endpoint in $\mathcal{B}$, and such that no segments form a closed polyline. An $\mathcal{AB}$-tree is transformed into another as follows: choose three distinct segments $A_1B_1$, $B_1A_2$, and $A_2B_2$ in the $\mathcal{AB}$-tree such that $A_1$ is in $\mathcal{A}$ and $|A_1B_1|+|A_2B_2|>|A_1B_2|+|A_2B_1|$, and remove the segment $A_1B_1$ to replace it by the segment $A_1B_2$. Given any $\mathcal{AB}$-tree, prove that every sequence of successive transformations comes to an end (no further transformation is possible) after finitely many steps.

Let $f : N \to N$ be a function such that $f(f(1995)) = 95, f(xy) = f(x)f(y)$ and $f(x) \le x$ for all $x,y$. Find all possible values of $f(1995)$.

Let $m$ be a positive integer, and let $T$ denote the set of all subsets of $\{1, 2, \dots, m\}$. Call a subset $S$ of $T$ $\delta$-[I]good[/I] if for all $s_1, s_2\in S$, $s_1\neq s_2$, $|\Delta (s_1, s_2)|\ge \delta m$, where $\Delta$ denotes the symmetric difference (the symmetric difference of two sets is the set of elements that is in exactly one of the two sets). Find the largest possible integer $s$ such that there exists an integer $m$ and $ \frac{1024}{2047}$-good set of size $s$.

It is known that there exists a point $P$ within the interior of $\triangle ABC$ satisfying the following conditions: (i) $\angle PAB \ge 30^\circ$ and $\angle APB \ge \angle PCB + 30^\circ$; (ii) $BP \cdot BC=CP \cdot AB.$ Prove that $\angle BAC \ge 60^\circ$, and that equality holds only when $\triangle ABC$ is equilateral.

Let $\triangle ABC$ be a triangle with $AB =AC$ and $\angle BAC = 20^{\circ}$. Let $D$ be point on the side $AB$ such that $\angle BCD = 70^{\circ}$. Let $E$ be point on the side $AC$ such that $\angle CBE = 60^{\circ}$. Determine the value of angle $\angle CDE$.

The incircle of triangle $ABC$ touches its sides $AB$ and $BC$ at points $P$ and $Q.$ The line $PQ$ meets the circumcircle of triangle $ABC$ at points $X$ and $Y.$ Find $\angle XBY$ if $\angle ABC = 90^\circ.$ [i]Proposed by A. Smirnov[/i]

Hexagon $ARTSCI$ has side lengths $AR=RT=TS=SC=4\sqrt2$ and $CI=IA=10\sqrt2$. Moreover, the vertices $A$, $R$, $T$, $S$, $C$, and $I$ lie on a circle $\mathcal{K}$. Find the area of $\mathcal{K}$.

Positive integers $ a<b$ are given. Prove that among every $ b$ consecutive positive integers there are two numbers whose product is divisible by $ ab$.

Given any $60$ points on a circle of radius $1$, prove that there is a point on the circle the sum of whose distances to these $60$ points is at most $80$.

For each point $X$ in the plane, a real number $r_X > 0$ is assigned such that $2|r_X - r_Y | \le |XY |$, for any two points $X, Y$ . (Here $|XY |$ denotes the distance between $X$ and $Y$) A frog can jump from $X$ to $Y$ if $r_X = |XY |$. Show that for any two points $X$ and $Y$ , the frog can jump from $X$ to $Y$ in a finite number of steps.

Let $x$ and $y$ be real numbers satisfying \[(x^2+x-1)(x^2-x+1)=2(y^3-2\sqrt{5}-1)\] and \[(y^2+y-1)(y^2-y+1)=2(x^3+2\sqrt{5}-1)\] Find $8x^2+4y^3$.

Does there exist a $6$-digit number $A$ such that none of its $500 000$ multiples $A$, $2A$, $3A$, ..., $500 000A$ ends in $6$ identical digits? (S Tokarev)

In a convex quadrilateral $ABCD$, let $AB + CD = BC + AD$. Prove that the circle inscribed in $ABC$ is tangent to the circle inscribed in $ACD$.

We call a monic polynomial $P(x) \in \mathbb{Z}[x]$ [i]square-free mod n[/i] if there [u]dose not[/u] exist polynomials $Q(x),R(x) \in \mathbb{Z}[x]$ with $Q$ being non-constant and $P(x) \equiv Q(x)^2 R(x) \mod n$. Given a prime $p$ and integer $m \geq 2$. Find the number of monic [i]square-free mod p[/i] $P(x)$ with degree $m$ and coeeficients in $\{0,1,2,3,...,p-1\}$. [i]Proposed by Masud Shafaie[/i]

The numbers, in order, of each row and the numbers, in order, of each column of a $5 \times 5$ array of integers form an arithmetic progression of length $5{.}$ The numbers in positions $(5, 5), \,(2,4),\,(4,3),$ and $(3, 1)$ are $0, 48, 16,$ and $12{,}$ respectively. What number is in position $(1, 2)?$ \[ \begin{bmatrix} . & ? &.&.&. \\ .&.&.&48&.\\ 12&.&.&.&.\\ .&.&16&.&.\\ .&.&.&.&0\end{bmatrix}\] $\textbf{(A) } 19 \qquad \textbf{(B) } 24 \qquad \textbf{(C) } 29 \qquad \textbf{(D) } 34 \qquad \textbf{(E) } 39$

In making Euclidean constructions in geometry it is permitted to use a ruler and a pair of compasses. In the constructions considered in this question no compasses are permitted, but the ruler is assumed to have two parallel edges, which can be used for constructing two parallel lines through two given points whose distance is at least equal to the breadth of the rule. Then the distance between the parallel lines is equal to the breadth of the ruler. Carry through the following constructions with such a ruler. Construct: [b]a)[/b] The bisector of a given angle. [b]b)[/b] The midpoint of a given rectilinear line segment. [b]c)[/b] The center of a circle through three given non-collinear points. [b]d)[/b] A line through a given point parallel to a given line.

There are $n$ students $A_1,A_2,...,A_n$ and some of them shaked hands with each other. ($A_i$ and $A-j$ can shake hands more than one time.) Let the student $A_i$ shaked hands $d_i$ times. Suppose $d_1 + d_2 +... + d_n > 0$. Prove that there exist $1 \le i < j \le n$ satisfying the following conditions: (a) Two students $A_i$ and $A_j$ shaked hands each other. (b) $\frac{(d_1 + d_2 +... + d_n)^2}{n^2}\le d_id_j$

Let $n \geq 2$ be an integer. Define $x_i =1$ or $-1$ for every $i=1,2,3,\cdots, n$. Call an operation [i]adhesion[/i], if it changes the string $(x_1,x_2,\cdots,x_n)$ to $(x_1x_2, x_2x_3, \cdots ,x_{n-1}x_n, x_nx_1)$ . Find all integers $n \geq 2$ such that the string $(x_1,x_2,\cdots, x_n)$ changes to $(1,1,\cdots,1)$ after finitely [i]adhesion[/i] operations.