Found problems: 1239
[b]a)[/b] Let be a continuous function $ f:\mathbb{R}_{\ge 0}\longrightarrow\mathbb{R}_{>0} . $ Show that there exists a natural number $ n_0 $ and a sequence of positive real numbers $ \left( x_n \right)_{n>n_0} $ that satisfy the following relation.
$$ n\int_0^{x_n} f(t)dt=1,\quad n_0<\forall n\in\mathbb{N} $$
[b]b)[/b] Prove that the sequence $ \left( nx_n \right)_{n> n_0} $ is convergent and find its limit.
Let $a_1,a_2,...$ be an infinite sequence of integers that satisfies $a_{n+2}=a_{n+1}+a_n$ for all $n \ge 1$. There exists a positive integer $k$ such that $a_k=a_{k+2018}$. Prove that there exists a term of the sequence which is equal to zero.
Let $\{a_n\}^\infty_{n=0}$ be the sequence of real numbers satisfying $a_0=0$, $a_1=1$ and
$$a_{n+2}=a_{n+1}+\frac{a_n}{2^n}$$for every $n\ge0$. Prove that
$$\lim_{n\to\infty}a_n=1+\sum_{n=1}^\infty\frac1{2^{\frac{n(n-1)}2}\displaystyle\prod_{k=1}^n(2^k-1)}.$$
Let $n$ be an integer greater than $1$. Define
\[x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \qquad \text{for }i = 1, 2, \ldots\ ,\]
where $[z]$ denotes the largest integer less than or equal to $z$. Prove that
\[ \min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]\]
Let $x_0=a, x_1= b, x_2 = c$ be given real numbers and let $x_{n+2} = \frac{x_n + x_{n-1}}{2}$ for all $n\geq 1$. Show that the sequence $(x_n)_{n\geq 0}$ converges and find its limit.
Let $a_1,a_2, \cdots$ be a sequence of integers that satisfies: $a_1=1$ and $a_{n+1}=a_n+a_{\lfloor \sqrt{n} \rfloor} , \forall n\geq 1 $. Prove that for all positive $k$, there is $m \geq 1$ such that $k \mid a_m$.
$\boxed{A5}$Let $n\in{N},n>2$,and suppose $a_1,a_2,...,a_{2n}$ is a permutation of the numbers $1,2,...,2n$ such that $a_1<a_3<...<a_{2n-1}$ and $a_2>a_4>...>a_{2n}.$Prove that
\[(a_1-a_2)^2+(a_3-a_4)^2+...+(a_{2n-1}-a_{2n})^2>n^3\]
Let $(F_n)_{n\geq 1} $ be the Fibonacci sequence $F_1 = F_2 = 1, F_{n+2} = F_{n+1} + F_n (n \geq 1),$ and $P(x)$ the polynomial of degree $990$ satisfying
\[ P(k) = F_k, \qquad \text{ for } k = 992, . . . , 1982.\]
Prove that $P(1983) = F_{1983} - 1.$
Consider an infinite sequence of positive integers in which each positive integer occurs exactly once. Let $\{a_n\}, n\ge 1$ be such a sequence. We call it [i]consistent [/i] if, for an arbitrary natural $k$ and every natural $n ,m$ such that $a_n <a_m$, the inequality $a_{kn} <a _{km}$ also holds. For example, the sequence $a_n = n$ is consistent .
a) Prove that there are consistent sequences other than $a_n = n$.
b) Are there consistent sequences for which $a_n \ne n, n\ge 2$ ?
c) Are there consistent sequences for which $a n \ne n, n\ge 1$ ?
A sequence $(x_{i})$ is said to have a [i]Cesaro limit[/i] exactly if $\lim_{n\to\infty} \frac{x_{1}+\ldots+x_{n}}{n}$ exists.
Find all real-valued functions $f$ on the closed interval $[0, 1]$ such that $(f(x_i))$ has a Cesaro limit if and only if $(x_i)$ has a Cesaro limit.
Let $a_1, a_2, ..., a_n$ be real numbers such that $a_1 = a_n = a$ and $a_{k+1} \le \frac{a_k + a_{k+2}}{2} $, for all $k = 1, 2, ..., n - 2$. Prove that $a_k \le a,$ for all $k = 1, 2, ..., n.$
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]
Let $\alpha > 1$ be an irrational number and $L$ be a integer such that $L > \frac{\alpha^2}{\alpha - 1}$. A sequence $x_1, x_2, \cdots$ satisfies that $x_1 > L$ and for all positive integers $n$, \[ x_{n+1} = \begin{cases} \left \lfloor \alpha x_n \right \rfloor & \textup{if} \; x_n \leqslant L \\\left \lfloor \frac{x_n}{\alpha} \right \rfloor & \textup{if} \; x_n > L \end{cases}. \]
Prove that
(i) $\left\{x_n\right\}$ is eventually periodic.
(ii) The eventual fundamental period of $\left\{x_n\right\}$ is an odd integer which doesn't depend on the choice of $x_1$.
Suppose $\{a_n\}$ is a decreasing sequence of reals and $\lim\limits_{n\to\infty} a_n = 0$. If $S_{2^k} - 2^k a_{2^k} \leq 1$ for any positive integer $k$, show that
$$\sum_{n=1}^{\infty} a_n \leq 1$$
(At here, $S_m = \sum_{n=1}^m a_n$ is a partial sum of $\{a_n\}$.)
[b]a)[/b] Find the number of infinite sequences of integers $ \left( a_n \right)_{n\ge 1} $ that have the property that $ a_na_{n+2}a_{n+3}=-1, $ for any natural number $ n. $
[b]b)[/b] Prove that there is no infinite sequence of integers $ \left( b_n \right)_{n\ge 1} $ that have the property that $ b_nb_{n+2}b_{n+3}=2005, $ for any natural number $ n. $
A sequence of positive integer numbers $a_1,a_2,\ldots$ for $i \geq 3$ satisfies $$a_{i+1}=a_i+gcd(a_{i-1},a_{i-2})$$
Prove that there exist two positive integer numbers $N, M$, such that $a_{n+1}-a_n=M$ for all $n \geq N$
For every non-negative integer $i$, define the number $M(i)$ as follows:
write $i$ down as a binary number, so that we have a string of zeroes and ones, if the number of ones in this string is even, then set $M(i) = 0$, otherwise set $M(i) = 1$. (The first terms of the sequence $M(i)$, $i = 0, 1, 2, ...$ are $0, 1, 1, 0, 1, 0, 0, 1,...$ )
(a) Consider the finite sequence $M(O), M(1), . . . , M(1000) $.
Prove that there are at least $320$ terms in this sequence which are equal to their neighbour on the right : $M(i) = M(i + 1 )$ .
(b) Consider the finite sequence $M(O), M(1), . . . , M(1000000)$ .
Prove that the number of terms $M(i)$ such that $M(i) = M(i +7)$ is at least $450000$.
(A Kanel)
Let $ a_0$, $ a_1$, $ a_2$, $ \ldots$ be a sequence of positive integers such that the greatest common divisor of any two consecutive terms is greater than the preceding term; in symbols, $ \gcd (a_i, a_{i \plus{} 1}) > a_{i \minus{} 1}$. Prove that $ a_n\ge 2^n$ for all $ n\ge 0$.
[i]Proposed by Morteza Saghafian, Iran[/i]
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 $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define
$$x_{k+1} = \begin{cases}
x_k + d &\text{if } a \text{ does not divide } x_k \\
x_k/a & \text{if } a \text{ divides } x_k
\end{cases}$$
Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.
Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.
A positive integer $k\geqslant 3$ is called[i] fibby[/i] if there exists a positive integer $n$ and positive integers $d_1 < d_2 < \ldots < d_k$ with the following properties: \\ $\bullet$ $d_{j+2}=d_{j+1}+d_j$ for every $j$ satisfying $1\leqslant j \leqslant k-2$, \\ $\bullet$ $d_1, d_2, \ldots, d_k$ are divisors of $n$, \\ $\bullet$ any other divisor of $n$ is either less than $d_1$ or greater than $d_k$.
Find all fibby numbers. \\ \\ [i]Proposed by Ivan Novak.[/i]
Let the sequence $ a(n), n \equal{} 1,2,3, \ldots$ be generated as follows with $ a(1) \equal{} 0,$ and for $ n > 1:$
\[ a(n) \equal{} a\left( \left \lfloor \frac{n}{2} \right \rfloor \right) \plus{} (\minus{}1)^{\frac{n(n\plus{}1)}{2}}.\]
1.) Determine the maximum and minimum value of $ a(n)$ over $ n \leq 1996$ and find all $ n \leq 1996$ for which these extreme values are attained.
2.) How many terms $ a(n), n \leq 1996,$ are equal to 0?
Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$,$\ldots$, $a_n$ satisfying: \[a_{k+1}=\frac{a_k^2+1}{a_{k-1}+1}-1\] for every $k$ with $2\leq k\leq n-1$.
[i]Proposed by North Korea[/i]
The real numbers $a_0, a_1, ... , a_{n+1}$ satisfy $a_0 = a_{n+1} = 0$ and $|a_{k-1} - 2a_k + a_{k+1}| \le 1$ for $k = 1, 2, ... , n$. Show that $|a_k| \le \frac{ k(n + 1 - k)}{2}$ for all $k$.