Prove that in any set of $2000$ distinct real numbers there exist two pairs $a>b$ and $c>d$ with $a \neq c$ or $b \neq d $, such that \[ \left| \frac{a-b}{c-d} - 1 \right|< \frac{1}{100000}. \]

A finite collection of digits $0$ and $1$ is written around a circle. An [i]arc[/i] of length $L\ge 0$ consists of $L$ consecutive digits around the circle. For each arc $w,$ let $Z(w)$ and $N(w)$ denote the number of $0$'s in $w$ and the number of $1$'s in $w,$ respectively. Assume that $|Z(w)-Z(w')|\le 1$ for any two arcs $w,w'$ of the same length. Suppose that some arcs $w_1,\dots,w_k$ have the property that \[Z=\frac1k\sum_{j=1}^kZ(w_j)\text{ and }N=\frac1k\sum_{j=1}^k N(w_j)\] are both integers. Prove that there exists an arc $w$ with $Z(w)=Z$ and $N(w)=N.$

Prove that every selection of $1325$ integers from $M=\{1, 2, \cdots, 1987 \}$ must contain some three numbers $\{a, b, c\}$ which are pairwise relatively prime, but that it can be avoided if only $1324$ integers are selected.

Let $n\geq 1$ be an integer and let $X$ be a set of $n^2+1$ positive integers such that in any subset of $X$ with $n+1$ elements there exist two elements $x\neq y$ such that $x\mid y$. Prove that there exists a subset $\{x_1,x_2,\ldots, x_{n+1} \} \in X$ such that $x_i \mid x_{i+1}$ for all $i=1,2,\ldots, n$.

Given a positive integer $n,$ what is the largest $k$ such that the numbers $1,2,\dots,n$ can be put into $k$ boxes so that the sum of the numbers in each box is the same? [When $n=8,$ the example $\{1,2,3,6\},\{4,8\},\{5,7\}$ shows that the largest $k$ is [i]at least[/i] 3.]

Nine mathematicians meet at an international conference and discover that among any three of them, at least two speak a common language. If each of the mathematicians speak at most three languages, prove that there are at least three of the mathematicians who can speak the same language.

Let $S$ be a nonempty set of primes satisfying the property that for each proper subset $P$ of $S$, all the prime factors of the number $\left(\prod_{p\in P}p\right)-1$ are also in $S$. Determine all possible such sets $S$.

We want to place $2012$ pockets, including variously colored balls, into $k$ boxes such that [b]i)[/b] For any box, all pockets in this box must include a ball with the same color or [b]ii)[/b] For any box, all pockets in this box must include a ball having a color which is not included in any other pocket in this box Find the smallest value of $k$ for which we can always do this placement whatever the number of balls in the pockets and whatever the colors of balls.

Let $c$ be fixed natural number. Sequence $(a_n)$ is defined by: $a_1=1$, $a_{n+1}=d(a_n)+c$ for $n=1,2,...$. where $d(m)$ is number of divisors of $m$. Prove that there exist $k$ natural such that sequence $a_k,a_{k+1},...$ is periodic.

Show that it is impossible to cover a unit square with five equal squares with side $s<\frac{1}{2}$.

Given a positive integer $n,$ what is the largest $k$ such that the numbers $1,2,\dots,n$ can be put into $k$ boxes so that the sum of the numbers in each box is the same? [When $n=8,$ the example $\{1,2,3,6\},\{4,8\},\{5,7\}$ shows that the largest $k$ is [i]at least[/i] 3.]

Let $F=\{1,2,...,100\}$ and let $G$ be any $10$-element subset of $F$. Prove that there exist two disjoint nonempty subsets $S$ and $T$ of $G$ with the same sum of elements.

a. Does there exist 4 distinct positive integers such that the sum of any 3 of them is prime? b. Does there exist 5 distinct positive integers such that the sum of any 3 of them is prime?

Prove that we can give a color to each of the numbers $1,2,3,...,2013$ with seven distinct colors (all colors are necessarily used) such that for any distinct numbers $a,b,c$ of the same color, then $2014\nmid abc$ and the remainder when $abc$ is divided by $2014$ is of the same color as $a,b,c$.

For the positive integer $n$, define $f(n)=\min\limits_{m\in\Bbb Z}\left|\sqrt2-\frac mn\right|$. Let $\{n_i\}$ be a strictly increasing sequence of positive integers. $C$ is a constant such that $f(n_i)<\dfrac C{n_i^2}$ for all $i\in\{1,2,\ldots\}$. Show that there exists a real number $q>1$ such that $n_i\geqslant q^{i-1}$ for all $i\in\{1,2,\ldots \}$.

Given is a cube $3 \times 3 \times 3$ with $27$ unit cubes. In each such cube a positive integer is written. Call a $\textit {strip}$ a block $1 \times 1 \times 3$ of $3$ cubes. The numbers are written so that for each cube, its number is the sum of three other numbers, one from each of the three strips it is in. Prove that there are at least $16$ numbers that are at most $60$.

From the interval $(2^{2n},2^{3n})$ are selected $2^{2n-1}+1$ odd numbers. Prove that there are two among the selected numbers, none of which divides the square of the other.

Let $G$ be a connected graph, with degree of all vertices not less then $m \geq 3$, such that there is no path through all vertices of $G$ being in every vertex exactly once. Find the least possible number of vertices of $G.$

Let $a_1,a_2,...,a_n$ be integers . Show that there exists integers $k$ and $r$ such that the sum $a_k+a_{k+1}+...+a_{k+r}$ is divisible by $n$ .

Two boxes contain between them 65 balls of several different sizes. Each ball is white, black, red or yellow. If you take any five balls of the same colour, at least two of them will always be of the same size(radius). Prove that there are at least three ball which lie in the same box have the same colour and have the same size(radius).

Prove that from a set of ten distinct two-digit numbers, it is always possible to find two disjoint subsets whose members have the same sum.

The sequence $a_1, a_2, a_3, ...$ is defined by $a_1 = a_2 = a_3 = 1$, $a_{n+3} = a_{n+2}a_{n+1} + a_n$. Show that for any positive integer $r$ we can find $s$ such that $a_s$ is a multiple of $r$.

There is an integer $n > 1$. There are $n^2$ stations on a slope of a mountain, all at different altitudes. Each of two cable car companies, $A$ and $B$, operates $k$ cable cars; each cable car provides a transfer from one of the stations to a higher one (with no intermediate stops). The $k$ cable cars of $A$ have $k$ different starting points and $k$ different finishing points, and a cable car which starts higher also finishes higher. The same conditions hold for $B$. We say that two stations are linked by a company if one can start from the lower station and reach the higher one by using one or more cars of that company (no other movements between stations are allowed). Determine the smallest positive integer $k$ for which one can guarantee that there are two stations that are linked by both companies. [i]Proposed by Tejaswi Navilarekallu, India[/i]

A real number $a$ is given. The sequence $n_{1}< n_{2}< n_{3}< ...$ consists of all the positive integral $n$ such that $\{na\}< \frac{1}{10}$. Prove that there are at most three different numbers among the numbers $n_{2}-n_{1}$, $n_{3}-n_{2}$, $n_{4}-n_{3}$, $\ldots$. [i]A corollary of a theorem from ergodic theory[/i]

Prove that every integer $ k$ greater than 1 has a multiple that is less than $ k^4$ and can be written in the decimal system with at most four different digits.