How many ways can $ 8$ mutually non-attacking rooks be placed on the $ 9\times9$ chessboard (shown here) so that all $ 8$ rooks are on squares of the same color? (Two rooks are said to be attacking each other if they are placed in the same row or column of the board.) [asy]unitsize(3mm); defaultpen(white); fill(scale(9)*unitsquare,black); fill(shift(1,0)*unitsquare); fill(shift(3,0)*unitsquare); fill(shift(5,0)*unitsquare); fill(shift(7,0)*unitsquare); fill(shift(0,1)*unitsquare); fill(shift(2,1)*unitsquare); fill(shift(4,1)*unitsquare); fill(shift(6,1)*unitsquare); fill(shift(8,1)*unitsquare); fill(shift(1,2)*unitsquare); fill(shift(3,2)*unitsquare); fill(shift(5,2)*unitsquare); fill(shift(7,2)*unitsquare); fill(shift(0,3)*unitsquare); fill(shift(2,3)*unitsquare); fill(shift(4,3)*unitsquare); fill(shift(6,3)*unitsquare); fill(shift(8,3)*unitsquare); fill(shift(1,4)*unitsquare); fill(shift(3,4)*unitsquare); fill(shift(5,4)*unitsquare); fill(shift(7,4)*unitsquare); fill(shift(0,5)*unitsquare); fill(shift(2,5)*unitsquare); fill(shift(4,5)*unitsquare); fill(shift(6,5)*unitsquare); fill(shift(8,5)*unitsquare); fill(shift(1,6)*unitsquare); fill(shift(3,6)*unitsquare); fill(shift(5,6)*unitsquare); fill(shift(7,6)*unitsquare); fill(shift(0,7)*unitsquare); fill(shift(2,7)*unitsquare); fill(shift(4,7)*unitsquare); fill(shift(6,7)*unitsquare); fill(shift(8,7)*unitsquare); fill(shift(1,8)*unitsquare); fill(shift(3,8)*unitsquare); fill(shift(5,8)*unitsquare); fill(shift(7,8)*unitsquare); draw(scale(9)*unitsquare,black);[/asy]

Anton is playing a game with shapes. He starts with a circle $\omega_1$ of radius $1$, and to get a new circle $\omega_2$, he circumscribes a square about $\omega_1$ and then circumscribes circle $\omega_2$ about that square. To get another new circle $\omega_3$, he circumscribes a regular octagon about circle $\omega_2$ and then circumscribes circle $\omega_3$ about that octagon. He continues like this, circumscribing a $2n$-gon about $\omega_{n-1}$ and then circumscribing a new circle $\omega_n$ about the $2n$-gon. As $n$ increases, the area of $\omega_n$ approaches a constant $A$. Compute $A$.

On side $AB$ of triangle $ABC$ a point $P$ is taken such that $AP = 2PB$. It is known that $CP = 2PQ$ where $Q$ is the midpoint of $AC$. Prove that $ABC$ is a right triangle.

Let $ C$ be a circle with center $ M$ in a plane $ V$, and $ P$ be a point not on the circle $ C$. $ (a)$ If $ P$ is fixed, prove that $ AP^2\plus{}BP^2$ is a constant for every diameter $ AB$ of the circle $ C$. $ (b)$ Let $ AB$ be a fixed diameter of $ C$ and $ P$ a point on a fixed sphere $ S$ not intersecting $ V$. Determine the points $ P$ on $ S$ that minimize $ AP^2\plus{}BP^2$.

Points $ A, B, C$ and $ D$ are midpoints of the sides of the larger square. If the larger square has area 60, what is the area of the smaller square? [asy]size(100); draw((0,0)--(2,0)--(2,2)--(0,2)--cycle,linewidth(1)); draw((0,1)--(1,2)--(2,1)--(1,0)--cycle); label("$A$", (1,2), N); label("$B$", (2,1), E); label("$C$", (1,0), S); label("$D$", (0,1), W);[/asy] $ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 20 \qquad \textbf{(C)}\ 24 \qquad \textbf{(D)}\ 30 \qquad \textbf{(E)}\ 40$

Consider the square $ABCD$ in which a segment is drawn between each vertex and the midpoints of both opposite sides. Find the ratio of the area of the octagon determined by these segments and the area of the square $ABCD.$

Every street in the city of Hamiltonville connects two squares, and every square may be reached by streets from every other. The governor discovered that if he closed all squares of any route not passing any square more than once, every remained square would be reachable from each other. Prove that there exists a circular route passing every square of the city exactly once. [i]Author: S. Berlov[/i]

Let $A =\left\{a = q + \frac{1}{q }/ q \in Q^*,q > 0 \right\}$, $A + A = \{a + b |a,b \in A\}$,$A \cdot A =\{a \cdot b | a, b \in A\}$. Prove that: i) $A + A \ne A \cdot A$ ii) $(A + A) \cap N = (A \cdot A) \cap N$. Vasile Pop

Suppose $S= \{1,2,\dots,n\}$ and $n \geq 3$. There is $f:S^k \longmapsto S$ that if $a,b \in S^k$ and $a$ and $b$ differ in all of elements then $f(a) \neq f(b)$. Prove that $f$ is a function of one of its elements.

Let $a$, $b$, $c$ be positive integers and $p$ be a prime number. Assume that \[ a^n(b+c)+b^n(a+c)+c^n(a+b)\equiv 8\pmod{p} \] for each nonnegative integer $n$. Let $m$ be the remainder when $a^p+b^p+c^p$ is divided by $p$, and $k$ the remainder when $m^p$ is divided by $p^4$. Find the maximum possible value of $k$. [i]Proposed by Justin Stevens and Evan Chen[/i]

Two points on the distance 1 are given in a plane. It is allowed to draw a line through two marked points, as well as a circle centered in a marked point with radius equal to the distance between some two marked points. By marked points we mean the two initial points and intersection points of two lines, two circles, or a line and a circle constructed so far. Let $C(n)$ be the minimum number of circles needed to construct two points on the distance $n$ if only a compass is used, and let $LC(n)$ be the minimum total number of circles and lines needed to do so if a ruler and a compass are used, where $n$ is a natural number. Prove that the sequence $C(n)/LC(n)$ is not bounded. [i]A. Belov[/i]

A plane is coloured into black and white squares in a chessboard pattern. Then, all the white squares are coloured red and blue such that any two initially white squares that share a corner are different colours. (One is red and the other is blue.) Let $\ell$ be a line not parallel to the sides of any squares. For every line segment $I$ that is parallel to $\ell$, we can count the difference between the length of its red and its blue areas. Prove that for every such line $\ell$ there exists a number $C$ that exceeds all those differences that we can calculate.

For each positive integer $ n$, define $ f(n)$ as the exponent of the $ 2$ in the decomposition in prime factors of the number $ n!$. Prove that the equation $ n\minus{}f(n)\equal{}a$ has infinitely many solutions for any positive integer $ a$.

[b]Problem 4.[/b] Let $k$ be the circumcircle of $\triangle ABC$, and $D$ the point on the arc $\overarc{AB},$ which do not pass through $C$. $I_A$ and $I_B$ are the centers of incircles of $\triangle ADC$ and $\triangle BDC$, respectively. Proove that the circumcircle of $\triangle I_AI_BC$ touches $k$ iff \[ \frac{AD}{BD}=\frac{AC+CD}{BC+CD}. \] [i] Stoyan Atanasov[/i]

Let $ABCD$ be a cyclic quadrilateral. Points $K, L, M, N$ are chosen on $AB, BC, CD, DA$ such that $KLMN$ is a rhombus with $KL \parallel AC$ and $LM \parallel BD$. Let $\omega_A, \omega_B, \omega_C, \omega_D$ be the incircles of $\triangle ANK, \triangle BKL, \triangle CLM, \triangle DMN$. Prove that the common internal tangents to $\omega_A$, and $\omega_C$ and the common internal tangents to $\omega_B$ and $\omega_D$ are concurrent.

There are $n$ clubs composed of $4$ students out of all $9$ students. For two arbitrary clubs, there are no more than $2$ students who are a member of both clubs. Prove that $n\le 18$. Translator’s Note. We can prove $n\le 12$, and we can prove that the bound is tight. (Credits to rkm0959 for translation and document)