Let $a_1, a_2, a_3, . . . , a_n, . . . $ be an infinite sequence of natural numbers in which $a_1$ is not divisible by $5$. Suppose $a_{n+1} = a_n + b_n$ where bn is the last digit of $a_n$, for every $n$. Prove that the sequence $\{a_n\}$ contains infinitely many powers of 2.

The closed broken line $M$ has odd number of vertices -- $A_1,A_2,..., A_{2n+1}$ in sequence. Let us denote with $S(M)$ a new closed broken line with vertices $B_1,B_2,...,B_{2n+1}$ -- the midpoints of the first line links: $B_1$ is the midpoint of $[A_1A_2], ... , B_{2n+1}$ -- of $[A_{2n+1}A_1]$. Prove that in a sequence $M_1=S(M), ... , M_k = S(M_{k-1}), ...$ there is a broken line, homothetic to the $M$.

Let $(x_n)$ be an infinite sequence of real numbers from interval $(0, 1)$. An infinite sequence $(a_n)$ of positive integers is defined as follows: $a_1 = 1$, and for $i \ge 1$, $a_{i+1}$ is equal to the smallest positive integer $m$, for which $[x_1 + x_2 + \ldots + x_m] = a_i$. Show that for any indexes $i, j$ holds $a_{i+j} \ge a_i + a_j$. [i]Proposed by Nazar Serdyuk[/i]

Let a sequence $(x_n)$ satisfy :$x_1=1$ and $x_{n+1}=x_n+3\sqrt{x_n} + \frac{n}{\sqrt{x_n}}$,$\forall$n$\ge1$ a) Prove lim$\frac{n}{x_n}=0$ b) Find lim$\frac{n^2}{x_n}$

There are two positive numbers that may be inserted between $3$ and $9$ such that the first three are in geometric progression while the last three are in arithmetic progression. The sum of those two positive numbers is $\textbf{(A) }13\textstyle\frac{1}{2}\qquad\textbf{(B) }11\frac{1}{4}\qquad\textbf{(C) }10\frac{1}{2}\qquad\textbf{(D) }10\qquad \textbf{(E) }9\frac{1}{2}$

Determine whether there exist two reals $x,y$ and a sequence $\{a_n\}_{n=0}^{\infty}$ of nonzero reals such that $a_{n+2}=xa_{n+1}+ya_n$ for all $n\ge0$ and for every positive real number $r$, there exist positive integers $i,j$ such that $|a_i|<r<|a_j|$. [i]Alex Zhu.[/i]

Let $ a_1,a_2,\dots$ be a sequence of integers determined by the rule $ a_n\equal{}a_{n\minus{}1}/2$ if $ a_{n\minus{}1}$ is even and $ a_n\equal{}3a_{n\minus{}1}\plus{}1$ if $ a_{n\minus{}1}$ is odd. For how many positive integers $ a_1 \le 2008$ is it true that $ a_1$ is less than each of $ a_2$, $ a_3$, and $ a_4$? $ \textbf{(A)}\ 250 \qquad \textbf{(B)}\ 251 \qquad \textbf{(C)}\ 501 \qquad \textbf{(D)}\ 502 \qquad \textbf{(E)}\ 1004$

In how many ways can the sequence $1,2,3,4,5$ be arranged so that no three consecutive terms are increasing and no three consecutive terms are decreasing? $\textbf{(A) } 10 \qquad \textbf{(B) } 18 \qquad \textbf{(C) } 24 \qquad \textbf{(D) } 32 \qquad \textbf{(E) } 44$

Define the numbers $a_0, a_1, \ldots, a_n$ in the following way: \[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \] Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]

Let the sequence $a_i$ be defined as $a_{i+1} = 2^{a_i}$. Find the number of integers $1 \le n \le 1000$ such that if $a_0 = n$, then $100$ divides $a_{1000} - a_1$.

Find all sequences $a_1, a_2, a_3, \dots$ of real numbers such that for all positive integers $m,n\ge 1$, we have \begin{align*} a_{m+n} &= a_m+a_n - mn \text{ and} \\ a_{mn} &= m^2a_n + n^2a_m + 2a_ma_n. \\ \end{align*}

A finite sequence $x_1,\dots,x_r$ of positive integers is a [i]palindrome[/i] if $x_i=x_{r+1-i}$ for all integers $1 \le i \le r$. Let $a_1,a_2,\dots$ be an infinite sequence of positive integers. For a positive integer $j \ge 2$, denote by $a[j]$ the finite subsequence $a_1,a_2,\dots,a_{j-1}$. Suppose that there exists a strictly increasing infinite sequence $b_1,b_2,\dots$ of positive integers such that for every positive integer $n$, the subsequence $a[b_n]$ is a palindrome and $b_{n+2} \le b_{n+1}+b_n$. Prove that there exists a positive integer $T$ such that $a_i=a_{i+T}$ for every positive integer $i$.

Let $a_0>0$ be a real number, and let $$a_n=\frac{a_{n-1}}{\sqrt{1+2020\cdot a_{n-1}^2}}, \quad \textrm{for } n=1,2,\ldots ,2020.$$ Show that $a_{2020}<\frac1{2020}$.

[i]Super number[/i] is a sequence of numbers $0,1,2,\ldots,9$ such that it has infinitely many digits at left. For example $\ldots 3030304$ is a [i]super number[/i]. Note that all of positive integers are [i]super numbers[/i], which have zeros before they're original digits (for example we can represent the number $4$ as $\ldots, 00004$). Like positive integers, we can add up and multiply [i]super numbers[/i]. For example: \[ \begin{array}{cc}& \ \ \ \ldots 3030304 \\ &+ \ldots4571378\\ &\overline{\qquad \qquad \qquad }\\ & \ \ \ \ldots 7601682 \end{array} \] And \[ \begin{array}{cl}& \ \ \ \ldots 3030304 \\ &\times \ldots4571378\\ &\overline{\qquad \qquad \qquad }\\ & \ \ \ \ldots 4242432 \\ & \ \ \ \ldots 212128 \\ & \ \ \ \ldots 90912 \\ & \ \ \ \ldots 0304 \\ & \ \ \ \ldots 128 \\ & \ \ \ \ldots 20 \\ & \ \ \ \ldots 6 \\ &\overline{\qquad \qquad \qquad } \\ & \ \ \ \ldots 5038912 \end{array}\] [b]a)[/b] Suppose that $A$ is a [i]super number[/i]. Prove that there exists a [i]super number[/i] $B$ such that $A+B=\stackrel{\leftarrow}{0}$ (Note: $\stackrel{\leftarrow}{0}$ means a super number that all of its digits are zero). [b]b)[/b] Find all [i]super numbers[/i] $A$ for which there exists a [i]super number[/i] $B$ such that $A \times B=\stackrel{\leftarrow}{0}1$ (Note: $\stackrel{\leftarrow}{0}1$ means the super number $\ldots 00001$). [b]c)[/b] Is this true that if $A \times B= \stackrel{\leftarrow}{0}$, then $A=\stackrel{\leftarrow}{0}$ or $B=\stackrel{\leftarrow}{0}$? Justify your answer.

We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n},\] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof. We call a nonnegative integer $r$-Fibonacci number if it is a sum of $r$ (not necessarily distinct) Fibonacci numbers. Show that there infinitely many positive integers that are not $r$-Fibonacci numbers for any $r, 1 \leq r\leq 5.$