Let $P$ be an interior point of acute triangle $\Delta ABC$, which is different from the orthocenter. Let $D$ and $E$ be the feet of altitudes from $A$ to $BP$ and $CP$, and let $F$ and $G$ be the feet of the altitudes from $P$ to sides $AB$ and $AC$. Denote by $X$ the midpoint of $[AP]$, and let the second intersection of the circumcircles of triangles $\Delta DFX$ and $\Delta EGX$ lie on $BC$. Prove that $AP$ is perpendicular to $BC$ or $\angle PBA = \angle PCA$.

Prove that in a tournament with 799 teams, there exist 14 teams, that can be partitioned into groups in a way that all of the teams in the first group have won all of the teams in the second group.

Prove that the equation \[ x^n + 1 = y^{n+1}, \] where $n$ is a positive integer not smaller then 2, has no positive integer solutions in $x$ and $y$ for which $x$ and $n+1$ are relatively prime.

Let $a, b, c$ be positive reals. Prove that $$\left(\frac{a}{a+b}\right)^2+\left(\frac{b}{b+c}\right)^2+\left(\frac{c}{c+a}\right)^2\ge \frac34$$

(a) Let $u$ and $v$ be two nilpotent elements in a commutative ring (with or without unity). Prove that $u+v$ is also nilpotent. (b) Show an example of a (non-commutative) ring $R$ and nilpotent elements $u,v\in R$ such that $u+v$ is not nilpotent.

Let $ a, b, c, r,$ and $ s$ be real numbers. Show that if $ r$ is a root of $ ax^2\plus{}bx\plus{}c \equal{} 0$ and s is a root of $ \minus{}ax^2\plus{}bx\plus{}c \equal{} 0,$ then \[ \frac{a}{2} x^2 \plus{} bx \plus{} c \equal{} 0\] has a root between $ r$ and $ s.$

A sequence $a_1, a_2, a_3, . . . , a_{100}$ of $100$ (not necessarily distinct) positive numbers satisfy that the$ 99$ fractions$$\frac{a_1}{a_2},\frac{a_2}{a_3},\frac{a3}{a_4}, ... ,\frac{a_{99}}{a_{100}}$$ are all distinct. How many distinct numbers must there be, at least, in the sequence $a_1, a_2, a_3, . . . , a_{100}$?

Let $S_1$ be the area of the regular pentagon $ABCDE$. And let $S_2$ be the area of the regular pentagon whose sides lie on the lines $AC, CE, EB, BD, DA$. What is values of $\frac{S_1}{S_2}$ ? $\textbf{(A)}\ \frac{41}{6} \qquad\textbf{(B)}\ \frac{3+5\sqrt5}{2} \qquad\textbf{(C)}\ 4+\sqrt5 \qquad\textbf{(D)}\ \frac{7+3\sqrt5}2 \qquad\textbf{(E)}\ \text{None}$

Let sequences of real numbers $(x_n)$ and $(y_n)$ satisfy $x_1 = y_1 = 1$ and $x_{n+1} =\frac{x_n + 2}{x_n + 1}$ and $y_{n+1} = \frac{y_n^2 + 2}{2y_n}$ for $n = 1,2, ...$ Prove that $y_{n+1} = x_{2^n}$ holds for $n =0, 1,2, ... $

Show that: 1) If $2n-1$ is a prime number, then for any $n$ pairwise distinct positive integers $a_1, a_2, \ldots , a_n$, there exists $i, j \in \{1, 2, \ldots , n\}$ such that \[\frac{a_i+a_j}{(a_i,a_j)} \geq 2n-1\] 2) If $2n-1$ is a composite number, then there exists $n$ pairwise distinct positive integers $a_1, a_2, \ldots , a_n$, such that for any $i, j \in \{1, 2, \ldots , n\}$ we have \[\frac{a_i+a_j}{(a_i,a_j)} < 2n-1\] Here $(x,y)$ denotes the greatest common divisor of $x,y$.

On a highway, a pedestrian and a cyclist were going in the same direction, while a cart and a car were coming from the opposite direction. All were travelling at different constant speeds. The cyclist caught up with the pedestrian at $10$ o'clock. After a time interval, she met the cart, and after another time interval equal to the first, she met the car. After a third time interval, the car met the pedestrian, and after another time interval equal to the third, the car caught up with the cart. If the pedestrian met the car at $11$ o'clock, when did he meet the cart?

Let $a$ be a positive number. Assume that the parameterized curve $C: \ x=t+e^{at},\ y=-t+e^{at}\ (-\infty <t< \infty)$ is touched to $x$ axis. (1) Find the value of $a.$ (2) Find the area of the part which is surrounded by two straight lines $y=0, y=x$ and the curve $C.$

Two circles are given in the plane, $\Omega$ and inside it $\omega$. The center of $\omega$ is $I$. $P$ is a point moving on $\Omega$. The second intersection of the tangents from $P$ to $\omega$ and circle $\Omega$ are $Q$ and $R.$ The second intersection of circle $IQR$ and lines $PI$, $PQ$ and $PR$ are $J$, $S$ and $T,$ respectively. The reflection of point $J$ across line $ST$ is $K.$ Prove that lines $PK$ are concurrent.

Let $ A,B$ denote two distinct fixed points in space. Let $ X, P$ denote variable points (in space), while $ K,N, n$ denote positive integers. Call $ (X,K,N,P)$ admissible if \[ (N \minus{} K) \cdot PA \plus{} K \cdot PB \geq N \cdot PX.\] Call $ (X,K,N)$ admissible if $ (X,K,N,P)$ is admissible for all choices of $ P.$ Call $ (X,N)$ admissible if $ (X,K,N)$ is admissible for some choice of $ K$ in the interval $ 0 < K < N.$ Finally, call $ X$ admissible if $ (X,N)$ is admissible for some choice of $ N, (N > 1).$ Determine: [b](a)[/b] the set of admissible $ X;$ [b](b)[/b] the set of $ X$ for which $ (X, 1989)$ is admissible but not $ (X, n), n < 1989.$

Determine the remainder when $$\sum_{i=0}^{2015} \left\lfloor \frac{2^i}{25} \right\rfloor$$ is divided by 100, where $\lfloor x \rfloor$ denotes the largest integer not greater than $x$.

If $3x^3-9x^2+kx-12$ is divisible by $x-3$, then it is also divisible by: ${{ \textbf{(A)}\ 3x^2-x+4 \qquad\textbf{(B)}\ 3x^2-4 \qquad\textbf{(C)}\ 3x^2+4 \qquad\textbf{(D)}\ 3x-4 }\qquad\textbf{(E)}\ 3x+4 } $

(a) On each square of a squared sheet of paper of size $20 \times 20$ there is a soldier. Vanya chooses a number $d$ and Petya moves the soldiers to new squares in such a way that each soldier is moved through a distance of at least $d$ (the distance being measured between the centres of the initial and the new squares) and each square is occupied by exactly one soldier. For which $d$ is this possible? (Give the maximum possible $d$, prove that it is possible to move the soldiers through distances not less than $d$ and prove that there is no greater $d$ for which this procedure may be carried out.) (b) Answer the same question as (a), but with a sheet of size $21 \times 21$. (SS Krotov, Moscow)

If $ x$, $ y$, $ z$, and $ n$ are natural numbers, and $ n\geq z$ then prove that the relation $ x^n \plus{} y^n \equal{} z^n$ does not hold.

A positive integer is called [i]digit-reduced[/i] if at most nine different digits occur in its decimal representation (leading $0$s are omitted.) Let $M$ be a finite set of [i]digit-reduced[/i] numbers. Show that the sum of the reciprocals of the elements in $M$ is less than $180$.

Let $C_1$ and $C_2$ be two concentric circles with $C_1$ inside $C_2$. Let $P_1$ and $P_2$ be two points on $C_1$ that are not diametrically opposite. Extend the segment $P_1P_2$ past $P_2$ until it meets the circle $C_2$ in $Q_2$. The tangent to $C_2$ at $Q_2$ and the tangent to $C_1$ at $P_1$ meet in a point $X$. Draw from X the second tangent to $C_2$ which meets $C_2$ at the point $Q_1$. Show that $P_1X$ bisects angle $Q_1P_1Q_2$.

Let $o$, $r$, $g$, $t$, $n$, $i$, $z$, $e$, and $d$ be positive reals. Show that \[ \sqrt{(d+o+t+t+e+d)(o+r+z+i+n+g)} > \sqrt{ti} + \sqrt{go} + \sqrt[6]{orz}. \] when $d^2e \geq \tfrac{2}{1434}$. Proposed by [i]David Fox[/i]

Determine the number of ten-digit positive integers with the following properties: $\bullet$ Each of the digits $0, 1, 2, . . . , 8$ and $9$ is contained exactly once. $\bullet$ Each digit, except $9$, has a neighbouring digit that is larger than it. (Note. For example, in the number $1230$, the digits $1$ and $3$ are the neighbouring digits of $2$ while $2$ and $0$ are the neighbouring digits of $3$. The digits $1$ and $0$ have only one neighbouring digit.) [i](Karl Czakler)[/i]

Let $r > n$ be positive integers. A "good word" is an $n$-tuple $\langle a_1,\dots, a_n \rangle$ of distinct positive integers between 1 and $r$. A "play" consist of changing a integer $a_i$ of a good word, in such a way that the resulting word is still a good word. The distance between two good words $A= \langle a_1,\dots, a_n \rangle$ and $B = \langle b_1,\dots, b_n \rangle$ is the minimun number of plays needed to obtain B from A. Find the maximun posible distance between two good words.

Let $a, b, c$ and $d$ be positive real numbers. Prove that $$\frac{a - b}{b + c}+\frac{b - c}{c + d}+\frac{c - d}{d + a} +\frac{d - a}{a + b } \ge 0 $$

A positive integer $m$ has the property that $m^2$ is expressible in the form $4n^2-5n+16$ where $n$ is an integer (of any sign). Find the maximum value of $|m-n|.$