Given a board consists of $n \times n$ unit squares ($n \ge 3$). Each unit square is colored black and white, resembling a chessboard. In each step, TOMI can choose any $2 \times 2$ square and change the color of every unit square chosen with the other color (white becomes black and black becomes white). Find every $n$ such that after a finite number of moves, every unit square on the board has a same color.

Let $n \geq 3$ be an integer. Two players play a game on an empty graph with $n + 1$ vertices, consisting of the vertices of a regular n-gon and its center. They alternately select a vertex of the n-gon and draw an edge (that has not been drawn) to an adjacent vertex on the n-gon or to the center of the n-gon. The player who first makes the graph connected wins. Between the player who goes first and the player who goes second, who has a winning strategy? [i]Note: an empty graph is a graph with no edges.[/i]

Determine all triples (x, y, z) of non-negative real numbers that satisfy the following system of equations $\begin{cases} x^2 - y = (z - 1)^2\\ y^2 - z = (x - 1)^2 \\ z^2 - x = (y -1)^2 \end{cases}$.

[color=darkred]Let $ p$ be a prime divisor of $ n\ge 2$. Prove that there exists a set of natural numbers $ A \equal{} \{a_1,a_2,...,a_n\}$ such that product of any two numbers from $ A$ is divisible by the sum of any $ p$ numbers from $ A$.[/color]

For some real numbers $ a$ and $ b$, the equation \[ 8x^3 \plus{} 4ax^2 \plus{} 2bx \plus{} a \equal{} 0 \]has three distinct positive roots. If the sum of the base-$ 2$ logarithms of the roots is $ 5$, what is the value of $ a$? $ \textbf{(A)}\minus{}\!256 \qquad \textbf{(B)}\minus{}\!64 \qquad \textbf{(C)}\minus{}\!8 \qquad \textbf{(D)}\ 64 \qquad \textbf{(E)}\ 256$

$P$ is a point inside the triangle $ABC$. The perpendicular distances from $P$ to the three sides have product $p$. Show that $p \le \frac{ 8 S^3}{27abc}$, where $S =$ area $ABC$ and $a, b, c$ are the sides. Prove a similar result for a tetrahedron.

In the following $6\times 6$ matrix, one can choose any $k\times k$ submatrix, with $1<k\leq6 $ and add $1$ to all its entries. Is it possible to perform the operation a finite number of times so that all the entries in the $6\times 6$ matrix are multiples of $3$? $ \begin{pmatrix} 2 & 0 & 1 & 0 & 2 & 0 \\ 0 & 2 & 0 & 1 & 2 & 0 \\ 1 & 0 & 2 & 0 & 2 & 0 \\ 0 & 1 & 0 & 2 & 2 & 0 \\ 1 & 1 & 1 & 1 & 2 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 \end{pmatrix} $ Note: A $p\times q$ submatrix of a $m\times n$ matrix (with $p\leq m$, $q\leq n$) is a $p\times q$ matrix formed by taking a block of the entries of this size from the original matrix.

Let $AA'BCC'B'$ be a convex cyclic hexagon such that $AC$ is tangent to the incircle of the triangle $A'B'C'$, and $A'C'$ is tangent to the incircle of the triangle $ABC$. Let the lines $AB$ and $A'B'$ meet at $X$ and let the lines $BC$ and $B'C'$ meet at $Y$. Prove that if $XBYB'$ is a convex quadrilateral, then it has an incircle.

Find all integer solutions to the equation $$x^3+2y^3+4z^3+8xyz=0$$

Three distinct positive integers are chosen at random from $\{1,2,3...,12\}$. The probability that no two elements of the set have an absolute difference less than or equal to $2$ can be written as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a +b$.

$3n$ lines are drawn on the plane ($n > 1$), such that no two of them are parallel and no three of them are concurrent. Prove that, if $2n$ of the lines are coloured red and the other $n$ lines blue, there are at least two regions of the plane such that all of their borders are red. Note: for each region, all of its borders are contained in the original set of lines, and no line passes through the region.

Prove the inequality $\frac{b^2+c^2-a^2}{a\left(b+c\right)}+\frac{c^2+a^2-b^2}{b\left(c+a\right)}+\frac{a^2+b^2-c^2}{c\left(a+b\right)}\geq\frac32$ for any three positive reals $a$, $b$, $c$. [i]Comment.[/i] This was an attempt of creating a contrast to the (rather hard) inequality at the QEDMO before. However, it turned out to be more difficult than I expected (a wrong solution was presented during the competition). Darij

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.

We have two $20 \times 13$ rectangular grids with $260$ unit cells. each one. We insert in the boxes of each of the grids the numbers $1, 2, ..., 260$ as follows: $\bullet$ For the first grid, we start by inserting the numbers $1, 2, ..., 13$ in the boxes in the top row from left to right. We continue inserting numbers $14$, $ 15$, $...$, $26$ in the second row from left to right. We maintain the same procedure until in the last row, $20$, the numbers are placed $248$, $249$, $...$, $260$ from left to right. $\bullet$ For the second grid we start by inserting the numbers $1$, $2$,$ ..$., $20$ from top to bottom in the farthest column right. We continue inserting the numbers $21$, $22$,$ ...$, $40$ in the second column from the right also from top to bottom. We maintain that same procedure until we reach the column on the left where we place the numbers from top to bottom $241$, $242$, $ ...$, $260$. Determines the integers inserted in the boxes located in the same position in both grids.

Consider the addition problem: \begin{tabular}{ccccc} &C&A&S&H\\ +&&&M&E\\ \hline O&S&I&D&E \end{tabular} where each letter represents a base-ten digit, and $C,M,O \ne 0.$ (Distinct letters are allowed to represent the same digit.) How many ways are there to assign values to the letters so that the addition problem is true?

The closed curve in the figure is made up of $9$ congruent circular arcs each of length $\frac{2\pi}{3}$, where each of the centers of the corresponding circles is among the vertices of a regular hexagon of side $2$. What is the area enclosed by the curve? [asy] size(170); defaultpen(fontsize(6pt)); dotfactor=4; label("$\circ$",(0,1)); label("$\circ$",(0.865,0.5)); label("$\circ$",(-0.865,0.5)); label("$\circ$",(0.865,-0.5)); label("$\circ$",(-0.865,-0.5)); label("$\circ$",(0,-1)); dot((0,1.5)); dot((-0.4325,0.75)); dot((0.4325,0.75)); dot((-0.4325,-0.75)); dot((0.4325,-0.75)); dot((-0.865,0)); dot((0.865,0)); dot((-1.2975,-0.75)); dot((1.2975,-0.75)); draw(Arc((0,1),0.5,210,-30)); draw(Arc((0.865,0.5),0.5,150,270)); draw(Arc((0.865,-0.5),0.5,90,-150)); draw(Arc((0.865,-0.5),0.5,90,-150)); draw(Arc((0,-1),0.5,30,150)); draw(Arc((-0.865,-0.5),0.5,330,90)); draw(Arc((-0.865,0.5),0.5,-90,30)); [/asy] $ \textbf{(A)}\ 2\pi+6\qquad\textbf{(B)}\ 2\pi+4\sqrt3 \qquad\textbf{(C)}\ 3\pi+4 \qquad\textbf{(D)}\ 2\pi+3\sqrt3+2 \qquad\textbf{(E)}\ \pi+6\sqrt3 $

Suppose that the number $ a$ satisfies the equation $ 4 \equal{} a \plus{} a^{ \minus{} 1}$. What is the value of $ a^{4} \plus{} a^{ \minus{} 4}$? $ \textbf{(A)}\ 164 \qquad \textbf{(B)}\ 172 \qquad \textbf{(C)}\ 192 \qquad \textbf{(D)}\ 194 \qquad \textbf{(E)}\ 212$

Let $ABCDE$ be a pentagon with right angles at vertices $B$ and $E$ and such that $AB = AE$ and $BC = CD = DE$. The diagonals $BD$ and $CE$ meet at point $F$. Prove that $FA = AB$.

Let $ABC$ be an acute triangle with orthocenter $H$. Let $G$ be the point such that the quadrilateral $ABGH$ is a parallelogram. Let $I$ be the point on the line $GH$ such that $AC$ bisects $HI$. Suppose that the line $AC$ intersects the circumcircle of the triangle $GCI$ at $C$ and $J$. Prove that $IJ = AH$.

Consider a parallelogram $[ABCD]$ such that $\angle DAB$ is an acute angle. Let $G$ be a point in line $AB$ different from $B$ such that $\overline{BC}=\overline{GC}$, and let $H$ be a point in line $BC$ different from $B$ such that $\overline{AB}=\overline{AH}$. Prove that triangle $[GDH]$ is isosceles.

We have placed some red and blue points along a circle. The following operations are permitted: (a) we may add a red point somewhere and switch the color of its neighbors, (b) we may take off a red point from somewhere and switch the color of its neighbors (if there are at least $3$ points on the circle and there is a red one too). Initially, there are two blue points on the circle. Using a number of these operations, can we reach a state with exactly two red point?

Solve the equation $|x-m|+|x+m|=x$ depending on the value of the parameter $m$.

Find the linking coefficient of the phase trajectories of the equation of small oscillations $\ddot{x}=-4x$, $\ddot{y}=-9y$ on a level surface of the total energy.

In triangle $ABC$, $AB>AC.$ The bisector of $\angle BAC$ meets $BC$ at $D.$ $P$ is on line $DA,$ such that $A$ lies between $P$ and $D$. $PQ$ is tangent to $\odot(ABD)$ at $Q.$ $PR$ is tangent to $\odot(ACD)$ at $R.$ $CQ$ meets $BR$ at $K.$ The line parallel to $BC$ and passing through $K$ meets $QD,AD,RD$ at $E,L,F,$ respectively. Prove that $EL=KF.$

$E$ is the intersection point of the diagonals of the cyclic quadrilateral, $ABCD, F$ is the intersection point of the lines $AB$ and $CD, M$ is the midpoint of the side $AB$, and $N$ is the midpoint of the side $CD$. The circles circumscribed around the triangles $ABE$ and $ACN$ intersect for the second time at point $K$. Prove that the points $F, K, M$ and $N$ lie on one circle.