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]

The numbers $\frac{1}{1}, \frac{1}{2}, \cdots , \frac{1}{2012}$ are written on the blackboard. Aïcha chooses any two numbers from the blackboard, say $x$ and $y$, erases them and she writes instead the number $x + y + xy$. She continues to do this until only one number is left on the board. What are the possible values of the final number?

Let $ n$ be positive integer, $ A,B\subseteq[0,n]$ are sets of integers satisfying $ \mid A\mid \plus{} \mid B\mid\ge n \plus{} 2.$ Prove that there exist $ a\in A, b\in B$ such that $ a \plus{} b$ is a power of $ 2.$

In a wagon, every $m \geq 3$ people have exactly one common friend. (When $A$ is $B$'s friend, $B$ is also $A$'s friend. No one was considered as his own friend.) Find the number of friends of the person who has the most friends.

A convex 2011-gon is drawn on the board. Peter keeps drawing its diagonals in such a way, that each newly drawn diagonal intersected no more than one of the already drawn diagonals. What is the greatest number of diagonals that Peter can draw?

Let $S$ denote the set of words $W = w_1w_2\ldots w_n$ of any length $n\ge0$ (including the empty string $\lambda$), with each letter $w_i$ from the set $\{x,y,z\}$. Call two words $U,V$ [i]similar[/i] if we can insert a string $s\in\{xyz,yzx,zxy\}$ of three consecutive letters somewhere in $U$ (possibly at one of the ends) to obtain $V$ or somewhere in $V$ (again, possibly at one of the ends) to obtain $U$, and say a word $W$ is [i]trivial[/i] if for some nonnegative integer $m$, there exists a sequence $W_0,W_1,\ldots,W_m$ such that $W_0=\lambda$ is the empty string, $W_m=W$, and $W_i,W_{i+1}$ are similar for $i=0,1,\ldots,m-1$. Given that for two relatively prime positive integers $p,q$ we have \[\frac{p}{q} = \sum_{n\ge0} f(n)\left(\frac{225}{8192}\right)^n,\]where $f(n)$ denotes the number of trivial words in $S$ of length $3n$ (in particular, $f(0)=1$), find $p+q$. [i]Victor Wang[/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_1=1$ and $a_n=n(a_{n-1}+1)$ for all $n\ge 2$ . Define : $P_n=\left(1+\frac{1}{a_1}\right)...\left(1+\frac{1}{a_n}\right)$ Compute $\lim_{n\to \infty} P_n$

From a $n\times (n-1)$ rectangle divided into unit squares, we cut the [i]corner[/i], which consists of the first row and the first column. (that is, the corner has $2n-2$ unit squares). For the following, when we say [i]corner[/i] we reffer to the above definition, along with rotations and symmetry. Consider an infinite lattice of unit squares. We will color the squares with $k$ colors, such that for any corner, the squares in that corner are coloured differently (that means that there are no squares coloured with the same colour). Find out the minimum of $k$. [i]Proposed by S. Berlov[/i]

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 $f$ be a function defined for the non-negative integers, such that: a) $f(n)=0$ if $n=2^{j}-1$ for some $j \geq 0$. b) $f(n+1)=f(n)-1$ otherwise. i) Show that for every $n \geq 0$ there exists $k \geq 0$ such that $f(n)+n=2^{k}-1$. ii) Find $f(2^{1990})$.

Find all integers $n$, $n \ge 1$, such that $n \cdot 2^{n+1}+1$ is a perfect square.

Given an integer $ n\ge 2$, find the maximal constant $ \lambda (n)$ having the following property: if a sequence of real numbers $ a_{0},a_{1},a_{2},\cdots,a_{n}$ satisfies $ 0 \equal{} a_{0}\le a_{1}\le a_{2}\le \cdots\le a_{n},$ and $ a_{i}\ge\frac {1}{2}(a_{i \plus{} 1} \plus{} a_{i \minus{} 1}),i \equal{} 1,2,\cdots,n \minus{} 1,$ then $ (\sum_{i \equal{} 1}^n{ia_{i}})^2\ge \lambda (n)\sum_{i \equal{} 1}^n{a_{i}^2}.$

Define a function $f:\mathbb{N}\rightarrow\mathbb{N}$, \[f(1)=p+1,\] \[f(n+1)=f(1)\cdot f(2)\cdots f(n)+p,\] where $p$ is a prime number. Find all $p$ such that there exists a natural number $k$ such that $f(k)$ is a perfect square.

In a country there are several cities; some of these cities are connected by airlines, so that an airline connects exactly two cities in each case and both flight directions are possible. Each airline belongs to one of $k$ flight companies; two airlines of the same flight company have always a common final point. Show that one can partition all cities in $k+2$ groups in such a way that two cities from exactly the same group are never connected by an airline with each other.

Let $n$ be a positive integer and let $a_1 \le a_2 \le \dots \le a_n$ and $b_1 \le b_2 \le \dots \le b_n$ be two nondecreasing sequences of real numbers such that \[ a_1 + \dots + a_i \le b_1 + \dots + b_i \text{ for every } i = 1, \dots, n \] and \[ a_1 + \dots + a_n = b_1 + \dots + b_n. \] Suppose that for every real number $m$, the number of pairs $(i,j)$ with $a_i-a_j=m$ equals the numbers of pairs $(k,\ell)$ with $b_k-b_\ell = m$. Prove that $a_i = b_i$ for $i=1,\dots,n$.

For every positive integer $n$, let $\operatorname{mod_5}(n)$ be the remainder obtained when $n$ is divided by $5$. Define a function $f : \{0, 1, 2, 3, \dots\} \times \{0, 1, 2, 3, 4\} \to \{0, 1, 2, 3, 4\}$ recursively as follows: \[f(i, j) = \begin{cases} \operatorname{mod_5}(j+1) & \text{if }i=0\text{ and }0\leq j\leq 4 \\ f(i-1, 1) & \text{if }i\geq 1\text{ and }j=0 \text{, and}\\ f(i-1, f(i, j-1)) & \text{if }i\geq 1\text{ and }1\leq j\leq 4 \end{cases}\] What is $f(2015, 2)$? $\textbf{(A) }0 \qquad\textbf{(B) }1 \qquad\textbf{(C) }2 \qquad\textbf{(D) }3 \qquad\textbf{(E) }4$

Let $\alpha(n)$ be the number of digits equal to one in the dyadic representation of a positive integer $n$. Prove that [list=a] [*] the inequality $\alpha(n^2 ) \le \frac{1}{2} \alpha(n) (1+\alpha(n))$ holds, [*] equality is attained for infinitely $n\in\mathbb{N}$, [*] there exists a sequence $\{n_i\}$ such that $\lim_{i \to \infty} \frac{ \alpha({n_{i}}^2 )}{ \alpha(n_{i}) } = 0$.[/list]

If $a,b,c,d \in \mathbb{R}_{+}$ and $a+b +c +d =1$, show that \[ ab +bc +cd \leq \dfrac{1}{4}. \]

Let $t(A)$ denote the sum of elements of a nonempty set $A$ of integers, and define $t(\emptyset)=0$. Find a set $X$ of positive integers such that for every integers $k$ there is a unique ordered pair of disjoint subsets $(A_{k},B_{k})$ of $X$ such that $t(A_{k})-t(B_{k}) = k$.

For a nonempty set $\, S \,$ of integers, let $\, \sigma(S) \,$ be the sum of the elements of $\, S$. Suppose that $\, A = \{a_1, a_2, \ldots, a_{11} \} \,$ is a set of positive integers with $\, a_1 < a_2 < \cdots < a_{11} \,$ and that, for each positive integer $\, n\leq 1500, \,$ there is a subset $\, S \,$ of $\, A \,$ for which $\, \sigma(S) = n$. What is the smallest possible value of $\, a_{10}$?

The sequence $ (a_n)$ is defined by: $ a_0\equal{}a_1\equal{}1$ and $ a_{n\plus{}1}\equal{}14a_n\minus{}a_{n\minus{}1}$ for all $ n\ge 1$. Prove that $ 2a_n\minus{}1$ is a perfect square for any $ n\ge 0$.

Prove that for all positive integers $n,m$, with $m$ odd, the following number is an integer \[ \frac 1{3^mn}\sum^m_{k=0} { 3m \choose 3k } (3n-1)^k. \]

Let $n$ be a positive integer number and let $a_1, a_2, \ldots, a_n$ be $n$ positive real numbers. Prove that $f : [0, \infty) \rightarrow \mathbb{R}$, defined by \[f(x) = \dfrac{a_1 + x}{a_2 + x} + \dfrac{a_2 + x}{a_3 + x} + \cdots + \dfrac{a_{n-1} + x}{a_n + x} + \dfrac{a_n + x}{a_1 + x}, \] is a decreasing function. [i]Dan Marinescu et al.[/i]

Let $ \left(x_{n}\right)$ be a real sequence satisfying $ x_{0}=0$, $ x_{2}=\sqrt[3]{2}x_{1}$, and $ x_{n+1}=\frac{1}{\sqrt[3]{4}}x_{n}+\sqrt[3]{4}x_{n-1}+\frac{1}{2}x_{n-2}$ for every integer $ n\geq 2$, and such that $ x_{3}$ is a positive integer. Find the minimal number of integers belonging to this sequence.