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.

A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where $[x]$ denotes the smallest integer $\leq x)$

Consider $0<\lambda<1$, and let $A$ be a multiset of positive integers. Let $A_n=\{a\in A: a\leq n\}$. Assume that for every $n\in\mathbb{N}$, the set $A_n$ contains at most $n\lambda$ numbers. Show that there are infinitely many $n\in\mathbb{N}$ for which the sum of the elements in $A_n$ is at most $\frac{n(n+1)}{2}\lambda$. (A multiset is a set-like collection of elements in which order is ignored, but repetition of elements is allowed and multiplicity of elements is significant. For example, multisets $\{1, 2, 3\}$ and $\{2, 1, 3\}$ are equivalent, but $\{1, 1, 2, 3\}$ and $\{1, 2, 3\}$ differ.)

Study the convergence of a sequence $ \left( x_n\right)_{n\ge 0} $ for which $ x_0\in\mathbb{R}\setminus\mathbb{Q} , $ and $ x_{n+1}\in \left\{ \frac{x_n+1}{x_n} , \frac{x_n+2}{2x_n-1}\right\} , $ for all $ n\ge 1. $

Let $\sum_{n=1}^\infty a_n$ be a convergent series of positive terms (so $a_i>0$ for all $i$) and set $b_n=\frac1{na_n^2}$ for $n\ge1$. Prove that $\sum_{n=1}^\infty\frac n{b_1+b_2+\ldots+b_n}$ is convergent.

For a given positive integer $n$ one has to choose positive integers $a_0, a_1,...$ so that the following conditions hold: (1) $a_i = a_{i+n}$ for any $i$, (2) $a_i$ is not divisible by $n$ for any $i$, (3) $a_{i+a_i}$ is divisible by $a_i$ for any $i$. For which positive integers $n > 1$ is this possible only if the numbers $a_0, a_1, ...$ are all equal?

Let $a_1, a_2,...,a_{2018}$ be a sequence of numbers such that all its elements are elements of a set $\{-1,1\}$. Sum $$S=\sum \limits_{1 \leq i < j \leq 2018} a_i a_j$$ can be negative and can also be positive. Find the minimal value of this sum

Positive integers $a_1, a_2, \dots, a_{2023}$ satisfy the following conditions. [list] [*] $a_1 = 5, a_2 = 25$ [*] $a_{n + 2} = 7a_{n+1}-a_n-6$ for each $n = 1, 2, \dots, 2021$ [/list] Prove that there exist integers $x, y$ such that $a_{2023} = x^2 + y^2.$

Let $n > 3$ be an integer. Prove that there exist positive integers $x_1,..., x_n$ in geometric progression and positive integers $y_1,..., y_n$ in arithmetic progression such that $x_1<y_1<x_2<y_2<...<x_n<y_n$

Given the sequence $(t_n)$ defined as $t_0 = 0$, $t_1 = 6$, $t_{n + 2} = 14t_{n + 1} - t_n$. Prove that for every number $n \ge 1$, $t_n$ is the area of a triangle whose lengths are all numbers integers. Dang Hung Thang, University of Natural Sciences, Hanoi National University.

A student firstly wrote $x=3$ on the board. For each procces, the stutent deletes the number x and replaces it with either $(2x+4)$ or $(3x+8)$ or $(x^2+5x)$. Is this possible to make the number $(20^{17}+2016)$ on the board? \\ (Explain your answer) \\ [hide=Note]This type of the question is well known but I am going to make a collection so, :blush: [/hide]

Let be a surjective function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that has the property that if the sequence $ \left( f\left( x_n \right) \right)_{n\ge 1} $ is convergent, then the sequence $ \left( x_n \right)_{n\ge 1} $ is convergent. Prove that it is continuous.

Let \( p_1, p_2, \cdots, p_{2025} \) be real numbers. For \( 1 \leq i \leq 2025 \), let \[\{a_n^{(i)}\}_{n \geq 0}\] be an infinite real sequence satisfying \[a_0^{(i)} = 0.\] It is known that: (1) \[a_1^{(1)}, a_1^{(2)}, \cdots, a_1^{(2025)}\] are not all zero. (2) For any integer \( n \geq 0 \) and any \( 1 \leq i \leq 2025 \), the following holds: \[p_i \cdot a_n^{(i+1)} = a_{n-1}^{(i)} + a_n^{(i)} + a_{n+1}^{(i)},\] where the sequence \[\{a_n^{(2026)}\}\] satisfies \[a_n^{(2026)} = a_n^{(1)}, \, n = 0, 1, 2, \cdots.\] Prove that there exists a positive real number \( r \) such that for infinitely many positive integers \( n \), \[\max \left\{ |a_n^{(1)}|, |a_n^{(2)}|, \cdots, |a_n^{(2025)}|\right\} \geq r.\]

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}.\]

A real number sequence $a_1, \cdots ,a_{2021}$ satisfies the below conditions. $$a_1=1, a_2=2, a_{n+2}=\frac{2a_{n+1}^2}{a_n+a_{n+1}} (1\leq n \leq 2019)$$ Let the minimum of $a_1, \cdots ,a_{2021}$ be $m$, and the maximum of $a_1, \cdots ,a_{2021}$ be $M$. Let a 2021 degree polynomial $$P(x):=(x-a_1)(x-a_2) \cdots (x-a_{2021})$$ $|P(x)|$ is maximum in $[m, M]$ when $x=\alpha$. Show that $1<\alpha <2$.

An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that \[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1 \] for every pair of distinct nonnegative integers $ i, j$.

Let $a_1,a_2,\cdots$ be an infinity sequence of positive integers such that $a_1=2021$ and $$a_{n+1}=(a_1+a_2+\cdots+a_n)^2-1$$ for all positive integers $n$. Prove that for any integer $n\ge 2$, $a_n$ is the product of at least $2n$ (not necessarily distinct) primes.

Let $(a_n)_{n\ge1}$ and $(b_n)_{n\ge1}$ be positive real sequences such that $$\lim_{n\to\infty}\frac{a_{n+1}-a_n}n=a\in\mathbb R^*_+\enspace\text{and}\enspace\lim_{n\to\infty}\frac{b_{n+1}}{nb_n}=b\in\mathbb R^*_+$$ Compute $$\lim_{n\to\infty}\left(\frac{a_{n+1}}{\sqrt[n+1]{b_{n+1}}}-\frac{a_n}{\sqrt[n]{b_n}}\right)$$ [i]Proposed by D.M. Bătinețu-Giurgiu and Neculai Stanciu[/i]

For $n \in \mathbb{N}$, let $a_n = \int _0 ^{1/\sqrt{n}} | 1 + e^{it} + e^{2it} + \dots + e^{nit} | \ dt$. Determine whether the sequence $(a_n) = a_1, a_2, \dots$ is bounded.

Consider the sequence of rational numbers defined by $x_1=\frac{4}{3}$, and $x_{n+1}=\frac{x_n^2}{x_n^2-x_n+1}$. Show that the nu,erator of the lowest term expression of each sum $x_1+x_2+...+x_k$ is a perfect square.

Let the sequence ($a_n$) be defined by $a_n = n^6 +5n^4 -12n^2 -36, n \ge 2$. (a) Prove that any prime number divides some term in this sequence. (b) Prove that there is a positive integer not dividing any term in the sequence. (c) Determine the least $n \ge 2$ for which $1989 | a_n$.

Let $n \ne 0$ be a natural number. A sequence of numbers is briefly called a sequence “$F_n$” if $n$ different numbers $z_1$, $z_2$, $...$, $z_n$ exist so that the following conditions are fulfilled: (1) Each term of the sequence is one of the numbers $z_1$, $z_2$, $...$, $z_n$. (2) Each of the numbers $z_1$, $z_2$, $...$, $z_n$ occurs at least once in the sequence. (3) Any two immediately consecutive members of the sequence are different numbers. (4) No subsequence of the sequence has the form $\{a, b, a, b\}$ with $a \ne b$. Note: A subsequence of a given sequence $\{x_1, x_2, x_3, ...\}$ or $\{x_1, x_2, x_3, ..., x_s\}$ is called any sequence of the form $\{x_{m1}, x_{m2}, x_{m3}, ...\}$ or $\{x_{m1}, x_{m2}, x_{m3}, ..., x_{mt}\}$ with natural numbers $m_1 < m_2 < m_3 < ...$ Answer the following questions: a) Given $n$, are there sequences $F_n$ of arbitrarily long length? b) If question (a) is answered in the negative for an $n$: What is the largest possible number of terms that a sequence $F_n$ can have (given $n$)?

Let $n$ be an integer greater than $1$. Define \[x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \qquad \text{for }i = 1, 2, \ldots\ ,\] where $[z]$ denotes the largest integer less than or equal to $z$. Prove that \[ \min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]\]

Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$. [i]Proposed by Mohsen Jamaali, Iran[/i]

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