Let $B$ be a set of $k$ sequences each having $n$ terms equal to $1$ or $-1$. The product of two such sequences $(a_1, a_2, \ldots , a_n)$ and $(b_1, b_2, \ldots , b_n)$ is defined as $(a_1b_1, a_2b_2, \ldots , a_nb_n)$. Prove that there exists a sequence $(c_1, c_2, \ldots , c_n)$ such that the intersection of $B$ and the set containing all sequences from $B$ multiplied by $(c_1, c_2, \ldots , c_n)$ contains at most $\frac{k^2}{2^n}$ sequences.

The periods of two periodic sequences are $7$ and $13$. What is the maximal length of initial sections of the two sequences which can coincide? (The period $p$ of a sequence $a_1$,$a_2$, $...$ is the minimal $p$ such that $a_n = a_{n+p}$ for all $n$.) (AY Belov)

Initially, Alice is given a positive integer $a_0$. At time $i$, Alice has two choices, $$\begin{cases}a_i\mapsto\frac1{a_{i-1}}\\a_i\mapsto2a_{i-1}+1\end{cases}$$ Note that it is dangerous to perform the first operation, so Alice cannot choose this operation in two consecutive turns. However, if $x>8763$, then Alice could only perform the first operation. Determine all $a_0$ so that $\{i\in\mathbb N\mid a_i\in\mathbb N\}$ is an infinite set.

Let be a sequence $ \left( a_n \right)_{n\geqslant 1} $ of real numbers defined recursively as $$ a_n=2007+1004n^2-a_{n-1}-a_{n-2}-\cdots -a_2-a_1. $$ Calculate: $$ \lim_{n\to\infty} \frac{1}{n}\int_1^{a_n} e^{1/\ln t} dt $$

Let $p > 1$ be a natural number. Consider the set $F_p$ of all non-constant sequences of non-negative integers that satisfy the recursive relation $a_{n+1} = (p+1)a_n - pa_{n-1}$ for all $n > 0$. Show that there exists a sequence ($a_n$) in $F_p$ with the property that for every other sequence ($b_n$) in $F_p$, the inequality $a_n \le b_n$ holds for all $n$.

Let $m$ and $n$ are fixed natural numbers and $Oxy$ is a coordinate system in the plane. Find the total count of all possible situations of $n+m-1$ points $P_1(x_1,y_1),P_2(x_2,y_2),\ldots,P_{n+m-1}(x_{n+m-1},y_{n+m-1})$ in the plane for which the following conditions are satisfied: (i) The numbers $x_i$ and $y_i~(i=1,2,\ldots,n+m-1)$ are integers and $1\le x_i\le n,1\le y_i\le m$. (ii) Every one of the numbers $1,2,\ldots,n$ can be found in the sequence $x_1,x_2,\ldots,x_{n+m-1}$ and every one of the numbers $1,2,\ldots,m$ can be found in the sequence $y_1,y_2,\ldots,y_{n+m-1}$. (iii) For every $i=1,2,\ldots,n+m-2$ the line $P_iP_{i+1}$ is parallel to one of the coordinate axes. [i](Ivan Gochev, Hristo Minchev)[/i]

Let $(a_n)^\infty_{n=1}$ be an unbounded and strictly increasing sequence of positive reals such that the arithmetic mean of any four consecutive terms $a_n,a_{n+1},a_{n+2},a_{n+3}$ belongs to the same sequence. Prove that the sequence $\frac{a_{n+1}}{a_n}$ converges and find all possible values of its limit.

Let $ p\ge 2 $ be a fixed natural number, and let the sequence of functions $ \left( f_n\right)_{n\ge 2}:[0,1]\longrightarrow\mathbb{R} $ defined as $ f_n (x)=f_{n-1}\left( f_1 (x)\right) , $ where $ f_1 (x)=\sqrt[p]{1-x^p} . $ Find $ a\in (0,1) $ such that: [b]a)[/b] exists $ b\ge a $ so that $ f_1:[a,b]\longrightarrow [a,b] $ is bijective. [b]b)[/b] $ \forall x\in [0,1]\quad\exists y\in [0,1]\quad m\in\mathbb{N}\implies \left| f_m(x)-f_m(y)\right| >a|x-y| $

We consider the two sequences $(a_n)_{n\ge 0}$ and $(b_n) _{n\ge 0}$ of integers, which are given by $a_0 = b_0 = 2$ and $a_1= b_1 = 14$ and for $n\ge 2$ they are defined as $a_n = 14a_{n-1} + a_{n-2}$ , $b_n = 6b_{n-1}-b_{n-2}$. Determine whether there are infinite numbers that occur in both sequences

Let $R_1 =1$ and $R_{n+1}= 1+ n\slash R_n$ for $n\geq 1.$ Show that for $n\geq 1,$ $$ \sqrt{n} \leq R_n \leq \sqrt{n} +1.$$

Show that the recursion $n=x_n(x_{n-1}+x_n+x_{n+1})$, $n=1,2,\ldots$, $x_0=0$ has exaclty one nonnegative solution. (translated by L. Erdős)

An infinite sequence of digits $1$ and $2$ is determined by the following two properties: i) The sequence is built by writing, in some order, blocks $12$ and blocks $112.$ ii) If each block $12$ is replaced by $1$ and each block $112$ by $2$, the same sequence is again obtained. In which position is the hundredth digit $1$? What is the thousandth digit of the sequence?

Determine all sequences $(x_1,x_2,\ldots,x_{2011})$ of positive integers, such that for every positive integer $n$ there exists an integer $a$ with \[\sum^{2011}_{j=1} j x^n_j = a^{n+1} + 1\] [i]Proposed by Warut Suksompong, Thailand[/i]

In a sequence of natural numbers, the first number is $a$, and each subsequent number is the smallest number coprime to all the previous ones and greater than all of them. Prove that in this sequence from some place all numbers will be primes.

Find constants $A > B$ such that $\frac{f\left( \frac{1}{1+2x}\right) }{f(x)}$ is independent of $x$, where $f(x) = \frac{1 + Ax}{1 + Bx}$ for all real $x \ne - \frac{1}{B}$. Put $a_0 = 1$, $a_{n+1} = \frac{1}{1 + 2a_n}$. Find an expression for an by considering $f(a_0), f(a_1), ...$.

The sequence ($a_n$) is defined by $a_1 = a_2 = 1$ and $a_{n+2 }= a_{n+1} +a_n +k$, where $k$ is a positive integer. Find the least $k$ for which $a_{1991}$ and $1991$ are not coprime.

The sequence $(a_n)$ is such that $a_{n+1} = (a_n)^n + n + 1$ for all positive integers $n$, where $a_1$ is some positive integer. Let $k$ be the greatest power of $3$ by which $a_{101}$ is divisible. Find all possible values of $k$. [i]Proposed by Kyrylo Holodnov[/i]

The integers $1, 2, 3, \ldots, 2016$ are written on a board. You can choose any two numbers on the board and replace them with their average. For example, you can replace $1$ and $2$ with $1.5$, or you can replace $1$ and $3$ with a second copy of $2$. After $2015$ replacements of this kind, the board will have only one number left on it. (a) Prove that there is a sequence of replacements that will make the final number equal to $2$. (b) Prove that there is a sequence of replacements that will make the final number equal to $1000$.

Let $n>1$ be an integer. Call a number beautiful if its square leaves an odd remainder upon divison by $n$. Prove that the number of consecutive beautiful numbers is less or equal to $1+\lfloor \sqrt{3n} \rfloor$.

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]

Let $a$ be a positive integer and let $\{a_n\}$ be defined by $a_0 = 0$ and \[a_{n+1 }= (a_n + 1)a + (a + 1)a_n + 2 \sqrt{a(a + 1)a_n(a_n + 1)} \qquad (n = 1, 2 ,\dots ).\] Show that for each positive integer $n$, $a_n$ is a positive integer.

$x_1=\frac{1}{2}$ and $x_{k+1}=\frac{x_k}{x_1^2+...+x_k^2}$ Prove that $\sqrt{x_k^4+4\frac{x_{k-1}}{x_{k+1}}}$ is rational

Call a triple of numbers [b]Nice[/b] if one of them is the average of the other two. Assume that we have $2k+1$ distinct real numbers with $k^2$ [b] Nice[/b] triples. Prove that these numbers can be devided into two arithmetic progressions with equal ratios Proposed by [i]Morteza Saghafian[/i]

Let $\{x_i\}^{\infty}_{i=1}$ and $\{y_i\}^{\infty}_{i=1}$ be sequences of real numbers such that $x_1=y_1=\sqrt{3}$, $$x_{n+1}=x_n+\sqrt{1+x_n^2}\quad\text{and}\quad y_{n+1}=\frac{y_n}{1+\sqrt{1+y_n^2}}$$ for all $n\geq 1$. Prove that $2<x_ny_n<3$ for all $n>1$.

Let $N$ be a positive integer. Consider the sequence $a_1, a_2, ..., a_N$ of positive integers, none of which is a multiple of $2^{N+1}$. For $n \ge N +1$, the number $a_n$ is defined as follows: choose $k$ to be the number among $1, 2, ..., n - 1$ for which the remainder obtained when $a_k$ is divided by $2^n$ is the smallest, and define $a_n = 2a_k$ (if there are more than one such $k$, choose the largest such $k$). Prove that there exist $M$ for which $a_n = a_M$ holds for every $n \ge M$.