Found problems: 1239
Every month a forester Ermolay has planted 2000 trees along a fence. On every tree, he has written how many oaks there are among itself and trees at his right and left. This way a sequence of 2000 numbers was created. How many distinct sequences could the forester Ermolay get? (oak is a certain type of tree)
[I]Proposed by A. Khrabrov, D.Rostovski[/i]
The sequence of real numbers $(a_n)_{n\geq 0}$ is such that $a_0 = 1$, $a_1 = a > 2$ and $\displaystyle a_{n+1} = \left(\left(\frac{a_n}{a_{n-1}}\right)^2 -2\right)a_n$ for every positive integer $n$. Prove that $\displaystyle \sum_{i=0}^k \frac{1}{a_i} < \frac{2+a-\sqrt{a^2-4}}{2}$ for every positive integer $k$.
Define sequence $(a_{n})_{n=1}^{\infty}$ by $a_1=a_2=a_3=1$ and $a_{n+3}=a_{n+1}+a_{n}$ for all $n \geq 1$. Also, define sequence $(b_{n})_{n=1}^{\infty}$ by $b_1=b_2=b_3=b_4=b_5=1$ and $b_{n+5}=b_{n+4}+b_{n}$ for all $n \geq 1$. Prove that $\exists N \in \mathbb{N}$ such that $a_n = b_{n+1} + b_{n-8}$ for all $n \geq N$.
The sequence $1,2,3,4,0,9,6,9,4,8,7,\ldots$ is formed so that each term, starting from the fifth, is the units digit of the sum of the previous four.
(a) Do the digits $2,0,0,4$ occur in the sequence in this order?
(b) Will the initial digits $1,2,3,4$ ever occur again in this order?
Let $k$ be a positive integer and $a_1, a_2, ...$ be a sequence of terms from set $\{ 0, 1, ..., k \}$. Let
$b_n = \sqrt[n] {a_1^n + a_2^n + ... + a_n^n}$
for all positive integers $n$. Prove, that if in sequence $b_1, b_2, b_3, ...$ are infinitely many integers, then all terms of this series are integers.
Consider the sequence $ \left( x_n \right)_{n\ge 1} $ having $ x_1>1 $ and satisfying the equation
$$ x_1+x_2+\cdots +x_{n+1} =x_1x_2\cdots x_{n+1} ,\quad\forall n\in\mathbb{N} . $$
Show that this sequence is convergent and find its limit.
$2020$ positive integers are written in one line. Each of them starting with the third is divisible by previous and by the sum of two previous numbers. What is the smallest value the last number can take?
A. Gribalko
Define the sequence $(w_n)_{n\ge0}$ by the recurrence relation
$$w_{n+2}=2w_{n+1}+3w_n,\enspace\enspace w_0=1,w_1=i,\enspace n=0,1,\ldots$$
(1) Find the general formula for $w_n$ and compute the first $9$ terms.
(2) Show that $|\Re w_n-\Im w_n|=1$ for all $n\ge1$.
[i]Proposed by Ovidiu Bagdasar[/i]
Let us define the sequences $a_1, a_2, a_3,...$ and $b_1, b_2, b_3,...$. with the following conditions
$a_1 = 3, b_1 = 1$ and $a_{n +1} =\frac{a_n^2+b_n^2}{2}$ and $b_{n + 1}= a_n \cdot b_n$ for each $n = 1, 2,...$.
Find all different prime factors οf the number $a_{2000} + b_{2000}$.
Denote by $B(c,r)$ the open disk of center $c$ and radius $r$ in the plane. Decide whether there exists a sequence $\{z_n\}^\infty_{n=1}$ of points in $\mathbb R^2$ such that the open disks $B(z_n,1/n)$ are pairwise disjoint and the sequence $\{z_n\}^\infty_{n=1}$ is convergent.
Let $k$ be a positive integer. A sequence $a_0,a_1,...,a_n,n>0$ of positive integers satisfies the following conditions:
$(i)$ $a_0=a_n=1$;
$(ii)$ $2\leq a_i\leq k$ for each $i=1,2,...,n-1$;
$(iii)$For each $j=2,3,...,k$, the number $j$ appears $\phi(j)$ times in the sequence $a_0,a_1,...,a_n$, where $\phi(j)$ is the number of positive integers that do not exceed $j$ and are coprime to $j$;
$(iv)$For any $i=1,2,...,n-1$, $\gcd(a_i,a_{i-1})=1=\gcd(a_i,a_{i+1})$, and $a_i$ divides $a_{i-1}+a_{i+1}$.
Suppose there is another sequence $b_0,b_1,...,b_n$ of integers such that $\frac{b_{i+1}}{a_{i+1}}>\frac{b_i}{a_i}$ for all $i=0,1,...,n-1$. Find the minimum value of $b_n-b_0$.
Let $ \lfloor x \rfloor$ denote the greatest integer less than or equal to $ x.$ Pick any $ x_1$ in $ [0, 1)$ and define the sequence $ x_1, x_2, x_3, \ldots$ by $ x_{n\plus{}1} \equal{} 0$ if $ x_n \equal{} 0$ and $ x_{n\plus{}1} \equal{} \frac{1}{x_n} \minus{} \left \lfloor \frac{1}{x_n} \right \rfloor$ otherwise. Prove that
\[ x_1 \plus{} x_2 \plus{} \ldots \plus{} x_n < \frac{F_1}{F_2} \plus{} \frac{F_2}{F_3} \plus{} \ldots \plus{} \frac{F_n}{F_{n\plus{}1}},\]
where $ F_1 \equal{} F_2 \equal{} 1$ and $ F_{n\plus{}2} \equal{} F_{n\plus{}1} \plus{} F_n$ for $ n \geq 1.$
Find all integers $k$, such that there exists an integer sequence ${\{a_n\}}$ satisfies two conditions below
(1) For all positive integers $n$,$a_{n+1}={a_n}^3+ka_n+1$
(2) $|a_n| \leq M$ holds for some real $M$
Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that
$$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$
for all positive integers $n$. Show that $a_{2022}\leq 1$.
Let $n>1$ be an integer. Call a number beautiful if its square leaves an odd remainder upon divison by $n$. Prove that the number of consecutive beautiful numbers is less or equal to $1+\lfloor \sqrt{3n} \rfloor$.
Let be a sequence of natural numbers $ \left( a_n \right)_{n\ge 1} $ such that $ a_n\le n $ for all natural numbers $ n, $ and
$$ \sum_{j=1}^{k-1} \cos \frac{\pi a_j}{k} =0, $$
for all natural $ k\ge 2. $
[b]a)[/b] Find $ a_2. $
[b]b)[/b] Determine this sequence.
Let be two positive real numbers $ a,b, $ and an infinite arithmetic sequence of natural numbers $ \left( x_n \right)_{n\ge 1} . $
Study the convergence of the sequences
$$ \left( \frac{1}{x_n}\sum_{i=1}^n\sqrt[x_i]{b} \right)_{n\ge 1}\text{ and } \left( \left(\sum_{i=1}^n \sqrt[x_i]{a}/\sqrt[x_i]{b} \right)^\frac{x_n}{\ln x_n} \right)_{n\ge 1} , $$
and calculate their limits.
[i]Dumitru Acu[/i]
Let $ p $ and $ q $ be given primes and the sequence $ \{ p_n \}_{n = 1}^{\infty} $ defined recursively as follows:
$ p_1 = p $, $ p_2 = q $, and $ p_{n+2} $ is the largest prime divisor of the number $( p_n + p_{n + 1} + 2016) $ for all $ n \geq 1 $. Prove that this sequence is bounded. That is, there exists a positive real number $ M $ such that $ p_n < M $ for all positive integers $ n $.
Let $u_0, u_1, u_2, \ldots$ be integers such that $u_0 = 100$; $u_{k+2} \geqslant 2 + u_k$ for all $k \geqslant 0$; and $u_{\ell+5} \leqslant 5 + u_\ell$ for all $\ell \geqslant 0$. Find all possible values for the integer $u_{2023}$.
Prove that there exists an infinite sequence of perfect squares with the following properties:
(i) The arithmetic mean of any two consecutive terms is a perfect square,
(ii) Every two consecutive terms are coprime,
(iii) The sequence is strictly increasing.
From the sequence $1,\frac12, \frac13, ...$ can one choose
(a) a subsequence of $100$ different numbers,
(b) an infinite subsequence
such that each number (beginning from the third) is equal to the difference between the two preceding numbers ($a_k=a_{k-2}-a_{k-1}$)?
(SI Tokarev)
prove that for any sequence of nonnegative numbers $(a_n)$, $$\liminf_{n\to\infty} (n^2(4a_n(1-a_{n-1})-1))\leq\frac{1}{4}$$
Prove that for all $n\in \mathbb{N}$ there exist natural numbers $a_1,a_2,...,a_n$ such that:
$(i)a_1>a_2>...>a_n$
$(ii)a_i|a^2_{i+1},\forall i\in\{1,2,...,n-1\}$
$(iii)a_i\nmid a_j,\forall i,j\in \{1,2,...,n\},i\neq j$
Given a $3 \times 3$ symmetric real matrix $A$, we define $f(A)$ as a $3 \times 3$ matrix with the same eigenvectors of $A$ such that if $A$ has eigenvalues $a$, $b$, $c$, then $f(A)$ has eigenvalues $b+c$, $c+a$, $a+b$ (in that order). We define a sequence of symmetric real $3\times3$ matrices $A_0, A_1, A_2, \ldots$ such that $A_{n+1} = f(A_n)$ for $n \geq 0$. If the matrix $A_0$ has no zero entries, determine the maximum number of indices $j \geq 0$ for which the matrix $A_j$ has any null entries.
Let \(c\) be a positive real number. Alice wishes to pick an integer \(n\) and a sequence \(a_1\), \(a_2\), \(\ldots\) of distinct positive integers such that \(a_{i} \leq ci\) for all positive integers \(i\) and \[n, \qquad n + a_1, \qquad n + a_1 - a_2, \qquad n + a_1 - a_2 + a_3, \qquad \cdots\] is a sequence of distinct nonnegative numbers. Find all \(c\) such that Alice can fulfil her wish.