Let $G=G(V,E)$ be a simple graph with vertex set $V$ and edge set $E$. Suppose $|V|=n$. A map $f:\,V\rightarrow\mathbb{Z}$ is called good, if $f$ satisfies the followings: (1) $\sum_{v\in V} f(v)=|E|$; (2) color arbitarily some vertices into red, one can always find a red vertex $v$ such that $f(v)$ is no more than the number of uncolored vertices adjacent to $v$. Let $m(G)$ be the number of good maps. Prove that if every vertex in $G$ is adjacent to at least one another vertex, then $n\leq m(G)\leq n!$.

Let $n\in\mathbb{N}$ and $0\leq a_1\leq a_2\leq\ldots\leq a_n\leq\pi$ and $b_1,b_2,\ldots ,b_n$ are real numbers for which the following inequality is satisfied : \[\left|\sum_{i\equal{}1}^{n} b_i\cos(ka_i)\right|<\frac{1}{k}\] for all $ k\in\mathbb{N}$. Prove that $ b_1\equal{}b_2\equal{}\ldots \equal{}b_n\equal{}0$.

Suppose $\alpha_i > 0, \beta_i > 0$ for $1 \leq i \leq n, n > 1$ and that \[ \sum^n_{i=1} \alpha_i = \sum^n_{i=1} \beta_i = \pi. \] Prove that \[ \sum^n_{i=1} \frac{\cos(\beta_i)}{\sin(\alpha_i)} \leq \sum^n_{i=1} \cot(\alpha_i). \]

Consider a regular $2^k$-gon with center $O$ and label its sides clockwise by $l_1,l_2,...,l_{2^k}$. Reflect $O$ with respect to $l_1$, then reflect the resulting point with respect to $l_2$ and do this process until the last side. Prove that the distance between the final point and $O$ is less than the perimeter of the $2^k$-gon. [i]Proposed by Hesam Rajabzade[/i]

Let $n > 1$ be an integer. Find, with proof, all sequences $x_1 , x_2 , \ldots , x_{n-1}$ of positive integers with the following three properties: (a). $x_1 < x_2 < \cdots < x_{n-1}$ ; (b). $x_i + x_{n-i} = 2n$ for all $i = 1, 2, \ldots , n - 1$; (c). given any two indices $i$ and $j$ (not necessarily distinct) for which $x_i + x_j < 2n$, there is an index $k$ such that $x_i + x_j = x_k$.

On a circle there are $2n+1$ points, dividing it into equal arcs ($n\ge 2$). Two players take turns to erase one point. If after one player's turn, it turned out that all the triangles formed by the remaining points on the circle were obtuse, then the player wins and the game ends. Who has a winning strategy: the starting player or his opponent?

We are given the finite sets $ X$, $ A_1$, $ A_2$, $ \dots$, $ A_{n \minus{} 1}$ and the functions $ f_i: \ X\rightarrow A_i$. A vector $ (x_1,x_2,\dots,x_n)\in X^n$ is called [i]nice[/i], if $ f_i(x_i) \equal{} f_i(x_{i \plus{} 1})$, for each $ i \equal{} 1,2,\dots,n \minus{} 1$. Prove that the number of nice vectors is at least \[ \frac {|X|^n}{\prod\limits_{i \equal{} 1}^{n \minus{} 1} |A_i|}. \]

Find all the functions $f(x),$ continuous on the whole real axis, such that for every real $x$ \[f(3x-2)\leq f(x)\leq f(2x-1).\] [i]Proposed by A. Golovanov[/i]

Let $P$ be a polynomial with real coefficients. Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that there exists a real number $t$ such that \[f(x+t) - f(x) = P(x)\] for all $x \in \mathbb{R}$.

What is the least number of moves it takes a knight to get from one corner of an $n\times n$ chessboard, where $n\ge 4$, to the diagonally opposite corner?

Two players in turns color the sides of an $n$-gon. The first player colors any side that has $0$ or $2$ common vertices with already colored sides. The second player colors any side that has exactly $1$ common vertex with already colored sides. The player who cannot move, loses. For which $n$ the second player has a winning strategy?

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| \]

Prove that $\frac{1}{1999}< \prod_{i=1}^{999}{\frac{2i-1}{2i}}<\frac{1}{44}$.

A crazy physicist discovered a new kind of particle wich he called an imon, after some of them mysteriously appeared in his lab. Some pairs of imons in the lab can be entangled, and each imon can participate in many entanglement relations. The physicist has found a way to perform the following two kinds of operations with these particles, one operation at a time. (i) If some imon is entangled with an odd number of other imons in the lab, then the physicist can destroy it. (ii) At any moment, he may double the whole family of imons in the lab by creating a copy $I'$ of each imon $I$. During this procedure, the two copies $I'$ and $J'$ become entangled if and only if the original imons $I$ and $J$ are entangled, and each copy $I'$ becomes entangled with its original imon $I$; no other entanglements occur or disappear at this moment. Prove that the physicist may apply a sequence of such operations resulting in a family of imons, no two of which are entangled.

The eleven members of a cricket team are numbered $1,2,...,11$. In how many ways can the entire cricket team sit on the eleven chairs arranged around a circular table so that the numbers of any two adjacent players differ by one or two ?

Let $ f(x)\equal{}\sum_{n\equal{}1}^{\infty} a_n/(x\plus{}n^2), \;(x \geq 0)\ ,$ where $ \sum_{n\equal{}1}^{\infty} |a_n|n^{\minus{} \alpha} < \infty$ for some $ \alpha > 2$. Let us assume that for some $ \beta > 1/{\alpha}$, we have $ f(x)\equal{}O(e^{\minus{}x^{\beta}})$ as $ x \rightarrow \infty$. Prove that $ a_n$ is identically $ 0$. [i]G. Halasz[/i]

In a meeting, there are $2011$ scientists attending. We know that, every scientist know at least $1509$ other ones. Prove that a group of five scientists can be formed so that each one in this group knows $4$ people in his group.

Let $\mathbb N = B_1\cup\cdots \cup B_q$ be a partition of the set $\mathbb N$ of all positive integers and let an integer $l \in \mathbb N$ be given. Prove that there exist a set $X \subset \mathbb N$ of cardinality $l$, an infinite set $T \subset \mathbb N$, and an integer $k$ with $1 \leq k \leq q$ such that for any $t \in T$ and any finite set $Y \subset X$, the sum $t+ \sum_{y \in Y} y$ belongs to $B_k.$

Is it possible to place the numbers $0,1,2,\dots,9$ on a circle so that the sum of any three consecutive numbers is a) 13, b) 14, c) 15?

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]

The numbers $1, 2, \ldots, 2012$ are written on a blackboard. Each minute, a student goes up to the board, chooses two numbers $x$ and $y$, erases them, and writes the number $2x+2y$ on the board. This continues until only one number $N$ remains. Find the remainder when the maximum possible value of $N$ is divided by 1000. [i]Victor Wang.[/i]

Let $X$ be a non empty subset of $\mathbb{N} = \{1,2,\ldots \}$. Suppose that for all $x \in X$, $4x \in X$ and $\lfloor \sqrt{x} \rfloor \in X$. Prove that $X=\mathbb{N}$.

Prove that for any $ n\in \mathbb N$ the number $ 1\plus{}\dfrac{1}{3}\plus{}\dfrac{1}{5}\plus{}\ldots\plus{}\dfrac{1}{2n\plus{}1}$ is not an integer.

Find all strictly increasing functions $f: \mathbb{N}\to \mathbb{N}$ such that \[f(f(n))=3n.\]

Given is a function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $|f(x+y)-f(x)-f(y)|\leq 1$. Prove the existence of an additive function $g:\mathbb{R}\rightarrow \mathbb{R}$ (that is $g(x+y)=g(x)+g(y)$) such that $|f(x)-g(x)|\leq 1$ for any $x \in \mathbb{R}$