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]

The sequence $a_n$ is defined by $a_0=a_1=1$ and $a_{n+1}=14a_n-a_{n-1}-4$,for all positive integers $n$. Prove that all terms of this sequence are perfect squares.

Find all functions $f : \mathbb{R} \to \mathbb{Z}$ which satisfy the conditions: $f(x+y) < f(x) + f(y)$ $f(f(x)) = \lfloor {x} \rfloor + 2$

Find all positive integers $n$ such that \[3^n+4^n+\cdots+(n+2)^n=(n+3)^n.\]

Let $p$ be a prime and $k$ a positive integer such that $k \le p$. We know that $f(x)$ is a polynomial in $\mathbb Z[x]$ such that for all $x \in \mathbb{Z}$ we have $p^k | f(x)$. [b](a)[/b] Prove that there exist polynomials $A_0(x),\ldots,A_k(x)$ all in $\mathbb Z[x]$ such that \[ f(x)=\sum_{i=0}^{k} (x^p-x)^ip^{k-i}A_i(x),\] [b](b)[/b] Find a counter example for each prime $p$ and each $k > p$.

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.

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

A sequence of numbers $a_n, n = 1,2, \ldots,$ is defined as follows: $a_1 = \frac{1}{2}$ and for each $n \geq 2$ \[ a_n = \frac{2 n - 3}{2 n} a_{n-1}. \] Prove that $\sum^n_{k=1} a_k < 1$ for all $n \geq 1.$

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 $\mathcal{F}$ be the set of all functions $f : (0,\infty)\to (0,\infty)$ such that $f(3x) \geq f( f(2x) )+x$ for all $x$. Find the largest $A$ such that $f(x) \geq A x$ for all $f\in\mathcal{F}$ and all $x$.

Let $ n$ be a positive integer. Show that \[ \left(\sqrt{2} \plus{} 1 \right)^n \equal{} \sqrt{m} \plus{} \sqrt{m\minus{}1}\] for some positive integer $ m.$

Assume real numbers $a_i,b_i\,(i=0,1,\cdots,2n)$ satisfy the following conditions: (1) for $i=0,1,\cdots,2n-1$, we have $a_i+a_{i+1}\geq 0$; (2) for $j=0,1,\cdots,n-1$, we have $a_{2j+1}\leq 0$; (2) for any integer $p,q$, $0\leq p\leq q\leq n$, we have $\sum_{k=2p}^{2q}b_k>0$. Prove that $\sum_{i=0}^{2n}(-1)^i a_i b_i\geq 0$, and determine when the equality holds.

Find all functions $f: \mathbb{Z} \mapsto \mathbb{Z}$ satisfying the condition: $f(x^3 +y^3 +z^3 )=f(x)^3+f(y)^3+f(z)^3.$

An $ n \times n$ matrix whose entries come from the set $ S \equal{} \{1, 2, \ldots , 2n \minus{} 1\}$ is called a [i]silver matrix[/i] if, for each $ i \equal{} 1, 2, \ldots , n$, the $ i$-th row and the $ i$-th column together contain all elements of $ S$. Show that: (a) there is no silver matrix for $ n \equal{} 1997$; (b) silver matrices exist for infinitely many values of $ n$.