Points $B = B_1 , B_2, \cdots , B_n , B_{n+1} = C$ are chosen on side $BC$ of a triangle $ABC$ in that order. Let $r_j$ be the inradius of triangle $AB_jB_{j+1}$ for $j = 1, \cdots, n$ , and $r$ be the inradius of $\triangle ABC$. Show that there is a constant $\lambda$ independent of $n$ such that : \[(\lambda -r_1)(\lambda -r_2)\cdots (\lambda -r_n) =\lambda^{n-1}(\lambda -r)\]

Let $n$ be an positive integer and $\sigma = (a_1, \dots, a_n)$ a permutation of $\{1, \dots, n\}$. The [i]cadence number[/i] of $\sigma$ is the number of maximal decrescent blocks. For example, if $n = 6$ and $\sigma = (4, 2, 1, 5, 6, 3)$, then the cadence number of $\sigma$ is $3$, because $\sigma$ has $3$ maximal decrescent blocks: $(4, 2, 1)$, $(5)$ and $(6, 3)$. Note that $(4, 2)$ and $(2, 1)$ are decrescent, but not maximal, because they are already contained in $(4, 2, 1)$. Compute the sum of the cadence number of every permutation of $\{1, \dots, n\}$.

A $9 \times 10$ board is divided into $90$ unit cells. There are certain rules for moving a non-standard chess queen from one square to another: [list] [*]The queen can only move along the column or row it is in each step. [*]For any natural number $n$, if $x$ cells move made in $(2n-1)$th step, then $9-x$ cells move will be done in $(2n)$th step. The last cell it stops at during these steps is considered the visited cell. [/list] Is it possible for the queen to move from any square on the board and return to the square where it started after visiting all the squares of the board exactly once? Note: At each step, the queen chooses the right, left, up, and down direction within the above condition can choose.

All the grids of a $m\times n$ chess board ($m,n\geq 3$), are colored either with red or with blue. Two adjacent grids (having a common side) are called a "good couple" if they have different colors. Suppose there are $S$ "good couples". Explain how to determine whether $S$ is odd or even. Is it prescribed by some specific color grids? Justify your answers.

Let $n$ be an integer and $n \geq 2$, $x_1, x_2, \cdots , x_n$ are arbitrary real number, find the maximum value of $$2\sum_{1\leq i<j \leq n}\left \lfloor x_ix_j \right \rfloor-\left ( n-1 \right )\sum_{i=1}^{n}\left \lfloor x_i^2 \right \rfloor $$

Let $a$, $b$, and $c$ be the $3$ roots of $x^3-x+1=0$. Find $\frac{1}{a+1}+\frac{1}{b+1}+\frac{1}{c+1}.$

Let $a,b,c,d \in [0,1] .$ Prove that$$\frac{1}{1+a+b}+\frac{1}{1+b+c}+\frac{1}{1+c+d}+\frac{1}{1+d+a}\leq \frac{4}{1+2\sqrt[4]{abcd}}$$

Let $ABC$ be a given triangle and $\ell$ be a line that meets the lines $BC, CA$ and $AB$ in $A_1,B_1$ and $C_1$ respectively. Let $A'$ be the midpoint, of the segment connecting the projections of $A_1$ onto the lines $AB$ and $AC$. Construct, analogously the points $B'$ and $C'$. (a) Show that the points $A', B'$ and $C'$ are collinear on some line $\ell'$. (b) Show that if $\ell$ contains the circumcenter of the triangle $ABC$, then $\ell' $ contains the center of it's Euler circle.

What are the signs of $\triangle{H}$ and $\triangle{S}$ for a reaction that is spontaneous only at low temperatures? $ \textbf{(A)}\ \triangle{H} \text{ is positive}, \triangle{S} \text{ is positive} \qquad\textbf{(B)}\ \triangle{H}\text{ is positive}, \triangle{S} \text{ is negative} \qquad$ $\textbf{(C)}\ \triangle{H} \text{ is negative}, \triangle{S} \text{ is negative} \qquad\textbf{(D)}\ \triangle{H} \text{ is negative}, \triangle{S} \text{ is positive} \qquad $

Show: For all real numbers $ a,b,c$ with $ 0<a,b,c<1$ is: \[ \sqrt{a^2bc\plus{}ab^2c\plus{}abc^2}\plus{}\sqrt{(1\minus{}a)^2(1\minus{}b)(1\minus{}c)\plus{}(1\minus{}a)(1\minus{}b)^2(1\minus{}c)\plus{}(1\minus{}a)(1\minus{}b)(1\minus{}c)^2}<\sqrt{3}.\]

Determine for which positive integers $ k$ the set \[ X \equal{} \{1990, 1990 \plus{} 1, 1990 \plus{} 2, \ldots, 1990 \plus{} k\}\] can be partitioned into two disjoint subsets $ A$ and $ B$ such that the sum of the elements of $ A$ is equal to the sum of the elements of $ B.$

The country has $n \ge 3$ airports, some pairs of which are connected by bidirectional flights. Every day, the government closes the airport with the strictly highest number of flights going out of it. What is the maximum number of days this can continue? [i]Proposed by Fedir Yudin[/i]

You have 2 six-sided dice. One is a normal fair die, while the other has 2 ones, 2 threes, and 2 fives. You pick a die and roll it. Because of some secret magnetic attraction of the unfair die, you have a 75% chance of picking the unfair die and a 25% chance of picking the fair die. If you roll a three, what is the probability that you chose the fair die?

Three numbers were written with a chalk on the blackboard. The following operation was repeated several times: One of the numbers was cleared and the sum of two other numbers, decreased by $1$, was written instead of it. The final set of numbers is $\{17, 1967, 1983\}$.Is it possible to admit that the initial numbers were a) $\{2, 2, 2\}$? b) $\{3, 3, 3\}$?

Let $m$ be a positive integer. Consider a $4m\times 4m$ array of square unit cells. Two different cells are [i]related[/i] to each other if they are in either the same row or in the same column. No cell is related to itself. Some cells are colored blue, such that every cell is related to at least two blue cells. Determine the minimum number of blue cells.

Let $ f(0) \equal{} f(1) \equal{} 0$ and \[ f(n\plus{}2) \equal{} 4^{n\plus{}2} \cdot f(n\plus{}1) \minus{} 16^{n\plus{}1} \cdot f(n) \plus{} n \cdot 2^{n^2}, \quad n \equal{} 0, 1, 2, \ldots\] Show that the numbers $ f(1989), f(1990), f(1991)$ are divisible by $ 13.$

Let $A$ and $B$ be two fixed points in the plane. Consider all possible convex quadrilaterals $ABCD$ with $AB = BC, AD = DC$, and $\angle ADC = 90^\circ$. Prove that there is a fixed point $P$ such that, for every such quadrilateral $ABCD$ on the same side of $AB$, the line $DC$ passes through $P.$

Suppose that $(a_n)$ is a sequence of real numbers such that the series $$\sum_{n=1}^\infty\frac{a_n}n$$is convergent. Show that the sequence $$b_n=\frac1n\sum^n_{j=1}a_j$$is convergent and find its limit.

A circle is inscribed in a triangle $ABC$ with sides $a,b,c$. Tangents to the circle parallel to the sides of the triangle are contructe. Each of these tangents cuts off a triagnle from $\triangle ABC$. In each of these triangles, a circle is inscribed. Find the sum of the areas of all four inscribed circles (in terms of $a,b,c$).

A positive integer $n (\ge 4)$ is given. Let $a_1, a_2, \cdots ,a_n$ be $n$ pairwise distinct positive integers where $a_i \le n$ for all $1 \le i \le n$. Determine the maximum value of $$\sum_{i=1}^{n}{|a_i - a_{i+1} + a_{i+2} - a_{i+3}|}$$ where all indices are modulo $n$

Prove that $\overline{a0... 09}$ (in which $a > 0$ is a digit and there is at least one zero) is not a perfect square. (VA Senderov)

Let $ABC$ be a triangle such that $\angle CAB > \angle ABC$, and let $I$ be its incentre. Let $D$ be the point on segment $BC$ such that $\angle CAD = \angle ABC$. Let $\omega$ be the circle tangent to $AC$ at $A$ and passing through $I$. Let $X$ be the second point of intersection of $\omega$ and the circumcircle of $ABC$. Prove that the angle bisectors of $\angle DAB$ and $\angle CXB$ intersect at a point on line $BC$.

Find all finite sequences $(x_0, x_1, \ldots,x_n)$ such that for every $j$, $0 \leq j \leq n$, $x_j$ equals the number of times $j$ appears in the sequence.

What is largest positive integer n satisfying the following inequality: $n^{2006}$ < $7^{2007}$?

Let $O$ be the centre of the incircle of $\triangle ABC$. Points $K,L$ are the intersection points of the circles circumscribed about triangles $BOC,AOC$ respectively with the bisectors of the angles at $A,B$ respectively $(K,L\not= O)$. Also $P$ is the midpoint of segment $KL$, $M$ is the reflection of $O$ with respect to $P$ and $N$ is the reflection of $O$ with respect to line $KL$. Prove that the points $K,L,M$ and $N$ lie on the same circle.