Let $ a, b, c$ be positive integers for which $ abc \equal{} 1$. Prove that $ \sum \frac{1}{b(a\plus{}b)} \ge \frac{3}{2}$.

Consider a $ 7\times 7$ numbers table $ a_{ij} \equal{} (i^2 \plus{} j)(i \plus{} j^2), 1\le i,j\le 7.$ When we add arbitrarily each term of an arithmetical progression consisting of $ 7$ integers to corresponding to term of certain row (or column) in turn, call it an operation. Determine whether such that each row of numbers table is an arithmetical progression, after a finite number of operations.

Five identical empty buckets of $2$-liter capacity stand at the vertices of a regular pentagon. Cinderella and her wicked Stepmother go through a sequence of rounds: At the beginning of every round, the Stepmother takes one liter of water from the nearby river and distributes it arbitrarily over the five buckets. Then Cinderella chooses a pair of neighbouring buckets, empties them to the river and puts them back. Then the next round begins. The Stepmother goal's is to make one of these buckets overflow. Cinderella's goal is to prevent this. Can the wicked Stepmother enforce a bucket overflow? [i]Proposed by Gerhard Woeginger, Netherlands[/i]

It is given $5$ numbers $1$, $3$, $5$, $7$, $9$. We get the new $5$ numbers such that we take arbitrary $4$ numbers(out of current $5$ numbers) $a$, $b$, $c$ and $d$ and replace them with $\frac{a+b+c-d}{2}$, $\frac{a+b-c+d}{2}$, $\frac{a-b+c+d}{2}$ and $\frac{-a+b+c+d}{2}$. Can we, with repeated iterations, get numbers: $a)$ $0$, $2$, $4$, $6$ and $8$ $b)$ $3$, $4$, $5$, $6$ and $7$

We are given an $n \times n$ board, where $n$ is an odd number. In each cell of the board either $+1$ or $-1$ is written. Let $a_k$ and $b_k$ denote them products of numbers in the $k^{th}$ row and in the $k^{th}$ column respectively. Prove that the sum $a_1 +a_2 +\cdots+a_n +b_1 +b_2 +\cdots+b_n$ cannot be equal to zero.

Consider $n$ students with numbers $1, 2, \ldots, n$ standing in the order $1, 2, \ldots, n.$ Upon a command, any of the students either remains on his place or switches his place with another student. (Actually, if student $A$ switches his place with student $B,$ then $B$ cannot switch his place with any other student $C$ any more until the next command comes.) Is it possible to arrange the students in the order $n,1, 2, \ldots, n-1$ after two commands ?

Let $a,b$ be two positive integers, such that $ab\neq 1$. Find all the integer values that $f(a,b)$ can take, where \[ f(a,b) = \frac { a^2+ab+b^2} { ab- 1} . \]

Triangles $ABC$ and $ABD$ are isosceles with $AB =AC = BD$, and $BD$ intersects $AC$ at $E$. If $BD$ is perpendicular to $AC$, then $\angle C + \angle D$ is [asy] size(130); defaultpen(linewidth(0.8) + fontsize(11pt)); pair A, B, C, D, E; real angle = 70; B = origin; A = dir(angle); D = dir(90-angle); C = rotate(2*(90-angle), A) * B; draw(A--B--C--cycle); draw(B--D--A); E = extension(B, D, C, A); draw(rightanglemark(B, E, A, 1.5)); label("$A$", A, dir(90)); label("$B$", B, dir(210)); label("$C$", C, dir(330)); label("$D$", D, dir(0)); label("$E$", E, 1.5*dir(340)); [/asy] $\textbf{(A)}\ 115^\circ \qquad \textbf{(B)}\ 120^\circ \qquad \textbf{(C)}\ 130^\circ \qquad \textbf{(D)}\ 135^\circ \qquad \textbf{(E)}\ \text{not uniquely determined}$

There are $ n$ markers, each with one side white and the other side black. In the beginning, these $ n$ markers are aligned in a row so that their white sides are all up. In each step, if possible, we choose a marker whose white side is up (but not one of the outermost markers), remove it, and reverse the closest marker to the left of it and also reverse the closest marker to the right of it. Prove that, by a finite sequence of such steps, one can achieve a state with only two markers remaining if and only if $ n \minus{} 1$ is not divisible by $ 3$. [i]Proposed by Dusan Dukic, Serbia[/i]

Numbers $\frac{49}{1}, \frac{49}{2}, ... , \frac{49}{97}$ are writen on a blackboard. Each time, we can replace two numbers (like $a, b$) with $2ab-a-b+1$. After $96$ times doing that prenominate action, one number will be left on the board. Find all the possible values fot that number.

Players $A$ and $B$ play a "paintful" game on the real line. Player $A$ has a pot of paint with four units of black ink. A quantity $p$ of this ink suffices to blacken a (closed) real interval of length $p$. In every round, player $A$ picks some positive integer $m$ and provides $1/2^m $ units of ink from the pot. Player $B$ then picks an integer $k$ and blackens the interval from $k/2^m$ to $(k+1)/2^m$ (some parts of this interval may have been blackened before). The goal of player $A$ is to reach a situation where the pot is empty and the interval $[0,1]$ is not completely blackened. Decide whether there exists a strategy for player $A$ to win in a finite number of moves.

There are $2019$ students sitting around circular table. Initially each of them have one candy. Teacher is allowed to pick one student, who has at least one can candy, and this student can decide, whether he gives his candy to his neighbour on the right or on the left. Prove that no matter what students teacher picks during the process, students can always ensure that any point of time no student has more than $2$ candies.

Let $n > 1$ be an integer. In a circular arrangement of $n$ lamps $L_0, \ldots, L_{n-1},$ each of of which can either ON or OFF, we start with the situation where all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \ldots .$ If $L_{j-1}$ ($j$ is taken mod $n$) is ON then $Step_j$ changes the state of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the state of any of the other lamps. If $L_{j-1}$ is OFF then $Step_j$ does not change anything at all. Show that: (i) There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again, (ii) If $n$ has the form $2^k$ then all the lamps are ON after $n^2-1$ steps, (iii) If $n$ has the form $2^k + 1$ then all lamps are ON after $n^2 - n + 1$ steps.

The numbers $1,2,\dots,10$ are written on a board. Every minute, one can select three numbers $a$, $b$, $c$ on the board, erase them, and write $\sqrt{a^2+b^2+c^2}$ in their place. This process continues until no more numbers can be erased. What is the largest possible number that can remain on the board at this point? [i]Proposed by Evan Chen[/i]