A uniform circular disc is suspended in a horizontal position on a string attached to its center $ O $. At three different points $ A $, $ B $, $ C $ on the edge of the disc, weights $ p_1 $, $ p_2 $, $ p_3 $ are placed, after which the disc remains in equilibrium. Calculate angles $ AOB $, $ BOC $, and $ COA $.

Let $M(n)$ and $m(n)$ are maximal and minimal proper divisors of $n$ Natural number $n>1000$ is on the board. Every minute we replace our number with $n+M(n)-m(n)$. If we get prime, then process is stopped. Prove that after some moves we will get number, that is not divisible by $17$

Determine the largest natural number whose all decimal digits are different and which is divisible by each of its digits.

Show that it is impossible to cover a unit square with five equal squares with side $s<\frac{1}{2}$.

The set $ S$ consists of $ n > 2$ points in the plane. The set $ P$ consists of $ m$ lines in the plane such that every line in $ P$ is an axis of symmetry for $ S$. Prove that $ m\leq n$, and determine when equality holds.

Let $a,b,c,d\in\mathbb{R}$ such that for all $x\in(-1,1)$ we have $$(x^2+ax+b)\cdot\lfloor x^2+cx+d\rfloor = \lfloor x^2+ax+b\rfloor \cdot (x^2 + cx + d).$$ Prove that $a=c$ and $b=d$. [i]Cristi Săvescu[/i]

Let $g_0 = 1$, $g_1 = 2$, $g_2 = 3$, and $g_n = g_{n-1} + 2g_{n-2} + 3g_{n-3}$. For how many $0 \le i \le 100$ is it that $g_i$ is divisible by $5$?

On the plane there are two cylindrical towers with radii of bases $r$ and $R$. Find the set of all those points of the plane from which these towers are visible at the same angle. Consider the case of more towers.

Let $n$ be a positive integer. $n$ letters are written around a circle, each $A$, $B$, or $C$. When the letters are read in clockwise order, the sequence $AB$ appears $100$ times, the sequence $BA$ appears $99$ times, and the sequence $BC$ appears $17$ times. How many times does the sequence $CB$ appear?

Let $r$ be a positive real number. Denote by $[r]$ the integer part of $r$ and by $\{r\}$ the fractional part of $r$. For example, if $r=32.86$, then $\{r\}=0.86$ and $[r]=32$. What is the sum of all positive numbers $r$ satisfying $25\{r\}+[r]=125$?

Let $ H $ be the orthocenter of $ ABC $ and $ A',B',C', $ the symmetric points of $ A,B,C $ with respect to $ H. $ The intersection of the segments $ BC,CA, AB $ with the circles of diameter $ A'H,B'H, $ respectively, $ C'H, $ consists of $ 6 $ points. Prove that these are concyclic.

Harold, Tanya, and Ulysses paint a very long picket fence. Harold starts with the first picket and paints every $h$th picket; Tanya starts with the second picket and paints everth $t$th picket; and Ulysses starts with the third picket and paints every $u$th picket. Call the positive integer $100h+10t+u$ $\textit{paintable}$ when the triple $(h,t,u)$ of positive integers results in every picket being painted exaclty once. Find the sum of all the paintable integers.

In any cell of an $n \times n$ table a number is written such that all the rows are distinct. Prove that we can remove a column such that the rows in the new table are still distinct.

Write a list of the first $10$ positive integers in increasing order. Erase any number adjacent to a prime; if two primes are adjacent, do not erase either prime. Apply this process twice. How many positive integers remain in the list? $\textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }4\qquad\textbf{(D) }5\qquad\textbf{(E) }6$

Kevin is in kindergarten, so his teacher puts a $100 \times 200$ addition table on the board during class. The teacher first randomly generates distinct positive integers $a_1, a_2, \dots, a_{100}$ in the range $[1, 2016]$ corresponding to the rows, and then she randomly generates distinct positive integers $b_1, b_2, \dots, b_{200}$ in the range $[1, 2016]$ corresponding to the columns. She then fills in the addition table by writing the number $a_i+b_j$ in the square $(i, j)$ for each $1\le i\le 100$, $1\le j\le 200$. During recess, Kevin takes the addition table and draws it on the playground using chalk. Now he can play hopscotch on it! He wants to hop from $(1, 1)$ to $(100, 200)$. At each step, he can jump in one of $8$ directions to a new square bordering the square he stands on a side or at a corner. Let $M$ be the minimum possible sum of the numbers on the squares he jumps on during his path to $(100, 200)$ (including both the starting and ending squares). The expected value of $M$ can be expressed in the form $\frac{p}{q}$ for relatively prime positive integers $p, q$. Find $p + q.$ [i]Proposed by Yang Liu[/i]

Which of the following are true? $\textbf{(A)}~\exists f:\mathbb N\to\mathbb Z\text{ onto and increasing}$ $\textbf{(B)}~\exists f:\mathbb Z\to\mathbb Q\text{ onto and increasing}$ $\textbf{(C)}~\exists f:\mathbb Q\to\mathbb Z\text{ onto and increasing and bounded}$ $\textbf{(D)}~\text{None of the above}$

For an integer $n > 0$, let $p(n)$ be the product of the digits of $n$. Compute the sum of all integers $n$ such that $n - p(n) = 52$.

Let $a$ and $k$ be positive integers such that $a^2+k$ divides $(a-1)a(a+1)$. Prove that $k\ge a$.

Isosceles trapezoid $ABCD$ has parallel sides $\overline{AD}$ and $\overline{BC},$ with $BC < AD$ and $AB = CD.$ There is a point $P$ in the plane such that $PA=1, PB=2, PC=3,$ and $PD=4.$ What is $\tfrac{BC}{AD}?$ $\textbf{(A) }\frac{1}{4}\qquad\textbf{(B) }\frac{1}{3}\qquad\textbf{(C) }\frac{1}{2}\qquad\textbf{(D) }\frac{2}{3}\qquad\textbf{(E) }\frac{3}{4}$

a) Let $ABC$ be a triangle and a point $I$ lies inside the triangle. Assume $\angle IBA > \angle ICA$ and $\angle IBC >\angle ICB$. Prove that, if extensions of $BI$, $CI$ intersect $AC$, $AB$ at $B'$, $C'$ respectively, then $BB' < CC'$. b) Let $ABC$ be a triangle with $AB < AC$ and angle bisector $AD$. Prove that for every point $I, J$ on the segment $[AD]$ and $I \ne J$, we always have $\angle JBI > \angle JCI$. c) Let $ABC$ be a triangle with $AB < AC$ and angle bisector $AD$. Choose $M, N$ on segments $CD$ and $BD$, respectively, such that $AD$ is the bisector of angle $\angle MAN$. On the segment $[AD]$ take an arbitrary point $I$ (other than $D$). The lines $BI$, $CI$ intersect $AM$, $AN$ at $B', C'$. Prove that $BB' < CC'$.

$30$ same balls are put into four boxes $ A$, $ B$, $ C$, $ D$ in such a way that sum of number of balls in $ A$ and $ B$ is greater than sum of in $ C$ and $ D$. How many possible ways are there? $\textbf{(A)}\ 2472 \qquad\textbf{(B)}\ 2600 \qquad\textbf{(C)}\ 2728 \qquad\textbf{(D)}\ 2856 \qquad\textbf{(E)}\ \text{None}$

Let $L$ be a circle with center $O$ and tangent to sides $AB$ and $AC$ of a triangle $ABC$ in points $E$ and $F$, respectively. Let the perpendicular from $O$ to $BC$ meet $EF$ at $D$. Prove that $A,D$ and $M$ are collinear, where $M$ is the midpoint of $BC$.

Two segments slide along two skew lines. On each straight line there is a segment. Consider the tetrahedron with vertices at the endpoints of the segments. Prove that the volume of the tetrahedron does not depend on the position of the segments

In how many ways can you write $12$ as an ordered sum of integers where the smallest of those integers is equal to $2$? For example, $2+10$, $10+2$, and $3+2+2+5$ are three such ways.

Let $n$ be a positive integer. There are $n$ islands with $n-1$ bridges connecting them such that one can travel from any island to another. One afternoon, a fire breaks out in one of the islands. Every morning, it spreads to all neighbouring islands. (Two islands are neighbours if they are connected by a bridge.) To control the spread, one bridge is destroyed every night until the fire has nowhere to spread the next day. Let $X$ be the minimum possible number of bridges one has to destroy before the fire stops spreading. Find the maximum possible value of $X$ over all possible configurations of bridges and island where the fire starts at.