Let $ABC$ be an acute-angled triangle in which no two sides have the same length. The reflections of the centroid $G$ and the circumcentre $O$ of $ABC$ in its sides $BC,CA,AB$ are denoted by $G_1,G_2,G_3$ and $O_1,O_2,O_3$, respectively. Show that the circumcircles of triangles $G_1G_2C$, $G_1G_3B$, $G_2G_3A$, $O_1O_2C$, $O_1O_3B$, $O_2O_3A$ and $ABC$ have a common point. [i]The centroid of a triangle is the intersection point of the three medians. A median is a line connecting a vertex of the triangle to the midpoint of the opposite side.[/i]

Let $M = F_1\times\cdots\times F_k$ be the product of $k$ smooth, closed surfaces (2-dimensional, $C^\infty$, compact, connected, manifold without boundary), $s$ of which are non-orientable. Prove that $M$ can be embedded in $\mathbb{R}^{2k+s+1}$.

Triangle $ABC$ has an obtuse angle at $\angle A$. Points $D$ and $E$ are placed on $\overline{BC}$ in the order $B$, $D$, $E$, $C$ such that $\angle BAD=\angle BCA$ and $\angle CAE=\angle CBA$. If $AB=10$, $AC=11$, and $DE=4$, determine $BC$.

Find the angle $\angle A$ of a triangle $ABC$, when we know it's altitudes $BD$ and $CE$ intersect in an interior point $H$ of the triangle and $BH=2HD$ and $CH=HE$.

Let $r$ be the result of doubling both the base and exponent of $a^b$, $b\neq 0$. If $r$ equals the product of $a^b$ by $x^b$, then $x$ equals: ${{ \textbf{(A)} a\qquad\textbf{(B)}\ 2a \qquad\textbf{(C)}\ 4a \qquad\textbf{(D)}\ 2}\qquad\textbf{(E)}\ 4} $

[u]Round 5[/u] [b]p13.[/b] Initially, the three numbers $20$, $201$, and $2016$ are written on a blackboard. Each minute, Zhuo selects two of the numbers on the board and adds $1$ to each. Find the minimum $n$ for which Zhuo can make all three numbers equal to $n$. [b]p14.[/b] Call a three-letter string rearrangeable if, when the first letter is moved to the end, the resulting string comes later alphabetically than the original string. For example, $AAA$ and $BAA$ are not rearrangeable, while $ABB$ is rearrangeable. How many three-letters strings with (not necessarily distinct) uppercase letters are rearrangeable? [b]p15.[/b] Triangle $ABC$ is an isosceles right triangle with $\angle C = 90^o$ and $AC = 1$. Points $D$, $E$ and $F$ are chosen on sides $BC$,$CA$ and $AB$, respectively, such that $AEF$, $BFD$, $CDE$, and $DEF$ are isosceles right triangles. Find the sum of all distinct possible lengths of segment $DE$. [u]Round 6[/u] [b]p16.[/b] Let $p, q$, and $r$ be prime numbers such that $pqr = 17(p + q + r)$. Find the value of the product $pqr$. [b]p17.[/b] A cylindrical cup containing some water is tilted $45$ degrees from the vertical. The point on the surface of the water closest to the bottom of the cup is $6$ units away. The point on the surface of the water farthest from the bottom of the cup is $10$ units away. Compute the volume of the water in the cup. [b]p18.[/b] Each dot in an equilateral triangular grid with $63$ rows and $2016 = \frac12 \cdot 63 \cdot 64$ dots is colored black or white. Every unit equilateral triangle with three dots has the property that exactly one of its vertices is colored black. Find all possible values of the number of black dots in the grid. [u]Round 7[/u] [b]p19.[/b] Tomasz starts with the number $2$. Each minute, he either adds $2$ to his number, subtracts $2$ from his number, multiplies his number by $2$, or divides his number by $2$. Find the minimum number of minutes he will need in order to make his number equal $2016$. [b]p20.[/b] The edges of a regular octahedron $ABCDEF$ are painted with $3$ distinct colors such that no two edges with the same color lie on the same face. In how many ways can the octahedron be painted? Colorings are considered different under rotation or reflection. [b]p21.[/b] Jacob is trapped inside an equilateral triangle $ABC$ and must visit each edge of triangle $ABC$ at least once. (Visiting an edge means reaching a point on the edge.) His distances to sides $AB$, $BC$, and $CA$ are currently $3$, $4$, and $5$, respectively. If he does not need to return to his starting point, compute the least possible distance that Jacob must travel. [u]Round 8[/u] [b]p22.[/b] Four integers $a, b, c$, and $d$ with a $\le b \le c \le d$ satisfy the property that the product of any two of them is equal to the sum of the other two. Given that the four numbers are not all equal, determine the $4$-tuple $(a, b, c, d)$. [b]p23.[/b] In equilateral triangle $ABC$, points $D$,$E$, and $F$ lie on sides $BC$,$CA$ and $AB$, respectively, such that $BD = 4$ and $CD = 5$. If $DEF$ is an isosceles right triangle with right angle at $D$, compute $EA + FA$. [b]p24.[/b] On each edge of a regular tetrahedron, four points that separate the edge into five equal segments are marked. There are sixteen planes that are parallel to a face of the tetrahedron and pass through exactly three of the marked points. When the tetrahedron is cut along each of these sixteen planes, how many new tetrahedrons are produced? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2934049p26256220]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $f : \mathbb{Z} \to\mathbb{ Z}$ such that \[ n^2+4f(n)=f(f(n))^2 \] for all $n\in \mathbb{Z}$. [i]Proposed by Sahl Khan, UK[/i]

The sum of the first 2011 terms of a geometric series is 200. The sum of the first 4022 terms of the same series is 380. Find the sum of the first 6033 terms of the series.

Crisp All, a basketball player, is [i]dropping dimes[/i] and nickels on a number line. Crisp drops a dime on every positive multiple of $10$, and a nickel on every multiple of $5$ that is not a multiple of $10$. Crisp then starts at $0$. Every second, he has a $\frac{2}{3}$ chance of jumping from his current location $x$ to $x+3$, and a $\frac{1}{3}$ chance of jumping from his current location $x$ to $x+7$. When Crisp jumps on either a dime or a nickel, he stops jumping. What is the probability that Crisp [i]stops on a dime[/i]?

Let $ x_1, x_2, ..., x_5$ be a non-negative real numbers such that $ x_1 \plus{} x_2 \plus{} \cdots \plus{} x_5 \equal{} 100.$ Let $ M$ be a maximum of the numbers $ x_1 \plus{} x_2, x_2 \plus{} x_3, x_3 \plus{} x_4,$ and $ x_4 \plus{} x_5$. The least possible value of $ M$ lies in the interval A. [0,32) B. [32, 34) C. [34, 36) D. [36, 38) E. [38, 40]

Find the last three digits of the sum of all the real values of $m$ such that the ellipse $x^2+xy+y^2=m$ intersects the hyperbola $xy=n$ only at its two vertices, as $n$ ranges over all non-zero integers $-81\le n \le 81$. [i]Proposed by [b]AOPS12142015[/b][/i]

Is there an infinite sequence of positive real numbers $x_1,x_2,...,x_n$ satisfying for all $n\ge 1$ the relation $x_{n+2}= \sqrt{x_{n+1}}-\sqrt{x_n}$?

The National Foundation of Happiness (NFoH) wants to estimate the happiness of people of country. NFoH selected $n$ random persons, and on every morning asked from each of them whether she is happy or not. On any two distinct days, exactly half of the persons gave the same answer. Show that after $k$ days, there were at most $n-\frac{n}{k}$ persons whose “yes” answers equals their “no” answers.

Find the least prime factor of $2024^{2024}-1$.

Two magicians are performing the following game. Initially the first magician encloses the second magician in a cabin where he can neither see nor hear anything. To start the game, the first magician invites Daniel, from the audience, to put on each square of a chessboard $n \times n$, at his (Daniel's) discretion, a token black or white. Then the first magician asks Daniel to show him a square $C$ of his own choice. At this point, the first magician chooses a square $D$ (not necessarily different from $C$) and replaces the token that is on $D$ with other color token (white with black or black with white). Then he opens the cabin in which the second magician was held. Looking at the chessboard, the second magician guesses what is the square $C$. For what value of $n$, the two magicians have a strategy such that the second magician makes a successful guess.

Find all functions $f : Z \to Z$ such that $x f (2f (y) - x) + y^2 f (2x - f (y)) = \frac{(f (x))^2}{x} + f (y f (y))$ , for all $x, y \in Z$, $x \ne 0$.

Given a matrix $\{a_{ij}\}_{i,j=0}^{9}$, $a_{ij}=10i+j+1$. Andrei is going to cover its entries by $50$ rectangles $1\times 2$ (each such rectangle contains two adjacent entries) so that the sum of $50$ products in these rectangles is minimal possible. Help him. [i]A. Badzyan[/i]

Find all prime numbers $p$, for which the number $p + 1$ is equal to the product of all the prime numbers which are smaller than $p$.

Each square of a chessboard is painted either blue or red . Prove that the squares of one colour possess the property that the chess queen can perform a tour of all of them. The rules are that the queen may visit the squares of this colour not necessarily only once each , and may not be placed on squares of the other colour, although she may pass over them ; the queen moves along any horizontal , vertical or diagonal file over any distance. (A . K . Tolpugo , Kiev)

Are there any rational numbers $x,y$ with $x^2 + y^2 = 2015$?

Consider an equilateral triangle $\vartriangle ABC$ of side length $4$. In the zeroth iteration, draw a circle $\Omega_0$ tangent to all three sides of the triangle. In the first iteration, draw circles $\Omega_{1A}$,$ \Omega_{1B}$, $\Omega_{1C}$ such that circle $\Omega_{1v}$ is externally tangent to $\Omega_0$ and tangent to the two sides that meet at vertex $v$ (for example, $\Omega_{1A}$ would be tangent to $\Omega_0$ and sides $AB$, $AC$). In the nth iteration, draw circle $\Omega_{n,v}$ externally tangent to $\Omega_{n-1,v}$ and the two sides that meet at vertex $v$. Compute the total area of all the drawn circles as the number of iterations approaches infinity.

Find all triples $(a, b, c)$ of positive integers for which $a + [a, b] = b + [b, c] = c + [c, a]$. Here $[a, b]$ denotes the least common multiple of integers $a, b$. [i](Proposed by Mykhailo Shtandenko)[/i]

Let $ P(x) \equal{} (x \minus{} 1)(x \minus{} 2)(x \minus{} 3)$. For how many polynomials $ Q(x)$ does there exist a polynomial $ R(x)$ of degree 3 such that $ P(Q(x)) \equal{} P(x) \cdot R(x)$? $ \textbf{(A)}\ 19\qquad \textbf{(B)}\ 22\qquad \textbf{(C)}\ 24\qquad \textbf{(D)}\ 27\qquad \textbf{(E)}\ 32$

$ABCD$ is a cyclic quadrilateral in which $AB=4$, $BC=3$, $CD=2$, and $AD=5$. Diagonals $AC$ and $BD$ intersect at $X$. A circle $\omega$ passes through $A$ and is tangent to $BD$ at $X$. $\omega$ intersects $AB$ and $AD$ at $Y$ and $Z$ respectively. Compute $YZ/BD$.

Consider any rectangular table having finitely many rows and columns, with a real number $a(r, c)$ in the cell in row $r$ and column $c$. A pair $(R, C)$, where $R$ is a set of rows and $C$ a set of columns, is called a [i]saddle pair[/i] if the following two conditions are satisfied: [list] [*] $(i)$ For each row $r^{\prime}$, there is $r \in R$ such that $a(r, c) \geqslant a\left(r^{\prime}, c\right)$ for all $c \in C$; [*] $(ii)$ For each column $c^{\prime}$, there is $c \in C$ such that $a(r, c) \leqslant a\left(r, c^{\prime}\right)$ for all $r \in R$. [/list] A saddle pair $(R, C)$ is called a [i]minimal pair[/i] if for each saddle pair $\left(R^{\prime}, C^{\prime}\right)$ with $R^{\prime} \subseteq R$ and $C^{\prime} \subseteq C$, we have $R^{\prime}=R$ and $C^{\prime}=C$. Prove that any two minimal pairs contain the same number of rows.