Let $\{a_n\}$ be a sequence of integers satisfying the following conditions. [list] [*] $a_1=2021^{2021}$ [*] $0 \le a_k < k$ for all integers $k \ge 2$ [*] $a_1-a_2+a_3-a_4+ \cdots + (-1)^{k+1}a_k$ is multiple of $k$ for all positive integers $k$. [/list] Determine the $2021^{2022}$th term of the sequence $\{a_n\}$.

Let $(a_n)_{n=1}^{\infty}$ and $(b_n)_{n=1}^{\infty}$ be two sequences of positive numbers. Show that the following statements are equivalent: [list=1] [*]There is a sequence $(c_n)_{n=1}^{\infty}$ of positive numbers such that $\sum_{n=1}^{\infty}{\frac{a_n}{c_n}}$ and $\sum_{n=1}^{\infty}{\frac{c_n}{b_n}}$ both converge;[/*] [*]$\sum_{n=1}^{\infty}{\sqrt{\frac{a_n}{b_n}}}$ converges.[/*] [/list] [i]Proposed by Tomáš Bárta, Charles University, Prague[/i]

[b]Problem.[/b] Let $f:\mathbb{R}_0^+\rightarrow\mathbb{R}_0^+$ be a function defined as $$f(n)=n+\lfloor\sqrt{n}\rfloor~\forall~n\in\mathbb{R}_0^+.$$ Prove that for any positive integer $m,$ the sequence $$m,f(m),f(f(m)),f(f(f(m))),\ldots$$ contains a perfect square.

For $m = 1, 2, 3, ...$ denote $S(m)$ the sum of the digits of $m$, and let $f(m)=m+S(m)$. Show that for each positive integer $n$, there exists a number that appears exactly $n$ times in the sequence $f(1),f(2),...,f(m),...$

Given unbounded strictly increasing sequence $a_1, a_2, ... , a_n, ...$ of positive numbers. Prove that a) there exists a number $k_0$ such that for all $k>k_0$ the following inequality is valid: $$\frac{a_1}{a_2}+ \frac{a_2}{a_3} + ... + \frac{a_k}{a_{k-1} }< k - 1$$ b) there exists a number $k_0$ such that for all $k>k_0$ the following inequality is valid: $$\frac{a_1}{a_2}+ \frac{a_2}{a_3} + ... + \frac{a_k}{a_{k-1} }< k - 1985$$

Sequence $(G_n)$ is defined by $G_0 = 0, G_1 = 1$ and $G_n = G_{n-1} + G_{n-2} + 1$ for every $n \ge2$. Prove that for every positive integer $m$ there exist two consecutive terms in the sequence that are both divisible by $m$.

[b]1)[/b] Prove that there are finite sequences, of any length, of nonegative integers having the property that the arithmetic mean of any choice of its elements is natural. [b]2)[/b] Study if there is an increasing infinite sequence of nonegative integers having the property that the arithmetic mean of any finite choice of its elements is natural.

The sequence $(Q_{n}(x))$ of polynomials is defined by $$Q_{1}(x)=1+x ,\; Q_{2}(x)=1+2x,$$ and for $m \geq 1 $ by $$Q_{2m+1}(x)= Q_{2m}(x) +(m+1)x Q_{2m-1}(x),$$ $$Q_{2m+2}(x)= Q_{2m+1}(x) +(m+1)x Q_{2m}(x).$$ Let $x_n$ be the largest real root of $Q_{n}(x).$ Prove that $(x_n )$ is an increasing sequence and that $\lim_{n\to \infty} x_n =0.$

A sequence of natural numbers $a_1, a_2, a_3,..$ is called [i]periodic modulo[/i] $n$ if there exists a positive integer $k$ such that, for any positive integer $i$, the terms $a_i$ and $a_{i+k}$ are equal modulo $n$. Does there exist a strictly increasing sequence of natural numbers that a) is not periodic modulo finitely many positive integers and is periodic modulo all the other positive integers? b) is not periodic modulo infinitely many positive integers and is periodic modulo infinitely many positive integers?

For positive integer $n$ we define $f(n)$ as sum of all of its positive integer divisors (including $1$ and $n$). Find all positive integers $c$ such that there exists strictly increasing infinite sequence of positive integers $n_1, n_2,n_3,...$ such that for all $i \in \mathbb{N}$ holds $f(n_i)-n_i=c$

A sequence $\{a_n\}_{n\geq 1}$ is defined by a recurrence relation $$a_1 = 1,\quad a_{n+1} = \log \frac{e^{a_n}-1}{a_n}$$ And a sequence $\{b_n\}_{n\geq 1}$ is defined as $b_n = \prod\limits_{i=1}^n a_i$. Evaluate an infinite series $\sum\limits_{n=1}^\infty b_n$.

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

Let $c \ge 1$ be an integer. Define a sequence of positive integers by $a_1 = c$ and \[a_{n+1}=a_n^3-4c\cdot a_n^2+5c^2\cdot a_n+c\] for all $n\ge 1$. Prove that for each integer $n \ge 2$ there exists a prime number $p$ dividing $a_n$ but none of the numbers $a_1 , \ldots , a_{n -1}$ . [i]Proposed by Austria[/i]

For a positive integer $x$, define a sequence $a_0, a_1, a_2, . . .$ according to the following rules: $a_0 = 1$, $a_1 = x + 1$ and $$a_{n+2} = xa_{n+1} - a_n$$ for all $n \ge 0$. Prove that there exist infinitely many positive integers x such that this sequence does not contain a prime number.

Let $\alpha > 1$ be an irrational number and $L$ be a integer such that $L > \frac{\alpha^2}{\alpha - 1}$. A sequence $x_1, x_2, \cdots$ satisfies that $x_1 > L$ and for all positive integers $n$, \[ x_{n+1} = \begin{cases} \left \lfloor \alpha x_n \right \rfloor & \textup{if} \; x_n \leqslant L \\\left \lfloor \frac{x_n}{\alpha} \right \rfloor & \textup{if} \; x_n > L \end{cases}. \] Prove that (i) $\left\{x_n\right\}$ is eventually periodic. (ii) The eventual fundamental period of $\left\{x_n\right\}$ is an odd integer which doesn't depend on the choice of $x_1$.

Esmeralda chooses two distinct positive integers \(a\) and \(b\), with \(b > a\), and writes the equation \[ x^2 - ax + b = 0 \] on the board. If the equation has distinct positive integer roots \(c\) and \(d\), with \(d > c\), she writes the equation \[ x^2 - cx + d = 0 \] on the board. She repeats the procedure as long as she obtains distinct positive integer roots. If she writes an equation for which this does not occur, she stops. a) Show that Esmeralda can choose \(a\) and \(b\) such that she will write exactly 2024 equations on the board. b) What is the maximum number of equations she can write knowing that one of the initially chosen numbers is 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 $S$ be the set of all points $t$ in the closed interval $[-1, 1]$ such that for the sequence $x_0, x_1, x_2, ...$ defined by the equations $x_0 = t, x_{n+1} = 2x_n^2-1$, there exists a positive integer $N$ such that $x_n = 1$ for all $n \ge N$. Show that the set $S$ has infinitely many elements.

Consider a finite sequence $a_1, a_2,...,a_n$ whose terms are natural numbers at most equal to $n$. Determine the maximum number of terms of such a sequence, if you know that every two of its neighboring terms are different and at the same time there is no quartet of terms in it such that $a_p = a_r \ne a_q = a_s$ for $p < q < r < s$.

Define sequence $(a_{n})_{n=1}^{\infty}$ by $a_1=a_2=a_3=1$ and $a_{n+3}=a_{n+1}+a_{n}$ for all $n \geq 1$. Also, define sequence $(b_{n})_{n=1}^{\infty}$ by $b_1=b_2=b_3=b_4=b_5=1$ and $b_{n+5}=b_{n+4}+b_{n}$ for all $n \geq 1$. Prove that $\exists N \in \mathbb{N}$ such that $a_n = b_{n+1} + b_{n-8}$ for all $n \geq N$.

Given an increasing sequence of different natural numbers $a_1 < a_2 < a_3 < ... < a_n$ such that for any two distinct numbers in this sequence their sum is not divisible by $10$. It is known that $a_n = 2023$. a) Can $n$ be greater than $800$? b) What is the largest possible value of $n$? c) For the value $n$ found in question b), find the number of such sequences with $a_n = 2023$.

The sequences of positive integers $1,a_2,a_3,\ldots$ and $1,b_2,b_3,\ldots$ are an increasing arithmetic sequence and an increasing geometric sequence, respectively. Let $c_n=a_n+b_n$. There is an integer $k$ such that $c_{k-1}=100$ and $c_{k+1}=1000$. Find $c_k$.

Given a non-decreasing unbounded sequence $a_n,$ construct a new sequence $b_n$ as follows $$b_n = \frac{a_2 - a_1}{a_2} + \frac{a_3 - a_2}{a_3} + ... + \frac{a_n - a_{n-1}}{a_n}$$ Prove that $b_n$ is also unbounded.

Consider the set of all strictly decreasing sequences of $n$ natural numbers having the property that in each sequence no term divides any other term of the sequence. Let $A = (a_j)$ and $B = (b_j)$ be any two such sequences. We say that $A$ precedes $B$ if for some $k$, $a_k < b_k$ and $a_i = b_i$ for $i < k$. Find the terms of the first sequence of the set under this ordering.

For every sequence $\{a_n\}~(n\in\mathbb N)$ we define the sequences $\{\Delta a_n\}$ and $\{\Delta^2a_n\}$ by the following formulas: \begin{align*}\Delta a_n&=a_{n+1}-a_n,\\\Delta^2a_n&=\Delta a_{n+1}-\Delta a_n.\end{align*}Further, for all $n\in\mathbb N$ for which $\Delta a_n^2\ne0$, define $$a_n'=a_n-\frac{(\Delta a_n)^2}{\Delta^2a_n}.$$ (a) For which sequences $\{a_n\}$ is the sequence $\{\Delta^2a_n\}$ constant? (b) Find all sequences $\{a_n\}$, for which the numbers $a_n'$ are defined for all $n\in\mathbb N$ and for which the sequence $\{a_n'\}$ is constant. (c) Assume that the sequence $\{a_n\}$ converges to $a=0$, and $a_n\ne a$ for all $n\in\mathbb N$ and the sequence $\{\tfrac{a_{n+1}-a}{a_n-a}\}$ converges to $\lambda\ne1$. i. Prove that $\lambda\in[-1,1)$. ii. Prove that there exists $n_0\in\mathbb N$ such that for all integers $n\ge n_0$ we have $\Delta^2a_n\ne0$. iii. Let $\lambda\ne0$. For which $k\in\mathbb Z$ is the sequence $\{\tfrac{a_n'}{a_{n+k}}\}$ not convergent? iv. Let $\lambda=0$. Prove that the sequences $\{a_n'/a_n\}$ and $\{a_n'/a_{n+1}\}$ converge to $0$. Find an example of $\{a_n\}$ for which the sequence $\{a_n'/a_{n+2}\}$ has a non-zero limit. (d) What happens with part (c) if we remove the condition $a=0$?