Let $ABC$ be an acute-angled triangle, with $AC \neq BC$ and let $O$ be its circumcenter. Let $P$ and $Q$ be points such that $BOAP$ and $COPQ$ are parallelograms. Show that $Q$ is the orthocenter of $ABC$.

An integer $n$ is said to be [i]good[/i] if $|n|$ is not the square of an integer. Determine all integers $m$ with the following property: $m$ can be represented, in infinitely many ways, as a sum of three distinct good integers whose product is the square of an odd integer. [i]Proposed by Hojoo Lee, Korea[/i]

Show that for every integer $n \ge 3$ there exists positive integers $x_1, x_2, . . . , x_n$, pairwise different, so that $\{2, n\} \subset \{x_1, x_2, . . . , x_n\}$ and $$\frac{1}{x_1}+\frac{1}{x_2}+.. +\frac{1}{x_n}= 1.$$

Seven triangles of area $7$ lie in a square of area $27$. Prove that among the $7$ triangles there are $2$ that intersect in a region of area not less than $1$.

Find the largest $ 85$-digit integer which has property: the sum of its digits equals to the product of its digits.

Prove that if $n$ is a positive integer such that the equation \[x^{3}-3xy^{2}+y^{3}=n.\] has a solution in integers $(x,y),$ then it has at least three such solutions. Show that the equation has no solutions in integers when $n=2891$.

Let triangle $ABC$ be an acute triangle with $AB\neq AC$. The bisector of $BC$ intersects the lines $AB$ and $AC$ at points $F$ and $E$, respectively. The circumcircle of triangle $AEF$ has center $P$ and intersects the circumcircle of triangle $ABC$ at point $D$ with $D$ different to $A$. Prove that the line $PD$ is tangent to the circumcircle of triangle $ABC$.

Let $N_0$ denote the set of nonnegative integers and $Z$ the set of all integers. Let a function $f : N_0 \times Z \to Z$ satisfy the conditions (i) $f(0, 0) = 1$, $f(0, 1) = 1$ (ii) for all $k, k \ne 0, k \ne 1$, $f(0, k) = 0$ and (iii) for all $n \ge 1$ and $k, f(n, k) = f(n -1, k) + f(n- 1, k - 2n)$. Find the value of $$\sum_{k=0}^{2009 \choose 2} f(2008, k)$$

A pizza is divided into six slices. Each slice contains one olive. One plays the following game. At each move it is allowed to move an olive on a neighboring slice. Is it possible to bring all the olives on one slice by exactly $20$ moves?

Do integers $a, b$ exist such that $a^{2006} + b^{2006} + 1$ is divisible by $2006^2$?

For any $a$, $b$, $c > 0$ and for any $n \in \mathbb{N}^*$, prove the inequality$$(a - b)\left(\frac{a}{b}\right)^n+(b - c)\left(\frac{b}{c}\right)^n+(c - a)\left(\frac{c}{a}\right)^n\geq (a - b)\frac{a}{b}+(b - c)\frac{b}{c}+(c - a)\frac{c}{a}$$

Let $P$ and $Q$ be points on a circle $k$. A chord $AC$ of $k$ passes through the midpoint $M$ of $PQ$. Consider a trapezoid $ABCD$ inscribed in $k$ with $AB \parallel PQ \parallel CD$. Prove that the intersection point $X$ of $AD$ and $BC$ depends only on $k$ and $P,Q.$

16 NHL teams in the first playoff round divided in pairs and to play series until 4 wins (thus the series could finish with score 4-0, 4-1, 4-2, or 4-3). After that 8 winners of the series play the second playoff round divided into 4 pairs to play series until 4 wins, and so on. After all the final round is over, it happens that $k$ teams have non-negative balance of wins (for example, the team that won in the first round with a score of 4-2 and lost in the second with a score of 4-3 fits the condition: it has $4+3=7$ wins and $2+4=6$ losses). Find the least possible $k$.

Do the medians of a triangle meet in a single point in the Lobachevskii plane? What about the altitudes?

Let $ R_1,R_2, \ldots$ be the family of finite sequences of positive integers defined by the following rules: $ R_1 \equal{} (1),$ and if $ R_{n - 1} \equal{} (x_1, \ldots, x_s),$ then \[ R_n \equal{} (1, 2, \ldots, x_1, 1, 2, \ldots, x_2, \ldots, 1, 2, \ldots, x_s, n).\] For example, $ R_2 \equal{} (1, 2),$ $ R_3 \equal{} (1, 1, 2, 3),$ $ R_4 \equal{} (1, 1, 1, 2, 1, 2, 3, 4).$ Prove that if $ n > 1,$ then the $ k$th term from the left in $ R_n$ is equal to 1 if and only if the $ k$th term from the right in $ R_n$ is different from 1.

An alphabet has $n$ letters. A word is called [i]differentiated [/i] if it has the following property fulfilled: No letter occurs more than once between two identical letters. For example with the alphabet $\{a, b, c, d\}$ the word [i]abbdacbdd [/i] is not, the word [i]bbacbadcdd [/i] is differentiated. (a) Each differentiated word has a maximum of $3n$ letters. (b) How many differentiated words with exactly $3n$ letters are ther

Evaluate: \[\frac{1}{\log_2 (\frac{1}{6})} - \frac{1}{\log_3 (\frac{1}{6})} - \frac{1}{\log_4 (\frac{1}{6})}\]

Convex quadrilateral $ABCD$ satisfies $\angle{CAB} = \angle{ADB} = 30^{\circ}, \angle{ABD} = 77^{\circ}, BC = CD$ and $\angle{BCD} =n^{\circ}$ for some positive integer $n$. Compute $n$.

For $ x \ge 0$ the smallest value of $ \frac {4x^2 \plus{} 8x \plus{} 13}{6(1 \plus{} x)}$ is: $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ \frac {25}{12} \qquad \textbf{(D)}\ \frac {13}{6} \qquad \textbf{(E)}\ \frac {34}{5}$

Let $S$ be a string of $99$ characters, $66$ of which are $A$ and $33$ are $B$. We call $S$ [i]good[/i] if, for each $n$ such that $1\le n \le 99$, the sub-string made from the first $n$ characters of $S$ has an odd number of distinct permutations. How many good strings are there? Which strings are good?

The function $f: N \to N_0$ is such that $f (2) = 0, f (3)> 0, f (6042) = 2014$ and $f (m + n)- f (m) - f (n) \in\{0,1\}$ for all $m,n \in N$. Determine $f (2014)$. $N_0=\{0,1,2,...\}$

Suppose $a_i, b_i, c_i, i=1,2,\cdots ,n$, are $3n$ real numbers in the interval $\left [ 0,1 \right ].$ Define $$S=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k<1 \right \}, \; \; T=\left \{ \left ( i,j,k \right ) |\, a_i+b_j+c_k>2 \right \}.$$ Now we know that $\left | S \right |\ge 2018,\, \left | T \right |\ge 2018.$ Try to find the minimal possible value of $n$.

The real numbers $a_0, a_1, ... , a_{n+1}$ satisfy $a_0 = a_{n+1} = 0$ and $|a_{k-1} - 2a_k + a_{k+1}| \le 1$ for $k = 1, 2, ... , n$. Show that $|a_k| \le \frac{ k(n + 1 - k)}{2}$ for all $k$.

Let $P(x),\ Q(x)$ be polynomials such that : \[\int_0^2 \{P(x)\}^2dx=14,\ \int_0^2 P(x)dx=4,\ \int_0^2 \{Q(x)\}^2dx=26,\ \int_0^2 Q(x)dx=2.\] Find the maximum and the minimum value of $\int_0^2 P(x)Q(x)dx$.

Tiles I, II, III and IV are translated so one tile coincides with each of the rectangles $A, B, C$ and $D$. In the final arrangement, the two numbers on any side common to two adjacent tiles must be the same. Which of the tiles is translated to Rectangle $C$? [asy] size(400); defaultpen(linewidth(0.8)); path p=origin--(8,0)--(8,6)--(0,6)--cycle; draw(p^^shift(8.5,0)*p^^shift(8.5,10)*p^^shift(0,10)*p); draw(shift(20,2)*p^^shift(28,2)*p^^shift(20,8)*p^^shift(28,8)*p); label("8", (4,6+10), S); label("6", (4+8.5,6+10), S); label("7", (4,6), S); label("2", (4+8.5,6), S); label("I", (4,6+10), N); label("II", (4+8.5,6+10), N); label("III", (4,6), N); label("IV", (4+8.5,6), N); label("3", (0,3+10), E); label("4", (0+8.5,3+10), E); label("1", (0,3), E); label("9", (0+8.5,3), E); label("7", (4,10), N); label("2", (4+8.5,10), N); label("0", (4,0), N); label("6", (4+8.5,0), N); label("9", (8,3+10), W); label("3", (8+8.5,3+10), W); label("5", (8,3), W); label("1", (8+8.5,3), W); label("A", (24,10), N); label("B", (32,10), N); label("C", (24,4), N); label("D", (32,4), N); [/asy] $\mathrm{(A)}\ I \qquad \mathrm{(B)}\ II \qquad \mathrm{(C)}\ III \qquad \mathrm{(D)}\ IV \qquad \mathrm{(E)}\text{ cannot be determined}$