Let $a_1,a_2,\ldots,a_n$ be a finite sequence of non negative integers, its subsequences are the sequences of the form $a_i,a_{i+1},\ldots,a_j$ with $1\le i\le j \le n$. Two subsequences are said to be equal if they have the same length and have the same terms, that is, two subsequences $a_i,a_{i+1},\ldots,a_j$ and $a_u,a_{u+1},\ldots a_v$ are equal iff $j-i=u-v$ and $a_{i+k}=a_{u+k}$ forall integers $k$ such that $0\le k\le j-1$. Finally, we say that a subsequence $a_i,a_{i+1},\ldots,a_j$ is palindromic if $a_{i+k}=a_{j-k}$ forall integers $k$ such that $0\le k \le j-i$ What is the greatest number of different palindromic subsequences that can a palindromic sequence of length $n$ contain?

The sequence $a_1, a_2,...$ is defined by the equalities $a_1 = 2, a_2 = 12$ and $a_{n+1} = 6a_n-a_{n-1}$ for every positive integer $n \ge 2$. Prove that no member of this sequence is equal to a perfect power (greater than one) of a positive integer.

What relationship should be between the positive real numbers $ a $ and $ b $ such that the sequence $ \left(\left( a\sqrt[n]{n} +b \right)^{\frac{n}{\ln n}}\right)_{n\ge 1} $ has a nonzero and finite limit? For such $ a,b, $ calculate the limit of this sequence. [i]Ion Cucurezeanu[/i]

Let the sequence an be defined by $a_0 = 2, a_1 = 15$, and $a_{n+2 }= 15a_{n+1} + 16a_n$ for $n \ge 0$. Show that there are infinitely many integers $k$ such that $269 | a_k$.

Let the sequence $ a(n), n \equal{} 1,2,3, \ldots$ be generated as follows with $ a(1) \equal{} 0,$ and for $ n > 1:$ \[ a(n) \equal{} a\left( \left \lfloor \frac{n}{2} \right \rfloor \right) \plus{} (\minus{}1)^{\frac{n(n\plus{}1)}{2}}.\] 1.) Determine the maximum and minimum value of $ a(n)$ over $ n \leq 1996$ and find all $ n \leq 1996$ for which these extreme values are attained. 2.) How many terms $ a(n), n \leq 1996,$ are equal to 0?

Let $(a_n)^\infty_{n=1}$ be a non-decreasing sequence of natural numbers with $a_{20}=100$. A sequence $(b_n)$ is defined by $b_m=\min\{n|an\ge m\}$. Find the maximum value of $a_1+a_2+\ldots+a_{20}+b_1+b_2+\ldots+b_{100}$ over all such sequences $(a_n)$.

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

Let $\operatorname{rad}(k)$ denote the product of prime divisors of a natural number $k$ (define $\operatorname{rad}(1)=1$). A sequence $(a_n)$ is defined by setting $a_1$ arbitrarily, and $a_{n+1}=a_n+\operatorname{rad}(a_n)$ for $n\ge1$. Prove that the sequence $(a_n)$ contains arithmetic progressions of arbitrary length.

The sequence $\{a_n\}$ is defined as follows: $a_1$ is a positive rational number, $a_n= \frac{p_n}{q_n}$, ($n= 1,2,…$) is a positive integer, where $p_n$ and $q_n$ are positive integers that are relatively prime, then $a_{n+1} = \frac{p_n^2+2015}{p_nq_n}$ Is there a$_1>2015$, making the sequence $\{a_n\}$ a bounded sequence? Justify your conclusion.

$a_1,a_2,\ldots,a_n$ is a sequence of positive integers that has at least $\frac {2n}{3}+1$ distinct numbers and each positive integer has occurred at most three times in it. Prove that there exists a permutation  $b_1,b_2,\ldots,b_n$ of $a_i $'s such that all the $n$ sums $b_i+b_{i+1}$ are distinct ($1\le i\le n $ , $b_{n+1}\equiv b_1 $) [i]Proposed by Mohsen Jamali[/i]

Let $a_1, a_2, \cdots, a_n$ be a sequence of nonnegative integers. For $k=1,2,\cdots,n$ denote \[ m_k = \max_{1 \le l \le k} \frac{a_{k-l+1} + a_{k-l+2} + \cdots + a_k}{l}. \] Prove that for every $\alpha > 0$ the number of values of $k$ for which $m_k > \alpha$ is less than $\frac{a_1+a_2+ \cdots +a_n}{\alpha}.$

Let $m_1<m_2<\cdots<m_s$ be a sequence of $s\ge2$ positive integers, none of which can be written as the sum of (two or more) distinct other numbers in the sequence. For every integer $r$ with $1\le r<s$, prove that \[ r\cdot m_r+m_s ~\ge~ (r+1)(s-1). \] (Proposed by Gerhard Woeginger, Austria)

Given a positive integer $k$ show that there exists a prime $p$ such that one can choose distinct integers $a_1,a_2\cdots, a_{k+3} \in \{1, 2, \cdots ,p-1\}$ such that p divides $a_ia_{i+1}a_{i+2}a_{i+3}-i$ for all $i= 1, 2, \cdots, k$. [i]South Africa [/i]

Prove that for each positive integer $ n$ there exist $ n$ consecutive positive integers none of which is an integral power of a prime number.

Let $a_1,a_2,\dots$ be a sequence of integers satisfying $a_1=2$ and: $$a_n=\begin{cases}a_{n-1}+1, & \text{ if }n\ne a_k \text{ for some }k=1,2,\dots,n-1; \\ a_{n-1}+2, & \text{ if } n=a_k \text{ for some }k=1,2,\dots,n-1. \end{cases}$$ Find the value of $a_{2022!}$.

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.

Let $a_1,a_2,...$ and $b_1,b_2,..$. be two arbitrary infinite sequences of natural numbers. Prove that there exist different indices $r$ and $s$ such that $a_r \ge a_s$ and $b_r \ge b_s$.

We define the sequence $x_1=n,y_1=1,x_{i+1}=[\frac{x_i+y_i}{2}],y_{i+1}=[\frac{n}{x_{i+1}} ]$. Prove that $min\{ x_1, x_2, ..., x_n\}=[\sqrt{n}]$ .

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

Let $0<f(1)<f(2)<f(3)<\ldots$ a sequence with all its terms positive$.$ The $n-th$ positive integer which doesn't belong to the sequence is $f(f(n))+1.$ Find $f(240).$

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

Given the sequence $(u_n)_{n=1}^{\infty}$, where $u_1 = 1, u_2 = 2$, and $u_{n + 2} = u_{n + 1} +u_ n+ \frac{(-1)^n-1}{2}$ for any positive integers $n$. Prove that every positive integers can be expressed as the sum of some distinguished numbers of the sequence of numbers $(u_n)_{n=1}^{\infty}$ Nguyen Duy Thai Son, The University of Danang, Da Nang.

The sequence $x_0, x_1, x_2, ...$ is defined by $x_0 = 0$, $x_{k+1} = [(n - \sum_0^k x_i)/2]$. Show that $x_k = 0$ for all sufficiently large $k$ and that the sum of the non-zero terms $x_k$ is $n-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.

For each positive integer $n$, put $$p_n =\left(1+\frac{1}{n}\right)^{n},\; P_n =\left(1+\frac{1}{n}\right)^{n+1}, \; h_n = \frac{2 p_n P_{n}}{ p_n + P_n }.$$ Prove that $h_1 < h_2 < h_3 <\ldots$