Consider a sequence of positive integers with total sum $2019$ such that no number and no sum of a set of consecutive num bers is equal to $40$. What is the greatest possible length of such a sequence? (Alexandr Shapovalov)

We have an infinite sequence of real numbers $x_0,x_1, x_2, ... $ such that $x_{n+1} = \sqrt{x_n -\frac14}$ holds for all natural $n$ and moreover $x_0 \in \frac12$. (a) Prove that for every natural $n$ holds: $x_n > \frac12$ (b) Prove that $\lim_{n \to \infty} x_n$ exists. Calculate this limit.

Let $m, n$ be positive integers. Consider a sequence of positive integers $a_1, a_2, ... , a_n$ that satisfies $m = a_1 \ge a_2\ge ... \ge a_n \ge 1$. Then define, for $1\le  i\le  m$, $b_i =$ # $\{ j \in \{1, 2, ... , n\}: a_j \ge i\}$, so $b_i$ is the number of terms $a_j $ of the given sequence for which $a_j  \ge i$. Similarly, we define, for $1\le   j \le  n$, $c_j=$ # $\{ i \in \{1, 2, ... , m\}: b_i \ge j\}$ , thus $c_j$ is the number of terms bi in the given sequence for which $b_i \ge j$. E.g.: If $a$ is the sequence $5, 3, 3, 2, 1, 1$ then $b$ is the sequence $6, 4, 3, 1, 1$. (a) Prove that $a_j = c_j $ for $1  \le j  \le n$. (b) Prove that for $1\le  k \le m$: $\sum_{i=1}^{k} b_i = k \cdot b_k + \sum_{j=b_{k+1}}^{n} a_j$.

Tireless Thomas and Jeremy construct a sequence. At the beginning there is one positive integer in the sequence. Then they successively write new numbers in the sequence in the following way: Thomas obtains the next number by adding to the previous number one of its (decimal) digits, while Jeremy obtains the next number by subtracting from the previous number one of its digits. Prove that there is a number in this sequence which will be repeated at least $100$ times. (A Shapovalov)

The sequence of natural numbers is based on the following rule: each term, starting with the second, is obtained from the previous addition works of all its various simple divisors (for example, after the number $12$ should be the number $18$, and after the number $125$ , the number $130$). Prove that any two sequences constructed in this way have a common member.

The infinite sequence $a_0, a_1, a_2, a_3,... $ is defined by $a_0 = 2$ and $$a_n =\frac{2a_{n-1} + 1}{a_{n-1} + 2}$$ , $n = 1, 2, 3, ...$ Prove that $1 < a_n < 1 + \frac{1}{3^n}$ for all $n = 1, 2, 3, . .$

Let $x_n$ the sequence defined by any nonnegatine integer $x_0$ and $x_{n+1}=1+\prod_{0 \leq i \leq n}{x_i}$ Show that there exists prime $p$ such that $p\not|x_n$ for any $n$.

Consider the sequence $(x_n)_{n\in\mathbb{N^*}}$ such that $$x_0=0,\quad x_1=2024,\quad x_n=x_{n-1}+x_{n-2}, \forall n\geq2.$$ Prove that there is an infinity of terms in this sequence that end with $2024.$

Consider the sequence $a_1, a_2, a_3, ...$ defined by $a_1 = 9$ and $a_{n + 1} = \frac{(n + 5)a_n + 22}{n + 3}$ for $n \ge 1$. Find all natural numbers $n$ for which $a_n$ is a perfect square of an integer.

Let $a_1,a_2,a_3,\ldots$ and $b_1,b_2,b_3,\ldots$ be positive integers such that $a_{n+2} = a_n + a_{n+1}$ and $b_{n+2} = b_n + b_{n+1}$ for all $n \ge 1$. Assume that $a_n$ divides $b_n$ for infinitely many values of $n$. Prove that there exists an integer $c$ such that $b_n = c a_n$ for all $n \ge 1$.

Let ${a_n}$ be a sequence defined by $a_1=2$, $a_{n+1}=\left[ \frac {3a_n}{2}\right]$ $\forall n \in \mathbb N$ $0.a_1a_2...$ rational or irrational?

The positive integers $x_1, \cdots , x_n$, $n \geq 3$, satisfy $x_1 < x_2 <\cdots< x_n < 2x_1$. Set $P = x_1x_2 \cdots x_n.$ Prove that if $p$ is a prime number, $k$ a positive integer, and $P$ is divisible by $pk$, then $\frac{P}{p^k} \geq n!.$

The sequence of positive integers $a_1, a_2, a_3, ...$ satisfies $a_{n+1} = a^2_{n} + 2018$ for $n \ge 1$. Prove that there exists at most one $n$ for which $a_n$ is the cube of an integer.

Let $a_0,a_1,\ldots$ be an infinite sequence of positive numbers. Prove that the inequality $1+a_n>\sqrt[n]2a_{n-1}$ holds for infinitely many positive integers $n$.

Let $p\in(0,1)$ and $a>0$ be real numbers. Determine the asymptotic behavior of the sequence $\{a_n\}_{n=1}^\infty$ defined recursively by $$a_1=a,a_{n+1}=\frac{a_n}{1+a_n^p},n\in\mathbb N$$ [i]Proposed by Arkady Alt[/i]

Let $n$ be an odd positive integer, and let $x_1,x_2,\cdots ,x_n$ be non-negative real numbers. Show that \[ \min_{i=1,\ldots,n} (x_i^2+x_{i+1}^2) \leq \max_{j=1,\ldots,n} (2x_jx_{j+1}) \]where $x_{n+1}=x_1$.

Consider the sequence of integer such that: $ a_1 = 2$ $ a_2 = 5$ $ a_{n + 1} = (2 - n^2)a_n + (2 + n^2)a_{n - 1}, \forall n\ge 2$ Find all triplies $ (x,y,z) \in \mathbb{N}^3$ such that $ a_xa_y = a_z$.

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]

A function $f: R \to R$ satisfies $f (x + 1) = f (x) + 1$ for all $x$. Given $a \in R$, define the sequence $(x_n)$ recursively by $x_0 = a$ and $x_{n+1} = f (x_n)$ for $n \ge 0$. Suppose that, for some positive integer m, the difference $x_m - x_0 = k$ is an integer. Prove that the limit $\lim_{n\to \infty}\frac{x_n}{n}$ exists and determine its value.

[b]1.[/b] Given a positive integer $r>1$, prove that there exists an infinite number of infinite geometrical series, with positive terms, having the sum 1 and satisfying the following condition: for any positive real numbers $S_{1},S_{2},\dots,S_{r}$ such that $S_{1}+S_{2}+\dots+S_{r}=1$, any of these infinite geometrical series can be divided into $r$ infinite series(not necessarily geometrical) having the sums $S_{1},S_{2},\dots,S_{r}$, respectively. [b](S. 6)[/b]

A sequence of $N$ consecutive positive integers is called [i]good [/i] if it is possible to choose two of these numbers so that their product is divisible by the sum of the other $N-2$ numbers. For which $N$ do there exist infinitely many [i]good [/i] sequences?

$(x_n)$ be a sequence with $x_1=0$, $$x_{n+1}=5x_n + \sqrt{24x_n^2+1}$$. Prove that for $k \geq 2$ $x_k$ is a natural number.

Compute the number of sequences of integers $(a_1,\ldots,a_{200})$ such that the following conditions hold. [list] [*] $0\leq a_1<a_2<\cdots<a_{200}\leq 202.$ [*] There exists a positive integer $N$ with the following property: for every index $i\in\{1,\ldots,200\}$ there exists an index $j\in\{1,\ldots,200\}$ such that $a_i+a_j-N$ is divisible by $203$. [/list]

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]

Let $\alpha$ be a real number with $\alpha>1$. Let the sequence $(a_n)$ be defined as $$a_n=1+\sqrt[\alpha]{2+\sqrt[\alpha]{3+\ldots+\sqrt[\alpha]{n+\sqrt[\alpha]{n+1}}}}$$ for all positive integers $n$. Show that there exists a positive real constant $C$ such that $a_n<C$ for all positive integers $n$.