A point object of mass $m$ is connected to a cylinder of radius $R$ via a massless rope. At time $t = 0$ the object is moving with an initial velocity $v_0$ perpendicular to the rope, the rope has a length $L_0$, and the rope has a non-zero tension. All motion occurs on a horizontal frictionless surface. The cylinder remains stationary on the surface and does not rotate. The object moves in such a way that the rope slowly winds up around the cylinder. The rope will break when the tension exceeds $T_{max}$. Express your answers in terms of $T_{max}$, $m$, $L_0$, $R$, and $v_0$. [asy] size(200); real L=6; filldraw(CR((0,0),1),gray(0.7),black); path P=nullpath; for(int t=0;t<370;++t) { pair X=dir(180-t)+(L-t/180)*dir(90-t); if(X.y>L) X=(X.x,L); P=P--X; } draw(P,dashed,EndArrow(size=7)); draw((-1,0)--(-1,L)--(2,L),EndArrow(size=7)); filldraw(CR((-1,L),0.25),gray(0.7),black);[/asy]What is the kinetic energy of the object at the instant that the rope breaks? $ \textbf{(A)}\ \frac{mv_0^2}{2} $ $ \textbf{(B)}\ \frac{mv_0^2R}{2L_0} $ $ \textbf{(C)}\ \frac{mv_0^2R^2}{2L_0^2} $ $ \textbf{(D)}\ \frac{mv_0^2L_0^2}{2R^2} $ $ \textbf{(E)}\ \text{none of the above} $

A quadrilateral $ABCD$ is inscribed into a circle with center $O.$ Points $P$ and $Q$ are opposite to $C$ and $D$ respectively. Two tangents drawn to that circle at these points meet the line $AB$ in points $E$ and $F.$ ($A$ is between $E$ and $B$, $B$ is between $A$ and $F$). The line $EO$ meets $AC$ and $BC$ in points $X$ and $Y$ respectively, and the line $FO$ meets $AD$ and $BD$ in points $U$ and $V$ respectively. Prove that $XV=YU.$

Find the least possible number of elements which can be deleted from the set $\{1,2,...,20\}$ so that the sum of no two different remaining numbers is not a perfect square. N. Sedrakian , I.Voronovich

Circles $\Gamma_1$ and $\Gamma_2$ have centers $O_1$ and $O_2$ and intersect at $P$ and $Q$. A line through $P$ intersects $\Gamma_1$ and $\Gamma_2$ at $A$ and $B$, respectively, such that $AB$ is not perpendicular to $PQ$. Let $X$ be the point on $PQ$ such that $XA=XB$ and let $Y$ be the point within $AO_1 O_2 B$ such that $AYO_1$ and $BYO_2$ are similar. Prove that $2\angle{O_1 AY}=\angle{AXB}$. [i]Author: Matthew Brennan[/i]

Let $\omega$ be a root of unity and $f$ be a polynomial with integer coefficients. Show that if $|f(\omega)|=1$, then $f(\omega)$ is also a root of unity.

Find all $n \in \mathbb{N}$ such that $ \lfloor \sqrt{n}\rfloor$ divides $n$.

Prove that there are infinitely many positive integers $n$ such that $n \times n \times n$ can not be filled completely with 2 x 2 x 2 and 3 x 3 x 3 solid cubes.

Let $ABC$ be a triangle. The incircle of $ABC$ touches the sides $AB$ and $AC$ at the points $Z$ and $Y$, respectively. Let $G$ be the point where the lines $BY$ and $CZ$ meet, and let $R$ and $S$ be points such that the two quadrilaterals $BCYR$ and $BCSZ$ are parallelogram. Prove that $GR=GS$. [i]Proposed by Hossein Karke Abadi, Iran[/i]

You are given $n$ not necessarily distinct real numbers $a_1, a_2, \ldots, a_n$. Let's consider all $2^n-1$ ways to select some nonempty subset of these numbers, and for each such subset calculate the sum of the selected numbers. What largest possible number of them could have been equal to $1$? For example, if $a = [-1, 2, 2]$, then we got $3$ once, $4$ once, $2$ twice, $-1$ once, $1$ twice, so the total number of ones here is $2$. [i](Proposed by Anton Trygub)[/i]

Find the smallest positive real number $\lambda$ such that for every numbers $a_1,a_2,a_3 \in \left[0, \frac{1}{2} \right]$ and $b_1,b_2,b_3 \in (0, \infty)$ with $\sum\limits_{i=1}^3a_i=\sum\limits_{i=1}^3b_i=1,$ we have $$b_1b_2b_3 \le \lambda (a_1b_1+a_2b_2+a_3b_3).$$

Find all odd primes $ p$, if any, such that $ p$ divides $ \sum_{n\equal{}1}^{103}n^{p\minus{}1}$

In a wagon, every $m \geq 3$ people have exactly one common friend. (When $A$ is $B$'s friend, $B$ is also $A$'s friend. No one was considered as his own friend.) Find the number of friends of the person who has the most friends.

Given 2005 distinct numbers $a_1,\,a_2,\dots,a_{2005}$. By one question, we may take three different indices $1\le i<j<k\le 2005$ and find out the set of numbers $\{a_i,\,a_j,\,a_k\}$ (unordered, of course). Find the minimal number of questions, which are necessary to find out all numbers $a_i$.

Let $AA_1$ and $CC_1$ be altitudes of acute angled triangle $ABC$. A point $D$ is chosen on $AA_1$ such that $A_1D=C_1D$. Let $E$ be the midpoint of $AC$. Prove that points $A$, $C_1$, $D$, $E$ are concylic. [I]Proposed by S. Berlov[/i]

Alex is stuck on a platform floating over an abyss at $1$ ft/s. An evil physicist has arranged for the platform to fall in (taking Alex with it) after traveling $100$ft. One minute after the platform was launched, Edward arrives with a second platform capable of floating all the way across the abyss. He calculates for 5 seconds, then launches the second platform in such a way as to maximize the time that one end of Alex's platform is between the two ends of the new platform, thus giving Alex as much time as possible to switch. If both platforms are $5$ ft long and move with constant velocity once launched, what is the speed of the second platform (in ft/s)?

In the triangle $ABC$, ${{A}_{1}}$ and ${{C}_{1}} $ are the midpoints of sides $BC $ and $AB$ respectively. Point $P$ lies inside the triangle. Let $\angle BP {{C}_{1}} = \angle PCA$. Prove that $\angle BP {{A}_{1}} = \angle PAC $.