Let $ ABC$ be an acute-angled triangle such that there exist points $ D,E,F$ on side $ BC,CA,AB$, respectively such that the inradii of triangle $ AEF,BDF,CDE$ are all equal to $ r_0$. If the inradii of triangle $ DEF$ and $ ABC$ are $ r$ and $ R$, respectively, prove that \[ r\plus{}r_0\equal{}R.\] [i]Soewono, Bandung[/i]

A right triangle and a circle are drawn such that the circle is tangent to the legs of the right triangle. The circle cuts the hypotenuse into three segments of lengths $1, 24,$ and $3,$ and the segment of length $24$ is a chord of the circle. Compute the area of the triangle.

Let $I$ be the incenter of triangle $ABC$. The tangent point of $\odot I$ on $AB,AC$ is $D,E$, respectively. Let $BI \cap AC = F$, $CI \cap AB = G$, $DE \cap BI = M$, $DE \cap CI = N$, $DE \cap FG = P$, $BC \cap IP = Q$. Prove that $BC = 2MN$ is equivalent to $IQ = 2IP$.

In a mathematical competition some competitors are friends. Friendship is always mutual. Call a group of competitors a [i]clique[/i] if each two of them are friends. (In particular, any group of fewer than two competitiors is a clique.) The number of members of a clique is called its [i]size[/i]. Given that, in this competition, the largest size of a clique is even, prove that the competitors can be arranged into two rooms such that the largest size of a clique contained in one room is the same as the largest size of a clique contained in the other room. [i]Author: Vasily Astakhov, Russia[/i]

Let $ n_1<n_2<n_3<\cdots <n_k$ be a set of positive integers. Prove that the polynomial $ 1\plus{}z^{n_1}\plus{}z^{n_2}\plus{}\cdots \plus{}z^{n_k}$ has no roots inside the circle $ |z|<\frac{\sqrt{5}\minus{}1}{2}$.

The function $f : N \to N$ is defined by $f(n) = n + S(n)$, where $S(n)$ is the sum of digits in the decimal representation of positive integer $n$. a) Prove that there are infinitely many numbers $a \in N$ for which the equation $f(x) = a$ has no natural roots. b) Prove that there are infinitely many numbers $a \in N$ for which the equation $f(x) = a$ has at least two distinct natural roots. (I. Voronovich)

Let $n$ points be given arbitrarily in the plane, no three of them collinear. Let us draw segments between pairs of these points. What is the minimum number of segments that can be colored red in such a way that among any four points, three of them are connected by segments that form a red triangle?

Let $ ABCD$ be a convex quadrilateral such that the sides $ AB, AD, BC$ satisfy $ AB \equal{} AD \plus{} BC.$ There exists a point $ P$ inside the quadrilateral at a distance $ h$ from the line $ CD$ such that $ AP \equal{} h \plus{} AD$ and $ BP \equal{} h \plus{} BC.$ Show that: \[ \frac {1}{\sqrt {h}} \geq \frac {1}{\sqrt {AD}} \plus{} \frac {1}{\sqrt {BC}} \]

Show that the number of finite sequences of length $ n $ that are formed with $ 5 $ distinct numbers such that for any three consecutive terms of the sequence at least two are equal, is $ \frac{5}{2}\left( (-1)^n+3^n \right) . $

A magician wants to demonstrate the following trick to an audience of $n \ge 16$ people. He gives them $15$ hats and after giving instructions to his assistant (which the audience does not hear), leaves the hall. Some $15$ people in the audience put on one of the hats. The assistant tags in front of everyone, one of the hats with a marker and then the person with an unmarked hat takes it off. The magician then returns back to the hall and after surveying the situation, knows who in the audience has taken off his hat. For what $n$ is this possible? [hide=original wording]Магьосник иска да покаже следния фокус пред публика от $n \ge 16$ души. Той им дава $15$ шапки и след като даде инструкции на помощника си (които публиката не чува), напуска залата. Някои $15$ души от публиката си слагат по една от шапките. Асистентът маркира пред всички една от шапките с маркер и след това човек с немаркирана шапка си я сваля. След това магьосникът се връща обратно в залата и след оглед на ситуацията познава кой от публиката си е свалил шапката. За кои $n$ е възможно това?[/hide]

We call a matrix $\textsl{binary matrix}$ if all its entries equal to $0$ or $1$. A binary matrix is $\textsl{Good}$ if it simultaneously satisfies the following two conditions: (1) All the entries above the main diagonal (from left to right), not including the main diagonal, are equal. (2) All the entries below the main diagonal (from left to right), not including the main diagonal, are equal. Given positive integer $m$, prove that there exists a positive integer $M$, such that for any positive integer $n>M$ and a given $n \times n$ binary matrix $A_n$, we can select integers $1 \leq i_1 <i_2< \cdots < i_{n-m} \leq n$ and delete the $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th rows and $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th columns of $A_n$, then the resulting binary matrix $B_m$ is $\textsl{Good}$.

According to the estimated number of participants who gave a correct solution, this was the hardest (!) problem from today's paper. So here is this great German killer - be warned! Given a circle k and three pairwisely distinct points A, B, C on this circle. Let h and g be the perpendiculars to the line BC at the points B and C. The perpendicular bisector of the segment AB meets the line h at a point F; the perpendicular bisector of the segment AC meets the line g at a point G. Prove that the product $BF\cdot CG$ is independent from the position of the point A, as long as the points B and C stay fixed. The actual problem behind the problem: Why on hell should the points B and C stay fixed? Darij

Find the last three digits of \[2008^{2007^{\cdot^{\cdot^{\cdot ^{2^1}}}}}.\]

For a positive integer $m$, prove that the number of pairs of positive integers $(x,y)$ which satisfies the following two conditions is even or $0$. (i): $x^2-3y^2+2=16m$ (ii): $2y \le x-1$

Find all triplets of nonnegative integers $(x, y, z)$ that satisfy: $x^2-3y^2=y^2-3z^2=22$.

Introduce a standard scalar product in $\mathbb{R}^4.$ Let $V$ be a partial vector space in $\mathbb{R}^4$ produced by $\left( \begin{array}{c} 1 \\ -1 \\ -1 \\ 1 \end{array} \right),\left( \begin{array}{c} 1 \\-1 \\ 1 \\ -1 \end{array} \right).$ Find a pair of base of orthogonal complement $W$ for $V$ in $\mathbb{R}^4.$

The integers $1$ through $1000$ are located on the circumference of a circle in natural order. Starting with $1$, every fifteenth number (i.e.,$1, 16, 31, \cdots$ ) is marked. The marking is continued until an already marked number is reached. How many of the numbers will be left unmarked?

Let $K$ be a point in the interior of an acute triangle $ABC$ and $ARBPCQ$ be a convex hexagon whose vertices lie on the circumcircle $\Gamma$ of the triangle $ABC.$ Let $A_1$ be the second point where the circle passing through $K$ and tangent to $\Gamma$ at $A$ intersects the line $AP.$ The points $B_1$ and $C_1$ are defined similarly. Prove that \[ \min\left\{\frac{PA_1}{AA_1}, \: \frac{QB_1}{BB_1}, \: \frac{RC_1}{CC_1}\right\} \leq 1.\]

The lateral edges of a right square pyramid are of length $a$. Let $ABCD$ be the base of the pyramid, $E$ its top vertex and $F$ the midpoint of $CE$. Assuming that $BDF$ is an equilateral triangle, compute the volume of the pyramid.

Let $I$ be the incenter and $O$ be the circumcenter of triangle $ABC,$ where $\angle A < \angle B < \angle C.$ Points $P$ and $Q$ are such that $AIOP$ and $BIOQ$ are isosceles trapezoids ($AI \parallel OP,$ $BI \parallel OQ$). Prove that $CP = CQ.$ [i]Proposed by Volodymyr Brayman and Matthew Kurskyi[/i]

Consider the equation \[(3x^3+xy^2)(x^2y+3y^3)=(x-y)^7\] (a) Prove that there are infinitely many pairs $(x,y)$ of positive integers satisfying the equation. (b) Describe all pairs $(x,y)$ of positive integers satisfying the equation.

Determine all $f:\mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ such that $f(m)\geq m$ and $f(m+n) \mid f(m)+f(n)$ for all $m,n\in \mathbb{Z}^+$

From an $n\times n$ square divided into $n^2$ unit squares, one corner unit square is cut off. Find all positive integers $n$ for which it is possible to tile the remaining part of the square with $L$-trominos. [img]https://cdn.artofproblemsolving.com/attachments/0/4/d13e6e7016d943b867f44375a2205b10ccf552.png[/img]

Find an integer $n$, where $100 \leq n \leq 1997$, such that \[ \frac{2^n+2}{n} \] is also an integer.

Given a triangle $ABC$, let $ P$ be the point which minimizes the sum of squares of distances from the sides of the triangle. Let $D, E, F$ the projections of $ P$ on the sides of the triangle $ABC$. Show that $P$ is the barycenter of $DEF$. (Jack D’Aurizio)