Let $ \lfloor x \rfloor$ denote the greatest integer less than or equal to $ x.$ Pick any $ x_1$ in $ [0, 1)$ and define the sequence $ x_1, x_2, x_3, \ldots$ by $ x_{n\plus{}1} \equal{} 0$ if $ x_n \equal{} 0$ and $ x_{n\plus{}1} \equal{} \frac{1}{x_n} \minus{} \left \lfloor \frac{1}{x_n} \right \rfloor$ otherwise. Prove that \[ x_1 \plus{} x_2 \plus{} \ldots \plus{} x_n < \frac{F_1}{F_2} \plus{} \frac{F_2}{F_3} \plus{} \ldots \plus{} \frac{F_n}{F_{n\plus{}1}},\] where $ F_1 \equal{} F_2 \equal{} 1$ and $ F_{n\plus{}2} \equal{} F_{n\plus{}1} \plus{} F_n$ for $ n \geq 1.$

Any positive integer $n$ can be written in the form $n = 2^b(2c+1)$. We call $2c+1$ the[i] odd part[/i] of $n$. Given an odd integer $n > 0$, define the sequence $ a_0, a_1, a_2, ...$ as follows: $a_0 = 2^n-1, a_{k+1} $ is the [i]odd part[/i] of $3a_k+1$. Find $a_n$.

Let $a_n, b_n$ be sequences of positive reals such that,$$a_{n+1}= a_n + \frac{1}{2b_n}$$ $$b_{n+1}= b_n + \frac{1}{2a_n}$$ for all $n\in\mathbb N$. Prove that, $\text{max}\left(a_{2018}, b_{2018}\right) >44$.

Let $ a_0$, $ a_1$, $ a_2$, $ \ldots$ be a sequence of positive integers such that the greatest common divisor of any two consecutive terms is greater than the preceding term; in symbols, $ \gcd (a_i, a_{i \plus{} 1}) > a_{i \minus{} 1}$. Prove that $ a_n\ge 2^n$ for all $ n\ge 0$. [i]Proposed by Morteza Saghafian, Iran[/i]

An arbitrary positive number $a$ is given. A sequence ${a_n}$ is defined by equalities $a_1=\frac{a}{a+1}$ and $a_{n+1}=\frac{aa_n}{a^2+a_n-aa_n}$ for all $n \geq 1$ Find the minimal constant $C$ such that inequality $$a_1+a_1a_2+\ldots+a_1\ldots a_m<C$$ holds for all positive integers $m$ regardless of $a$

Given is a number $a$ with 0 $\le \alpha \le \pi$. A sequence $c_0,c_1, c_2,...$ is defined as $$c_0=\cos \alpha$$ $$C_{n+1}=\sqrt{\frac{1+c_n}{2}} \,\, for \,\,\, n=0,1,2,...$$ Calculate $\lim_{n\to \infty}2^{2n+1}(1-c_n)$

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

Let $ \left( a_n\right)_{n\ge 1} $ be a sequence defined by $ a_1>0 $ and $ \frac{a_{n+1}}{a}=\frac{a_n}{a}+\frac{a}{a_n} , $ with $ a>0. $ Calculate $ \lim_{n\to\infty} \frac{a_n}{\sqrt{n+a}} . $ [i]Florin Rotaru[/i]

Find the number of strictly increasing sequences of nonnegative integers with the first term $0$ and the last term $15$, and among any two consecutive terms, exactly one of them is even. Lê Anh Vinh

The periods of two periodic sequences are $7$ and $13$. What is the maximal length of initial sections of the two sequences which can coincide? (The period $p$ of a sequence $a_1$,$a_2$, $...$ is the minimal $p$ such that $a_n = a_{n+p}$ for all $n$.) (AY Belov)

An infinite sequence of digits $1$ and $2$ is determined by the following two properties: i) The sequence is built by writing, in some order, blocks $12$ and blocks $112.$ ii) If each block $12$ is replaced by $1$ and each block $112$ by $2$, the same sequence is again obtained. In which position is the hundredth digit $1$? What is the thousandth digit of the sequence?

Find constants $A > B$ such that $\frac{f\left( \frac{1}{1+2x}\right) }{f(x)}$ is independent of $x$, where $f(x) = \frac{1 + Ax}{1 + Bx}$ for all real $x \ne - \frac{1}{B}$. Put $a_0 = 1$, $a_{n+1} = \frac{1}{1 + 2a_n}$. Find an expression for an by considering $f(a_0), f(a_1), ...$.

Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.

Given a sequence $\{a_n\}$ of real numbers such that $|a_{k+m} - a_k - a_m| \leq 1$ for all positive integers $k$ and $m$, prove that, for all positive integers $p$ and $q$, \[|\frac{a_p}{p} - \frac{a_q}{q}| < \frac{1}{p} + \frac{1}{q}.\]

The sequence $(a_n)$ is such that $a_{n+1} = (a_n)^n + n + 1$ for all positive integers $n$, where $a_1$ is some positive integer. Let $k$ be the greatest power of $3$ by which $a_{101}$ is divisible. Find all possible values of $k$. [i]Proposed by Kyrylo Holodnov[/i]

A numerical sequence is called lusophone if it satisfies the following three conditions: i) The first term of the sequence is number $1$. ii) To obtain the next term of the sequence we can multiply the previous term by a positive prime number ($2,3,5,7,11, ...$) or add $1$. (iii) The last term of the sequence is the number $2016$. For example: $1\overset{{\times 11}}{\to}11 \overset{{\times 61}}{\to} 671 \overset{{+1}}{\to}672 \overset{{\times 3}}{\to}2016$ How many Lusophone sequences exist in which (as in the example above) the add $1$ operation was used exactly once and not multiplied twice by the same prime number?

We say that a strictly increasing sequence of positive integers $n_1, n_2,\ldots$ is [i]non-decelerating[/i] if $n_{k+1}-n_k\le n_{k+2}-n_{k+1}$ holds for all positive integers $k$. We say that a strictly increasing sequence $n_1, n_2, \ldots$ is [i]convergence-inducing[/i], if the following statement is true for all real sequences $a_1, a_2, \ldots$: if subsequence $a_{m+n_1}, a_{m+n_2}, \ldots$ is convergent and tends to $0$ for all positive integers $m$, then sequence $a_1, a_2, \ldots$ is also convergent and tends to $0$. Prove that a non-decelerating sequence $n_1, n_2,\ldots$ is convergence-inducing if and only if sequence $n_2-n_1$, $n_3-n_2$, $\ldots$ is bounded from above. [i]Proposed by András Imolay[/i]

Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]

Let $c,d \geq 2$ be naturals. Let $\{a_n\}$ be the sequence satisfying $a_1 = c, a_{n+1} = a_n^d + c$ for $n = 1,2,\cdots$. Prove that for any $n \geq 2$, there exists a prime number $p$ such that $p|a_n$ and $p \not | a_i$ for $i = 1,2,\cdots n-1$.

The natural number $m\geq 2$ is given.Sequence of natural numbers $(b_0,b_1,\ldots,b_m)$ is called concave if $b_k+b_{k-2}\le2b_{k-1}$ for all $2\le k\le m.$ Prove that there exist not greater than $2^m$ concave sequences starting with $b_0 =1$ or $b_0 =2$

Let $0<f(1)<f(2)<f(3)<\ldots$ a sequence with all its terms positive$.$ The $n-th$ positive integer which doesn't belong to the sequence is $f(f(n))+1.$ Find $f(240).$

Let $(b_n)_{n \ge 0}$ be a sequence of positive integers satisfying $b_n=d\left(\sum_{i=0}^{n-1} b_k\right)$ for all $n \ge 1$. (By $d(m)$ we denote the number of positive divisors of $m$.) a) Prove that $(b_n)_{n \ge 0}$ is unbounded. b) Prove that there are infinitely many $n$ such that $b_n>b_{n+1}$.

Let $S = \{0, 1, 2, .., 1994\}$. Let $a$ and $b$ be two positive numbers in $S$ which are relatively prime. Prove that the elements of $S$ can be arranged into a sequence $s_1, s_2, s_3,... , s_{1995}$ such that $s_{i+1} - s_i \equiv \pm a$ or $\pm b$ (mod $1995$) for $i = 1, 2, ... , 1994$

Consider a sequence of numbers between $0$ and $1$ in which the next number after $x$ is $1 - |1 - 2x|$. ($|x| = x$ if$ x \ge 0$, $|x| = -x$ if $x < 0$.) Prove that (a) if the first number of the sequence is rational, then the sequence will be periodic (i.e. the terms repeat with a certain cycle length after a certain term in the sequence); (b) if the sequence is periodic, then the first number is rational. (G Shabat)

Let $(a_n)$ be defined by: $$ a_1 = 2, \qquad a_{n+1} = a_n^3 - a_n + 1 $$ Consider positive integers $n,p$, where $p$ is an odd prime. Prove that if $p | a_n$, then $p > n$.