The sequence of $a_n$ is determined by the relation $$a_{n+1}=\frac{k+a_n}{1-a_n}$$ where $k > 0$. It is known that $a_{13} = a_1$. What values can $k$ take?

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.

An infinite sequence is given by $x_1=2, x_2=7, x_{n+1} = 4x_n - x_{n-1}$ for all $n \geq 2$. Does there exist a perfect square in this sequence? [hide="Remark"]During the test the initial value of $x_1$ was given as $1$, thus the problem was not graded[/hide]

Let $a$ be a non-negative real number and a sequence $(u_n)$ defined as: $u_1=6,u_{n+1} = \frac{2n+a}{n} + \sqrt{\frac{n+a}{n}u_n+4}, \forall n \ge 1$ a) With $a=0$, prove that there exist a finite limit of $(u_n)$ and find that limit b) With $a \ge 0$, prove that there exist a finite limit of $(u_n)$

Let $p>3$ and $p+2$ are prime numbers,and define sequence $$a_{1}=2,a_{n}=a_{n-1}+\lfloor \dfrac{pa_{n-1}}{n}\rfloor$$ show that:for any $n=3,4,\cdots,p-1$ have $$n|pa_{n-1}+1$$

A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula \[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0; \]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large. [i]Proposed by Harmel Nestra, Estionia[/i]

We say that a strictly increasing sequence of positive integers $n_1, n_2,\ldots$ is [i]non-decelerating[/i] if $n_{k+1}-n_k\le n_{k+2}-n_{k+1}$ holds for all positive integers $k$. We say that a strictly increasing sequence $n_1, n_2, \ldots$ is [i]convergence-inducing[/i], if the following statement is true for all real sequences $a_1, a_2, \ldots$: if subsequence $a_{m+n_1}, a_{m+n_2}, \ldots$ is convergent and tends to $0$ for all positive integers $m$, then sequence $a_1, a_2, \ldots$ is also convergent and tends to $0$. Prove that a non-decelerating sequence $n_1, n_2,\ldots$ is convergence-inducing if and only if sequence $n_2-n_1$, $n_3-n_2$, $\ldots$ is bounded from above. [i]Proposed by András Imolay[/i]

The given numbers are real numbers $ q,t \in \langle \frac{1}{2}; 1) $, $ t \in (0; 1 \rangle $. Prove that there is an increasing sequence of natural numbers $ {n_k} $ ($ k = 1,2, \ldots $) such that $$ t = \lim_{N\to \infty} \sum_{j=1}^N q^{n_j}.$$

Suppose the numbers $a_0, a_1, a_2, ... , a_n$ satisfy the following conditions: $a_0 =\frac12$, $a_{k+1} = a_k +\frac{1}{n}a_k^2$ for $k = 0, 1, ... , n - 1$. Prove that $1 - \frac{1}{n}< a_n < 1$

Prove that we can find an infinite set of positive integers of the from $2^n-3$ (where $n$ is a positive integer) every pair of which are relatively prime.

Let $b$ be an odd positive integer. The sequence $a_1, a_2, a_3, a_4$, is definedin the next way: $a_1$ and $a_2$ are positive integers and for all $k \ge 2$, $$a_{k+1}= \begin{cases} \frac{a_k + a_{k-1}}{2} \,\,\, if \,\,\, a_k + a_{k-1} \,\,\, is \,\,\, even \\ \frac{a_k + a_{k-1+b}}{2}\,\,\, if \,\,\, a_k + a_{k-1}\,\,\, is \,\,\,odd\end{cases}$$ a) Prove that if $b = 1$, then after a certain term, the sequence will become constant. b) For each $b \ge 3$ (odd), prove that there exist values of $a_1$ and $a_2$ for which the sequence will become constant after a certain term.

Let $n$ be a fixed odd positive integer. For each odd prime $p$, define $$a_p=\frac{1}{p-1}\sum_{k=1}^{\frac{p-1}{2}}\bigg\{\frac{k^{2n}}{p}\bigg\}.$$ Prove that there is a real number $c$ such that $a_p = c$ for infinitely many primes $p$. [i]Note: $\left\{x\right\} = x - \left\lfloor x\right\rfloor$ is the fractional part of $x$.[/i]

For positive real numbers $b_1,b_2,\ldots,b_n$ define $$a_1=\frac{b_1}{b_1+b_2+\ldots+b_n}\enspace\text{ and }\enspace a_k=\frac{b_1+\ldots+b_k}{b_1+\ldots+b_{k-1}}\text{ for }k>1.$$Prove that $a_1+a_2+\ldots+a_n\le\frac1{a_1}+\frac1{a_2}+\ldots+\frac1{a_n}$

Let $x_n = \sqrt[2]{2+\sqrt[3]{3+\cdots+\sqrt[n]{n}}}.$ Prove that \[x_{n+1}-x_n <\frac{1}{n!} \quad n=2,3,\cdots\]

Show that the sequence $$ \sqrt{7} , \sqrt{7-\sqrt{7}}, \sqrt{7-\sqrt{7-\sqrt{7}}}, \ldots$$ converges and evaluate the limit.

Let $c \ge 1$ be an integer. Define a sequence of positive integers by $a_1 = c$ and \[a_{n+1}=a_n^3-4c\cdot a_n^2+5c^2\cdot a_n+c\] for all $n\ge 1$. Prove that for each integer $n \ge 2$ there exists a prime number $p$ dividing $a_n$ but none of the numbers $a_1 , \ldots , a_{n -1}$ . [i]Proposed by Austria[/i]

A sequence $a_1, a_2, a_3, \ldots $ is defined as follows: $a_1$ is a positive integer and $$a_{n+1} = \left\lfloor \frac{3}{2} a_n \right\rfloor +1$$ for all $n \in \mathbb{N}$. Can $a_1$ be chosen in such a way that the first $100000$ terms of the sequence are even, but the $100001$-th term is odd?

Given a finite sequence of integers $a_{1},$ $a_{2},$ $...,$ $a_{n}$ for $n\geq 2.$ Show that there exists a subsequence $a_{k_{1}},$ $a_{k_{2}},$ $...,$ $a_{k_{m}},$ where $1\leq k_{1}\leq k_{2}\leq...\leq k_{m}\leq n,$ such that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}$ is divisible by $n.$ [b]Note by Darij:[/b] Of course, the $1\leq k_{1}\leq k_{2}\leq ...\leq k_{m}\leq n$ should be understood as $1\leq k_{1}<k_{2}<...<k_{m}\leq n;$ else, we could take $m=n$ and $k_{1}=k_{2}=...=k_{m},$ so that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}=n^{2}a_{k_{1}}^{2}$ will surely be divisible by $n.$

Let $c>1$ be a real constant. For the sequence $a_1,a_2,...$ we have: $a_1=1$, $a_2=2$, $a_{mn}=a_m a_n$, and $a_{m+n}\leq c(a_m+a_n)$. Prove that $a_n=n$.

Prove that there exists two strictly increasing sequences $(a_{n})$ and $(b_{n})$ such that $a_{n}(a_{n}+1)$ divides $b^{2}_{n}+1$ for every natural n.

Define the sequence sequence $a_0,a_1, a_2,....,a_{2018}, a_{2019}$ of real numbers as follows: $\bullet$ $a_0 = 1$. $\bullet$ $a_{n + 1} = a_n - \frac{a_n^2}{2019}$ for $n = 0, 1, ...,2018$. Prove that $a_{2019} < \frac12 <a_{2018}$.

Any positive integer $n$ can be written in the form $n = 2^b(2c+1)$. We call $2c+1$ the[i] odd part[/i] of $n$. Given an odd integer $n > 0$, define the sequence $ a_0, a_1, a_2, ...$ as follows: $a_0 = 2^n-1, a_{k+1} $ is the [i]odd part[/i] of $3a_k+1$. Find $a_n$.

A deck consists of $2^n$ cards. The deck is shuffled using the following operation: if the cards are initially in the order $a_1,a_2,a_3,a_4,...,a_{2^n-1},a_{2^n}$ then after shuffling the order becomes $a_{2^{n-1}+1},a_1,a_{2^{n-1}+2},a_2,...,a_{2^n},a_{2^{n-1}}$ . Find the smallest number of such operations after which the original order of the cards is restored. (R. Palm)

The sequence $(a_n)$ is defined by $a_0 = 0$ and $a_{n+1} = [\sqrt[3]{a_n +n}]^3$ for $n \ge 0$. (a) Find $a_n$ in terms of $n$. (b) Find all $n$ for which $a_n = n$.

Let $\{c_k\}_{k\geq1}$ be a sequence with $0 \leq c_k \leq 1$, $c_1 \neq 0$, $\alpha > 1$. Let $C_n = c_1 + \cdots + c_n$. Prove $$\lim \limits_{n \to \infty}\frac{C_1^{\alpha}+\cdots+C_n^{\alpha}}{\left(C_1+\cdots +C_n\right)^{\alpha}}=0$$