Found problems: 1239
Let $a_1, a_2, ..., a_n, a_{n+1}$ be a finite sequence of real numbers satisfying $a_0 = a_{n+1} = 0$ and $|a_{k-1} - 2a_{k} + a_{k+1}| \leq 1$ for $k = 1, 2, ..., n$
Prove that for $k=0, 1, ..., n+1,$ $|a_k| \leq \frac{k(n+1-k)}{2}$
Let $\{x_n\}$ be a sequence of natural numbers such that \[(a) 1 = x_1 < x_2 < x_3 < \ldots; \quad (b) x_{2n+1} \leq 2n \quad \forall n.\] Prove that, for every natural number $k$, there exist terms $x_r$ and $x_s$ such that $x_r - x_s = k.$
Let be a sequence $ \left( b_n \right)_{n\ge 1} $ of integers, having the following properties:
$ \text{(i)} $ the sequence $ \left( \frac{b_n}{n} \right)_{n\ge 1} $ is convergent.
$ \text{(ii)} m-n|b_m-b_n, $ for any natural numbers $ m>n. $
Prove that there exists an index from which the sequence $ \left( b_n \right)_{n\ge 1} $ is an arithmetic one.
[i]Cristinel Mortici[/i]
For a given value $t$, we consider number sequences $a_1, a_2, a_3,...$ such that $a_{n+1} =\frac{a_n + t}{a_n + 1}$ for all $n \ge 1$.
(a) Suppose that $t = 2$. Determine all starting values $a_1 > 0$ such that $\frac43 \le a_n \le \frac32$ holds for all $n \ge 2$.
(b) Suppose that $t = -3$. Investigate whether $a_{2020} = a_1$ for all starting values $a_1$ different from $-1$ and $1$.
Let $f: \mathbb{R} \to \mathbb{R}$ be a non-decreasing function such that $f(y) - f(x) < y - x$ for all real numbers
$x$ and $y > x$. The sequence $u_1,u_2,\ldots$ of real numbers is such that $u_{n+2} = f(u_{n+1}) - f(u_n)$ for all $n\geq 1$. Prove that for any $\varepsilon > 0$ there exists a positive integer $N$ such that $|u_n| < \varepsilon$ for all $n\geq N$.
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 $(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)$.
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.
Eight consecutive numbers are chosen from the Fibonacci sequence $1, 2, 3, 5, 8, 13, 21,...$. Prove that the sequence does not contain the sum of chosen numbers.
Find all $C\in \mathbb{R}$ such that every sequence of integers $\{a_n\}_{n=1}^{\infty}$ which is bounded from below and for all $n\geq 2$ satisfy $$0\leq a_{n-1}+Ca_n+a_{n+1}<1$$ is periodic.
Proposed by Navid Safaei
$a_0, a_1, \ldots, a_{100}$ and $b_1, b_2,\ldots, b_{100}$ are sequences of real numbers, for which the property holds: for all $n=0, 1, \ldots, 99$, either
$$a_{n+1}=\frac{a_n}{2} \quad \text{and} \quad b_{n+1}=\frac{1}{2}-a_n,$$
or
$$a_{n+1}=2a_n^2 \quad \text{and} \quad b_{n+1}=a_n.$$
Given $a_{100}\leq a_0$, what is the maximal value of $b_1+b_2+\cdots+b_{100}$?
Let $p\in(0,1)$ and $a>0$ be real numbers. Determine the asymptotic behavior of the sequence $\{a_n\}_{n=1}^\infty$ defined recursively by
$$a_1=a,a_{n+1}=\frac{a_n}{1+a_n^p},n\in\mathbb N$$
[i]Proposed by Arkady Alt[/i]
On the coordinate plane is given the square with vertices $T_1(1,0),T_2(0,1),T_3(-1,0),T_4(0,-1)$. For every $n\in\mathbb N$, point $T_{n+4}$ is defined as the midpoint of the segment $T_nT_{n+1}$. Determine the coordinates of the limit point of $T_n$ as $n\to\infty$, if it exists.
Let $P_1, \ldots , P_s$ be arithmetic progressions of integers, the following conditions being satisfied:
[b](i)[/b] each integer belongs to at least one of them;
[b](ii)[/b] each progression contains a number which does not belong to other progressions.
Denote by $n$ the least common multiple of the ratios of these progressions; let $n=p_1^{\alpha_1} \cdots p_k^{\alpha_k}$ its prime factorization.
Prove that \[s \geq 1 + \sum^k_{i=1} \alpha_i (p_i - 1).\]
[i]Proposed by Dierk Schleicher, Germany[/i]
Let $(a_n)_{n\in\mathbb N}$ be a sequence, given by the recurrence:
$$ma_{n+1}+(m-2)a_n-a_{n-1}=0$$
where $m\in\mathbb R$ is a parameter and the first two terms of $a_n$ are fixed known real numbers. Find $m\in\mathbb R$, so that
$$\lim_{n\to\infty}a_n=0$$
[i]Proposed by Laurențiu Modan[/i]
define $(a_n)_{n \in \mathbb{N}}$ such that $a_1=2$ and $$a_{n+1}=\left(1+\frac{1}{n}\right)^n \times a_{n}$$
Prove that there exists infinite number of $n$ such that $\frac{a_1a_2 \ldots a_n}{n+1}$ is a square of an integer.
[b](a)[/b] Find the rearrangement $\{a_1, \dots , a_n\}$ of $\{1, 2, \dots, n\}$ that maximizes
\[a_1a_2 + a_2a_3 + \cdots + a_na_1 = Q.\]
[b](b)[/b] Find the rearrangement that minimizes $Q.$
Find the greatest positive real number $M$ such that for all positive real sequence $(a_n)$ and for all real number $m < M$, it is possible to find some index $n \ge 1$ that satisfies the inequality $a_1 + a_2 + a_3 + ...+ a_n +a_{n+1} > m a_n$.
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?
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$.
For all $n>1$ let $f(n)$ be the sum of the smallest factor of $n$ that is not 1 and $n$ . The computer prints $f(2),f(3),f(4),...$ with order:$4,6,6,...$ ( Because $f(2)=2+2=4,f(3)=3+3=6,f(4)=4+2=6$ etc.). In this infinite sequence, how many times will be $ 2015$ and $ 2016$ written? (Explain your answer)
In the sequence of digits $2,0,2,9,3,...$ any digit it equal to the last digit in the decimal representation of the sum of four previous digits. Do the four numbers $2,0,1,5$ in that order occur in the sequence?
Folklore
Find all infinite integer sequences $a_1,a_2,\ldots$ satisfying
\[a_{n+2}^{a_{n+1}}=a_{n+1}+a_n\] holds for all $n\geq 1$. Define $0^0=1$
Suppose that the sequence $\{a_n\}$ satisfy $a_1=1$ and $a_{2k}=a_{2k-1}+a_k, \quad a_{2k+1}=a_{2k}$ for $k=1,2, \ldots$ \\Prove that $a_{2^n}< 2^{\frac{n^2}{2}}$ for any integer $n \geq 3$.
Let $c>2$ and $a_0,a_1, \ldots$ be a sequence of real numbers such that
\begin{align*} a_n = a_{n-1}^2 - a_{n-1} < \frac{1}{\sqrt{cn}} \end{align*}
for any $n$ $\in$ $\mathbb{N}$. Prove, $a_1=0$