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]

A natural number is written on the blackboard. In each step, we erase the units digit and add four times the erased digit to the remaining number, and write the result on the blackboard instead of the initial number. Starting with the number $13^{2006}$, is it possible to obtain the number $2006^{13}$ by repeating this step finitely many times?

A regular $ (5 \times 5)$-array of lights is defective, so that toggling the switch for one light causes each adjacent light in the same row and in the same column as well as the light itself to change state, from on to off, or from off to on. Initially all the lights are switched off. After a certain number of toggles, exactly one light is switched on. Find all the possible positions of this light.

Given a permutation $(a_{1}, a_{1},...,a_{n})$ of the numbers $1, 2,...,n$ one may interchange any two consecutive "blocks" - that is, one may transform ($a_{1}, a_{2},...,a_{i}$,$\underbrace {a_{i+1},... a_{i+p},}_{A} $ $ \underbrace{a_{i+p+1},...,a_{i+q},}_{B}...,a_{n}) $ into $ (a_{1}, a_{2},...,a_{i},$ $ \underbrace {a_{i+p+1},...,a_{i+q},}_{B} $ $ \underbrace {a_{i+1},... a_{i+p}}_{A}$$,...,a_{n}) $ by interchanging the "blocks" $A$ and $B$. Find the least number of such changes which are needed to transform $(n, n-1,...,1)$ into $(1,2,...,n)$

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 $n$ be an integer greater than 2. A positive integer is said to be [i]attainable [/i]if it is 1 or can be obtained from 1 by a sequence of operations with the following properties: 1.) The first operation is either addition or multiplication. 2.) Thereafter, additions and multiplications are used alternately. 3.) In each addition, one can choose independently whether to add 2 or $n$ 4.) In each multiplication, one can choose independently whether to multiply by 2 or by $n$. A positive integer which cannot be so obtained is said to be [i]unattainable[/i]. [b]a.)[/b] Prove that if $n\geq 9$, there are infinitely many unattainable positive integers. [b]b.)[/b] Prove that if $n=3$, all positive integers except 7 are attainable.

Find all linear homogeneous differential equations with continuous coefficients (on the whole real line) such that for any solution $ f(t)$ and any real number $ c,f(t\plus{}c)$ is also a solution.

Let $n\ge 1$ be an odd integer. Alice and Bob play the following game, taking alternating turns, with Alice playing first. The playing area consists of $n$ spaces, arranged in a line. Initially all spaces are empty. At each turn, a player either • places a stone in an empty space, or • removes a stone from a nonempty space $s,$ places a stone in the nearest empty space to the left of $s$ (if such a space exists), and places a stone in the nearest empty space to the right of $s$ (if such a space exists). Furthermore, a move is permitted only if the resulting position has not occurred previously in the game. A player loses if he or she is unable to move. Assuming that both players play optimally throughout the game, what moves may Alice make on her first turn?

Let $a,b$ be integers with $0<a<b$. A set $\{x,y,z\}$ of non-negative integers is [i]olympic[/i] if $x<y<z$ and if $\{z-y,y-x\}=\{a,b\}$. Show that the set of all non-negative integers is the union of pairwise disjoint olympic sets.

Peter has three accounts in a bank, each with an integral number of dollars. He is only allowed to transfer money from one account to another so that the amount of money in the latter is doubled. Prove that Peter can always transfer all his money into two accounts. Can Peter always transfer all his money into one account?

Given $v = (a,b,c,d) \in \mathbb{N}^4$, let $\Delta^{1} (v) = (|a-b|,|b-c|,|c-d|,|d-a|)$ and $\Delta^{k} (v) = \Delta(\Delta^{k-1} (v))$ for $k > 1$. Define $f(v) = \min\{k \in \mathbb{N} : \Delta^k (v) = (0,0,0,0)\}$ and $\max(v) = \max\{a,b,c,d\}.$ Show that $f(v) < 1000\log \max(v)$ for all sufficiently large $v$ and $f(v) > 0.001 \log \max (v)$ for infinitely many $v$.

Numbers $1$ through $2014$ are written on a board. A valid operation is to erase two numbers $a$ and $b$ on the board and replace them with the greatest common divisor and the least common multiple of $a$ and $b$. Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than $2014$ $\times$ $\sqrt[2014]{2014!}$

We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]

For a finite set $ X$ of positive integers, let $ \Sigma(X) \equal{} \sum_{x \in X} \arctan \frac{1}{x}.$ Given a finite set $ S$ of positive integers for which $ \Sigma(S) < \frac{\pi}{2},$ show that there exists at least one finite set $ T$ of positive integers for which $ S \subset T$ and $ \Sigma(S) \equal{} \frac{\pi}{2}.$ [i]Kevin Buzzard, United Kingdom[/i]

A multi-digit number is written on the blackboard. Susan puts in a number of plus signs between some pairs of adjacent digits. The addition is performed and the process is repeated with the sum. Prove that regardless of what number was initially on the blackboard, Susan can always obtain a single-digit number in at most ten steps.

Suppose a $m \times n$ table. We write an integer in each cell of the table. In each move, we chose a column, a row, or a diagonal (diagonal is the set of cells which the difference between their row number and their column number is constant) and add either $+1$ or $-1$ to all of its cells. Prove that if for all arbitrary $3 \times 3$ table we can change all numbers to zero, then we can change all numbers of $m \times n$ table to zero. ([i]Hint[/i]: First of all think about it how we can change number of $ 3 \times 3$ table to zero.)

We attach to the vertices of a regular hexagon the numbers $1$, $0$, $0$, $0$, $0$, $0$. Now, we are allowed to transform the numbers by the following rules: (a) We can add an arbitrary integer to the numbers at two opposite vertices. (b) We can add an arbitrary integer to the numbers at three vertices forming an equilateral triangle. (c) We can subtract an integer $t$ from one of the six numbers and simultaneously add $t$ to the two neighbouring numbers. Can we, just by acting several times according to these rules, get a cyclic permutation of the initial numbers? (I. e., we started with $1$, $0$, $0$, $0$, $0$, $0$; can we now get $0$, $1$, $0$, $0$, $0$, $0$, or $0$, $0$, $1$, $0$, $0$, $0$, or $0$, $0$, $0$, $1$, $0$, $0$, or $0$, $0$, $0$, $0$, $1$, $0$, or $0$, $0$, $0$, $0$, $0$, $1$ ?)

Suppose that $V$ is a finite dimensional vector space over the real numbers equipped with an inner product and $S:V\times V \longrightarrow \mathbb R$ is a skew symmetric function that is linear for each variable when others are kept fixed. Prove there exists a linear transformation $T:V \longrightarrow V$ such that $\forall u,v \in V: S(u,v)=<u,T(v)>$. We know that there always exists $v\in V$ such that $W=<v,T(v)>$ is invariant under $T$. (it means $T(W)\subseteq W$). Prove that if $W$ is invariant under $T$ then the following subspace is also invariant under $T$: $W^{\perp}=\{v\in V:\forall u\in W <v,u>=0\}$. Prove that if dimension of $V$ is more than $3$, then there exist a two dimensional subspace $W$ of $V$ such that the volume defined on it by function $S$ is zero!!!! (This is the way that we can define a two dimensional volume for each subspace $V$. This can be done for volumes of higher dimensions.)

Let $M$ be a set of points in a plane with at least two elements. Prove that if $M$ has two axes of symmetry $g_1$ and $g_2$ intersecting at an angle $\alpha = q\pi$, where $q$ is irrational, then $M$ must be infinite.

Petya chooses $100$ pairwise distinct positive numbers less than $1$ and arranges them in a circle. In one operation, he may take three consecutive numbers \( a, b, c \) (in this order) and replace \( b \) with \( a - b + c \). What is the greatest value of \( k \) such that Petya could initially choose the numbers and perform several operations so that \( k \) of the resulting numbers are integers? \\

Let $\{x\}$ be a sequence of positive reals $x_1, x_2, \ldots, x_n$, defined by: $x_1 = 1, x_2 = 9, x_3=9, x_4=1$. And for $n \geq 1$ we have: \[x_{n+4} = \sqrt[4]{x_{n} \cdot x_{n+1} \cdot x_{n+2} \cdot x_{n+3}}.\] Show that this sequence has a finite limit. Determine this limit.

The sequence $ (a_n)$ satisfies $ a_1 \equal{} 1$ and $ \displaystyle 5^{(a_{n\plus{}1}\minus{}a_n)} \minus{} 1 \equal{} \frac{1}{n\plus{}\frac{2}{3}}$ for $ n \geq 1$. Let $ k$ be the least integer greater than $ 1$ for which $ a_k$ is an integer. Find $ k$.

Each of the six boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$, $B_6$ initially contains one coin. The following operations are allowed Type 1) Choose a non-empty box $B_j$, $1\leq j \leq 5$, remove one coin from $B_j$ and add two coins to $B_{j+1}$; Type 2) Choose a non-empty box $B_k$, $1\leq k \leq 4$, remove one coin from $B_k$ and swap the contents (maybe empty) of the boxes $B_{k+1}$ and $B_{k+2}$. Determine if there exists a finite sequence of operations of the allowed types, such that the five boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$ become empty, while box $B_6$ contains exactly $2010^{2010^{2010}}$ coins. [i]Proposed by Hans Zantema, Netherlands[/i]

The vertices of a regular $n$-gon are initially marked with one of the signs $+$ or $-$ . A [i]move[/i] consists in choosing three consecutive vertices and changing the signs from the vertices , from $+$ to $-$ and from $-$ to $+$. [b]a)[/b] Prove that if $n=2015$ then for any initial configuration of signs , there exists a sequence of [i]moves[/i] such that we'll arrive at a configuration with only $+$ signs. [b]b)[/b] Prove that if $n=2016$ , then there exists an initial configuration of signs such that no matter how we make the [i]moves[/i] we'll never arrive at a configuration with only $+$ signs.

Circle is divided into $n$ arcs by $n$ marked points on the circle. After that circle rotate an angle $ 2\pi k/n $ (for some positive integer $ k $), marked points moved to $n$ [i] new points [/i], dividing the circle into $ n $ [i] new arcs[/i]. Prove that there is a new arc that lies entirely in the one of the old arсs. (It is believed that the endpoints of arcs belong to it.) [i]I. Mitrophanov[/i]