Prove that, for every set $X=\{x_{1},x_{2},\dots,x_{n}\}$ of $n$ real numbers, there exists a non-empty subset $S$ of $X$ and an integer $m$ such that \[\left|m+\sum_{s\in S}s\right|\le\frac1{n+1}\]

Prove that there exists a positive real number $C$ with the following property: for any integer $n\ge 2$ and any subset $X$ of the set $\{1,2,\ldots,n\}$ such that $|X|\ge 2$, there exist $x,y,z,w \in X$(not necessarily distinct) such that \[0<|xy-zw|<C\alpha ^{-4}\] where $\alpha =\frac{|X|}{n}$.

Let $S$ be a set of $n$ elements and $S_1,\ S_2,\dots,\ S_k$ are subsets of $S$ ($k\geq2$), such that every one of them has at least $r$ elements. Show that there exists $i$ and $j$, with $1\leq{i}<j\leq{k}$, such that the number of common elements of $S_i$ and $S_j$ is greater or equal to: $r-\frac{nk}{4(k-1)}$

Let $n$ be a positive integer. A $corner$ is a finite set $S$ of ordered $n$-tuples of positive integers such that if $a_1, a_2, \ldots, a_n, b_1, b_2, \ldots, b_n$ are positive integers with $a_k \geq b_k$ for $k = 1, 2, \ldots, n$ and $(a_1, a_2, \ldots, a_n) \in S$, then $(b_1, b_2, \ldots, b_n) \in S$. Prove that among any infinite collection of corners, there exist two corners, one of which is a subset of the other one.

Prove that if $n$ is large enough, among any $n$ points of plane we can find $1000$ points such that these $1000$ points have pairwise distinct distances. Can you prove the assertion for $n^{\alpha}$ where $\alpha$ is a positive real number instead of $1000$?

Let $\mathcal U = \left\{ \left( x,y \right) | x,y \in \mathbb Z, \ 0 \leq x,y < 4 \right\}$. (a) Prove that we can choose $6$ points from $\mathcal U$ such that there are no isosceles triangles with the vertices among the chosen points. (b) Prove that no matter how we choose $7$ points from $\mathcal U$, there are always three which form an isosceles triangle. [i]Radu Gologan, Dinu Serbanescu[/i]

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$.

A tournament on $2k$ vertices contains no $7$-cycles. Show that its vertices can be partitioned into two sets, each with size $k$, such that the edges between vertices of the same set do not determine any $3$-cycles. [i]Calvin Deng.[/i]

Let $ n \geq 3$ be a positive integer and let $ m \geq 2^{n\minus{}1}\plus{}1$. Prove that for each family of nonzero distinct subsets $ (A_j)_{j \in \overline{1, m}}$ of $ \{1, 2, ..., n\}$ there exist $ i$, $ j$, $ k$ such that $ A_i \cup A_j \equal{} A_k$.

Let $ a$ be a fix natural number . Prove that the set of prime divisors of $ 2^{2^{n}} \plus{} a$ for $ n \equal{} 1,2,\cdots$ is infinite

For non-empty number sets $S, T$, define the sets $S+T=\{s+t\mid s\in S, t\in T\}$ and $2S=\{2s\mid s\in S\}$. Let $n$ be a positive integer, and $A, B$ be two non-empty subsets of $\{1,2\ldots,n\}$. Show that there exists a subset $D$ of $A+B$ such that 1) $D+D\subseteq 2(A+B)$, 2) $|D|\geq\frac{|A|\cdot|B|}{2n}$, where $|X|$ is the number of elements of the finite set $X$.

Let $n\ge 3$ be a fixed integer. There are $m\ge n+1$ beads on a circular necklace. You wish to paint the beads using $n$ colors, such that among any $n+1$ consecutive beads every color appears at least once. Find the largest value of $m$ for which this task is $\emph{not}$ possible. [i]Carl Schildkraut, USA[/i]

There are representants from $n$ different countries sit around a circular table ($n\geq2$), in such way that if two representants are from the same country, then, their neighbors to the right are not from the same country. Find, for every $n$, the maximal number of people that can be sit around the table.

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$.

Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$.

In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]

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).

Given strictly increasing sequence $ a_1<a_2<\dots$ of positive integers such that each its term $ a_k$ is divisible either by 1005 or 1006, but neither term is divisible by $ 97$. Find the least possible value of maximal difference of consecutive terms $ a_{i\plus{}1}\minus{}a_i$.

Given the polynomial $P(x)=(x^2-7x+6)^{2n}+13$ where $n$ is a positive integer. Prove that $P(x)$ can't be written as a product of $n+1$ non-constant polynomials with integer coefficients.

Let $G$ be a graph, not containing $K_4$ as a subgraph and $|V(G)|=3k$ (I interpret this to be the number of vertices is divisible by 3). What is the maximum number of triangles in $G$?

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]

Let $ p \equiv 3 \pmod{4}$ be a prime. Define $T = \{ (i,j) \mid i, j \in \{ 0, 1, \cdots , p-1 \} \} \smallsetminus \{ (0,0) \} $. For arbitrary subset $ S ( \ne \emptyset ) \subset T $, prove that there exist subset $ A \subset S $ satisfying following conditions: (a) $ (x_i , y_i ) \in A ( 1 \le i \le 3) $ then $ p \not | x_1 + x_2 - y_3 $ or $ p \not | y_1 + y_2 + x_3 $. (b) $ 8 n(A) > n(S) $

Let $S$ be a set of $ 2 \times 2 $ integer matrices whose entries $a_{ij}(1)$ are all squares of integers and, $(2)$ satisfy $a_{ij} \le 200$. Show that $S$ has more than $ 50387 (=15^4-15^2-15+2) $ elements, then it has two elements that commute.

Consider a convex $2000$-gon, no three of whose diagonals have a common point. Each of its diagonals is colored in one of $999$ colors. Prove that there exists a triangle all of whose sides lie on diagonals of the same color. (Vertices of the triangle need not be vertices of the original polygon.)