Found problems: 1239
Given a non-decreasing unbounded sequence $a_n,$ construct a new sequence $b_n$ as follows
$$b_n = \frac{a_2 - a_1}{a_2} + \frac{a_3 - a_2}{a_3} + ... + \frac{a_n - a_{n-1}}{a_n}$$
Prove that $b_n$ is also unbounded.
Given real numbers $x_i \ (i = 1, 2, \cdots, 4k + 2)$ such that
\[\sum_{i=1}^{4k +2} (-1)^{i+1} x_ix_{i+1} = 4m \qquad ( \ x_1=x_{4k+3} \ )\]
prove that it is possible to choose numbers $x_{k_{1}}, \cdots, x_{k_{6}}$ such that
\[\sum_{i=1}^{6} (-1)^{i} k_i k_{i+1} > m \qquad ( \ x_{k_{1}} = x_{k_{7}} \ )\]
When the natural numbers are written one after another in an increasing way, you get an infinite succession of digits $123456789101112 ....$ Denote $A_k$ the number formed by the first $k$ digits of this sequence . Prove that for all positive integer $n$ there is a positive integer $m$ which simultaneously verifies the following three conditions:
(i) $n$ divides $A_m$,
(ii) $n$ divides $m$,
(iii) $n$ divides the sum of the digits of $A_m$.
Let $$x_0 = 5\,\, ,\, \,\,x_{n+1} = x_n +\frac{1}{x_n}.$$
Prove that $45 < x_{1000} < 45.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.
A sequence ($a_n$) satisfies the following conditions:
(i) For each $m \in N$ it holds that $a_{2^m} = 1/m$.
(ii) For each natural $n \ge 2$ it holds that $a_{2n-1}a_{2n} = a_n$.
(iii) For all integers $m,n$ with $2m > n \ge 1$ it holds that $a_{2n}a_{2n+1} = a_{2^m+n}$.
Determine $a_{2000}$. You may assume that such a sequence exists.
Consider a sequence of real numbers defined by:
$a_{n + 1} = a_n + \frac{1}{a_n}$ for $n = 0, 1, 2, ...$
Prove that, for any positive real number $a_0$, is true that $a_{1996}$ is greater than $63$.
Show an infinite sequence $a_1, a_2, \ldots$ of integers with both of the following properties:
• $a_i \neq 0$ for every positive integer $i$, that is, no term in the sequence is equal to zero;
• for all positive integer $n$, $a_n + a_{2n} + \ldots + a_{2023n} = 0$.
Consider pairs of the sequences of positive real numbers \[a_1\geq a_2\geq a_3\geq\cdots,\qquad b_1\geq b_2\geq b_3\geq\cdots\] and the sums \[A_n = a_1 + \cdots + a_n,\quad B_n = b_1 + \cdots + b_n;\qquad n = 1,2,\ldots.\] For any pair define $c_n = \min\{a_i,b_i\}$ and $C_n = c_1 + \cdots + c_n$, $n=1,2,\ldots$.
(1) Does there exist a pair $(a_i)_{i\geq 1}$, $(b_i)_{i\geq 1}$ such that the sequences $(A_n)_{n\geq 1}$ and $(B_n)_{n\geq 1}$ are unbounded while the sequence $(C_n)_{n\geq 1}$ is bounded?
(2) Does the answer to question (1) change by assuming additionally that $b_i = 1/i$, $i=1,2,\ldots$?
Justify your answer.
Find largest possible constant $M$ such that, for any sequence $a_n$, $n=0,1,2,...$ of real numbers, that satisfies the conditions :
i) $a_0=1$, $a_1=3$
ii) $a_0+a_1+...+a_{n-1} \ge 3 a_n - a_{n+1}$ for any integer $n\ge 1$
to be true that
$$\frac{a_{n+1}}{a_n} >M$$ for any integer $n\ge 0$.
We define a sequence ${a_n}$:
$$a_1=1,a_{n+1}=\sqrt{a_n+n^2},n=1,2,...$$
(1)Find $\lfloor a_{2019}\rfloor$
(2)Find $\lfloor a_{1}^2\rfloor+\lfloor a_{2}^2\rfloor+...+\lfloor a_{20}^2\rfloor$
For a positive integer $x$, define a sequence $a_0, a_1, a_2, . . .$ according to the following rules:
$a_0 = 1$, $a_1 = x + 1$ and $$a_{n+2} = xa_{n+1} - a_n$$ for all $n \ge 0$.
Prove that there exist infinitely many positive integers x such that this sequence does not contain a prime number.
Given are positive integers $r$ and $k$ and an infi nite sequence of positive integers $a_1 \le a_2 \le ...$ such that $\frac{r}{a_r}= k + 1$. Prove that there is a $t$ satisfying $\frac{t}{a_t}=k$.
Prove that the parity of each term of the sequence $ \left( \left\lfloor \left( \lfloor \sqrt q \rfloor +\sqrt{q} \right)^n \right\rfloor \right)_{n\ge 1} $ is opposite to the parity of its index, where $ q $ is a squarefree natural number.
A sequence $(a_n)_{n=1}^{\infty}$ of positive integers satisfies the condition $a_{n+1} = a_n +\tau (n)$ for all positive integers $n$ where $\tau (n)$ is the number of positive integer divisors of $n$. Determine whether two consecutive terms of this sequence can be perfect squares.
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_1,a_2,...,a_{100}\}$ be a sequence of $100$ distinct real numbers. Show that there exists either an increasing subsequence
$a_{i_1}<a_{i_2}<...<a_{i_{10}}$ $(i_1<i_2<...<i_{10})$ of $10$ numbers, or a decreasing subsequence
$ a_{j_1}>a_{j_2}>...>a_{j_{12}}$ $(j_1<j_2<...<j_{12})$ of $12$ numbers, or both.
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$$
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 $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]
Let $\{a_n\}_{n \in N}$ be a sequence of real numbers with $a_1 = 2$ and $a_n =\frac{n^2 + 1}{\sqrt{n^3 - 2n^2 + n}}$ for all positive integers $n \ge 2$.
Let $s_n = a_1 + a_2 + ...+ a_n$ for all positive integers $n$. Prove that $$\frac{1}{s_1s_2}+\frac{1}{s_2s_3}+ ...+\frac{1}{s_ns_{n+1}}<\frac15$$
for all positive integers $n$.
Let $c,d \geq 2$ be naturals. Let $\{a_n\}$ be the sequence satisfying $a_1 = c, a_{n+1} = a_n^d + c$ for $n = 1,2,\cdots$.
Prove that for any $n \geq 2$, there exists a prime number $p$ such that $p|a_n$ and $p \not | a_i$ for $i = 1,2,\cdots n-1$.
An infinite sequence of distinct real numbers is given. Prove that it contains a subsequence of $1999$ terms which is either monotonically increasing or monotonically decreasing.
The sequence ($a_n$) of natural numbers is defined by $a_1 = 2$ and $a_{n+1}$ equals the sum of tenth powers of the decimal digits of $a_n$ for all $n \ge 1$. Are there numbers which appear twice in the sequence ($a_n$)?
Let $x_0 = 10^9$, $x_n = \frac{x^2_{n-1}+2}{2x_{n-1}}$ for $n > 0$. Prove that $0 < x_{36} - \sqrt2 < 10^{-9}$.