Given three numbers $x, y, z$ denote the absolute values of the differences of each pair by $x_1,y_1, z_1$. From $x_1, y_1, z_1$ form in the same fashion the numbers $x_2, y_2, z_2$, etc. It is known that $x_n = x,y_n = y, z_n = z$ for some $n$. Find $y$ and $z$ if $x = 1$.

Let $a_1 <a_2 < \ldots$ be an increasing sequence of positive integers. Let the series $$\sum_{i=1}^{\infty} \frac{1}{a_i }$$ be convergent. For any real number $x$, let $k(x)$ be the number of the $a_i$ which do not exceed $x$. Show that $\lim_{x\to \infty} \frac{k(x)}{x}=0.$

Let $a_n$ be a sequence of natural numbers defined by $a_1 = m$ and for $n > 1$. We call apair$ (a_k, a_{\ell })$ [i]interesting [/i] if (i) $0 < \ell - k < 2016$, (ii) $a_k$ divides $a_{\ell }$. Show that there exists a $m$ such that the sequence $a_n$ contains no interesting pair.

A coin is tossed $n$ times, and the outcome is written in the form ($a_1,a_2,...,a_n$), where $a_i = 1$ or $2$ depending on whether the result of the $i$-th toss is the head or the tail, respectively. Set $b_j = a_1 +a_2 +...+a_j$ for $j = 1,2,...,n$, and let $p(n)$ be the probability that the sequence $b_1,b_2,...,b_n$ contains the number $n$. Express $p(n)$ in terms of $p(n-1)$ and $p(n-2)$.

Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$. [i]Proposed by Jaroslaw Wroblewski, Poland[/i]

Given an infinite positive integer sequence $\{x_i\}$ such that $$x_{n+2}=x_nx_{n+1}+1$$ Prove that for any positive integer $i$ there exists a positive integer $j$ such that $x_j^j$ is divisible by $x_i^i$. [i]Remark: Unfortunately, there was a mistake in the problem statement during the contest itself. In the last sentence, it should say "for any positive integer $i>1$ ..."[/i]

Let $a_1,\ldots,a_8$ be reals, not all equal to zero. Let \[ c_n = \sum^8_{k=1} a^n_k\] for $n=1,2,3,\ldots$. Given that among the numbers of the sequence $(c_n)$, there are infinitely many equal to zero, determine all the values of $n$ for which $c_n = 0.$

Show that there is no infinite sequence an of natural numbers such that \[a_{a_n}=a_{n+1}a_{n-1}-a_{n}^2\] for all $n\geq 2$

Determine the general term of the sequence ($a_n$) given by $a_0 =\alpha > 0$ and $a_{n+1} =\frac{a_n}{1+a_n}$ .

Denote by $a_n$ the greatest number that is not divisible by $3$ and that divides $n$. Consider the sequence $s_0 = 0, s_n = a_1 +a_2+\cdots+a_n, n \in \mathbb N$. Denote by $A(n)$ the number of all sums $s_k \ (0 \leq k \leq 3^n, k \in \mathbb N_0)$ that are divisible by $3$. Prove the formula \[A(n) = 3^{n-1} + 2 \cdot 3^{(n/2)-1} \cos \left(\frac{n\pi}{6}\right), \qquad n\in \mathbb N_0.\]

For the sequence \[S_n=\frac{1}{\sqrt{n^2+1^2}}+\frac{1}{\sqrt{n^2+2^2}}+\cdots+\frac{1}{\sqrt{n^2+n^2}},\]find the limit \[\lim_{n\to\infty}n\left(n\cdot\left(\log(1+\sqrt{2})-S_n\right)-\frac{1}{2\sqrt{2}(1+\sqrt{2})}\right).\]

Find the maximum value of $ x_{0}$ for which there exists a sequence $ x_{0},x_{1}\cdots ,x_{1995}$ of positive reals with $ x_{0} \equal{} x_{1995}$, such that \[ x_{i \minus{} 1} \plus{} \frac {2}{x_{i \minus{} 1}} \equal{} 2x_{i} \plus{} \frac {1}{x_{i}}, \] for all $ i \equal{} 1,\cdots ,1995$.

The sequences $(x_n)$ and $(y_n)$ are defined as follows: $$ x_{n+1} = \frac{x_n+2}{x_n+1},\quad y_{n+1}=\frac{y_n^2+2}{2y_n} \quad \text{ for } n= 0,1,2,\ldots.$$ Prove that for every integer $ n\geq 0 $ the equality $ y_n = x_{2^n-1} $ holds.

Define the function $f:\mathbb N_{>1}\to\mathbb N_{>1}$ such that $f(x)$ is the greatest prime factor of $x$. A sequence of positive integers $\{a_n\}$ satisfies $a_1=M>1$ and $$a_{n+1}=\begin{cases}a_n-f(a_n)&\text{if }a_n\text{ is composite.}\\a_n+k&\text{otherwise.}\end{cases}$$ Show that for any positive integers $M,k$, the sequence $\{a_n\}$ is bounded. (TAN768092100853)

For any positive integer $ x$ define $ g(x)$ as greatest odd divisor of $ x,$ and \[ f(x) \equal{} \begin{cases} \frac {x}{2} \plus{} \frac {x}{g(x)} & \text{if \ \(x\) is even}, \\ 2^{\frac {x \plus{} 1}{2}} & \text{if \ \(x\) is odd}. \end{cases} \] Construct the sequence $ x_1 \equal{} 1, x_{n \plus{} 1} \equal{} f(x_n).$ Show that the number 1992 appears in this sequence, determine the least $ n$ such that $ x_n \equal{} 1992,$ and determine whether $ n$ is unique.

[b]a)[/b] Determine all sequences of real numbers $ \left( x_n\right)_{n\in\mathbb{N}\cup\{ 0\}} $ that satisfy $ x_{n+2}+x_{n+1}=x_n, $ for any nonnegative integer $ n. $ [b]b)[/b] If $ y_k>0 $ and $ y_k^k=y_k+k, $ for all naturals $ k, $ calculate $ \lim_{n\to\infty }\frac{\ln n}{n\left( x_n-1\right)} . $

Let $ \left( a_n \right)_{n\ge 1} $ be a sequence of real numbers such that $ a_1>2 $ and $ a_{n+1} =a_1+\frac{2}{a_n} , $ for all natural numbers $ n. $ [b]a)[/b] Show that $ a_{2n-1} +a_{2n} >4 , $ for all natural numbers $ n, $ and $ \lim_{n\to\infty} a_n =2. $ [b]b)[/b] Find the biggest real number $ a $ for which the following inequality is true: $$ \sqrt{x^2+a_1^2} +\sqrt{x^2+a_2^2} +\sqrt{x^2+a_3^2} +\cdots +\sqrt{x^2+a_n^2} > n\sqrt{x^2+a^2}, \quad\forall x\in\mathbb{R} ,\quad\forall n\in\mathbb{N} . $$

Let be two sequences $ \left( a_n \right)_{n\ge 0} , \left( b_n \right)_{n\ge 0} $ satisfying the following system: $$ \left\{ \begin{matrix} a_0>0,& \quad a_{n+1} =a_ne^{-a_n} , &\quad\forall n\ge 0 \\ b_{0}\in (0,1) ,& \quad b_{n+1} =b_n\cos \sqrt{b_n} ,& \quad\forall n\ge 0 \end{matrix} \right. $$ Calculate $ \lim_{n\to\infty} \frac{a_n}{b_n} . $ [i]Florian Dumitrel[/i]

Consider all binary sequences of length $n$. In a sequence that allows the interchange of positions of an arbitrary set of $k$ adjacent numbers, ($k < n$), two sequences are said to be [i]equivalent [/i] if they can be transformed from one sequence to another by a finite number of transitions as above. Find the number of sequences that are not equivalent.

Let $(a_n)_{n\geq 0}$ be a sequence defined by $a_0\geq 0$ and the recurrence relation $$a_{n+1}=\frac{a_n^2-1}{n+1},$$ for all $n\geq 0$. Prove that here exists a real number $a> 0$ such that: [list] [*] if $a_0\geq a,$ $\lim_{n\rightarrow\infty}a_n = \infty$; [*] if $a_0\in [0,a),$ $\lim_{n\rightarrow\infty}a_n = 0$.

Let us call a sequence $(b_1, b_2, \ldots)$ of positive integers fast-growing if $b_{n+1} \geq b_n + 2$ for all $n \geq 1$. Also, for a sequence $a = (a(1), a(2), \ldots)$ of real numbers and a sequence $b = (b_1, b_2, \ldots)$ of positive integers, let us denote \[ S(a, b) = \sum_{n=1}^{\infty} \left| a(b_n) + a(b_n + 1) + \cdots + a(b_{n+1} - 1) \right|. \] a) Do there exist two fast-growing sequences $b = (b_1, b_2, \ldots)$, $c = (c_1, c_2, \ldots)$ such that for every sequence $a = (a(1), a(2), \ldots)$, if all the series \[ \sum_{n=1}^{\infty} a(n), \quad S(a, b) \quad \text{and} \quad S(a, c) \] are convergent, then the series $\sum_{n=1}^{\infty} |a(n)|$ is also convergent? b) Do there exist three fast-growing sequences $b = (b_1, b_2, \ldots)$, $c = (c_1, c_2, \ldots)$, $d = (d_1, d_2, \ldots)$ such that for every sequence $a = (a(1), a(2), \ldots)$, if all the series \[ S(a, b), \quad S(a, c) \quad \text{and} \quad S(a, d) \] are convergent, then the series $\sum_{n=1}^{\infty} |a(n)|$ is also convergent?

Consider a sequence $P_{1}, P_{2}, \ldots$ of points in the plane such that $P_{1}, P_{2}, P_{3}$ are non-collinear and for every $n \geq 4, P_{n}$ is the midpoint of the line segment joining $P_{n-2}$ and $P_{n-3}$. Let $L$ denote the line segment joining $P_{1}$ and $P_{5}$. Prove the following: [list=a] [*] The area of the triangle formed by the points $P_{n}, P_{n-1}, P_{n-2}$ converges to zero as $n$ goes to infinity. [*] The point $P_{9}$ lies on $L$. [/list]

Find all positive integers $n$ and sequence of integers $a_0,a_1,\ldots, a_n$ such that the following hold: 1. $a_n\neq 0$; 2. $f(a_{i-1})=a_i$ for all $i=1,\ldots, n$, where $f(x) = a_nx^n+a_{n-1}x^{n-1}+\cdots +a_0$. [i] Proposed by usjl[/i]

Given any integer $ n \geq 2,$ assume that the integers $ a_1, a_2, \ldots, a_n$ are not divisible by $ n$ and, moreover, that $ n$ does not divide $ \sum^n_{i\equal{}1} a_i.$ Prove that there exist at least $ n$ different sequences $ (e_1, e_2, \ldots, e_n)$ consisting of zeros or ones such $ \sum^n_{i\equal{}1} e_i \cdot a_i$ is divisible by $ n.$

A sequence $a_1,a_2,\dots$ satisfy $$ \sum_{i =1}^n a_{\lfloor \frac{n}{i}\rfloor }=n^{10}, $$ for every $n\in\mathbb{N}$. Let $c$ be a positive integer. Prove that, for every positive integer $n$, $$ \frac{c^{a_n}-c^{a_{n-1}}}{n} $$ is an integer.