Mari and Yuri play the next play. At first, there are two piles on the table, with $m$ and $n$ candies, respectively. At each turn, players eats one pile of candy from the table and distribute another pile of candy into two non-empty parts ,. Everything is done in turn and wins the player who can no longer share the pile (when there is only one candy left). Which player will win if both use the optimal strategy and Mari makes the first move?

Suppose $a, b, c$ are complex numbers with $a + b + c = 0$, $a^2 + b^2 + c^2 = 0$, and $|a|,|b|,|c| \le 5$. Suppose further at least one of $a, b, c$ have real and imaginary parts that are both integers. Find the number of possibilities for such ordered triples $(a, b, c)$.

A connected checkered figure is drawn on a checkered paper. It is known that the figure can be cut both into $2\times 2$ squares and into (possibly rotated) [url=https://upload.wikimedia.org/wikipedia/commons/thumb/3/30/Tetromino-skew2.svg/1200px-Tetromino-skew2.svg.png]skew-tetrominoes[/url]. Prove that there is a hole in the figure. [i]Proposed by Y. Markelov and A. Sairanov[/i]

A game is played by $n$ girls ($n \geq 2$), everybody having a ball. Each of the $\binom{n}{2}$ pairs of players, is an arbitrary order, exchange the balls they have at the moment. The game is called nice [b]nice[/b] if at the end nobody has her own ball and it is called [b]tiresome[/b] if at the end everybody has her initial ball. Determine the values of $n$ for which there exists a nice game and those for which there exists a tiresome game.

There are some cities in both sides of a river and there are some sailing channels between the cities. Each sailing channel connects exactly one city from a side of the river to a city on the other side. Each city has exactly $k$ sailing channels. For every two cities, there's a way which connects them together. Prove that if we remove any (just one) sailing channel, then again for every two cities, there's a way that connect them together. $( k \geq 2)$

Find all pairs of prime numbers $p$ and $q$ such that: \[ p(p + q) = q^p+ 1. \]

Solve the system in reals: $\frac{4-a}{b}=\frac{5-b}{a}=\frac{10}{a^2+b^2}$.

A disk with radius $1$ is externally tangent to a disk with radius $5$. Let $A$ be the point where the disks are tangent, $C$ be the center of the smaller disk, and $E$ be the center of the larger disk. While the larger disk remains fixed, the smaller disk is allowed to roll along the outside of the larger disk until the smaller disk has turned through an angle of $360^\circ$. That is, if the center of the smaller disk has moved to the point $D$, and the point on the smaller disk that began at $A$ has now moved to point $B$, then $\overline{AC}$ is parallel to $\overline{BD}$. Then $\sin^2(\angle BEA)=\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Find all real solutions to \[x^{3}+3x-3+\ln{(x^{2}-x+1)}=y,\] \[y^{3}+3y-3+\ln{(y^{2}-y+1)}=z,\] \[z^{3}+3z-3+\ln{(z^{2}-z+1)}=x.\]

Two circles $\gamma_1$ and $\gamma_2$ cross one another at two points; let $A$ be one of these points. The tangent to $\gamma_1$ at $A$ meets again $\gamma_2$ at $B$, the tangent to $\gamma_2$ at $A$ meets again $\gamma_1$ at $C$, and the line $BC$ meets again $\gamma_1$ and $\gamma_2$ at $D_1$ and $D_2$, respectively. Let $E_1$ and $E_2$ be interior points of the segments $AD_1$ and $AD_2$, respectively, such that $AE_1 = AE_2$. The lines $BE_1$ and $AC$ meet at $M$, the lines $CE_2$ and $AB$ meet at $N$, and the lines $MN$ and $BC$ meet at $P$. Show that the line $PA$ is tangent to the circle $ABC$.

(a) Two identical cogwheels with $14$ teeth each are given . One is laid horizontally on top of the other in such a way that their teeth coincide (thus the projections of the teeth on the horizontal plane are identical ) . Four pairs of coinciding teeth are cut off. Is it always possible to rotate the two cogwheels with respect to each other so that their common projection looks like that of an entire cogwheel? (The cogwheels may be rotated about their common axis, but not turned over.) (b) Answer the same question , but with two $13$-tooth cogwheels and four pairs of cut-off teeth.

From a point $P$ outside a circle, two tangents are drawn touching the circle at points $A$ and $C$. Let $B$ be a point on segment $AC$, and let segment $PB$ intersect the circle at point $Q$. The angle bisector of $\angle AQC$ intersects segment $AC$ at $R$. Show that $$\frac{AB}{BC} =\left(\frac{ AR}{RC}\right)^2$$

The figure shows a $2\times 2$ grid that has been filled with the numbers $a, b, c$, and $d$. We say that this grid is [i]ordered[/i] if it is true that $a > b > c > d$ or that $a > d > c > b$. $\begin{tabular}{|l|l|} \hline a & b \\ \hline d & c \\ \hline \end{tabular}$ In how many ways can the numbers from $1$ to $1000$ be arranged in the cells of a $2 \times 500$ grid ($2$ rows and $500$ columns) so that each $2 \times 2$ sub-grid is ordered?

Let $f,g:\mathbb{R}\to\mathbb{R}$ be functions which satisfy \[\inf_{x>a}f(x)=g(a)\text{ and }\sup_{x<a}g(x)=f(a),\]for all $a\in\mathbb{R}.$ Given that $f$ has Darboux's Property (intermediate value property), show that functions $f$ and $g$ are continuous and equal to each other. [i]Mathematical Gazette [/i]

Find all monotonic functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ with the property that $$ (f(\sin x))^2-3f(x)=-2, $$ for any real numbers $ x. $ [i]Dorin Andrica[/i] and [i]Mihai Piticari[/i]

All internal angles of a convex octagon $ABCDEFGH$ are equal to each other and the edges are alternatively equal: $$AB = CD = EF = GH,BC = DE = FG = HA$$ (we call such an octagon semiregular). The diagonals $AD$, $BE$, $CF$, $DG$, $EH$, $FA$, $GB$ and $HC$ divide the inside of the octagon into certain parts. Consider the part containing the centre of the octagon. If that part is an octagon, then this central octagon is semiregular (this is obvious). In this case we construct similar diagonals in the central octagon and so on. If, after several steps, the central figure is not an octagon, then the process stops. Prove that if the process never stops, then the initial octagon was regular. (A. Tolpygo, Kiev)

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

Let $ D$ be an interior point of the side $ BC$ of a triangle $ ABC$, and let $ O_1$ and $ O_2$ be the circumcenters of triangles $ ABD$ and $ ADC$. The perpendicular bisector of the side $ AC$ meets the line $ AO_1$ at $ E$, and the perpendicular bisector of the side $ AB$ meets the line $ AO_2$ at $ F$. Prove that the bisectors of the angles $ \angle O_1EO_2$ and $ \angle O_1FO_2$ are orthogonal.

Determine the number of times and the positions in which it appears $\frac12$ in the following sequence of fractions: $$ \frac11, \frac21, \frac12 , \frac31 , \frac22 , \frac13 , \frac41,\frac32,\frac23,\frac14,..., \frac{1}{1992}$$

Each row of the Misty Moon Amphitheater has $ 33$ seats. Rows $ 12$ through $ 22$ are reserved for a youth club. How many seats are reserved for this club? $ \textbf{(A)}\ 297\qquad \textbf{(B)}\ 330\qquad \textbf{(C)}\ 363\qquad \textbf{(D)}\ 396\qquad \textbf{(E)}\ 726$

A ball $K$ of radius $r$ is touched from the outside by mutually equal balls of radius $R$. Two of these balls are tangent to each other. Moreover, for two balls $K_1$ and $K_2$ tangent to $K$ and tangent to each other there exist two other balls tangent to $K_1,K_2$ and also to $K$. How many balls are tangent to $K$? For a given $r$ determine $R$.

Let $G$ be a simple connected graph with $2016$ vertices and $k$ edges. We want to choose a set of vertices where there is no edge between them and delete all these chosen vertices (we delete both the vertices and all edges of these vertices) such that the remaining graph becomes unconnected. If we can do this task no matter how these $k$ edges are arranged (by making the graph connected), find the maximal value of $k$.

In the figure, the rectangle is formed by $4$ smaller equal rectangles. If we count the total number of rectangles in the figure we find $10$. How many rectangles in total will there be in a rectangle that is formed by $n$ smaller equal rectangles?

Let $ S $ be a nonempty subset of a finite group $ G, $ and $ \left( S^j \right)_{j\ge 1} $ be a sequence of sets defined as $ S^j=\left.\left\{\underbrace{xy\cdots z}_{\text{j terms}} \right| \underbrace{x,y,\cdots ,z}_{\text{j terms}} \in S \right\} . $ Prove that: [b]a)[/b] $ \exists i_0\in\mathbb{N}^*\quad i\ge i_0\implies \left| S^i\right| =\left| S^{1+i}\right| $ [b]b)[/b] $ S^{|G|}\le G $

Show that there are infinitely many perfect squares of the form $50^m-50^n$, but no perfect square of the form $2020^m+2020^n$, where $m$ and $n$ are positive integers.