Found problems: 1239
Given $u_0,u_1$ with $0<u_0,u_1<1$, define the sequence $(u_n)$ recurrently by the formula
$$u_{n+2}=\frac12\left(\sqrt{u_{n+1}}+\sqrt{u_n}\right).$$(a) Prove that the sequence $u_n$ is convergent and find its limit.
(b) Prove that, starting from some index $n_0$, the sequence $u_n$ is monotonous.
The sequence $a_1,a_2,a_3,...$, is constructed according to the rule $$a_1=1, a_2=a_1+1/a_1, ... , a_{n+1}=a_n+1/a_n, ...$$
Prove that $a_{100} > 14$.
let $a_1,a_2,...a_n$ a sequence of real numbers such that $a_1+....+a_n=0$.
define $b_i=a_1+a_2+....a_i$ for all $1 \leq i \leq n$ .suppose $b_i(a_{j+1}-a_{i+1}) \geq 0$ for all $1 \leq i \leq j \leq n-1$.
Show that $$\max_{1 \leq l \leq n} |a_l| \geq \max_{1 \leq m \leq n} |b_m|$$
Let $(a_n)$ be a geometrical progression with positive terms. Define $S_n=\log a_1+\log a_2+\ldots+\log a_n$. Prove that if $S_n=S_m$ for some $m\ne n$, then $S_{n+m}=0$.
Let $F_1,F_2,F_3,...$ be the [i]Fibonacci sequence[/i], the sequence of positive integers with $F_1 =F_2 =1$ and $F_{n+2}=F_{n+1}+F_n$ for all $n \ge 1$. A [i]Fibonacci number[/i] is by definition a number appearing in this sequence.
Let $P_1,P_2,P_3,...$ be the sequence consisting of all the integers that are products of two Fibonacci numbers (not
necessarily distinct) in increasing order. The first few terms are $1,2,3,4,5,6,8,9,10,13,...$ since, for example $3 = 1 \cdot 3, 4 = 2 \cdot 2$, and $10 = 2 \cdot 5$.
Consider the sequence $D_n$ of [i]successive [/i] differences of the $P_n$ sequence, where $D_n = P_{n+1}-P_n$ for $n \ge 1$. The first few terms of D_n are $1,1,1,1,1,2,1,1,3, ...$ .
Prove that every number in $D_n$ is a [i]Fibonacci number[/i].
Let $n \geqslant 3$ be a positive integer and let $\left(a_{1}, a_{2}, \ldots, a_{n}\right)$ be a strictly increasing sequence of $n$ positive real numbers with sum equal to 2. Let $X$ be a subset of $\{1,2, \ldots, n\}$ such that the value of
\[
\left|1-\sum_{i \in X} a_{i}\right|
\]
is minimised. Prove that there exists a strictly increasing sequence of $n$ positive real numbers $\left(b_{1}, b_{2}, \ldots, b_{n}\right)$ with sum equal to 2 such that
\[
\sum_{i \in X} b_{i}=1.
\]
$a$ and $b$ are fixed real numbers. With $x_n$ we denote the sum of the digits of $an+b$ in the decimal number system. Prove that the sequence $x_n$ contains an infinite constant subsequence.
If $(a_n)$ is a sequence of real numbers such that for $n \geq 1$
$$(2-a_n )a_{n+1} =1,$$
prove that $\lim_{n\to \infty} a_n =1.$
Let $f:\mathbb{R}\to\mathbb{R}$ be a continuous, strictly decreasing function such that $f([0,1])\subseteq[0,1]$.
[list=i]
[*]For all positive integers $n{}$ prove that there exists a unique $a_n\in(0,1)$, solution of the equation $f(x)=x^n$. Moreover, if $(a_n){}$ is the sequence defined as above, prove that $\lim_{n\to\infty}a_n=1$.
[*]Suppose $f$ has a continuous derivative, with $f(1)=0$ and $f'(1)<0$. For any $x\in\mathbb{R}$ we define \[F(x)=\int_x^1f(t) \ dt.\]Let $\alpha{}$ be a real number. Study the convergence of the series \[\sum_{n=1}^\infty F(a_n)^\alpha.\]
[/list]
Let m be a positive integer. An $m$-[i]pattern [/i] is a sequence of $m$ symbols of strict inequalities. An $m$-pattern is said to be [i]realized [/i] by a sequence of $m + 1$ real numbers when the numbers meet each of the inequalities in the given order. (For example, the $5$-pattern $ <, <,>, < ,>$ is realized by the sequence of numbers $1, 4, 7, -3, 1, 0$.)
Given $m$, which is the least integer $n$ for which there exists any number sequence $x_1,... , x_n$ such that each $m$-pattern is realized by a subsequence $x_{i_1},... , x_{i_{m + 1}}$ with $1 \le i_1 <... < i_{m + 1} \le n$?
Let $a_1,a_2,a_3, \ldots$ be an infinite sequence of nonnegative real numbers such that for all positive integers $k$ the following conditions hold:
$i)$ $a_k-2a_{k+1}+a_{k+2} \geq 0$;
$ii)$ $\sum_{j=1}^{k} a_j \leq 1$.
Prove that for all positive integer $k$ holds: $0 \leq a_k - a_{k+1} < \frac{2}{k^2}$
An integer sequence is defined by \[{ a_n = 2 a_{n-1} + a_{n-2}}, \quad (n > 1), \quad a_0 = 0, a_1 = 1.\] Prove that $2^k$ divides $a_n$ if and only if $2^k$ divides $n$.
Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.)
[i]Proposed by Hong Kong[/i]
Let $a_1, a_2, \cdots , a_n$ be real numbers, with $n\geq 3,$ such that $a_1 + a_2 +\cdots +a_n = 0$ and $$ 2a_k\leq a_{k-1} + a_{k+1} \ \ \ \text{for} \ \ \ k = 2, 3, \cdots , n-1.$$ Find the least number $\lambda(n),$ such that for all $k\in \{ 1, 2, \cdots, n\} $ it is satisfied that $|a_k|\leq \lambda (n)\cdot \max \{|a_1|, |a_n|\} .$
Let $\{x_n\}$ be a sequence of real numbers in the interval $[0,1)$. Prove that there exists a sequence $1 < n_1 < n_2 < n_3 < \cdots$ of positive integers such that the following limit exists $$\lim_{i,j \to \infty} x_{n_i+n_j}. $$
That is, there exists a real number $L$ such that for every $\epsilon > 0,$ there exists a positive integer $N$ such that if $i,j > N$, then $|x_{n_i+n_j}-L| < \epsilon.$
Consider sequences $a_1, a_2, a_3,...$ of positive integers. Determine the smallest possible value of $a_{2010}$ if
(i) $a_n < a_{n+1}$ for all $n\ge 1$,
(ii) $a_i + a_l > a_j + a_k$ for all quadruples $ (i, j, k, l)$ which satisfy $1 \le i < j \le k < l$.
Let $f:[0,1]\to\mathbb R$ be a twice continuously differentiable increasing function. Define the sequences given by $L_n=\frac1n\sum_{k=0}^{n-1}f\left(\frac kn\right)$ and $U_n=\frac1n\sum_{k=0}^nf\left(\frac kn\right)$, $n\ge1$. 1. The interval $[L_n,U_n]$ is divided into three equal segments. Prove that, for large enough $n$, the number $I=\int^1_0f(x)\text dx$ belongs to the middle one of these three segments.
Let be a natural number $ m\ge 2. $
[b]a)[/b] Let be $ m $ pairwise distinct rational numbers. Prove that there is an ordering of these numbers such that these are terms of an arithmetic progression.
[b]b)[/b] Given that for any $ m $ pairwise distinct real numbers there is an ordering of them such that they are terms of an arithmetic sequence, determine the number $ m. $
[i]Bogdan Blaga[/i]
Define a sequence $\{a_n\}$ by\[S_1=1,\ S_{n+1}=\frac{(2+S_n)^2}{ 4+S_n} (n=1,\ 2,\ 3,\ \cdots).\]
Where $S_n$ the sum of first $n$ terms of sequence $\{a_n\}$.
For any positive integer $n$ ,prove that\[a_{n}\ge \frac{4}{\sqrt{9n+7}}.\]
Let $\{a_n\}$ be a sequence of real numbers with $a_1=-1$, $a_2=2$ and for all $n\ge3$,
$$a_{n+1}-a_n-a_{n+2}=0.$$
Find $a_1+a_2+a_3+\ldots+a_{2015}$.
a) Prove that there is not an infinte sequence $(x_n)$, $n=1,2,...$ of positive real numbers satisfying the relation
$x_{n+2}=\sqrt{x_{n+1}}-\sqrt{x_{n}}$, $\forall n \in N$ (*)
b) Do there exist sequences satisfying (*) and containing arbitrary many terms?
I.Voronovich
Given three infinite arithmetic progressions of natural numbers such that each of the numbers 1,2,3,4,5,6,7 and 8 belongs to at least one of them, prove that the number 1980 also belongs to at least one of them.
Determine all infinite sequences $(a_1,a_2,\dots)$ of positive integers satisfying
\[a_{n+1}^2=1+(n+2021)a_n\]
for all $n \ge 1$.
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 $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.