Found problems: 1239
Show that the recursion $n=x_n(x_{n-1}+x_n+x_{n+1})$, $n=1,2,\ldots$, $x_0=0$ has exaclty one nonnegative solution.
(translated by L. Erdős)
A student firstly wrote $x=3$ on the board. For each procces, the stutent deletes the number x and replaces it with either $(2x+4)$ or $(3x+8)$ or $(x^2+5x)$. Is this possible to make the number $(20^{17}+2016)$ on the board? \\
(Explain your answer) \\
[hide=Note]This type of the question is well known but I am going to make a collection so, :blush: [/hide]
Given is a sequence of real numbers $\{a_n\}^{\infty}_{n=1}$ such that $a_n \ne a_m$ for $n\ne m,$ given is a natural number $k$. Construct an injective map $P:\{1,2,\ldots,20k\}\to\mathbb Z^+$ such that the following inequalities hold:
$$a_{p(1)}<a_{p(2)}<...<a_{p(10)}$$
$$ a_{p(10)}>a_{p(11)}>...>a_{p(20)}$$
$$a_{p(20)}<a_{p(21)}<...<a_{p(30)}$$
$$...$$
$$a_{p(20k-10)}>a_{p(20k-9)}>...>a_{p(20k)}$$
$$a_{p(10)}>a_{p(30)}>...>a_{p((20k-10))} $$
$$a_{p(1)}<a_{p(20)}<...<a_{p(20k)},$$
Given an increasing sequence of different natural numbers $a_1 < a_2 < a_3 < ... < a_n$ such that for any two distinct numbers in this sequence their sum is not divisible by $10$. It is known that $a_n = 2023$.
a) Can $n$ be greater than $800$?
b) What is the largest possible value of $n$?
c) For the value $n$ found in question b), find the number of such sequences with $a_n = 2023$.
Let $a_1,a_2,\cdots$ be an infinity sequence of positive integers such that $a_1=2021$ and
$$a_{n+1}=(a_1+a_2+\cdots+a_n)^2-1$$
for all positive integers $n$. Prove that for any integer $n\ge 2$, $a_n$ is the product of at least $2n$ (not necessarily distinct) primes.
The sequence $a_1, a_2, ... , a_k, ...$ is constructed according to the rules: $$a_{2n} = a_n,a_{4n+1} = 1,a_{4n+3} = 0$$Prove that it is non-periodical sequence.
Every member, starting from the third one, of two sequences $\{a_n\}$ and $\{b_n\}$ equals to the sum of two preceding ones. First members are: $a_1 = 1, a_2 = 2, b_1 = 2, b_2 = 1$. How many natural numbers are encountered in both sequences (may be on the different places)?
We have an infinite sequence of integers $\{x_n\}$, such that $x_1 = 1$, and, for all $n \ge 1$, it holds that $x_n < x_{n+1} \le 2n$. Prove that there are two terms of the sequence,$ x_r$ and $x_s$, such that $x_r - x_s = 2018$.
A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where [x] denotes the smallest integer $\leq$ x)$.$
Let $B$ be a set of $k$ sequences each having $n$ terms equal to $1$ or $-1$. The product of two such sequences $(a_1, a_2, \ldots , a_n)$ and $(b_1, b_2, \ldots , b_n)$ is defined as $(a_1b_1, a_2b_2, \ldots , a_nb_n)$. Prove that there exists a sequence $(c_1, c_2, \ldots , c_n)$ such that the intersection of $B$ and the set containing all sequences from $B$ multiplied by $(c_1, c_2, \ldots , c_n)$ contains at most $\frac{k^2}{2^n}$ sequences.
The positive numbers $a_1, a_2,...$ satisfy $a_1 = 1$ and $(m+n)a_{m+n }\le a_m +a_n$ for all positive integers $m$ and $n$. Show that $\frac{1}{a_{200}} > 4 \cdot 10^7$ .
.
Let $u_1=1,u_2=2,u_3=24,$ and
$u_{n+1}=\frac{6u_n^2 u_{n-2}-8u_nu_{n-1}^2}{u_{n-1}u_{n-2}}, n \geq 3.$
Prove that the elements of the sequence are natural numbers and that $n\mid u_n$ for all $n$.
Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be the function as
\[ f(x) = \begin{cases} \frac{1}{x-1}& (x > 1)\\ 1& (x=1)\\ \frac{x}{1-x} & (x<1) \end{cases} \]
Let $x_1$ be a positive irrational number which is a zero of a quadratic polynomial with integer coefficients. For every positive integer $n$, let $x_{n+1} = f(x_n)$. Prove that there exists different positive integers $k$ and $\ell$ such that $x_k = x_\ell$.
Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$.
[i]Proposed by Mohsen Jamaali, Iran[/i]
For $n = 1,2,3,...$. $a_n$ is defined by:
$$a_n =\frac{1 \cdot 4 \cdot 7 \cdot ... (3n-2)}{2 \cdot 5 \cdot 8 \cdot ... (3n-1)}$$
Prove that for every $n$ holds that
$$\frac{1}{\sqrt{3n+1}}\le a_n \le \frac{1}{\sqrt[3]{3n+1}}$$
Let the numbers $a_1,a_2,a_3,a_4$ form an arithmetic progression with difference $d\ne0$. Prove that there are no exists geometric progressions $b_1,b_2,b_3,b_4$ and $c_1,c_2,c_3,c_4$ such that:
$$a_1=b_1+c_1,a_2=b_2+c_2,a_3=b_3+c_3,a_4=b_4+c_4.$$
Let be a sequence $ \left( u_n \right)_{n\ge 1} $ given by the recurrence relation $ u_{n+1} =u_n+\sqrt{u_n^2-u_1^2} , $ and the constraints $ u_2\ge u_1>0. $
Calculate $ \lim_{n\to\infty }\frac{2^n}{u_n} . $
[i]Dan Negulescu[/i]
For any two positive real numbers $x_0 > 0$, $x_1 > 0$, a sequence of real numbers is defined recursively by $$x_{n+1} =\frac{4 \max\{x_n, 4\}}{x_{n-1}}$$ for $n \ge 1$. Find $x_{2010}$.
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.
Find all polynomial with real coefficients such that:
P(x^2+1)=P(x)^2+1
Let the sequences $(x_n)$ and $(y_n)$ be defined by $x_0 = 0$, $x_1 = 1$, $x_{n + 2} = 3x_{n + 1}-2x_n$ for $n = 0, 1, ...$ and $y_n = x^2_n+2^{n + 2}$ for $n = 0, 1, ...,$ respectively. Show that for all n> 0, and n is the square of a odd integer.
Let $a_1,a_2,\dots$ be a sequence of positive numbers satisfying, for any positive integers $k,l,m,n$ such that $k+n=m+l$, $$\frac{a_k+a_n}{1+a_ka_n}=\frac{a_m+a_l}{1+a_ma_l}.$$Show that there exist positive numbers $b,c$ so that $b\le a_n\le c$ for any positive integer $n$.
Consider all binary sequences of length $n$. In a sequence that allows the interchange of positions of an arbitrary set of $k$ adjacent numbers, ($k < n$), two sequences are said to be [i]equivalent [/i] if they can be transformed from one sequence to another by a finite number of transitions as above. Find the number of sequences that are not equivalent.
Consider the sequence of integer such that:
$ a_1 = 2$
$ a_2 = 5$
$ a_{n + 1} = (2 - n^2)a_n + (2 + n^2)a_{n - 1}, \forall n\ge 2$
Find all triplies $ (x,y,z) \in \mathbb{N}^3$ such that $ a_xa_y = a_z$.
Let $f(x)=x^n+a_1x^{n-1}+\ldots+a_n~(n\ge3)$ be a polynomial with real coefficients and $n$ real roots, such that $\frac{a_{n-1}}{a_n}>n+1$. Prove that if $a_{n-2}=0$, then at least one root of $f(x)$ lies in the open interval $\left(-\frac12,\frac1{n+1}\right)$.