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

(a) Find the numbers $a_0,. . . , a_{100}$, such that $a_0 = 0, a_{100} = 1$ and for all $k = 1,. . . , 99$ : $$a_k = \frac12 a_{k- 1} + \frac12 a_{k+1 }$$ (b) Find the numbers $a_0,. . . , a_{100}$, such that $a_0 = 0, a_{100} = 1$ and for all $k = 1,. . . , 99$ : $$a_k = 1+\frac12 a_{k- 1} + \frac12 a_{k+1 }$$.

Let $K$ be the number of sequences $A_1$, $A_2$, $\dots$, $A_n$ such that $n$ is a positive integer less than or equal to $10$, each $A_i$ is a subset of $\{1, 2, 3, \dots, 10\}$, and $A_{i-1}$ is a subset of $A_i$ for each $i$ between $2$ and $n$, inclusive. For example, $\{\}$, $\{5, 7\}$, $\{2, 5, 7\}$, $\{2, 5, 7\}$, $\{2, 5, 6, 7, 9\}$ is one such sequence, with $n = 5$. What is the remainder when $K$ is divided by $10$? $\textbf{(A) } 1 \qquad \textbf{(B) } 3 \qquad \textbf{(C) } 5 \qquad \textbf{(D) } 7 \qquad \textbf{(E) } 9$

Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.

Let $1 + 1/2 + 1/3 +... + 1/n = a_n/b_n$, where $a_n$ and $b_n$ are relatively prime. Show that there exist infinitely many positive integers $n$, such that $b_{n+1} < b_n$. (8)

[b]a)[/b] Prove that there exists an unique sequence of real numbers $ \left( x_n \right)_{n\ge 1} $ satisfying $$ -\text{ctg} x_n=x_n\in\left( (2n+1)\pi /2,(n+1)\pi \right) , $$ for any nonnegative integer $ n. $ [b]b)[/b] Show that $ \lim_{n\to\infty } \left( \frac{x_n}{(n+1)\pi } \right)^{n^2} =e^{-1/\pi^2} . $ [i]Cătălin Zârnă[/i]

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$

Let $ a_0$, $ a_1$, $ a_2$, $ \ldots$ be a sequence of positive integers such that the greatest common divisor of any two consecutive terms is greater than the preceding term; in symbols, $ \gcd (a_i, a_{i \plus{} 1}) > a_{i \minus{} 1}$. Prove that $ a_n\ge 2^n$ for all $ n\ge 0$. [i]Proposed by Morteza Saghafian, Iran[/i]

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

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.

Prove that for any integer $n \ge 2$, there exists a unique finite sequence $x_0, x_1,..., x_n$ of real numbers which satisfies $x_0 = x_n = 0$ and $x_{i+1} - 8x_i^3 -4x_i + 3x_{i-1} + 1 = 0$ for all $i = 1,2,...,n - 1$. Prove moreover that $ |x_i| \le \frac12$ for all $i = 1,2,...,n - 1$. Nguyễn Duy Thái Sơn

The sequences $\{u_{n}\}$ and $\{v_{n}\}$ are defined by $u_{0} =u_{1} =1$ ,$u_{n}=2u_{n-1}-3u_{n-2}$ $(n\geq2)$ , $v_{0} =a, v_{1} =b , v_{2}=c$ ,$v_{n}=v_{n-1}-3v_{n-2}+27v_{n-3}$ $(n\geq3)$. There exists a positive integer $N$ such that when $n> N$, we have $u_{n}\mid v_{n}$ . Prove that $3a=2b+c$.

Let $d \geq 2$ be a positive integer. Define the sequence $a_1,a_2,\dots$ by $$a_1=1 \ \text{and} \ a_{n+1}=a_n^d+1 \ \text{for all }n\geq 1.$$ Determine all pairs of positive integers $(p, q)$ such that $a_p$ divides $a_q$.

Find the greatest natural number $n$ such there exist natural numbers $x_{1}, x_{2}, \ldots, x_{n}$ and natural $a_{1}< a_{2}< \ldots < a_{n-1}$ satisfying the following equations for $i =1,2,\ldots,n-1$: \[x_{1}x_{2}\ldots x_{n}= 1980 \quad \text{and}\quad x_{i}+\frac{1980}{x_{i}}= a_{i}.\]

The sequence $a_1,a_2,\dots$ of positive integers obeys the following two conditions: [list] [*] For all positive integers $m,n$, it happens that $a_m\cdot a_n=a_{mn}$ [*] There exist infinite positive integers $n$ such that $(a_1,a_2,\dots,a_n)$ is a permutation of $(1,2,\dots,n)$ [/list] Prove that $a_n=n$ for all positive integers $n$. [i]Proposed by José Alejandro Reyes González[/i]

Define a sequence: $x_0=1$ and for all $n\ge 0$, $x_{2n+1}=x_{n}$ and $x_{2n+2}=x_{n}+x_{n+1}$. Prove that for any relatively prime positive integers $a$ and $b$, there is a non-negative integer $n$ such that $a=x_n$ and $b=x_{n+1}$.

Let $a_1,a_2, \cdots$ be a sequence of integers that satisfies: $a_1=1$ and $a_{n+1}=a_n+a_{\lfloor \sqrt{n} \rfloor} , \forall n\geq 1 $. Prove that for all positive $k$, there is $m \geq 1$ such that $k \mid a_m$.

Let $a_0 < a_1 < a_2 < \dots$ be an infinite sequence of positive integers. Prove that there exists a unique integer $n\geq 1$ such that \[a_n < \frac{a_0+a_1+a_2+\cdots+a_n}{n} \leq a_{n+1}.\] [i]Proposed by Gerhard Wöginger, Austria.[/i]

For a positive integer $n$, an [i]$n$-sequence[/i] is a sequence $(a_0,\ldots,a_n)$ of non-negative integers satisfying the following condition: if $i$ and $j$ are non-negative integers with $i+j \leqslant n$, then $a_i+a_j \leqslant n$ and $a_{a_i+a_j}=a_{i+j}$. Let $f(n)$ be the number of $n$-sequences. Prove that there exist positive real numbers $c_1$, $c_2$, and $\lambda$ such that \[c_1\lambda^n<f(n)<c_2\lambda^n\] for all positive integers $n$.

An integer sequence is defined by \[{ a_n = 2 a_{n-1} + a_{n-2}}, \quad (n > 1), \quad a_0 = 0, a_1 = 1.\] Prove that $2^k$ divides $a_n$ if and only if $2^k$ divides $n$.

Define the sequence $a_1 = 1, a_2, a_3, ...$ by $$a_{n+1} = a_1^2 + a_2 ^2 + a_3^2 + ... + a_n^2 + n$$ Show that $1$ is the only square in the sequence.

Define a finite sequence $ \left( s_i \right)_{1\le i\le 2004} $ with $ s_0+2=s_1+1=s_2=2 $ and the recurrence relation $$ s_n=1+s_{n-1} +s_{n-2} -s_{n-3} . $$ Calculate its last element.

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 $m > 1$ be an integer. A sequence $a_1, a_2, a_3, \ldots$ is defined by $a_1 = a_2 = 1$, $a_3 = 4$, and for all $n \ge 4$, $$a_n = m(a_{n - 1} + a_{n - 2}) - a_{n - 3}.$$ Determine all integers $m$ such that every term of the sequence is a square.

Consider the following sequence $$(a_n)_{n=1}^{\infty}=(1,1,2,1,2,3,1,2,3,4,1,2,3,4,5,1,\dots)$$ Find all pairs $(\alpha, \beta)$ of positive real numbers such that $\lim_{n\to \infty}\frac{\displaystyle\sum_{k=1}^n a_k}{n^{\alpha}}=\beta$. (Proposed by Tomas Barta, Charles University, Prague)