At the vertices $A, B, C, D, E, F, G, H$ of a cube, $2001, 2002, 2003, 2004, 2005, 2008, 2007$ and $2006$ stones respectively are placed. It is allowed to move a stone from a vertex to each of its three neighbours, or to move a stone to a vertex from each of its three neighbours. Which of the following arrangements of stones at $A, B, \ldots , H$ can be obtained? $(\text{a})\quad 2001, 2002, 2003, 2004, 2006, 2007, 2008, 2005;$ $(\text{b})\quad 2002, 2003, 2004, 2001, 2006, 2005, 2008, 2007;$ $(\text{c})\quad 2004, 2002, 2003, 2001, 2005, 2008, 2007, 2006.$

A natural number is written in each square of an $ m \times n$ chess board. The allowed move is to add an integer $ k$ to each of two adjacent numbers in such a way that non-negative numbers are obtained. (Two squares are adjacent if they have a common side.) Find a necessary and sufficient condition for it to be possible for all the numbers to be zero after finitely many operations.

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]

The numbers $1,2,\dots,2000$ are written on the board. Two players are playing a game with alternating moves. A move consists of erasing two number $a,b$ and writing $a^b$. After some time only one number is left. The first player wins, if the numbers last digit is $2$, $7$ or $8$. If not, the second player wins. Who has a winning strategy? [I]Proposed by V. Frank[/i]

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$ ?)

Let $ p,q,n$ be three positive integers with $ p \plus{} q < n$. Let $ (x_{0},x_{1},\cdots ,x_{n})$ be an $ (n \plus{} 1)$-tuple of integers satisfying the following conditions : (a) $ x_{0} \equal{} x_{n} \equal{} 0$, and (b) For each $ i$ with $ 1\leq i\leq n$, either $ x_{i} \minus{} x_{i \minus{} 1} \equal{} p$ or $ x_{i} \minus{} x_{i \minus{} 1} \equal{} \minus{} q$. Show that there exist indices $ i < j$ with $ (i,j)\neq (0,n)$, such that $ x_{i} \equal{} x_{j}$.

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]

Let $n > 3$ be a positive integer. Suppose that $n$ children are arranged in a circle, and $n$ coins are distributed between them (some children may have no coins). At every step, a child with at least 2 coins may give 1 coin to each of their immediate neighbors on the right and left. Determine all initial distributions of the coins from which it is possible that, after a finite number of steps, each child has exactly one coin.

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]

The numbers $\frac 32$, $\frac 43$ and $\frac 65$ are intially written on the blackboard. A move consists of erasing one of the numbers from the blackboard, call it $a$, and replacing it with $bc-b-c+2$, where $b,c$ are the other two numbers currently written on the blackboard. Is it possible that $\frac{1000}{999}$ would eventually appear on the blackboard? What about $\frac{113}{108}$? [i] (Andrei Bâra)[/i]

Let $ A$, $ B$, $ C$, $ A^{\prime}$, $ B^{\prime}$, $ C^{\prime}$, $ X$, $ Y$, $ Z$, $ X^{\prime}$, $ Y^{\prime}$, $ Z^{\prime}$ and $ P$ be pairwise distinct points in space such that $ A^{\prime} \in BC;\ B^{\prime}\in CA;\ C^{\prime}\in AB;\ X^{\prime}\in YZ;\ Y^{\prime}\in ZX;\ Z^{\prime}\in XY;$ $ P \in AX;\ P\in BY;\ P\in CZ;\ P\in A^{\prime}X^{\prime};\ P\in B^{\prime}Y^{\prime};\ P\in C^{\prime}Z^{\prime}$. Prove that $ \frac {BA^{\prime}}{A^{\prime}C}\cdot\frac {CB^{\prime}}{B^{\prime}A}\cdot\frac {AC^{\prime}}{C^{\prime}B} \equal{} \frac {YX^{\prime}}{X^{\prime}Z}\cdot\frac {ZY^{\prime}}{Y^{\prime}X}\cdot\frac {XZ^{\prime}}{Z^{\prime}Y}$.

On an infinite chessboard, a solitaire game is played as follows: at the start, we have $n^2$ pieces occupying a square of side $n.$ The only allowed move is to jump over an occupied square to an unoccupied one, and the piece which has been jumped over is removed. For which $n$ can the game end with only one piece remaining on the board?

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]

Let $M$ be a connected, compact $C^{\infty}$-differentiable manifold, and denote the vector space of smooth real functions on $M$ by $C^{\infty}(M)$. Let the subspace $V\le C^{\infty}(M)$ be invariant under $C^{\infty}$-diffeomorphisms of $M$, that is, let $f\circ h\in V$ for every $f\in V$ and for every $C^{\infty}$-diffeomorphism $h\colon M\rightarrow M$. Prove that if $V$ is different from the subspaces $\{ 0\}$ and $C^{\infty}(M)$ then $V$ only contains the constant functions.