Given 2005 distinct numbers $a_1,\,a_2,\dots,a_{2005}$. By one question, we may take three different indices $1\le i<j<k\le 2005$ and find out the set of numbers $\{a_i,\,a_j,\,a_k\}$ (unordered, of course). Find the minimal number of questions, which are necessary to find out all numbers $a_i$.

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]

A $m \times n$ table is filled with signs $"+"$ and $"-"$. A table is called irreducible if one cannot reduce it to the table filled with $"+"$, applying the following operations (as many times as one wishes). $a)$ It is allowed to flip all the signs in a row or in a column. Prove that an irreducible table contains an irreducible $2\times 2$ sub table. $b)$ It is allowed to flip all the signs in a row or in a column or on a diagonal (corner cells are diagonals of length $1$). Prove that an irreducible table contains an irreducible $4\times 4$ sub table.

Let $P$ be a polynomial of degree $n$ with only real zeros and real coefficients. Prove that for every real $x$ we have $(n-1)(P'(x))^2\ge nP(x)P''(x)$. When does equality occur?

How many functions $\{f : 1,2, \cdots, 2013\} \rightarrow \{1,2, \cdots, 2013\}$ satisfy $f(j) < f(i) + j - i$ for all integers $i,j$ such that $1 \leq i < j \leq 2013$ ?

For any real numbers sequence $\{x_n\}$ ,suppose that $\{y_n\}$ is a sequence such that: $y_1=x_1, y_{n+1}=x_{n+1}-(\sum\limits_{i = 1}^{n} {x^2_i})^{ \frac{1}{2}}$ ${(n \ge 1})$ . Find the smallest positive number $\lambda$ such that for any real numbers sequence $\{x_n\}$ and all positive integers $m$ , have $\frac{1}{m}\sum\limits_{i = 1}^{m} {x^2_i}\le\sum\limits_{i = 1}^{m} {\lambda^{m-i}y^2_i} .$ (High School Affiliated to Nanjing Normal University )

Let $S$ be the set of all rational numbers expressible in the form \[\frac{(a_1^2+a_1-1)(a_2^2+a_2-1)\ldots (a_n^2+a_n-1)}{(b_1^2+b_1-1)(b_2^2+b_2-1)\ldots (b_n^2+b_n-1)}\] for some positive integers $n, a_1, a_2 ,\ldots, a_n, b_1, b_2, \ldots, b_n$. Prove that there is an infinite number of primes in $S$.

Let $ n$ be a nonzero positive integer. Find $ n$ such that there exists a permutation $ \sigma \in S_{n}$ such that \[ \left| \{ |\sigma(k) \minus{} k| \ : \ k \in \overline{1, n} \}\right | = n.\]

Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[ 2, \; 2^2, \; 2^{2^2}, \; 2^{2^{2^2}}, \ldots (\mbox{mod} \; n) \] is eventually constant. [The tower of exponents is defined by $a_1 = 2, \; a_{i+1} = 2^{a_i}$. Also $a_i \; (\mbox{mod} \; n)$ means the remainder which results from dividing $a_i$ by $n$.]

Given a finite sequence $ S \equal{} (a_1,a_2,\ldots,a_n)$ of $ n$ real numbers, let $ A(S)$ be the sequence \[ \left(\frac {a_1 \plus{} a_2}2,\frac {a_2 \plus{} a_3}2,\ldots,\frac {a_{n \minus{} 1} \plus{} a_n}2\right) \]of $ n \minus{} 1$ real numbers. Define $ A^1(S) \equal{} A(S)$ and, for each integer $ m$, $ 2\le m\le n \minus{} 1$, define $ A^m(S) \equal{} A(A^{m \minus{} 1}(S)).$ Suppose $ x > 0$, and let $ S \equal{} (1,x,x^2,\ldots,x^{100})$. If $ A^{100}(S) \equal{} (1/2^{50})$, then what is $ x$? $ \textbf{(A) } 1 \minus{} \frac {\sqrt {2}}2\qquad \textbf{(B) } \sqrt {2} \minus{} 1\qquad \textbf{(C) } \frac 12\qquad \textbf{(D) } 2 \minus{} \sqrt {2}\qquad \textbf{(E) } \frac {\sqrt {2}}2$

Each vertex of a finite graph can be coloured either black or white. Initially all vertices are black. We are allowed to pick a vertex $P$ and change the colour of $P$ and all of its neighbours. Is it possible to change the colour of every vertex from black to white by a sequence of operations of this type? Note: A finite graph consists of a finite set of vertices and a finite set of edges between vertices. If there is an edge between vertex $A$ and vertex $B,$ then $A$ and $B$ are neighbours of each other.

In the interior of the convex 2011-gon are $2011$ points, such that no three among the given $4022$ points (the interior points and the vertices) are collinear. The points are coloured one of two different colours and a colouring is called "good" if some of the points can be joined in such a way that the following conditions are satisfied: 1) Each segment joins two points of the same colour. 2) None of the line segments intersect. 3) For any two points of the same colour there exists a path of segments connecting them. Find the number of "good" colourings.

Let $n>1$ be an integer and $a,b,c$ be three complex numbers such that $a+b+c=0$ and $a^n+b^n+c^n=0$. Prove that two of $a,b,c$ have the same magnitude. [i]Evan O'Dorney.[/i]

Let $ a_1,a_2,\dots$ be sequence of real numbers such that $ a_1\equal{}1$, $ a_2\equal{}\dfrac{4}{3}$, and \[ a_{n\plus{}1}\equal{}\sqrt{1\plus{}a_na_{n\minus{}1}}, \quad \forall n \ge 2.\] Prove that for all $ n \ge 2$, \[ a_n^2>a_{n\minus{}1}^2\plus{}\dfrac{1}{2}\] and \[ 1\plus{}\dfrac{1}{a_1}\plus{}\dfrac{1}{a_2}\plus{}\dots\plus{}\dfrac{1}{a_n}>2a_n.\] [i]Fajar Yuliawan, Bandung[/i]

Let $\alpha $ be an angle such that $\cos \alpha = \frac pq$, where $p$ and $q$ are two integers. Prove that the number $q^n \cos n \alpha$ is an integer.

Shanille O'Keal shoots free throws on a basketball court. She hits the first and misses the second, and thereafter the probability that she hits the next shot is equal to the proportion of shots she has hit so far. What is the probability she hits exactly $50$ of her first $100$ shots?

We say that a pile is a set of four or more nuts. Two persons play the following game. They start with one pile of $n \geq 4$ nuts. During a move a player takes one of the piles that they have and split it into two nonempty sets (these sets are not necessarily piles, they can contain arbitrary number of nuts). If the player cannot move, he loses. For which values of $n$ does the first player have a winning strategy?

Let $p_1(x)=p(x)=4x^3-3x$ and $p_{n+1}(x)=p(p_n(x))$ for each positive integer $n$. Also, let $A(n)$ be the set of all the real roots of the equation $p_n(x)=x$. Prove that $A(n)\subseteq A(2n)$ and that the product of the elements of $A(n)$ is the average of the elements of $A(2n)$.

A $2^{2014} + 1$ by $2^{2014} + 1$ grid has some black squares filled. The filled black squares form one or more snakes on the plane, each of whose heads splits at some points but never comes back together. In other words, for every positive integer $n$ greater than $2$, there do not exist pairwise distinct black squares $s_1$, $s_2$, \dots, $s_n$ such that $s_i$ and $s_{i+1}$ share an edge for $i=1,2, \dots, n$ (here $s_{n+1}=s_1$). What is the maximum possible number of filled black squares? [i]Proposed by David Yang[/i]

Find the number of strictly increasing sequences of nonnegative integers with the following properties: • The first term is $0$ and the last term is $12$. In particular, the sequence has at least two terms. • Among any two consecutive terms, exactly one of them is even.

[i]Biribol[/i] is a game played between two teams of 4 people each (teams are not fixed). Find all the possible values of $ n$ for which it is possible to arrange a tournament with $ n$ players in such a way that every couple of people plays a match in opposite teams exactly once.

$ p >3 $ is a prime number such that $ p | 2^{p-1} -1 $ and $ p \not | 2^x - 1 $ for $ x = 1, 2, \cdots , p-2 $. Let $ p = 2k+3 $. Now we define sequence $ \{ a_n \} $ as \[ a_i = a_{i+k}= 2^i ( 1 \le i \le k ) , \ a_{j+2k} = a_j a_{j+k} \ ( j \ge 1 ) \] Prove that there exist $2k$ consecutive terms of sequence $ a_{x+1} , a_{x+2} , \cdots , a_{x+2k} $ such that for all $ 1 \le i < j \le 2k $, $ a_{x+i} \not \equiv a_{x+j} \ (mod \ p) $.

A $(3n + 1) \times (3n + 1)$ table $(n \in \mathbb{N})$ is given. Prove that deleting any one of its squares yields a shape cuttable into pieces of the following form and its rotations: ''L" shape formed by cutting one square from a $2 \times 2$ squares.

Determine whether or not there exist positive integers $ a$ and $ b$ such that $ a$ does not divide $ b^n \minus{} n$ for all positive integers $ n$.

(Leo Moser) Show that the Diophantine equation \[\frac{1}{x_{1}}+\frac{1}{x_{2}}+\cdots+\frac{1}{x_{n}}+\frac{1}{x_{1}x_{2}\cdots x_{n}}= 1\] has at least one solution for every positive integers $n$.