Found problems: 1239
2022 Romania Team Selection Test, 2
Fix a nonnegative integer $a_0$ to define a sequence of integers $a_0,a_1,\ldots$ by letting $a_k,k\geq 1$ be the smallest integer (strictly) greater than $a_{k-1}$ making $a_{k-1}+a_k{}$ into a perfect square. Let $S{}$ be the set of positive integers not expressible as the difference of two terms of the sequence $(a_k)_{k\geq 0}.$ Prove that $S$ is finite and determine its size in terms of $a_0.$
1983 Bundeswettbewerb Mathematik, 4
Let $f(0), f(1), f(2), \dots$ be a sequence satisfying \[ f(0) = 0 \quad \text{and} \quad f(n) = n - f(f(n-1)) \] for $n=1,2,3,\dots$. Give a formula for $f(n)$ such that its value can be immediately computed using $n$ without having to compute the previous terms.
1995 IMO Shortlist, 3
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$.
2013 Bogdan Stan, 2
Let $ \left( a_n \right) ,\left( b_n \right) $ be two sequences of real numbers from the interval $ (-1,1) $ having the property that
$$ \max\left( \left| a_{n+1} -a_n \right| ,\left| b_{n+1} -b_n \right| \right) \le\frac{1}{(n+4)(n+5)} , $$
for any natural number.
Prove that $ \left| a_nb_n -a_1b_1 \right|\le 1/2, $ for any natural number $ n. $
[i]Cristinel Mortici[/i]
2011 IFYM, Sozopol, 5
Does there exist a strictly increasing sequence $\{a_n\}_{n=1}^\infty$ of natural numbers with the following property: for $\forall$ $c\in \mathbb{Z}$ the sequence $c+a_1,c+a_2,...,c+a_n...$ has finite number of primes? Explain your answer.
2015 Dutch IMO TST, 3
Let $n$ be a positive integer.
Consider sequences $a_0, a_1, ..., a_k$ and $b_0, b_1,,..,b_k$ such that $a_0 = b_0 = 1$ and $a_k = b_k = n$ and such that for all $i$ such that $1 \le i \le k $, we have that $(a_i, b_i)$ is either equal to $(1 + a_{i-1}, b_{i-1})$ or $(a_{i-1}; 1 + b_{i-1})$.
Consider for $1 \le i \le k$ the number $c_i = \begin{cases} a_i \,\,\, if \,\,\, a_i = a_{i-1} \\
b_i \,\,\, if \,\,\, b_i = b_{i-1}\end{cases}$
Show that $c_1 + c_2 + ... + c_k = n^2 - 1$.
2006 Grigore Moisil Urziceni, 3
Let be a sequence $ \left( b_n \right)_{n\ge 1} $ of integers, having the following properties:
$ \text{(i)} $ the sequence $ \left( \frac{b_n}{n} \right)_{n\ge 1} $ is convergent.
$ \text{(ii)} m-n|b_m-b_n, $ for any natural numbers $ m>n. $
Prove that there exists an index from which the sequence $ \left( b_n \right)_{n\ge 1} $ is an arithmetic one.
[i]Cristinel Mortici[/i]
2018 Turkey Team Selection Test, 6
$a_0, a_1, \ldots, a_{100}$ and $b_1, b_2,\ldots, b_{100}$ are sequences of real numbers, for which the property holds: for all $n=0, 1, \ldots, 99$, either
$$a_{n+1}=\frac{a_n}{2} \quad \text{and} \quad b_{n+1}=\frac{1}{2}-a_n,$$
or
$$a_{n+1}=2a_n^2 \quad \text{and} \quad b_{n+1}=a_n.$$
Given $a_{100}\leq a_0$, what is the maximal value of $b_1+b_2+\cdots+b_{100}$?
1996 Akdeniz University MO, 2
Let $u_1=1,u_2=1$ and for all $k \geq 1$'s
$$u_{k+2}=u_{k+1}+u_{k}$$
Prove that for all $m \geq 1$'s $5$ divides $u_{5m}$
1991 IMO, 3
An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that
\[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1
\]
for every pair of distinct nonnegative integers $ i, j$.
2014 Peru IMO TST, 15
Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]
2017 Saudi Arabia IMO TST, 3
Find the greatest positive real number $M$ such that for all positive real sequence $(a_n)$ and for all real number $m < M$, it is possible to find some index $n \ge 1$ that satisfies the inequality $a_1 + a_2 + a_3 + ...+ a_n +a_{n+1} > m a_n$.
2020 Jozsef Wildt International Math Competition, W10
Let there be $(a_n)_{n\ge1},(b_n)_{n\ge1},a_n,b_n\in\mathbb R^*_+=(0,\infty)$ such that $\lim_{n\to\infty}a_n=a\in\mathbb R^*_+$ and $(b_n)_{n\ge1}$ is a bounded sequence. If $(x_n)_{n\ge1}$, $x_n=\prod_{k=1}^n(ka_h+b_h)$ find:
$$\lim_{n\to\infty}\left(\sqrt[n+1]{x_{n+1}}-\sqrt[n]{x_n}\right)$$
[i]Proposed by D.M. Bătinețu-Giurgiu and Daniel Sitaru[/i]
2011 VTRMC, Problem 2
A sequence $(a_n)$ is defined by $a_0=-1,a_1=0$, and $a_{n+1}=a_n^2-(n+1)^2a_{n-1}-1$ for all positive integers $n$. Find $a_{100}$.
2012 Junior Balkan Team Selection Tests - Romania, 1
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.$
Oliforum Contest V 2017, 10
Let $(x_n)_{n\in Z}$ and $(y_n)_{n\in Z}$ be two sequences of integers such that $|x_{n+2} - x_n| \le 2$ and $x_n + x_m = y_{n^2+m^2}$ for all $n, m \in Z$. Show that the sequence of $x_n$s takes at most $6$ distinct values.
(Paolo Leonetti)
1978 Germany Team Selection Test, 3
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 ]\]
1984 Polish MO Finals, 4
A coin is tossed $n$ times, and the outcome is written in the form ($a_1,a_2,...,a_n$), where $a_i = 1$ or $2$ depending on whether the result of the $i$-th toss is the head or the tail, respectively. Set $b_j = a_1 +a_2 +...+a_j$ for $j = 1,2,...,n$, and let $p(n)$ be the probability that the sequence $b_1,b_2,...,b_n$ contains the number $n$. Express $p(n)$ in terms of $p(n-1)$ and $p(n-2)$.
1971 IMO, 3
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.
2019 District Olympiad, 3
Let $(a_n)_{n \in \mathbb{N}}$ be a sequence of real numbers such that $$2(a_1+a_2+…+a_n)=na_{n+1}~\forall~n \ge 1.$$
$\textbf{a)}$ Prove that the given sequence is an arithmetic progression.
$\textbf{b)}$ If $\lfloor a_1 \rfloor + \lfloor a_2 \rfloor +…+ \lfloor a_n \rfloor = \lfloor a_1+a_2+…+a_n \rfloor~\forall~ n \in \mathbb{N},$ prove that every term of the sequence is an integer.
2011 Dutch IMO TST, 4
Prove that there exists no in nite sequence of prime numbers $p_0, p_1, p_2,...$ such that for all positive integers $k$:
$p_k = 2p_{k-1} + 1$ or $p_k = 2p_{k-1} - 1$.
1976 IMO, 3
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)$
1992 Putnam, B3
For any pair $(x,y)$ of real numbers, a sequence $(a_{n}(x,y))$ is defined as follows:
$$a_{0}(x,y)=x, \;\;\;\; a_{n+1}(x,y) =\frac{a_{n}(x,y)^{2} +y^2 }{2} \;\, \text{for}\, n\geq 0$$
Find the area of the region $\{(x,y)\in \mathbb{R}^{2} \, |\, (a_{n}(x,y)) \,\, \text{converges} \}$.
2002 Croatia National Olympiad, Problem 4
Let $(a_n)_{n\in\mathbb N}$ be an increasing sequence of positive integers. A term $a_k$ in the sequence is said to be good if it a sum of some other terms (not necessarily distinct). Prove that all terms of the sequence, apart from finitely many of them, are good.
1991 All Soviet Union Mathematical Olympiad, 551
A sequence of positive integers is constructed as follows. If the last digit of $a_n$ is greater than $5$, then $a_{n+1}$ is $9a_n$. If the last digit of $a_n$ is $5$ or less and an has more than one digit, then $a_{n+1}$ is obtained from $a_n$ by deleting the last digit. If $a_n$ has only one digit, which is $5$ or less, then the sequence terminates. Can we choose the first member of the sequence so that it does not terminate?