For $n=2^m$ (m is a positive integer) consider the set $M(n) = \{ 1,2,...,n\}$ of natural numbers. Prove that there exists an order $a_1, a_2, ..., a_n$ of the elements of M(n), so that for all $1\leq i < j < k \leq n$ holds: $a_j - a_i \neq a_k - a_j$.

Let $S$ be a set with 2002 elements, and let $N$ be an integer with $0 \leq N \leq 2^{2002}$. Prove that it is possible to color every subset of $S$ either black or white so that the following conditions hold: (a) the union of any two white subsets is white; (b) the union of any two black subsets is black; (c) there are exactly $N$ white subsets.

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

Note that $8^3 - 7^3 = 169 = 13^2$ and $13 = 2^2 + 3^2.$ Prove that if the difference between two consecutive cubes is a square, then it is the square of the sum of two consecutive squares.

The sequence $(x_n)$ is determined by the conditions: $x_0=1992,x_n=-\frac{1992}{n} \cdot \sum_{k=0}^{n-1} x_k$ for $n \geq 1$. Find $\sum_{n=0}^{1992} 2^nx_n$.

Let $x_1,x_2,\ldots,x_n$ be real numbers. Prove that \[ \sum_{i,j=1}^n |x_i+x_j|\geq n\sum_{i=1}^n |x_i| \]

A sequence of numbers is defined recursively by $a_1 = 1$, $a_2 = \frac{3}{7}$, and $$a_n=\frac{a_{n-2} \cdot a_{n-1}}{2a_{n-2} - a_{n-1}}$$for all $n \geq 3$ Then $a_{2019}$ can be written as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive inegers. What is $p+q ?$ $\textbf{(A) } 2020 \qquad\textbf{(B) } 4039 \qquad\textbf{(C) } 6057 \qquad\textbf{(D) } 6061 \qquad\textbf{(E) } 8078$

Nina and Tadashi play the following game. Initially, a triple $(a, b, c)$ of nonnegative integers with $a+b+c=2021$ is written on a blackboard. Nina and Tadashi then take moves in turn, with Nina first. A player making a move chooses a positive integer $k$ and one of the three entries on the board; then the player increases the chosen entry by $k$ and decreases the other two entries by $k$. A player loses if, on their turn, some entry on the board becomes negative. Find the number of initial triples $(a, b, c)$ for which Tadashi has a winning strategy.

Find all positive integers $n$ for which all positive divisors of $n$ can be put into the cells of a rectangular table under the following constraints: [list] [*]each cell contains a distinct divisor; [*]the sums of all rows are equal; and [*]the sums of all columns are equal. [/list]

Some checkers placed on an $n \times n$ checkerboard satisfy the following conditions: (a) every square that does not contain a checker shares a side with one that does; (b) given any pair of squares that contain checkers, there is a sequence of squares containing checkers, starting and ending with the given squares, such that every two consecutive squares of the sequence share a side. Prove that at least $(n^{2}-2)/3$ checkers have been placed on the board.

Determine all functions $ f$ from the set of positive integers to the set of positive integers such that, for all positive integers $ a$ and $ b$, there exists a non-degenerate triangle with sides of lengths \[ a, f(b) \text{ and } f(b \plus{} f(a) \minus{} 1).\] (A triangle is non-degenerate if its vertices are not collinear.) [i]Proposed by Bruno Le Floch, France[/i]

Let $n$ be a given positive integer. In the Cartesian plane, each lattice point with nonnegative coordinates initially contains a butterfly, and there are no other butterflies. The [i]neighborhood[/i] of a lattice point $c$ consists of all lattice points within the axis-aligned $(2n+1) \times (2n+1)$ square entered at $c$, apart from $c$ itself. We call a butterfly [i]lonely[/i], [i]crowded[/i], or [i]comfortable[/i], depending on whether the number of butterflies in its neighborhood $N$ is respectively less than, greater than, or equal to half of the number of lattice points in $N$. Every minute, all lonely butterflies fly away simultaneously. This process goes on for as long as there are any lonely butterflies. Assuming that the process eventually stops, determine the number of comfortable butterflies at the final state.

Let $n >1$ be a natural number and $T_{n}(x)=x^n + a_{n-1}x^{n-1} + a_{n-2}x^{n-2} + ... + a_1 x^1 + a_0$.\\ Assume that for each nonzero real number $t $ we have $T_{n}(t+\frac {1}{t})=t^n+\frac {1}{t^n} $.\\ Prove that for each $0\le i \le n-1 $ $gcd (a_i,n) >1$. [i]Proposed by Morteza Saghafian[/i]

Find all surjective functions $ f: \mathbb{N} \to \mathbb{N}$ such that for every $ m,n \in \mathbb{N}$ and every prime $ p,$ the number $ f(m + n)$ is divisible by $ p$ if and only if $ f(m) + f(n)$ is divisible by $ p$. [i]Author: Mohsen Jamaali and Nima Ahmadi Pour Anari, Iran[/i]