Found problems: 1239
Determine the set of all real numbers $r$ for which there exists an infinite sequence $a_1,a_2,\dots$ of positive integers satisfying the following three properties:
(1) No number occurs more than once in the sequence.
(2) The sum of two different elements of the sequence is never a power of two.
(3) For all positive integers $n$, we have $a_n<r \cdot n$.
A sequence $(x_n)$ satisfies $x_{n+1}=\frac{x_n^2+a}{x_{n-1}}$ for all $n\in\mathbb N$. Prove that if $x_0,x_1$, and $\frac{x_0^2+x_1^2+a}{x_0x_1}$ are integers, then all the terms of sequence $(x_n)$ are integers.
Suppose that primes $a_1, a_2, . . . , a_p$ form an increasing arithmetic progression and $a_1 > p$. Prove that if $p$ is a prime, then the difference of the progression is divisible by $p$.
Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.
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$.
We have an infinite sequence of real numbers $x_0,x_1, x_2, ... $ such that $x_{n+1} = \sqrt{x_n -\frac14}$ holds for all natural $n$ and moreover $x_0 \in \frac12$.
(a) Prove that for every natural $n$ holds: $x_n > \frac12$
(b) Prove that $\lim_{n \to \infty} x_n$ exists. Calculate this limit.
Given a sequence $\{a_n\}$ of real numbers such that $|a_{k+m} - a_k - a_m| \leq 1$ for all positive integers $k$ and $m$, prove that, for all positive integers $p$ and $q$, \[|\frac{a_p}{p} - \frac{a_q}{q}| < \frac{1}{p} + \frac{1}{q}.\]
Let $ R_1,R_2, \ldots$ be the family of finite sequences of positive integers defined by the following rules: $ R_1 \equal{} (1),$ and if $ R_{n - 1} \equal{} (x_1, \ldots, x_s),$ then
\[ R_n \equal{} (1, 2, \ldots, x_1, 1, 2, \ldots, x_2, \ldots, 1, 2, \ldots, x_s, n).\]
For example, $ R_2 \equal{} (1, 2),$ $ R_3 \equal{} (1, 1, 2, 3),$ $ R_4 \equal{} (1, 1, 1, 2, 1, 2, 3, 4).$ Prove that if $ n > 1,$ then the $ k$th term from the left in $ R_n$ is equal to 1 if and only if the $ k$th term from the right in $ R_n$ is different from 1.
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|$$
A biologist watches a chameleon. The chameleon catches flies and rests after each catch. The biologist notices that:
[list=1][*]the first fly is caught after a resting period of one minute;
[*]the resting period before catching the $2m^\text{th}$ fly is the same as the resting period before catching the $m^\text{th}$ fly and one minute shorter than the resting period before catching the $(2m+1)^\text{th}$ fly;
[*]when the chameleon stops resting, he catches a fly instantly.[/list]
[list=a][*]How many flies were caught by the chameleon before his first resting period of $9$ minutes in a row?
[*]After how many minutes will the chameleon catch his $98^\text{th}$ fly?
[*]How many flies were caught by the chameleon after 1999 minutes have passed?[/list]
For any positive integer $ x$ define $ g(x)$ as greatest odd divisor of $ x,$ and
\[ f(x) \equal{} \begin{cases} \frac {x}{2} \plus{} \frac {x}{g(x)} & \text{if \ \(x\) is even}, \\
2^{\frac {x \plus{} 1}{2}} & \text{if \ \(x\) is odd}. \end{cases}
\]
Construct the sequence $ x_1 \equal{} 1, x_{n \plus{} 1} \equal{} f(x_n).$ Show that the number 1992 appears in this sequence, determine the least $ n$ such that $ x_n \equal{} 1992,$ and determine whether $ n$ is unique.
Consider the sequence $a_1, a_2, \dots$ of positive integers such that $a_1=2$ and $a_{n+1}=a_n^4+a_n^3-3a_n^2-a_n+2$, for all $n\geqslant 1$. Prove that there exist infinitely many prime numbers that don't divide any term of the sequence.
[i]Proposed by Pavel Ciurea[/i]
Study the convergence of a sequence $ \left( x_n\right)_{n\ge 0} $ for which $ x_0\in\mathbb{R}\setminus\mathbb{Q} , $ and $ x_{n+1}\in \left\{ \frac{x_n+1}{x_n} , \frac{x_n+2}{2x_n-1}\right\} , $ for all $ n\ge 1. $
For an integer $x \geq 1$, let $p(x)$ be the least prime that does not divide $x$, and define $q(x)$ to be the product of all primes less than $p(x)$. In particular, $p(1) = 2.$ For $x$ having $p(x) = 2$, define $q(x) = 1$. Consider the sequence $x_0, x_1, x_2, \ldots$ defined by $x_0 = 1$ and \[ x_{n+1} = \frac{x_n p(x_n)}{q(x_n)} \] for $n \geq 0$. Find all $n$ such that $x_n = 1995$.
Sequence of integers $\{u_n\}_{n \in \mathbb{N}_0}$ is given as: $u_0=0$, $u_{2n}=u_n$, $u_{2n+1}=1-u_n$ for all $n \in \mathbb{N}_0$
$a)$ Find $u_{1998}$
$b)$ If $p$ is a positive integer and $m=(2^p-1)^2$, find $u_m$
For every sequence $\{a_n\}~(n\in\mathbb N)$ we define the sequences $\{\Delta a_n\}$ and $\{\Delta^2a_n\}$ by the following formulas:
\begin{align*}\Delta a_n&=a_{n+1}-a_n,\\\Delta^2a_n&=\Delta a_{n+1}-\Delta a_n.\end{align*}Further, for all $n\in\mathbb N$ for which $\Delta a_n^2\ne0$, define
$$a_n'=a_n-\frac{(\Delta a_n)^2}{\Delta^2a_n}.$$
(a) For which sequences $\{a_n\}$ is the sequence $\{\Delta^2a_n\}$ constant?
(b) Find all sequences $\{a_n\}$, for which the numbers $a_n'$ are defined for all $n\in\mathbb N$ and for which the sequence $\{a_n'\}$ is constant.
(c) Assume that the sequence $\{a_n\}$ converges to $a=0$, and $a_n\ne a$ for all $n\in\mathbb N$ and the sequence $\{\tfrac{a_{n+1}-a}{a_n-a}\}$ converges to $\lambda\ne1$.
i. Prove that $\lambda\in[-1,1)$.
ii. Prove that there exists $n_0\in\mathbb N$ such that for all integers $n\ge n_0$ we have $\Delta^2a_n\ne0$.
iii. Let $\lambda\ne0$. For which $k\in\mathbb Z$ is the sequence $\{\tfrac{a_n'}{a_{n+k}}\}$ not convergent?
iv. Let $\lambda=0$. Prove that the sequences $\{a_n'/a_n\}$ and $\{a_n'/a_{n+1}\}$ converge to $0$. Find an example of $\{a_n\}$ for which the sequence $\{a_n'/a_{n+2}\}$ has a non-zero limit.
(d) What happens with part (c) if we remove the condition $a=0$?
For any positive integer $ x$ define $ g(x)$ as greatest odd divisor of $ x,$ and
\[ f(x) \equal{} \begin{cases} \frac {x}{2} \plus{} \frac {x}{g(x)} & \text{if \ \(x\) is even}, \\
2^{\frac {x \plus{} 1}{2}} & \text{if \ \(x\) is odd}. \end{cases}
\]
Construct the sequence $ x_1 \equal{} 1, x_{n \plus{} 1} \equal{} f(x_n).$ Show that the number 1992 appears in this sequence, determine the least $ n$ such that $ x_n \equal{} 1992,$ and determine whether $ n$ is unique.
For positive integer n, define $a_n$ as the number of the triangles with integer length of every side and the length of the longest side being $2n.$
(1) Find $a_n$ in terms of $n;$
(2)If the sequence $\{ b_n\}$ satisfying for any positive integer $n,$ $\sum_{k=1}^n(-1)^{n-k}\binom {n}{k} b_k=a_n.$ Find the number of positive integer $n$ satisfying that $b_n\leq 2019a_n.$
$b_0, b_1, b_2, \dots$ is a sequence of positive reals such that the sequence $b_0,c b_1, c^2b_2,c^3b_3,\dots$ is convex for all $c > 0$. (A sequence is convex if each term is at most the arithmetic mean of its two neighbors.) Show that $\ln b_0, \ln b_1, \ln b_2, \dots$ is convex.
Let $a_0, a_1, \ldots, a_n, a_{n+1}$ be a sequence of real numbers satisfying the following conditions:
\[a_0 = a_{n+1 }= 0,\]\[ |a_{k-1} - 2a_k + a_{k+1}| \leq 1 \quad (k = 1, 2,\ldots , n).\]
Prove that $|a_k| \leq \frac{k(n+1-k)}{2} \quad (k = 0, 1,\ldots ,n + 1).$
Let $(a_n)_{n\ge1}$ be a positive real sequence such that
$$\lim_{n\to\infty}\frac{a_n}n=a\in\mathbb R^*_+\enspace\text{and}\enspace\lim_{n\to\infty}\left(\frac{a_{n+1}}{a_n}\right)^n=b\in\mathbb R^*_+$$
Compute
$$\lim_{n\to\infty}(a_{n+1}-a_n)$$
[i]Proposed by D.M. Bătinețu-Giurgiu and Neculai Stanciu[/i]
Let $k$ be a positive integer and $a_1,a_2,\dots$ be an infinite sequence of positive integers such that
\[a_ia_{i+1} \mid k-a_i^2\]
for all integers $i \ge 1$. Prove that there exists a positive integer $M$ such that $a_n=a_{n+1}$ for all
integers $n \ge M$.
Let ${a_n}$ be a non-increasing sequence of positive numbers. Prove that if for $n \ge 2001$, $na_{n} \le 1$, then for any positive integer $m \ge 2001$ and $x \in \mathbb{R}$, the following inequality holds:
$\left | \sum_{k=2001}^{m} a_{k} \sin kx \right | \le 1 + \pi$
The sequence $a_i$ is defined as $a_1 = 2, a_2 = 3$, and
$a_{n+1} = 2a_{n-1}$ or $a_{n+1} = 3a_n - 2a_{n-1}$ for all integers $n \ge 2$.
Prove that no term in $a_i$ is in the range $[1612, 2012]$.
[b]1.[/b] Given a positive integer $r>1$, prove that there exists an infinite number of infinite geometrical series, with positive terms, having the sum 1 and satisfying the following condition: for any positive real numbers $S_{1},S_{2},\dots,S_{r}$ such that $S_{1}+S_{2}+\dots+S_{r}=1$, any of these infinite geometrical series can be divided into $r$ infinite series(not necessarily geometrical) having the sums $S_{1},S_{2},\dots,S_{r}$, respectively. [b](S. 6)[/b]