Prove that there exists a succession $a_1, a_2, ... , a_k, ...$, where each $a_i$ is a digit ($a_i \in (0, 1, 2, 3, 4, 5, 6, 7, 8, 9)$ ) and $a_0=6$, such that, for each positive integrer $n$, the number $x_n=a_0+10a_1+100a_2+...+10^{n-1}a_{n-1}$ verify that $x_n^2-x_n$ is divisible by $10^n$.

Let $ a\ge 3 $ and a polynom $ P. $ Show that: $$ \max_{1\le k\le \text{grad} P} \left| a^{k-1}-P(k-1) \right| \ge 1 $$

Given integer $a_1\geq 2$. For integer $n\geq 2$, define $a_n$ to be the smallest positive integer which is not coprime to $a_{n-1}$ and not equal to $a_1,a_2,\cdots, a_{n-1}$. Prove that every positive integer except 1 appears in this sequence $\{a_n\}$.

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

Find all the functions $ f: \mathbb{N}\rightarrow \mathbb{N}$ such that \[ 3f(f(f(n))) \plus{} 2f(f(n)) \plus{} f(n) \equal{} 6n, \quad \forall n\in \mathbb{N}.\]

Let $(G,\cdot)$ be a finite group with the identity element, $e$. The smallest positive integer $n$ with the property that $x^{n}= e$, for all $x \in G$, is called the [i]exponent[/i] of $G$. (a) For all primes $p \geq 3$, prove that the multiplicative group $\mathcal G_{p}$ of the matrices of the form $\begin{pmatrix}\hat 1 & \hat a & \hat b \\ \hat 0 & \hat 1 & \hat c \\ \hat 0 & \hat 0 & \hat 1 \end{pmatrix}$, with $\hat a, \hat b, \hat c \in \mathbb Z \slash p \mathbb Z$, is not commutative and has [i]exponent[/i] $p$. (b) Prove that if $\left( G, \circ \right)$ and $\left( H, \bullet \right)$ are finite groups of [i]exponents[/i] $m$ and $n$, respectively, then the group $\left( G \times H, \odot \right)$ with the operation given by $(g,h) \odot \left( g^\prime, h^\prime \right) = \left( g \circ g^\prime, h \bullet h^\prime \right)$, for all $\left( g,h \right), \, \left( g^\prime, h^\prime \right) \in G \times H$, has the [i]exponent[/i] equal to $\textrm{lcm}(m,n)$. (c) Prove that any $n \geq 3$ is the [i]exponent[/i] of a finite, non-commutative group. [i]Ion Savu[/i]

A strip of width $w$ is the set of all points which lie on, or between, two parallel lines distance $w$ apart. Let $S$ be a set of $n$ ($n \ge 3$) points on the plane such that any three different points of $S$ can be covered by a strip of width $1$. Prove that $S$ can be covered by a strip of width $2$.

Let $S$ be a set of positive integers, each of them having exactly $100$ digits in base $10$ representation. An element of $S$ is called [i]atom[/i] if it is not divisible by the sum of any two (not necessarily distinct) elements of $S$. If $S$ contains at most $10$ atoms, at most how many elements can $S$ have?

For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A [i]tromino[/i] is an $L$-shape formed by three connected unit squares. $(a)$ For which values of $n$ is it possible to cover all the black squares with non-overlapping trominoes lying entirely on the chessboard? $(b)$ When it is possible, find the minimum number of trominoes needed.

Find the largest integer $n$ such that $n$ is divisible by all positive integers less than $\sqrt[3]{n}$.

It is known that a certain mechanical balance can measure any object of integer mass anywhere between 1 and 2009 (both included). This balance has $k$ weights of integral values. What is the minimum $k$ for which there exist weights that satisfy this condition?

Let $k$ be an odd number that is greater than or equal to $3$. Prove that there exists a $k^{th}$-degree integer-valued polynomial with non-integer-coefficients that has the following properties: (1) $f(0)=0$ and $f(1)=1$; and. (2) There exist infinitely many positive integers $n$ so that if the following equation: \[ n= f(x_1)+\cdots+f(x_s), \] has integer solutions $x_1, x_2, \dots, x_s$, then $s \geq 2^k-1$.

There are $n$ boxes which is numbere from $1$ to $n$. The box with number $1$ is open, and the others are closed. There are $m$ identical balls ($m\geq n$). One of the balls is put into the open box, then we open the box with number $2$. Now, we put another ball to one of two open boxes, then we open the box with number $3$. Go on until the last box will be open. After that the remaining balls will be randomly put into the boxes. In how many ways this arrangement can be done?

Let $m$ and $n$ be arbitrary non-negative integers. Prove that \[\frac{(2m)!(2n)!}{m! n!(m+n)!}\] is an integer.

Let $n \ge 2$ be an integer, and let $A_n$ be the set \[A_n = \{2^n - 2^k\mid k \in \mathbb{Z},\, 0 \le k < n\}.\] Determine the largest positive integer that cannot be written as the sum of one or more (not necessarily distinct) elements of $A_n$ . [i]Proposed by Serbia[/i]

On a planet there are $3\times2005!$ aliens and $2005$ languages. Each pair of aliens communicates with each other in exactly one language. Show that there are $3$ aliens who communicate with each other in one common language.

Let $n$ be a positive integer and $\{A,B,C\}$ a partition of $\{1,2,\ldots,3n\}$ such that $|A|=|B|=|C|=n$. Prove that there exist $x \in A$, $y \in B$, $z \in C$ such that one of $x,y,z$ is the sum of the other two.

rainbow is the name of a bird. this bird has $n$ colors and it's colors in two consecutive days are not equal. there doesn't exist $4$ days in this bird's life like $i,j,k,l$ such that $i<j<k<l$ and the bird has the same color in days $i$ and $k$ and the same color in days $j$ and $l$ different from the colors it has in days $i$ and $k$. what is the maximum number of days rainbow can live in terms of $n$?

Prove that \[\frac{1995}{2}-\frac{1994}{3}+\frac{1993}{4}-\ldots -\frac{2}{1995}+\frac{1}{1996}=\frac{1}{999}+\frac{3}{1000}+\ldots +\frac{1995}{1996}\]

Find all positive integers $n$ for which there exist positive integers $x_1, x_2, \dots, x_n$ such that $$ \frac{1}{x_1^2}+\frac{2}{x_2^2}+\frac{2^2}{x_3^2}+\cdots +\frac{2^{n-1}}{x_n^2}=1.$$

Prove that for every natural number $n$, and for every real number $x \neq \frac{k\pi}{2^t}$ ($t=0,1, \dots, n$; $k$ any integer) \[ \frac{1}{\sin{2x}}+\frac{1}{\sin{4x}}+\dots+\frac{1}{\sin{2^nx}}=\cot{x}-\cot{2^nx} \]

In a rectangular array of nonnegative reals with $m$ rows and $n$ columns, each row and each column contains at least one positive element. Moreover, if a row and a column intersect in a positive element, then the sums of their elements are the same. Prove that $m=n$.

Two positive valued sequences $\{ a_{n}\}$ and $\{ b_{n}\}$ satisfy: (a): $a_{0}=1 \geq a_{1}$, $a_{n}(b_{n+1}+b_{n-1})=a_{n-1}b_{n-1}+a_{n+1}b_{n+1}$, $n \geq 1$. (b): $\sum_{i=1}^{n}b_{i}\leq n^{\frac{3}{2}}$, $n \geq 1$. Find the general term of $\{ a_{n}\}$.

For $ n\geq2$ let $ a_1, a_2, \ldots a_n$ be positive real numbers such that \[ (a_1 \plus{} a_2 \plus{} \cdots \plus{} a_n)\left(\frac {1}{a_1} \plus{} \frac {1}{a_2} \plus{} \cdots \plus{} \frac {1}{a_n}\right) \leq \left(n \plus{} \frac {1}{2}\right)^2. \] Prove that $ \max(a_1, a_2, \ldots, a_n)\leq 4\min(a_1, a_2, \ldots, a_n)$.

A sequence $ (S_n), n \geq 1$ of sets of natural numbers with $ S_1 = \{1\}, S_2 = \{2\}$ and \[{ S_{n + 1} = \{k \in }\mathbb{N}|k - 1 \in S_n \text{ XOR } k \in S_{n - 1}\}. \] Determine $ S_{1024}.$