You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.

If $ P(x)$ denotes a polynomial of degree $ n$ such that $ P(k)\equal{}\frac{k}{k\plus{}1}$ for $ k\equal{}0,1,2,\ldots,n$, determine $ P(n\plus{}1)$.

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Find all prime numbers $p$ and $q$ such that $$1 + \frac{p^q - q^p}{p + q}$$ is a prime number. [i]Proposed by Dorlir Ahmeti, Albania[/i]

In a mathematical competition, some competitors are friends; friendship is mutual, that is, when $A$ is a friend of $B$, then $B$ is also a friend of $A$. We say that $n \geq 3$ different competitors $A_1, A_2, \ldots, A_n$ form a [i]weakly-friendly cycle [/i]if $A_i$ is not a friend of $A_{i+1}$ for $1 \leq i \leq n$ (where $A_{n+1} = A_1$), and there are no other pairs of non-friends among the components of the cycle. The following property is satisfied: "for every competitor $C$ and every weakly-friendly cycle $\mathcal{S}$ of competitors not including $C$, the set of competitors $D$ in $\mathcal{S}$ which are not friends of $C$ has at most one element" Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends. ([i]Serbia[/i])

Let $n$ be a positive integer. On a number line, Azer is at point $0$ in his car which have fuel capacity of $2^n$ units and is initially full. At each positive integer $m$, there is a gas station. Azer only moves to the right with constant speed and doesn't stop anywhere except the gas stations. Each time his car moves to the right by some amount, its fuel decreases by the same amount. Azer may choose to stop at a gas station or pass it. There are thieves at some gas stations. (A station may have multiple thieves) If Azer stops at a station which have $k\ge 0$ thieves while its car have fuel capacity $d$, his cars new fuel capacity becomes $\frac{d}{2^k}$. After that, Azer fulls his cars tank and leaves the station. Find the minimum number of thieves needed to guarantee that Azer will eventually run out of fuel. Proposed by[i] Mehmet Can Baştemir[/i] and [i]Deniz Can Karaçelebi[/i]

For $2n$ positive integers a matching (i.e. dividing them into $n$ pairs) is called {\it non-square} if the product of two numbers in each pair is not a perfect square. Prove that if there is a non-square matching, then there are at least $n!$ non-square matchings. (By $n!$ denote the product $1\cdot 2\cdot 3\cdot \ldots \cdot n$.)

Find all increasing sequences $a_1,a_2,a_3,...$ of natural numbers such that for each $i,j\in \mathbb N$, number of the divisors of $i+j$ and $a_i+a_j$ is equal. (an increasing sequence is a sequence that if $i\le j$, then $a_i\le a_j$.)

Let $1=d_1<d_2<\ldots<d_k=n$ be all divisors of $n$. It turned out that numbers $d_2-d_1,\ldots,d_k-d_{k-1}$ are $1,3,\ldots,2k-3$ in some order. Find all possible values of $n$ [i]M. Zorka[/i]

One hundred tennis players took part in a tournament where they played with each other exactly one game, with no draws. At the end of the tournament a table (ranking) is formed depending on the number of victories. It is known that one tennis player finished the tournament on $k$-th place and is the only one with that number of victories, and he has beaten every tennis player who is placed above him in the table and lost to anyone ranked weaker than him on the table. Find the smallest value of $k$.

Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions: \[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n; \] \[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n. \] [i]Author: Dusan Dukic, Serbia[/i]

Find all $ f:\mathbb{Z}\rightarrow\mathbb{Z} $ such that \[ f(2m+f(m)+f(m)f(n))=nf(m)+m \] $ \forall m,n\in\mathbb{Z} $

Consider a sequence $\{a_n\}_{n\geq 0}$ such that $a_{n+1}=a_n-\lfloor{\sqrt{a_n}}\rfloor\ (n\geq 0),\ a_0\geq 0$. (1) If $a_0=24$, then find the smallest $n$ such that $a_n=0$. (2) If $a_0=m^2\ (m=2,\ 3,\ \cdots)$, then for $j$ with $1\leq j\leq m$, express $a_{2j-1},\ a_{2j}$ in terms of $j,\ m$. (3) Let $m\geq 2$ be integer and for integer $p$ with $1\leq p\leq m-1$, let $a\0=m^2-p$. Find $k$ such that $a_k=(m-p)^2$, then find the smallest $n$ such that $a_n=0$.

Let $n\ge 2$ be an integer. Elwyn is given an $n\times n$ table filled with real numbers (each cell of the table contains exactly one number). We define a [i]rook set[/i] as a set of $n$ cells of the table situated in $n$ distinct rows as well as in n distinct columns. Assume that, for every rook set, the sum of $n$ numbers in the cells forming the set is nonnegative.\\ \\ By a move, Elwyn chooses a row, a column, and a real number $a,$ and then he adds $a$ to each number in the chosen row, and subtracts $a$ from each number in the chosen column (thus, the number at the intersection of the chosen row and column does not change). Prove that Elwyn can perform a sequence of moves so that all numbers in the table become nonnegative.

Determine the largest odd positive integer $n$ such that every odd integer $k$ with $1<k<n$ and $\gcd(k, n)=1$ is a prime.