To commemorate the $43rd$ anniversary of the restoration of mathematics competitions, a mathematics enthusiast arranges the first $2021$ integers $1,2,\dots,2021$ into a sequence $\{a_n\}$ in a certain order, so that the sum of any consecutive $43$ items in the sequence is a multiple of $43$. (1) If the sequence of numbers is connected end to end into a circle, prove that the sum of any consecutive $43$ items on the circle is also a multiple of $43$; (2) Determine the number of sequences $\{a_n\}$ that meets the conditions of the question.

Let $u_1=1,u_2=2,u_3=24,$ and $u_{n+1}=\frac{6u_n^2 u_{n-2}-8u_nu_{n-1}^2}{u_{n-1}u_{n-2}}, n \geq 3.$ Prove that the elements of the sequence are natural numbers and that $n\mid u_n$ for all $n$.

Let $F_1,F_2,F_3,...$ be the [i]Fibonacci sequence[/i], the sequence of positive integers with $F_1 =F_2 =1$ and $F_{n+2}=F_{n+1}+F_n$ for all $n \ge 1$. A [i]Fibonacci number[/i] is by definition a number appearing in this sequence. Let $P_1,P_2,P_3,...$ be the sequence consisting of all the integers that are products of two Fibonacci numbers (not necessarily distinct) in increasing order. The first few terms are $1,2,3,4,5,6,8,9,10,13,...$ since, for example $3 = 1 \cdot 3, 4 = 2 \cdot 2$, and $10 = 2 \cdot 5$. Consider the sequence $D_n$ of [i]successive [/i] differences of the $P_n$ sequence, where $D_n = P_{n+1}-P_n$ for $n \ge 1$. The first few terms of D_n are $1,1,1,1,1,2,1,1,3, ...$ . Prove that every number in $D_n$ is a [i]Fibonacci number[/i].

The sequence ($a_n$) is defined by $a_1 = a_2 = 1, a_3 = 199$ and $a_{n+1} =\frac{1989+a_na_{n-1}}{a_{n-2}}$ for all $n \ge 3$. Prove that all terms of the sequence are positive integers

Determine the set of all real numbers $r$ for which there exists an infinite sequence $a_1,a_2,\dots$ of positive integers satisfying the following three properties: (1) No number occurs more than once in the sequence. (2) The sum of two different elements of the sequence is never a power of two. (3) For all positive integers $n$, we have $a_n<r \cdot n$.

Let bet a sequence $\left( a_n \right)_{n\ge 1} $ with $ a_1=1 $ and defined as $ a_n=\sqrt[n]{1+na_{n-1}} . $ Show that $ \left( a_n \right)_{n\ge 1} $ is convergent and determine its limit. [i]Florian Dumitrel[/i]

Given a $3 \times 3$ symmetric real matrix $A$, we define $f(A)$ as a $3 \times 3$ matrix with the same eigenvectors of $A$ such that if $A$ has eigenvalues $a$, $b$, $c$, then $f(A)$ has eigenvalues $b+c$, $c+a$, $a+b$ (in that order). We define a sequence of symmetric real $3\times3$ matrices $A_0, A_1, A_2, \ldots$ such that $A_{n+1} = f(A_n)$ for $n \geq 0$. If the matrix $A_0$ has no zero entries, determine the maximum number of indices $j \geq 0$ for which the matrix $A_j$ has any null entries.

Sides of a triangle form an arithmetic sequence with common difference $2$, and its area is $6 \text{ cm }^2$. Find its sides.

The sequence $\{a_n\}$ satisfies $a_1 = \frac{1}{2}$, $a_2 = \frac{3}{8}$, and $a_{n + 1}^2 + 3 a_n a_{n + 2} = 2 a_{n + 1} (a_n + a_{n + 2}) (n \in \mathbb{N^*})$. $(1)$ Determine the general formula of the sequence $\{a_n\}$; $(2)$ Prove that for any positive integer $n$, there is $0 < a_n < \frac{1}{\sqrt{2n + 1}}$.

Consider a sequence of polynomials such that $P_0(x)=2,P_1(x)=x$ and for all $n\ge1$ \[P_{n+1}(x)+P_{n-1}(x)=xP_n(x).\] a) Determine the polynomial \[Q_n(x)=P^2_n(x)-xP_n(x)P_{n-1}(x)+P^2_{n-1}(x)\] for $n=1972.$ b) Express the polynomial \[\bigl(P_{n+1}(x)-P_{n-1}(x)\bigr)^2\] in terms of $P_n(x),Q_n(x).$

Let be two real numbers $ b>a>0, $ and a sequence $ \left( x_n \right)_{n\ge 1} $ with $ x_2>x_1>0 $ and such that $$ ax_{n+2}+bx_n\ge (a+b)x_{n+1} , $$ for any natural numbers $ n. $ Prove that $ \lim_{n\to\infty } x_n=\infty . $ [i]Dan Popescu[/i]

$\boxed{A3}$The sequence $a_1,a_2,a_3,...$ is defined by $a_1=a_2=1,a_{2n+1}=2a_{2n}-a_n$ and $a_{2n+2}=2a_{2n+1}$ for $n\in{N}.$Prove that if $n>3$ and $n-3$ is divisible by $8$ then $a_n$ is divisible by $5$

The sequence $(a_n)$ is defined with the recursion $a_{n + 1} = 5a^6_n + 3a^3_{n-1} + a^2_{n-2}$ for $n\ge 2$ and the set of initial values $\{a_0, a_1, a_2\} = \{2013, 2014, 2015\}$. (That is, the initial values are these three numbers in any order.) Show that the sequence contains no sixth power of a natural number.

Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that $$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$ for all positive integers $n$. Show that $a_{2022}\leq 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.

Suppose that $ n \geq 2$ and $ x_1, x_2, \ldots, x_n$ are real numbers between 0 and 1 (inclusive). Prove that for some index $ i$ between $ 1$ and $ n \minus{} 1$ the inequality \[ x_i (1 \minus{} x_{i\plus{}1}) \geq \frac{1}{4} x_1 (1 \minus{} x_{n})\]

Let $\{x\}$ denote the fractional part of $x$, $x - [x]$. The sequences $x_1, x_2, x_3, ...$ and $y_1, y_2, y_3, ...$ are such that $\lim \{x_n\} = \lim \{y_n\} = 0$. Is it true that $\lim \{x_n + y_n\} = 0$? $\lim \{x_n - y_n\} = 0$?

Given a sequence of positive integers $a_1, a_2, a_3, \ldots$ such that for any positive integers $k$, $l$ we have $k+l ~ | ~ a_k + a_l$. Prove that for all positive integers $k > l$, $a_k - a_l$ is divisible by $k-l$.

We consider the sequence $\{u_n\}$ defined by recursion $u_{n+1} =\frac{u_n(u_n + 1)}{n}$ for $n \ge 1$. (a) Determine the terms of the sequence for $u_1 = 1$. (b) Show that if a member of the sequence is rational, then all subsequent members are also rational numbers. (c) Show that for every natural number $K$ there is a $u_1 > 1$ such that the first $K$ terms of the sequence are natural numbers.

A sequence of real numbers $(a_k)_{k \ge 0}$ is called [i]log-concave[/i] if for every $k \ge 1$, the inequality $a_{k - 1}a_{k + 1} \le a_k^2$ holds. Let $n, l \in \mathbb{N}$. Prove that the sequence $(a_k)_{k \ge 0}$ with general term \[a_k = \sum_{i = k}^{k + l} {n \choose i}\] is log-concave. Proposed by [i]Svetlana Poznanovikj[/i]

A sequence $(x_{i})$ is said to have a [i]Cesaro limit[/i] exactly if $\lim_{n\to\infty} \frac{x_{1}+\ldots+x_{n}}{n}$ exists. Find all real-valued functions $f$ on the closed interval $[0, 1]$ such that $(f(x_i))$ has a Cesaro limit if and only if $(x_i)$ has a Cesaro limit.

Given the Fibonacci sequence $0, 1, 1, 2, 3, 5, 8, ... ,$ ascertain whether among its first $(10^8+1)$ terms there is a number that ends with four zeros.

A positive integer \( r \) is given, find the largest real number \( C \) such that there exists a geometric sequence $\{ a_n \}_{n\ge 1}$ with common ratio \( r \) satisfying $$ \| a_n \| \ge C $$ for all positive integers \( n \). Here, $\| x \|$ denotes the distance from the real number \( x \) to the nearest integer.

Let the sequences $(a_n)_{n=1}^{\infty}$ and $(b_n)_{n=1}^{\infty}$ satisfy $a_0 = b_0 = 1, a_n = 9a_{n-1} -2b_{n-1}$ and $b_n = 2a_{n-1} + 4b_{n-1}$ for all positive integers $n$. Let $c_n = a_n + b_n$ for all positive integers $n$. Prove that there do not exist positive integers $k, r, m$ such that $c^2_r = c_kc_m$.

Find all possible values of $C\in \mathbb R$ such that there exists a real sequence $\{a_n\}_{n=1}^\infty$ such that $$a_na_{n+1}^2\ge a_{n+2}^4 +C$$ for all $n\ge 1$.