Find all positive integers $n$ such that there exist two permutations $a_0,a_1,\ldots,a_{n-1}$ and $b_0,b_1,\ldots,b_{n-1}$ of the set $\lbrace0,1,\ldots,n-1\rbrace$, satisfying the condition $$ia_i\equiv b_i\pmod{n}$$ for all $0\le i\le n-1$. [i]Proposed by Fysty[/i]

Let $\Gamma$ and $\Gamma'$ be two circles with centres $O$ and $O'$, such that $O$ belongs to $\Gamma'$. Let $M$ be a point on $\Gamma'$, outside of $\Gamma$. The tangents to $\Gamma$ that go through $M$ touch $\Gamma$ in two points $A$ and $B$, and cross $\Gamma'$ again in two points $C$ and $D$. Finally, let $E$ be the crossing point of the lines $AB$ and $CD$. Prove that the circumcircles of the triangles $CEO'$ and $DEO'$ are tangent to $\Gamma'$.

Numbers $1, 2, \dots , n$ are written around a circle in some order. What is the smallest possible sum of the absolute differences of adjacent numbers?

Two circles lie completely outside each other.Let $A$ be the point of intersection of internal common tangents of the circles and let $K$ be the projection of this point onto one of their external common tangents.The tangents,different from the common tangent,to the circles through point $K$ meet the circles at $M_1$ and $M_2$.Prove that the line $AK$ bisects angle $M_1 KM_2$.

Let $a,b,c,d $-reals positive numbers. Prove inequality: $\frac{a^2+b^2+c^2}{ab+bc+cd}+\frac{b^2+c^2+d^2}{bc+cd+ad}+\frac{a^2+c^2+d^2}{ab+ad+cd}+\frac{a^2+b^2+d^2}{ab+ad+bc} \geq 4$

Does every positive polynomial in two real variables attain its lower bound in the plane?

A light pulse starts at a corner of a reflective square. It bounces around inside the square, reflecting off of the square’s perimeter $n$ times before ending in a different corner. The path of the light pulse, when traced, divides the square into exactly $2021$ regions. Compute the smallest possible value of $n$.

In how many ways can we paint $16$ seats in a row, each red or green, in such a way that the number of consecutive seats painted in the same colour is always odd?

A game consists in $9$ coins (blacks or whites) arrenged in the following position (see picture 1). If you choose $1$ coin on the border of the square, this coin and it's neighbours change their color. If you choose the coin at the centre, it doesn't change it's color, but the other $8$ coins do. Here is an example of $9$ white coins, and the changes of their colors, choosing the coin said: (see picture 2). Is it possible, starting with $9$ white coins, to have $9$ black coins?.

Let $m$ positive integers $a_1, \dots , a_m$ be given. Prove that there exist fewer than $2^m$ positive integers $b_1, \dots , b_n$ such that all sums of distinct $b_k$’s are distinct and all $a_i \ (i \leq m)$ occur among them.

The two circles $\Gamma_1$ and $\Gamma_2$ with the midpoints $O_1$ resp. $O_2$ intersect in the two distinct points $A$ and $B$. A line through $A$ meets $\Gamma_1$ in $C \neq A$ and $\Gamma_2$ in $D \neq A$. The lines $CO_1$ and $DO_2$ intersect in $X$. Prove that the four points $O_1,O_2,B$ and $X$ are concyclic.

Let $f$ be a continuous real-valued function on $\mathbb R^3$.  Suppose that for every sphere $S$ of radius $1$, the integral of $f(x,y,z)$ over the surface of $S$ equals zero.  Must $f(x,y,z)$ be identically zero?

The length of the hypotenuse of a right triangle is $h$ , and the radius of the inscribed circle is $r$. The ratio of the area of the circle to the area of the triangle is $\textbf{(A) }\frac{\pi r}{h+2r}\qquad\textbf{(B) }\frac{\pi r}{h+r}\qquad\textbf{(C) }\frac{\pi}{2h+r}\qquad\textbf{(D) }\frac{\pi r^2}{r^2+h^2}\qquad\textbf{(E) }\text{none of these}$

Anton wrote $4$ positive integers on the board. Oleksii calculated their product, while Fedir calculated the sum of their fourth powers. Is it possible that Oleksii's number and Fedir's number have the same number of digits and that these numbers are written as digit-reversals of each other? [i]Proposed by Fedir Yudin and Mykhailo Shtandenko[/i]

Let $p$ and $q$ be two different primes. Prove that \[\left\lfloor\frac{p}{q}\right\rfloor+\left\lfloor\frac{2p}{q}\right\rfloor+\left\lfloor\frac{3p}{q}\right\rfloor+\ldots +\left\lfloor\frac{(q-1)p}{q}\right\rfloor=\frac{1}{2}(p-1)(q-1) \]

How many digits are in the product $4^5 \cdot 5^{10}$? $ \textbf{(A)} 8 \qquad\textbf{(B)} 9 \qquad\textbf{(C)} 10 \qquad\textbf{(D)} 11 \qquad\textbf{(E)} 12 $

In the acute-angled triangle $ABC$, let $M$ be the midpoint of the atlitude $h_b$ through $B$ and $N$ be the midpoint of the height $h_c$ through $C$. Further let $P$ be the intersection of $AM$ and $h_c$ and $Q$ be the intersection of $AN$ and $h_b$. Show that $M, N, P$ and $Q$ lie on a circle.

A quadrilateral \( ABCD \) with no parallel sides is inscribed in a circle \( \Omega \). Circles \( \omega_a, \omega_b, \omega_c, \omega_d \) are inscribed in triangles \( DAB, ABC, BCD, CDA \), respectively. Common external tangents are drawn between \( \omega_a \) and \( \omega_b \), \( \omega_b \) and \( \omega_c \), \( \omega_c \) and \( \omega_d \), and \( \omega_d \) and \( \omega_a \), not containing any sides of quadrilateral \( ABCD \). A quadrilateral whose consecutive sides lie on these four lines is inscribed in a circle \( \Gamma \). Prove that the lines joining the centers of \( \omega_a \) and \( \omega_c \), \( \omega_b \) and \( \omega_d \), and the centers of \( \Omega \) and \( \Gamma \) all intersect at one point. \\

Let be a natural number $ n\ge 2, $ the real numbers $ a_1,a_2,\ldots ,a_n,b_1,b_2,\ldots, b_n, $ and the matrix defined as $$ A=\left( a_i+b_j \right)_{1\le j\le n}^{1\le i\le n} . $$ [b]a)[/b] Show that $ n=2 $ if $ A $ is invertible. [b]b)[/b] Prove that the pair of numbers $ a_1,a_2 $ and $ b_1,b_2 $ are both consecutive (not necessarily in this order), if $ A $ is an invertible matrix of integers whose inverse is a matrix of integers. [i]Costică Ambrinoc[/i]

There are $ 7$ boxes arranged in a row and numbered $1$ through $7$. You have a stack of $2015$ cards, which you place one by one in the boxes. The first card is placed in box #$1$, the second in box #$2$, and so forth up to the seventh card which is placed in box #$7$. You then start working back in the other direction, placing the eighth card in box #$6$, the ninth in box #$5$, up to the thirteenth card being placed in box #$1$. The fourteenth card is then placed in box #$2$, and this continues until every card is distributed. What box will the last card be placed in?

For what is the smallest natural number $n$ there is a polynomial $P(x)$ with integer coefficients, having $m$ different integer roots, and at the same time the equation $P(x) = n$ has at least one integer solution if: a) $m = 5$, b) $ m = 6$?

Consider a convex $15$- gon with perimeter $21$. Show that there one can select three distinct pairs of vertices that form a triangle with area less than $1$. [hide=original wording of second sentence]Zeige, dass man davon drei paarweise verschiedene Eckpunkte auswählen kann, die ein Dreieck mit Fläche kleiner als 1 bilden.[/hide]

There are $n$ people standing on a circular track. We want to perform a number of [i]moves[/i] so that we end up with a situation where the distance between every two neighbours is the same. The [i]move[/i] that is allowed consists in selecting two people and asking one of them to walk a distance $d$ on the circular track clockwise, and asking the other to walk the same distance on the track anticlockwise. The two people selected and the quantity $d$ can vary from move to move. Prove that it is possible to reach the desired situation (where the distance between every two neighbours is the same) after at most $n-1$ moves.

To $m$ ounces of a $m\%$ solution of acid, $x$ ounces of water are added to yield a $(m-10)\%$ solution. If $m>25$, then $x$ is $\textbf{(A)}\ \frac{10m}{m-10} \qquad \textbf{(B)}\ \frac{5m}{m-10} \qquad \textbf{(C)}\ \frac{m}{m-10} \qquad \textbf{(D)}\ \frac{5m}{m-20} \\ \textbf{(E)}\ \text{not determined by the given information}$

Is it true that for any permulation $a_1,a_2.....,a_{2002}$ of $1,2....,2002$ there are positive integers $m,n$ of the same parity such that $0<m<n<2003$ and $a_m+a_n=2a_{\frac {m+n}{2}}$