Let $< \Gamma _j >$ be a sequnce of concentric circles such that the sequence $< R_j >$ , where $R_j$ denotes the radius of $\Gamma_j$, is increasing and $R_j \longrightarrow \infty$ as $j \longrightarrow \infty$. Let $A_1 B_1 C_1$ be a triangle inscribed in $\Gamma _1$. extend the rays $\vec{A_i B_1} , \vec{B_1 C_1 }, \vec{C_1 A_1}$ to meet $\Gamma_2$ in $B_2, C_2$and $A_2$ respectively and form the triangle $A_2 B_2 C_2$. Continue this process. Show that the sequence of triangles $< A_n B_n C_n >$ tends to an equilateral triangle as $n \longrightarrow \infty$

Let $\gamma_1, \gamma_2, \gamma_3$ be mutually externally tangent circles and $\Gamma_1, \Gamma_2, \Gamma_3$ also be mutually externally tangent circles. For each $1 \le i \le 3$, $\gamma_i$ and $\Gamma_{i+1}$ are externally tangent at $A_i$, $\gamma_i$ and $\Gamma_{i+2}$ are externally tangent at $B_i$, and $\gamma_i$ and $\Gamma_i$ do not meet. Show that the six points $A_1, A_2, A_3, B_1, B_2, B_3$ lie on either a line or a circle.

Let $n\ge 3$ be an integer such that for every prime factor $q$ of $n-1$ exists an integer $a > 1$ such that $a^{n-1} \equiv 1 \,(\mod n \, )$ and $a^{\frac{n-1} {q}}\not\equiv 1 \,(\mod n \, )$. Prove that $n$ is not prime.

Complex numbers $\alpha$ , $\beta$ , $\gamma$ have the property that $\alpha^k +\beta^k +\gamma^k$ is an integer for every natural number $k$. Prove that the polynomial \[(x-\alpha)(x-\beta )(x-\gamma )\] has integer coefficients.

Peter and Bob play a game on a $n\times n$ chessboard. At the beginning, all squares are white apart from one black corner square containing a rook. Players take turns to move the rook to a white square and recolour the square black. The player who can not move loses. Peter goes first. Who has a winning strategy?

Consider an array of white unit squares arranged in a rectangular grid with $59$ rows of unit squares and $c$ columns of unit squares, for some positive integer $c$. What is the smallest possible value of $c$ such that, if we shade exactly $25$ unit squares in each column black, then there must necessarily be some row with at least $18$ black unit squares?

Determine all functions $f:\mathbf{R} \rightarrow \mathbf{R}^+$ such that for all real numbers $x,y$ the following conditions hold: $\begin{array}{rl} i. & f(x^2) = f(x)^2 -2xf(x) \\ ii. & f(-x) = f(x-1)\\ iii. & 1<x<y \Longrightarrow f(x) < f(y). \end{array}$

Let all distances between the vertices of a convex $n$-gon ($n > 3$) be different. a) A vertex is called uninteresting if the closest vertex is adjacent to it. What is the minimal possible number of uninteresting vertices (for a given $n$)? b) A vertex is called unusual if the farthest vertex is adjacent to it. What is the maximal possible number of unusual vertices (for a given $n$)? [i](Proposed by B.Frenkin)[/i]

A tripod has three legs each of length 5 feet. When the tripod is set up, the angle between any pair of legs is equal to the angle between any other pair, and the top of the tripod is 4 feet from the ground. In setting up the tripod, the lower 1 foot of one leg breaks off. Let $h$ be the height in feet of the top of the tripod from the ground when the broken tripod is set up. Then $h$ can be written in the form $\frac m{\sqrt{n}},$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $\lfloor m+\sqrt{n}\rfloor.$ (The notation $\lfloor x\rfloor$ denotes the greatest integer that is less than or equal to $x$.)

Show that when the product of three conscutive numbers we add arithmetic mean of them it is a perfect cube.

In the universe of Pi Zone, points are labeled with $2 \times 2$ arrays of positive reals. One can teleport from point $M$ to point $M'$ if $M$ can be obtained from $M'$ by multiplying either a row or column by some positive real. For example, one can teleport from $\left( \begin{array}{cc} 1 & 2 \\ 3 & 4 \end{array} \right)$ to $\left( \begin{array}{cc} 1 & 20 \\ 3 & 40 \end{array} \right)$ and then to $\left( \begin{array}{cc} 1 & 20 \\ 6 & 80 \end{array} \right)$. A [i]tourist attraction[/i] is a point where each of the entries of the associated array is either $1$, $2$, $4$, $8$ or $16$. A company wishes to build a hotel on each of several points so that at least one hotel is accessible from every tourist attraction by teleporting, possibly multiple times. What is the minimum number of hotels necessary? [i]Proposed by Michael Kural[/i]

Given a rectangle $ABCD$, which is located on the line $\ell$ They want it "turn over" by first turning around the vertex $D$, and then as point $C$ appears on the line $\ell$ - by making a turn around the vertex $C$ (see figure). What is the length of the curve along which the vertex $A$ is moving , at such movement, if $AB = 30$ cm, $BC = 40$ cm? (Alexey Panasenko) [img]https://cdn.artofproblemsolving.com/attachments/d/9/3cca36b08771b1897e385d43399022049bbcde.png[/img]

Joe finally asked Kathryn out. They go out on a date on a Friday night, racing at the local go-kart track. They take turns racing across an $8 \times 8$ square grid composed of $64$ unit squares. If Joe and Kathryn start in the lower left-hand corner of the $8\times 8$ square, and can move either up or right along any side of any unit square, what is the probability that Joe and Kathryn take the same exact path to reach the upper right-hand corner of the $8\times 8$ square grid?

Quadrilateral $ABCD$ inscribed in circle with center $O$. Let lines $AD$ and $BC$ intersects at $M$, lines $AB$ and $CD$- at $N$, lines $AC$ and $BD$ -at $P$, lines $OP$ and $MN$ at $K$. Proved that $ \angle AKP = \angle PKC$. As I know, this problem was very short solution by polars, but in olympiad for this solution gives maximum 4 balls (in marking schemes written, that needs to prove all theorems about properties of polars)

Cut $2003$ disjoint rectangles from an acute-angled triangle $ABC$, such that any of them has a parallel side to $AB$ and the sum of their areas is maximal.

The corner of a unit cube is chopped off such that the cut runs through the three vertices adjacent to the vertex of the chosen corner. What is the height of the cube when the freshly-cut face is placed on a table?