$120$ pirates distribute $119$ gold pieces among themselves. Then the captain checks if any pirate has $15$ or more gold pieces. If he finds the first one, he must give all his gold pieces to other pirates, whereby he may not give more than one gold piece to anyone. This control is repeated as long as there is any pirate with $15$ or more gold pieces. Does this process end after a lot of checks?

Let $ ABC$ be a triangle with angle $ A <$ angle $ C < 90^\circ <$ angle $ B$. Consider the bisectors of the external angles at $ A$ and $ B$, each measured from the vertex to the opposoite side (extended). Suppose both of these line-segments are equal to $ AB$. Compute the angle $ A$.

The lengths of all sides and both diagonals of a quadrilateral are less than $1$ metre. Prove that it may be placed in a circle of radius $0.9$ metres.

For every pair of reals $0 < a < b < 1$, we define sequences $\{x_n\}_{n \ge 0}$ and $\{y_n\}_{n \ge 0}$ by $x_0 = 0$, $y_0 = 1$, and for each integer $n \ge 1$: \begin{align*} x_n & = (1 - a) x_{n - 1} + a y_{n - 1}, \\ y_n & = (1 - b) x_{n - 1} + b y_{n - 1}. \end{align*} The [i]supermean[/i] of $a$ and $b$ is the limit of $\{x_n\}$ as $n$ approaches infinity. Over all pairs of real numbers $(p, q)$ satisfying $\left (p - \textstyle\frac{1}{2} \right)^2 + \left (q - \textstyle\frac{1}{2} \right)^2 \le \left(\textstyle\frac{1}{10}\right)^2$, the minimum possible value of the supermean of $p$ and $q$ can be expressed as $\textstyle\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $100m + n$. [i]Proposed by Lewis Chen[/i]

The set $S$ consists of five integers. If pairs of distinct elements of $S$ are added, the following ten sums are obtained: 1967,1972,1973,1974,1975,1980,1983,1984,1989,1991. What are the elements of $S$?

Given that $x$ satisfies $2^{4x} \cdot 2^{4x} \cdot 8^{4x} = 16^5$, find the value of $x$. $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }4\qquad\textbf{(D) }5\qquad\textbf{(E) }10$

Let $X={1,2,3,4,5,6,7,8,9,10}$ and $A={1,2,3,4}$. Find the number of $4$-element subsets $Y$ of $X$ such that $10\in Y$ and the intersection of $Y$ and $A$ is not empty.

Let $P$ be a point inside a triangle $ABC$ such that \[\angle P AB = \angle P BC = \angle P CA\] Suppose $AP, BP, CP$ meet the circumcircles of triangles $P BC, P CA, P AB$ at $X, Y, Z$ respectively $(\neq P)$ . Prove that \[[XBC] + [Y CA] + [ZAB] \ge 3[ABC]\]

The vertices of a convex $2550$-gon are colored black and white as follows: black, white, two black, two white, three black, three white, ..., 50 black, 50 white. Dania divides the polygon into quadrilaterals with diagonals that have no common points. Prove that there exists a quadrilateral among these, in which two adjacent vertices are black and the other two are white. [i]D. Rudenko[/i]

Show that the sequence \begin{align*} a_n = \left \lfloor \left( \sqrt[3]{n-2} + \sqrt[3]{n+3} \right)^3 \right \rfloor \end{align*} contains infinitely many terms of the form $a_n^{a_n}$

In the triangle $ABC$ the altitude $BD$ and $CT$ are drawn, they intersect at the point $H$. The point $Q$ is the foot of the perpendicular drawn from the point $H$ on the bisector of the angle $A$. Prove that the bisector of the external angle $A$ of the triangle $ABC$, the bisector of the angle $BHC$ and the line $QM$, where $M$ is the midpoint of the segment $DT$, intersect at one point. (Matvsh Kursky)

Let $N = 2^{\left(2^2\right)}$ and $x$ be a real number such that $N^{\left(N^N\right)} = 2^{(2^x)}$. Find $x$.

Fedja used matches to put down the equally long sides of a parallelogram whose vertices are not on a common line. He figures out that exactly 7 or 9 matches, respectively, fit into the diagonals. How many matches compose the parallelogram's perimeter?

$(POL 2)$ Given two segments $AB$ and $CD$ not in the same plane, find the locus of points $M$ such that $MA^2 +MB^2 = MC^2 +MD^2.$

For every integer $n > 1$, the sequence $\left( {{S}_{n}} \right)$ is defined by ${{S}_{n}}=\left\lfloor {{2}^{n}}\underbrace{\sqrt{2+\sqrt{2+...+\sqrt{2}}}}_{n\ radicals} \right\rfloor $ where $\left\lfloor x \right\rfloor$ denotes the floor function of $x$. Prove that ${{S}_{2001}}=2\,{{S}_{2000}}+1$. .

Solve the equation $x^{2}+y^{2}=10xy$ for integers $x$ and $y$

On a cellular plane with a cell side equal to $1$, arbitrarily $100 \times 100$ napkin is thrown. It covers some nodes (the node lying on the border of a napkin, is also considered covered). What is the smallest number of lines (going not necessarily along grid lines) you can certainly cover all these nodes?

There are $n$ boyfriend-girlfriend pairs at a party. Initially all the girls sit at a round table. For the first dance, each boy invites one of the girls to dance with.After each dance, a boy takes the girl he danced with to her seat, and for the next dance he invites the girl next to her in the counterclockwise direction. For which values of $n$ can the girls be selected in such a way that in every dance at least one boy danced with his girlfriend, assuming that there are no less than $n$ dances?

An ant begins at a vertex of a convex regular icosahedron (a figure with 20 triangular faces and 12 vertices). The ant moves along one edge at a time. Each time the ant reaches a vertex, it randomly chooses to next walk along any of the edges extending from that vertex (including the edge it just arrived from). Find the probability that after walking along exactly six (not necessarily distinct) edges, the ant finds itself at its starting vertex.

There are $n$ points in the plane, some of which are connected by segments. Some of the segments are colored in white, while the others are colored black in such a way that there exist a completely white as well as a completely black closed broken line of segments, each of them passing through every one of the $n$ points exactly once. It is known that the segments $AB$ and $BC$ are white. Prove that it is possible to recolor the segments in red and blue in such a way that $AB$ and $BC$ are recolored as red, [hide=not all of which segments are recolored red]meaning that recoloring every white as red and every black as blue is not acceptable[/hide], and that there exist a completely red as well as a completely blue closed broken line of segments, each of them passing through every one of the $n$ points exactly once.

Three faces of a tetrahedron are right triangles, while the fourth is not an obtuse triangle. [i](a) [/i]Prove that a necessary and sufficient condition for the fourth face to be a right triangle is that at some vertex exactly two angles are right. [i](b)[/i] Prove that if all the faces are right triangles, then the volume of the tetrahedron equals one -sixth the product of the three smallest edges not belonging to the same face.

In a triangle $ABC, D$ lies on $AB, E$ lies on $AC$ and $ \angle ABE = 30^o, \angle EBC = 50^o, \angle ACD = 20^o$, $\angle DCB = 60^o$. Find $\angle EDC$.

Prove that in a plane, arbitrary $ n$ points can be overlapped by discs that the sum of all the diameters is less than $ n$, and the distances between arbitrary two are greater than $ 1$. (where the distances between two discs that have no common points are defined as that the distances between its centers subtract the sum of its radii; the distances between two discs that have common points are zero)

Which fractions $ \dfrac{p}{q},$ where $p,q$ are positive integers $< 100$, is closest to $\sqrt{2} ?$ Find all digits after the point in decimal representation of that fraction which coincide with digits in decimal representation of $\sqrt{2}$ (without using any table).

Let $ABC$ be an acute triangle with circumcenter $O$ such that $AB=4$, $AC=5$, and $BC=6$. Let $D$ be the foot of the altitude from $A$ to $BC$, and $E$ be the intersection of $AO$ with $BC$. Suppose that $X$ is on $BC$ between $D$ and $E$ such that there is a point $Y$ on $AD$ satisfying $XY\parallel AO$ and $YO\perp AX$. Determine the length of $BX$.