Arthur and Renate play a game on a $7 \times 7$ board. Arthur has two red tiles, initially placed on the cells in the bottom left and the upper right corner. Renate has two black tiles, initially placed on the cells in the bottom right and the upper left corner. In a move, a player can choose one of his two tiles and move them to a horizontally or vertically adjacent cell. The players alternate, with Arthur beginning. Arthur wins when both of his tiles are in horizontally or vertically adjacent cells after some number of moves. Can Renate prevent him from winning?

Can a number of the form $44\dots 41$, with an odd number of decimal digits $4$ followed by a digit $1$, be a perfect square?

Let $ABCD$ be a parallelogram whose diagonals intersect in $M$. Suppose that the circumcircle of $ABM$ intersects the segment $AD$ in a point $E \ne A$ and that the circumcircle of $EMD$ intersects the segment $BE$ in a point $F \ne E$. Show that $\angle ACB=\angle DCF$.

For positive integers $p$, $q$ and $r$ we are given $p \cdot q \cdot r$ unit cubes. We drill a hole along the space diagonal of each of these cubes and then tie them to a very thin thread of length $p \cdot q \cdot r \cdot \sqrt{3}$ like a string of pearls. We now want to construct a cuboid of side lengths $p$, $q$ and $r$ out of the cubes, without tearing the thread. a) For which numbers $p$, $q$ and $r$ is this possible? b) For which numbers $p$, $q$ and $r$ is this possible in a way such that both ends of the thread coincide?

Determine all pairs $(x,y)$ of integers satisfying \[(x+2)^4-x^4=y^3.\]

Determine the set of all real numbers $r$ for which there exists an infinite sequence $a_1,a_2,\dots$ of positive integers satisfying the following three properties: (1) No number occurs more than once in the sequence. (2) The sum of two different elements of the sequence is never a power of two. (3) For all positive integers $n$, we have $a_n<r \cdot n$.

Let $ABC$ be a triangle. For a point $P$ in its interior, we draw the threee lines through $P$ parallel to the sides of the triangle. This partitions $ABC$ in three triangles and three quadrilaterals. Let $V_A$ be the area of the quadrilateral which has $A$ as one vertex. Let $D_A$ be the area of the triangle which has a part of $BC$ as one of its sides. Define $V_B, D_B$ and $V_C, D_C$ similarly. Determine all possible values of $\frac{D_A}{V_A}+\frac{D_B}{V_B}+\frac{D_C}{V_C}$, as $P$ varies in the interior of the triangle.

In Sikinia, there are $2024$ cities. Between some of them there are flight connections, which can be used in either direction. No city has a direct flight to all $2023$ other cities. It is known, however, that there is a positive integer $n$ with the following property: For any $n$ cities in Sikinia, there is another city which is directly connected to all these cities. Determine the largest possible value of $n$.