Several (at least three) turtles are crawling along the plane, the velocities of which are constant in magnitude and direction (all are equal in magnitude, but pairwise different in direction). Prove that regardless of the initial location, after some time all the turtles will be at the vertices of some convex polygon.

Points $A, B$ and $P$ lie on the circumference of a circle $\Omega_1$ such that $\angle APB$ is an obtuse angle. Let $Q$ be the foot of the perpendicular from $P$ on $AB$. A second circle $\Omega_2$ is drawn with centre $P$ and radius $PQ$. The tangents from $A$ and $B$ to $\Omega_2$ intersect $\Omega_1$ at $F$ and $H$ respectively. Prove that $FH$ is tangent to $\Omega_2$.

Part of an "$n$-pointed regular star" is shown. It is a simple closed polygon in which all $2n$ edges are congruent, angles $A_{1}$, $A_{2}$, $\ldots$, $A_{n}$ are congruent and angles $B_{1}$, $B_{2}$, $\ldots$, $B_{n}$ are congruent. If the acute angle at $A_{1}$ is $10^{\circ}$ less than the acute angle at $B_{1}$, then $n = $ [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=dir(90-2*36), B=dir(90-36), C=dir(90), D=dir(90+36), E=dir(90+2*36); pair F=2*dir(90-1.5*36), G=2*dir(90-0.5*36), H=2*dir(90+0.5*36), I=2*dir(90+1.5*36); draw(A--F--B--G--C--H--D--I--E); label("$B_2$", B, -0.3*dir(B)); label("$B_1$", C, -0.3*dir(C)); label("$B_n$", D, -0.3*dir(D)); label("$A_3$", F, dir(F)); label("$A_2$", G, dir(G)); label("$A_1$", H, dir(H)); label("$A_n$", I, dir(I)); [/asy] $ \textbf{(A)}\ 12\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 24\qquad\textbf{(D)}\ 36\qquad\textbf{(E)}\ 60 $

For every positive integer $m$ prove the inquality $|\{\sqrt{m}\} - \frac{1}{2}| \geq \frac{1}{8(\sqrt m+1)} $ (The integer part $[x]$ of the number $x$ is the largest integer not exceeding $x$. The fractional part of the number $x$ is a number $\{x\}$ such that $[x]+\{x\}=x$.) A. Golovanov

Let $x,y,z$ be real numbers such that $(x-z)(y-z)=x+y+z-3.$ Prove that $x^2+y^2+z^2\ge3.$

Let there be $131$ given distinct natural numbers, each having prime divisors not exceeding $42$. Prove that one can choose four of them whose product is a perfect square.

For each integer $n\geqslant2$, determine the largest real constant $C_n$ such that for all positive real numbers $a_1, \ldots, a_n$ we have \[\frac{a_1^2+\ldots+a_n^2}{n}\geqslant\left(\frac{a_1+\ldots+a_n}{n}\right)^2+C_n\cdot(a_1-a_n)^2\mbox{.}\] [i](4th Middle European Mathematical Olympiad, Team Competition, Problem 2)[/i]

A point $O$ lies inside $\triangle ABC$ so that $\angle BOC=90-\angle BAC$. Let $BO, CO$ meet $AC, AB$ at $K, L$. Points $K_1, L_1$ lie on the segments $CL, BK$ so that $K_1B=K_1K$ and $L_1C=L_1L$. If $M$ is the midpoint of $BC$, then prove that $\angle K_1ML_1=90^{o}$. [i]Proposed by Anton Trygub[/i]

Given a convex polygon. You can put no triangle with area $1$ inside it. Prove that you can put the polygon inside a triangle with the area $4$.

Let $Q$ be a point inside a cube. Prove that there are infinitely many lines $l$ so that $AQ=BQ$ where $A$ and $B$ are the two points of intersection of $l$ and the surface of the cube.

A pen costs $\mathrm{Rs.}\, 13$ and a note book costs $\mathrm{Rs.}\, 17$. A school spends exactly $\mathrm{Rs.}\, 10000$ in the year $2017-18$ to buy $x$ pens and $y$ note books such that $x$ and $y$ are as close as possible (i.e., $|x-y|$ is minimum). Next year, in $2018-19$, the school spends a little more than $\mathrm{Rs.}\, 10000$ and buys $y$ pens and $x$ note books. How much [b]more[/b] did the school pay?

There are 300 children in a camp. Everyone has no more than $k-1$ friends. What is the smallest $k{}$ for which it might be impossible to create some new friendships so that everyone has exactly $k{}$ friends?

For any set $S$, let $P(S)$ be its power set, the set of all of its subsets. Over all sets $A$ of $2015$ arbitrary finite sets, let $N$ be the maximum possible number of ordered pairs $(S,T)$ such that $S \in P(A), T \in P(P(A))$, $S \in T$, and $S \subseteq T$. (Note that by convention, a set may never contain itself.) Find the remainder when $N$ is divided by $1000.$ [i] Proposed by Ashwin Sah [/i]

Let $O$ be the circumcenter of triangle $ABC$. Suppose the perpendicular bisectors of $\overline{OB}$ and $\overline{OC}$ intersect lines $AB$ and $AC$ at $D\neq A$ and $E\neq A$, respectively. Determine the maximum possible number of distinct intersection points between line $BC$ and the circumcircle of $\triangle ADE$. [i]Andrew Wen[/i]

Find all polygons $P$ that can be covered completely by three (possibly overlapping) smaller dilated versions of itself. [i]Proposed by Evan Chang (squareman), USA[/i]

Given a regular 103-sided polygon. 79 vertices are colored red and the remaining vertices are colored blue. Let $A$ be the number of pairs of adjacent red vertices and $B$ be the number of pairs of adjacent blue vertices. a) Find all possible values of pair $(A,B).$ b) Determine the number of pairwise non-similar colorings of the polygon satisfying $B=14.$ 2 colorings are called similar if they can be obtained from each other by rotating the circumcircle of the polygon.

A convex quadrilateral $ABCD$ inscribed in a circle $k$ has the property that the rays $DA$ and $CB$ meet at a point $E$ for which $CD^2=AD\cdot
ED.$ The perpendicular to $ED$ at $A$ intersects $k$ again at point $F.$ Prove that the segments $AD$ and $CF$ are congruent if and only if the circumcenter of $\triangle ABE$ lies on $ED.$

Is there a convex polygon with each side equal to some diagonal, and each diagonal equal to some side?

Find all function $f:\mathbb R^+ \rightarrow \mathbb R^+$ such that: \[f\left(\frac{f(x)}{x}+y\right)=1+f(y), \quad \forall x,y \in \mathbb R^+.\]

Let $a_{0,1}, a_{0,2}, . . . , a_{0, 2016}$ be positive real numbers. For $n\geq 0$ and $1 \leq k < 2016$ set $$a_{n+1,k} = a_{n,k} +\frac{1}{2a_{n,k+1}} \ \ \text{and} \ \ a_{n+1,2016} = a_{n,2016} +\frac{1}{2a_{n,1}}.$$ Show that $\max_{1\leq k \leq 2016} a_{2016,k} > 44.$

Let $S$ be a set of size $n$, and $k$ be a positive integer. For each $1 \le i \le kn$, there is a subset $S_i \subset S$ such that $|S_i| = 2$. Furthermore, for each $e \in S$, there are exactly $2k$ values of $i$ such that $e \in S_i$. Show that it is possible to choose one element from $S_i$ for each $1 \le i \le kn$ such that every element of $S$ is chosen exactly $k$ times.

Given a triangle $ABC$, let $D$ be the intersection of the line through $A$ perpendicular to $AB$, and the line through $B$ perpendicular to $BC$. Let $P$ be a point inside the triangle. Show that $DAPB$ is cyclic if and only if $\angle BAP = \angle CBP$.

The points $M$ and $N$ are chosen on the angle bisector $AL$ of a triangle $ABC$ such that $\angle ABM=\angle ACN=23^{\circ}$. $X$ is a point inside the triangle such that $BX=CX$ and $\angle BXC=2\angle BML$. Find $\angle MXN$.

Let \(a\), \(b\), and \(n\) be positive integers. A lemonade stand owns \(n\) cups, all of which are initially empty. The lemonade stand has a [i]filling machine[/i] and an [i]emptying machine[/i], which operate according to the following rules: [list] [*]If at any moment, \(a\) completely empty cups are available, the filling machine spends the next \(a\) minutes filling those \(a\) cups simultaneously and doing nothing else. [*]If at any moment, \(b\) completely full cups are available, the emptying machine spends the next \(b\) minutes emptying those \(b\) cups simultaneously and doing nothing else. [/list] Suppose that after a sufficiently long time has passed, both the filling machine and emptying machine work without pausing. Find, in terms of \(a\) and \(b\), the least possible value of \(n\). [i]Proposed by Raymond Feng[/i]

High school graduate Igor Petrov, who dreamed of becoming a diplomat, took the entrance exam in mathematics to Moscow University. Igor remembered all the problems offered during the exam, but forgot some numerical data in one. This is the task: “When multiplying two natural numbers, the difference of which is $10$, an error was made: the hundreds digit in the product was increased by $2$. When dividing the resulting (incorrect) product by the smaller of the factors, the result was quotient $k$ and remainder $r$.. Find the numbers that needed to be multiplied.” . The values of $k$ and $r$ were given in the condition, but Igor forgot them. However, he remembered that the problem had two answers. What could the numbers $ k$ and $r$ be equal to (they are both integers and positive)? [i]Note. The problem in question was proposed at one of the humanities faculties of Moscow State University in 1991. [/i]