Rombus ABCD with acute angle $B$ is given. $O$ is a circumcenter of $ABC$. Point $P$ lies on line $OC$ beyond $C$. $PD$ intersect the line that goes through $O$ and parallel to $AB$ at $Q$. Prove that $\angle AQO=\angle PBC$.

Let $x_0,x_1,\dots, x_{n-1}$ be real numbers such that $0<|x_0|<|x_1|<\dots<|x_{n-1}|$. We will write the sum of the elements of each one of the $2^n$ subsets of $\{x_0,x_1,\dots,x_{n-1}\}$ in a paper. Prove that the $2^n$ written numbers are consecutive elements of a arithmetic progression if and only if the ratios $$|\frac{x_i}{x_j}|, 0\leq j<i\leq n-1$$ are equal(s) to the ratio(s) obtained with the numbers $2^0,2^1,\dots,2^{n-1}$. Note: The sum of the elements of the empty set is $0$.

Find all functions $f$ from the set of real numbers to itself satisfying \[ f(x(1+y)) = f(x)(1 + f(y)) \] for all real numbers $x, y$.

Let set $S$ contain all positive integers that are one less than a perfect square. Find the sum of all powers of $2$ that can be expressed as the product of two (not necessarily distinct) members of $S.$ [i]Proposed by Alex Li[/i]

In triangle $ABC$, point $O$ is the center of the excircle touching the side $BC$, while the other two excircles touch the sides $AB$ and $AC$ at points $M$ and $N$ respectively. A line through $O$ perpendicular to $MN$ intersects the line $BC$ at $P$. Determine the ratio $AB/AC$, given that the ratio of the area of $\triangle ABC$ to the area of $\triangle MNP$ is $2R/r$, where $R$ is the circumradius and $r$ the inradius of $\triangle ABC$.

A segment of length $\sqrt2 + \sqrt3 + \sqrt5$ is drawn. Is it possible to draw a segment of unit length using a compass and a straightedge? [i](3 points)[/i]

The infinite sequence $P_0(x),P_1(x),P_2(x),\ldots,P_n(x),\ldots$ is defined as \[P_0(x)=x,\quad P_n(x) = P_{n-1}(x-1)\cdot P_{n-1}(x+1),\quad n\ge 1.\] Find the largest $k$ such that $P_{2014}(x)$ is divisible by $x^k$.

Let $ABC$ be a triangle. The points $K, L,$ and $M$ lie on the segments $BC, CA,$ and $AB,$ respectively, such that the lines $AK, BL,$ and $CM$ intersect in a common point. Prove that it is possible to choose two of the triangles $ALM, BMK,$ and $CKL$ whose inradii sum up to at least the inradius of the triangle $ABC$. [i]Proposed by Estonia[/i]

Let \( H \) be the orthocenter, and \( O \) be the circumcenter of \( \triangle ABC \). The line \( AH \) intersects the circumcircle of \( \triangle ABC \) at point \( N \) for the second time. The circumcircle of \( \triangle BOC \), with center at point \( Q \), intersects the line \( OH \) at point \( X \) for the second time. Prove that the points \( O, Q, N, X \) lie on the same circle. [i]Proposed by Matthew Kurskyi[/i]

For positive integers $x$, let$$f(x)=\begin{cases} \frac{f\left(\frac{x}{2}\right)}{2} &\mbox{if }x\mbox{ is even,} \\ 2^{-x} &\mbox{if }x\mbox{ is odd.} \end{cases}$$Find $f(1)+f(2)+f(3)+\dots$.

Each of $K$ friends simultaneously learns one different item of news. They begin to phone one another to tell them their news. Each conversation lasts exactly one hour, during which time it is possible for two friends to tell each other all of their news. What is the minimum number of hours needed in order for all of the friends to know all of the news? Consider in this problem: (a) $K = 64$. (b) $K = 55$. (c) $K = 100$. (A Andjans, Riga) PS. (a) was the junior problem, (a),(b),(c) the senior one

A convex polyhedron has $m$ triangular faces (there can be faces of other kind too). From each vertex there are exactly 4 edges. Find the least possible value of $m$.

Medians $AA_1, BB_1, CC_1$ and altitudes $AA_2, BB_2, CC_2$ are drawn in triangle $ABC$ . Prove that the length of the broken line $A_1B_2C_1A_2B_1C_2A_1$ is equal to the perimeter of triangle $ABC$.

Let $n$ be a positive integer. $S$ is a set of points such that the points in $S$ are arranged in a regular $2016$-simplex grid, with an edge of the simplex having $n$ points in $S$. (For example, the $2$-dimensional analog would have $\dfrac{n(n+1)}{2}$ points arranged in an equilateral triangle grid). Each point in $S$ is labeled with a real number such that the following conditions hold: (a) Not all the points in $S$ are labeled with $0$. (b) If $\ell$ is a line that is parallel to an edge of the simplex and that passes through at least one point in $S$, then the labels of all the points in $S$ that are on $\ell$ add to $0$. (c) The labels of the points in $S$ are symmetric along any such line $\ell$. Find the smallest positive integer $n$ such that this is possible. Note: A regular $2016$-simplex has $2017$ vertices in $2016$-dimensional space such that the distances between every pair of vertices are equal. [i]Proposed by James Lin[/i]

A country has 1001 cities, and each two cities are connected by a one-way street. From each city exactly 500 roads begin, and in each city 500 roads end. Now an independent republic splits itself off the country, which contains 668 of the 1001 cities. Prove that one can reach every other city of the republic from each city of this republic without being forced to leave the republic.

Call an $n$-tuple $(a_1, . . . , a_n)$ [i]occasionally periodic [/i] if there exist a nonnegative integer $i$ and a positive integer $p$ satisfying $i + 2p \le n$ and $a_{i+j} = a_{i+p+j}$ for every $j = 1, 2, . . . , p$. Let $k$ be a positive integer. Find the least positive integer $n$ for which there exists an $n$-tuple $(a_1, . . . , a_n)$ with elements from set $\{1, 2, . . . , k\}$, which is not occasionally periodic but whose arbitrary extension $(a_1, . . . , a_n, a_{n+1})$ is occasionally periodic for any $a_{n+1} \in \{1, 2, . . . , k\}$.