Points $K$ and $L$ are taken on the sides $BC$ and $CD$ of a square $ABCD$ so that $\angle AKB = \angle AKL$. Find $\angle KAL$.

Do there exist distinct non-zero digits $a, b$ and $c$ such that the two-digit number $\overline{ab}$ is divisible by $c$, the number $\overline{bc}$ is divisible by $a$ and $\overline{ca}$, is divisible by $b$?

Let $a_1,a_2,...,a_n$ be pairwise distinct real numbers and $m$ be the number of distinct sums $a_i +a_j$ (where $i \ne j$). Find the least possible value of $m$.

Mary writes $5$ numbers on the blackboard. On each step John replaces one of the numbers on the blackboard by the number $x + y - z$, where $x, y$ and $z$ are three of the four other numbers on the blackboard. Can John make all five numbers on the blackboard equal, regardless of the numbers initially written by Mary?

There were $n> 1$ aborigines living on an island, each of them telling only the truth or only lying, and each having at least one friend among the others. The new governor asked each aborigine whether there are more truthful aborigines or liars among his friends, or an equal number of both. Each aborigine answered that there are more liars than truthful aborigines among his friends. The governor then ordered one of the aborigines to be executed for being a liar and asked each of the remaining $n- 1$ aborigines the same question again. This time each aborigine answered that there are more truthful aborigines than liars among his friends. Determine whether the executed aborigine was truthful or a liar, and whether there are more truthful aborigines or liars remaining on the island.

The greatest common divisor $d$ and the least common multiple $u$ of positive integers $m$ and $n$ satisfy the equality $3m + n = 3u + d$. Prove that $m$ is divisible by $n$.

Let $ABC$ be a non-right triangle with its altitudes intersecting in point $H$. Prove that $ABH$ is an acute triangle if and only if $\angle ACB$ is obtuse.

John takes seven positive integers $a_1,a_2,...,a_7$ and writes the numbers $a_i a_j$, $a_i+a_j$ and $|a_i -a_j |$ for all $i \ne j$ on the blackboard. Find the greatest possible number of distinct odd integers on the blackboard.

Find the maximum length of a broken line on the surface of a unit cube, such that its links are the cube’s edges and diagonals of faces, the line does not intersect itself and passes no more than once through any vertex of the cube, and its endpoints are in two opposite vertices of the cube.

The teacher writes numbers $1$ at both ends of the blackboard. The first student adds a $2$ in the middle between them, each next student adds the sum of each two adjacent numbers already on the blackboard between them (hence there are numbers $1, 3, 2, 3, 1$ on the blackboard after the second student, $1, 4, 3, 5, 2, 5, 3, 4, 1$ after the third student etc.) Find the sum of all numbers on the blackboard after the $n$-th student.

Find all real parameters $a$ for which the equation $x^8 +ax^4 +1 = 0$ has four real roots forming an arithmetic progression.

Inside an equilateral triangle there is a point whose distances from the sides of the triangle are $3, 4$ and $5$. Find the area of the triangle.

The teacher writes a $2002$-digit number consisting only of digits $9$ on the blackboard. The first student factors this number as $ab$ with $a > 1$ and $b > 1$ and replaces it on the blackboard by two numbers $a'$ and $b'$ with $|a-a'| = |b-b'| = 2$. The second student chooses one of the numbers on the blackboard, factors it as $cd$ with $c > 1$ and $d > 1$ and replaces the chosen number by two numbers $c'$ and $d'$ with $|c-c'| = |d-d'| = 2$, etc. Is it possible that after a certain number of students have been to the blackboard all numbers written there are equal to $9$?

Let $a_1, ... ,a_5$ be real numbers such that at least $N$ of the sums $a_i+a_j$ ($i < j$) are integers. Find the greatest value of $N$ for which it is possible that not all of the sums $a_i+a_j$ are integers.

Juku built a robot that moves along the border of a regular octagon, passing each side in exactly $1$ minute. The robot starts in some vertex $A$ and upon reaching each vertex can either continue in the same direction, or turn around and continue in the opposite direction. In how many different ways can the robot move so that after $n$ minutes it will be in the vertex $B$ opposite to $A$?

Peeter, Juri, Kati and Mari are standing at the entrance of a dark tunnel. They have one torch and none of them dares to be in the tunnel without it, but the tunnel is so narrow that at most two people can move together. It takes $1$ minute for Peeter, $2$ minutes for Juri, $5$ for Kati and $10$ for Mari to pass the tunnel. Find the minimum time in which they can all pass through the tunnel.

Does there exist an integer containing only digits $2$ and $0$ which is a $k$-th power of a positive integer ($k \ge2$)?

Prove that for positive real numbers $a, b$ and $c$ the inequality $2(a^4+b^4+c^4) < (a^2+b^2+c^2)^2$ holds if and only if $a,b,c$ are the sides of a triangle.

A convex quadrilateral $ABCD$ is inscribed in a circle $\omega$. The rays $AD$ and $BC$ meet in point $K$ and the rays $AB$ and $DC$ meet in $L$. Prove that the circumcircle of triangle $AKL$ is tangent to $\omega$ if and only if so is the circumcircle of triangle $CKL$.

There is a lottery at Juku’s birthday party with a number of identical prizes, where each guest can win at most one prize. It is known that if there was one prize less, then the number of possible distributions of the prizes among the guests would be $50\%$ less than it actually is, while if there was one prize more, then the number of possible distributions of the prizes would be $50\%$ more than it actually is. Find the number of possible distributions of the prizes.