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

The sequences $(a_n)$ and (c_n) are given by $a_0 =\frac12$, $c_0=4$ , and for $n \ge 0$ , $a_{n+1}=\frac{2a_n}{1+a_n^2}$, $c_{n+1}=c_n^2-2c_n+2$ Prove that for all $n\ge 1$, $a_n=\frac{2c_0c_1...c_{n-1}}{c_n}$

The first term of a sequence is 2005. Each succeeding term is the sum of the cubes of the digits of the previous terms. What is the 2005th term of the sequence? $ \textbf{(A)}\ 29\qquad \textbf{(B)}\ 55\qquad \textbf{(C)}\ 85\qquad \textbf{(D)}\ 133\qquad \textbf{(E)}\ 250$

Define a complexity of a set $a_1,a_2,\dots,$ consisting of 0 and 1 to be the smallest positive integer $k$ such that for some positive integers $\epsilon_1,\epsilon_2,\dots, \epsilon_k$ each number of the sequence $a_n$, $n>k$, has the same parity as $\epsilon_1 a_{n-1}+\epsilon_2 a_{n-2}+\dots+\epsilon_k a_{n-k}$. Sequence $a_1,a_2,\dots,$ has a complexity of $1000$. What is the complexity of sequence $1-a_1,1-a_2,\dots,$. [I]Proposed by A. Kirichenko[/i]

Given natural $n$. We shall call "universal" such a sequence of natural number $a_1, a_2, ... , a_k, k\ge n$, if we can obtain every transposition of the first $n$ natural numbers (i.e such a sequence of $n$ numbers, that every one is encountered only once) by deleting some its members. (Examples: ($1,2,3,1,2,1,3$) is universal for $n=3$, and ($1,2,3,2,1,3,1$) -- not, because you can't obtain ($3,1,2$) from it.) The goal is to estimate the length of the shortest universal sequence for given $n$. a) Give an example of the universal sequence of $n2$ members. b) Give an example of the universal sequence of $(n^2 - n + 1)$ members. c) Prove that every universal sequence contains not less than $n(n + 1)/2$ members d) Prove that the shortest universal sequence for $n=4$ contains 12 members e) Find as short universal sequence, as you can. The Organising Committee knows the method for $(n^2 - 2n +4) $ members.

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

Let $(n+3)a_{n+2}=(6n+9)a_{n+1}-na_n$ and $a_0=1$ and $a_1=2$ prove that all the terms of the sequence are integers

Let there be $(a_n)_{n\ge1},(b_n)_{n\ge1},a_n,b_n\in\mathbb R^*_+=(0,\infty)$ such that $\lim_{n\to\infty}a_n=a\in\mathbb R^*_+$ and $(b_n)_{n\ge1}$ is a bounded sequence. If $(x_n)_{n\ge1}$, $x_n=\prod_{k=1}^n(ka_h+b_h)$ find: $$\lim_{n\to\infty}\left(\sqrt[n+1]{x_{n+1}}-\sqrt[n]{x_n}\right)$$ [i]Proposed by D.M. Bătinețu-Giurgiu and Daniel Sitaru[/i]

$\boxed{A6}$The sequence $a_0,a_1,...$ is defined by the initial conditions $a_0=1,a_1=6$ and the recursion $a_{n+1}=4a_n-a_{n-1}+2$ for $n>1.$Prove that $a_{2^k-1}$ has at least three prime factors for every positive integer $k>3.$

Let $\{x_n\}$ and $\{y_n\}$ be two sequences of natural numbers defined as follow: $x_1 = 1, \,\,\, x_2 = 1, \,\,\, x_{n+2} = x_{n+1} + 2x_n$ for $n = 1, 2, 3, ...$ $y_1 = 1, \,\,\, y_2 = 7, \,\,\, y_{n+2} = 2y_{n+1} + 3y_n$ for $n = 1, 2, 3, ...$ Prove that, except for the case $x_1 = y_1 = 1$, there is no natural value that occurs in the two sequences.

Let $P(x)$ denote the product of all (decimal) digits of a natural number $x$. For any positive integer $x_1$, define the sequence $(x_n)$ recursively by $x_{n+1} = x_n + P(x_n)$. Prove or disprove that the sequence $(x_n)$ is necessarily bounded.

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]

A nonempty set $ A$ of real numbers is called a $ B_3$-set if the conditions $ a_1, a_2, a_3, a_4, a_5, a_6 \in A$ and $ a_1 \plus{} a_2 \plus{} a_3 \equal{} a_4 \plus{} a_5 \plus{} a_6$ imply that the sequences $ (a_1, a_2, a_3)$ and $ (a_4, a_5, a_6)$ are identical up to a permutation. Let $A = \{a_0 = 0 < a_1 < a_2 < \cdots \}$, $B = \{b_0 = 0 < b_1 < b_2 < \cdots \}$ be infinite sequences of real numbers with $ D(A) \equal{} D(B),$ where, for a set $ X$ of real numbers, $ D(X)$ denotes the difference set $ \{|x\minus{}y|\mid x, y \in X \}.$ Prove that if $ A$ is a $ B_3$-set, then $ A \equal{} B.$

Let $a_1, a_2, a_3, \ldots$ be a sequence of positive real numbers, and $s$ be a positive integer, such that \[a_n = \max \{ a_k + a_{n-k} \mid 1 \leq k \leq n-1 \} \ \textrm{ for all } \ n > s.\] Prove there exist positive integers $\ell \leq s$ and $N$, such that \[a_n = a_{\ell} + a_{n - \ell} \ \textrm{ for all } \ n \geq N.\] [i]Proposed by Morteza Saghafiyan, Iran[/i]

Consider the sequence defined by $a_1 = 2022$ and $a_{n+1} = a_n + e^{-a_n}$ for $n \geq 1$. Prove that there exists a positive real number $r$ for which the sequence $$\{ra_1\}, \{ra_{10}\}, \{ra_{100}\}, . . . $$converges. [i]Note[/i]: $\{x \} = x - \lfloor x \rfloor$ denotes the part of $x$ after the decimal point. [i]Proposed by Ethan Tan[/i]

[b]1.[/b] Let $a_{v} $ and $b_{v} $, ${v= 1,2,\dots,n} $, be real numbers such that $a_{1}\geq a_{2} \geq a_{3}\geq\dots\geq a_{n}> 0 $ and $b_{1}\geq a_{1}, b_{1}b_{2}\geq a_{1}a_{2},\dots,b_{1}b_{2}\dots b_{n}\geq a_{1}a_{2}\dots a_{n} $ Show that $b_{1}+b_{2}+\dots+b_{n}\geq a_{1}+a_{2}+\dots+a_{n} $ [b](S. 4)[/b]

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 $a_1, a_2, a_3, \ldots$ be a sequence of positive real numbers, and $s$ be a positive integer, such that \[a_n = \max \{ a_k + a_{n-k} \mid 1 \leq k \leq n-1 \} \ \textrm{ for all } \ n > s.\] Prove there exist positive integers $\ell \leq s$ and $N$, such that \[a_n = a_{\ell} + a_{n - \ell} \ \textrm{ for all } \ n \geq N.\] [i]Proposed by Morteza Saghafiyan, Iran[/i]

Let $\left\{ {{a}_{n}} \right\}_{n \geq 1}$ and $\left\{ {{b}_{n}} \right\}_{n \geq 1}$ be two infinite arithmetic progressions, each of which the first term and the difference are mutually prime natural numbers. It is known that for any natural $n$, at least one of the numbers $\left( a_n^2+a_{n+1}^2 \right)\left( b_n^2+b_{n+1}^2 \right) $ or $\left( a_n^2+b_n^2 \right) \left( a_{n+1}^2+b_{n+1}^2 \right)$ is an perfect square. Prove that ${{a}_{n}}={{b}_{n}}$, for any natural $n$ .

For an integer $x \geq 1$, let $p(x)$ be the least prime that does not divide $x$, and define $q(x)$ to be the product of all primes less than $p(x)$. In particular, $p(1) = 2.$ For $x$ having $p(x) = 2$, define $q(x) = 1$. Consider the sequence $x_0, x_1, x_2, \ldots$ defined by $x_0 = 1$ and \[ x_{n+1} = \frac{x_n p(x_n)}{q(x_n)} \] for $n \geq 0$. Find all $n$ such that $x_n = 1995$.

Prove that the parity of each term of the sequence $ \left( \left\lfloor \left( \lfloor \sqrt q \rfloor +\sqrt{q} \right)^n \right\rfloor \right)_{n\ge 1} $ is opposite to the parity of its index, where $ q $ is a squarefree natural number.

Let $k$ be a positive integer and $a_1, a_2, ...$ be a sequence of terms from set $\{ 0, 1, ..., k \}$. Let $b_n = \sqrt[n] {a_1^n + a_2^n + ... + a_n^n}$ for all positive integers $n$. Prove, that if in sequence $b_1, b_2, b_3, ...$ are infinitely many integers, then all terms of this series are integers.

Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define $$x_{k+1} = \begin{cases} x_k + d &\text{if } a \text{ does not divide } x_k \\ x_k/a & \text{if } a \text{ divides } x_k \end{cases}$$ Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.

let n,m be positive integers st $m>n\geq 5$ with m depending on n. consider the sequence $a_1,a_2,...a_m$ where $a_i=i$ for $i=1,...,n$ $a_{n+j}=a_{3j}+a_{3j-1}+a_{3j-2}$ for $j=1,..,m-n$ with $m-3(m-n)=$1 or 2, ie $a_m=a_{m-k}+a_{m-k-1}+a_{m-k-2}$ where k=1 or 2 (Thus if $n=5$, the sequence is 1,2,3,4,5,6,15 and if $n=8$, the sequence is 1,2,3,4,5,6,7,8,6,15,21) Find $S=a_1+...+a_m$ if (i) $n=2007$ (ii) $n=2008$