Is there a positive integer $n$ for which the following holds: for an arbitrary rational $r$ there exists an integer $b$ and non-zero integers $a _1, a_2, ..., a_n$ such that $r=b+\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_n}$ ?

If $x_1,x_2,...,x_{2001}$ are real numbers with $0 \le x_n \le 1$ for $n = 1,2,...,2001$, find the maximum value of $$\left(\frac{1}{2001}\sum_{n=1}^{2001}x_n^2\right)-\left(\frac{1}{2001}\sum_{n=1}^{2001}x_n\right)^2$$ Where is this maximum attained?

On a circle, numbers from $1$ to $100$ are arranged in some order. We call a pair of numbers [i]good [/i] if these two numbers do not stand side by side, and at least on one of the two arcs into which they break a circle, all the numbers are less than each of them. What can be the total number of [i]good [/i] pairs?

Let $f(x) = x^3 - 3x + b$ and $g(x) = x^2 + bx -3$, where $b$ is a real number. What is the sum of all possible values of $b$ for which the equations $f(x)$ = 0 and $g(x) = 0$ have a common root?

Consider the numbers from $1$ to $32$. A game is made by placing all the numbers in pairs and replacing each pair with the largest prime divisor of the sum of the numbers of that couple. For example, if we match the $32$ numbers as: $(1, 2), (3,4),(5, 6), (7, 8),..., (27, 28),(29, 30), (31,32)$, we get the following list of $16$ numbers: $3,7,11,5,...,11,59,7$. where there are repetitions. The game continues in a similar way until in the end only one number remains. Determine the highest possible value from the number that remains at the end.

Let $p$ be a prime number. A set of $p + 2$ positive integers, not necessarily distinct, is called [i]interesting [/i] if the sum of any $p$ of them is divisible by each of the other two. Determine all interesting sets.

Given natural numbers $x_1,x_2,...,x_n,y_1,y_2,...,y_m$. The following condition is valid: $$(x_1+x_2+...+x_n)=(y_1+y_2+...+y_m)<mn \,\,\,\, (*)$$ Prove that it is possible to delete some terms from (*) (not all and at least one) and to obtain another valid condition.

Calculate the sum $$\frac{1}{1+2^{-2006}}+...+ \frac{1}{1+2^{-1}}+ \frac{1}{1+2^{0}}+ \frac{1}{1+2^{1}}+...+ \frac{1}{1+2^{2006}}$$

Let $ a_1, a_2, ..., a_ {1994} $ be integers such that $ a_1 + a_2 + ... + a_{1994} = 1994 ^{1994} $ . Determine the remainder of the division of $ a ^ 3_1 + a ^ 3_2 + ... + a ^ 3_{1994} $ with $6$.

Consider all products by $2, 4, 6, ..., 2000$ of the elements of the set $A =\left\{\frac12, \frac13, \frac14,...,\frac{1}{2000},\frac{1}{2001}\right\}$ . Find the sum of all these products.

A domino has two numbers (which may be equal) between $0$ and $6$, one at each end. The domino may be turned around. There is one domino of each type, so $28$ in all. We want to form a chain in the usual way, so that adjacent dominos have the same number at the adjacent ends. Dominos can be added to the chain at either end. We want to form the chain so that after each domino has been added the total of all the numbers is odd. For example, we could place first the domino $(3,4)$, total $3 + 4 = 7$. Then $(1,3)$, total $1 + 3 + 3 + 4 = 11$, then $(4,4)$, total $11 + 4 + 4 = 19$. What is the largest number of dominos that can be placed in this way? How many maximum-length chains are there?

Given an integer $N \geq 4$, determine the largest value the sum $$\sum_{i=1}^{\left \lfloor{\frac{k}{2}}\right \rfloor+1}\left( \left \lfloor{\frac{n_i}{2}}\right \rfloor+1\right)$$ may achieve, where $k, n_1, \ldots, n_k$ run through the integers subject to $k \geq 3$, $n_1 \geq \ldots\geq n_k\geq 1$ and $n_1 + \ldots + n_k = N$.

Show that for all $n\ge 3$ there are $n$ different positive integers $x_1,x_2, ...,x_n$ such that $$\frac{1}{x_1}+\frac{1}{x_2}+...+\frac{1}{x_n}= 1.$$

The real numbers $x_1, x_2, ... , x_{1991}$ satisfy $$|x_1 - x_2| + |x_2 - x_3| + ... + |x_{1990} - x_{1991}| = 1991$$ What is the maximum possible value of $$|s_1 - s_2| + |s_2 - s_3| + ... + |s_{1990} - s_{1991}|$$ where $$s_n = \frac{x_1 + x_2 + ... + x_n}{n}?$$

In how many ways can the number $2000$ be written as a sum of three positive, not necessarily different integers? (Sums like $1 + 2 + 3$ and $3 + 1 + 2$ etc. are the same.)

$n$ real numbers are written in increasing order in a line. The same numbers are written in the second line below in unknown order. The third line contains the sums of the pairs of numbers above from two previous lines. It comes out, that the third line is arranged in increasing order. Prove that the second line coincides with the first one.

Let $x_1,..., x_n$ be non-negative real numbers, not all of which are zeros. (i) Prove that $$1 \le \frac{\left(x_1+\frac{x_2}{2}+\frac{x_3}{3}+...+\frac{x_n}{n}\right)(x_1+2x_2+3x_3+...+nx_n)}{(x_1+x_2+x_3+...+x_n)^2} \le \frac{(n+1)^2}{4n}$$ (ii) Show that, for each $n > 1$, both inequalities can hold as equalities.

* Given several numbers each of which is less than $1951$ and the least common multiple of any two of which is greater than $1951$. Prove that the sum of their reciprocals is less than $2$.

Prove that $$\dfrac{1}{2+\dfrac{1}{3+\dfrac{1}{4+\dfrac{1}{...+\dfrac{1}{9991}}}}}+\dfrac{1}{1+\dfrac{1}{1+\dfrac{1}{3+\dfrac{1}{4+\dfrac{1}{...+\dfrac{1}{9991}}}}}}=1$$ This means $1/(2+ (1/(3+ (1/(4+(...+1/1991)))))) +1/(1 + (1/(1 + (1/(3 + (1/(4 + (...+ 1/1991...)))))))) = 1.)$ (G. Galperin, Moscow-Tel Aviv)

Let $n$ be a positive integer. Consider sequences $a_0, a_1, ..., a_k$ and $b_0, b_1,,..,b_k$ such that $a_0 = b_0 = 1$ and $a_k = b_k = n$ and such that for all $i$ such that $1 \le i \le k $, we have that $(a_i, b_i)$ is either equal to $(1 + a_{i-1}, b_{i-1})$ or $(a_{i-1}; 1 + b_{i-1})$. Consider for $1 \le i \le k$ the number $c_i = \begin{cases} a_i \,\,\, if \,\,\, a_i = a_{i-1} \\ b_i \,\,\, if \,\,\, b_i = b_{i-1}\end{cases}$ Show that $c_1 + c_2 + ... + c_k = n^2 - 1$.

Given a sequence of $19$ positive integers not exceeding $88$ and another sequence of $88$ positive integers not exceeding $19$. Show that we can find two subsequences of consecutive terms, one from each sequence, with the same sum.

Let $180^o < \theta_1 < \theta_2 <...< \theta_n = 360^o$. For $i = 1,2,..., n$, $P_i = (\cos \theta_i^o, \sin \theta_i^o)$ is a point on the circle $C$ with centre $(0,0)$ and radius $1$. Let $P$ be any point on the upper half of $C$. Find the coordinates of $P$ such that the sum of areas $[PP_1P_2] + [PP_2P_3] + ...+ [PP_{n-1}P_n]$ attains its maximum.

Is it possible to arrange integers in the cells of the infinite chechered sheet so that every integer appears at least in one cell, and the sum of any $10$ numbers in a row vertically or horizontal, would be divisible by $101$?

In each cell of a table with $m$ rows and $n$ columns, where $m<n$, we put a non-negative real number such that each column contains at least one positive number. Show that there is a cell with a positive number such that the sum of the numbers in its row is larger than the sum of the numbers in its column.

We call a number greater than $25$, [i] semi-prime[/i] if it is the sum of some two different prime numbers. What is the greatest number of consecutive natural numbers that can be [i]semi-prime[/i]?