Found problems: 307
2009 Tournament Of Towns, 3
For each positive integer $n$, denote by $O(n)$ its greatest odd divisor. Given any positive integers $x_1 = a$ and $x_2 = b$, construct an in nite sequence of positive integers as follows: $x_n = O(x_{n-1} + x_{n-2})$, where $n = 3,4,...$
(a) Prove that starting from some place, all terms of the sequence are equal to the same integer.
(b) Express this integer in terms of $a$ and $b$.
1998 Portugal MO, 6
Let $a_0$ be a positive real number and consider the general term sequence $a_n$ defined by $$a_n =a_{n-1} + \frac{1}{a_{n-1}} \,\,\, n=1,2,3,...$$ Prove that $a_{1998} > 63$.
1979 IMO Longlists, 54
Consider the sequences $(a_n), (b_n)$ defined by
\[a_1=3, \quad b_1=100 , \quad a_{n+1}=3^{a_n} , \quad b_{n+1}=100^{b_n} \]
Find the smallest integer $m$ for which $b_m > a_{100}.$
2007 Balkan MO Shortlist, A8
Let $c>2$ and $a_0,a_1, \ldots$ be a sequence of real numbers such that
\begin{align*} a_n = a_{n-1}^2 - a_{n-1} < \frac{1}{\sqrt{cn}} \end{align*}
for any $n$ $\in$ $\mathbb{N}$. Prove, $a_1=0$
1958 November Putnam, A1
Let $f(m,1)=f(1,n)=1$ for $m\geq 1, n\geq 1$ and let $f(m,n)=f(m-1, n)+ f(m, n-1) +f(m-1 ,n-1)$ for $m>1$ and $n>1$. Also let
$$ S(n)= \sum_{a+b=n} f(a,b) \,\,\;\; a\geq 1 \,\, \text{and} \,\; b\geq 1.$$
Prove that
$$S(n+2) =S(n) +2S(n+1) \,\, \; \text{for} \, \, n \geq 2.$$
1991 Tournament Of Towns, (307) 4
A sequence $a_n$ is determined by the rules $a_0 = 9$ and for any nonnegative $k$,
$$a_{k+1}=3a_k^4+4a_k^3.$$
Prove that $a_{10}$ contains more than $1000$ nines in decimal notation.
(Yao)
1979 IMO Shortlist, 19
Consider the sequences $(a_n), (b_n)$ defined by
\[a_1=3, \quad b_1=100 , \quad a_{n+1}=3^{a_n} , \quad b_{n+1}=100^{b_n} \]
Find the smallest integer $m$ for which $b_m > a_{100}.$
1971 IMO Longlists, 34
Let $T_k = k - 1$ for $k = 1, 2, 3,4$ and
\[T_{2k-1} = T_{2k-2} + 2^{k-2}, T_{2k} = T_{2k-5} + 2^k \qquad (k \geq 3).\]
Show that for all $k$,
\[1 + T_{2n-1} = \left[ \frac{12}{7}2^{n-1} \right] \quad \text{and} \quad 1 + T_{2n} = \left[ \frac{17}{7}2^{n-1} \right],\]
where $[x]$ denotes the greatest integer not exceeding $x.$
2008 Postal Coaching, 1
Define a sequence $<x_n>$ by $x_0 = 0$ and $$\large x_n = \left\{
\begin{array}{ll}
x_{n-1} + \frac{3^r-1}{2} & if \,\,n = 3^{r-1}(3k + 1)\\
& \\
x_{n-1} - \frac{3^r+1}{2} & if \,\, n = 3^{r-1}(3k + 2)\\
\end{array}
\right. $$
where $k, r$ are integers. Prove that every integer occurs exactly once in the sequence.
1990 Tournament Of Towns, (271) 5
The numerical sequence $\{x_n\}$ satisfies the condition $$x_{n+1}=|x_n|-x_{n-1}$$ for all $n > 1$. Prove that the sequence is periodic with period $9$, i.e. for any $n > 1$ we have $x_n = x_{n+9}$.
(M Kontsevich, Moscow)
1984 Poland - Second Round, 6
The sequence $(x_n)$ is defined by formulas
$$
x_1=c,\; x_{n+1} = cx_n + \sqrt{(c^2-1)(x_n^2-1)} \quad\text{ for }\quad n=1,2,\ldots$$
Prove that if $ c $ is a natural number, then all numbers $ x_n $ are natural.
V Soros Olympiad 1998 - 99 (Russia), 11.9
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?
1989 Dutch Mathematical Olympiad, 1
For a sequence of integers $a_1,a_2,a_3,...$ with $0<a_1<a_2<a_3<...$ applies:
$$a_n=4a_{n-1}-a_{n-2} \,\,\, for \,\,\, n > 2$$
It is further given that $a_4 = 194$. Calculate $a_5$.
2021 Dutch IMO TST, 1
The sequence of positive integers $a_0, a_1, a_2, . . .$ is defined by $a_0 = 3$ and $$a_{n+1} - a_n = n(a_n - 1)$$ for all $n \ge 0$. Determine all integers $m \ge 2$ for which $gcd (m, a_n) = 1$ for all $n \ge 0$.
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?
1994 IMO Shortlist, 1
Let $ a_{0} \equal{} 1994$ and $ a_{n \plus{} 1} \equal{} \frac {a_{n}^{2}}{a_{n} \plus{} 1}$ for each nonnegative integer $ n$. Prove that $ 1994 \minus{} n$ is the greatest integer less than or equal to $ a_{n}$, $ 0 \leq n \leq 998$
1987 Yugoslav Team Selection Test, Problem 1
Let $x_0=a,x_1=b$ and $x_{n+1}=2x_n-9x_{n-1}$ for each $n\in\mathbb N$, where $a,b$ are integers. Find the necessary and sufficient condition on $a$ and $b$ for the existence of an $x_n$ which is a multiple of $7$.
1990 IMO Shortlist, 13
An eccentric mathematician has a ladder with $ n$ rungs that he always ascends and descends in the following way: When he ascends, each step he takes covers $ a$ rungs of the ladder, and when he descends, each step he takes covers $ b$ rungs of the ladder, where $ a$ and $ b$ are fixed positive integers. By a sequence of ascending and descending steps he can climb from ground level to the top rung of the ladder and come back down to ground level again. Find, with proof, the minimum value of $ n,$ expressed in terms of $ a$ and $ b.$
2018 Estonia Team Selection Test, 10
A sequence of positive real numbers $a_1, a_2, a_3, ... $ satisfies $a_n = a_{n-1} + a_{n-2}$ for all $n \ge 3$. A sequence $b_1, b_2, b_3, ...$ is defined by equations
$b_1 = a_1$ ,
$b_n = a_n + (b_1 + b_3 + ...+ b_{n-1})$ for even $n > 1$ ,
$b_n = a_n + (b_2 + b_4 + ... +b_{n-1})$ for odd $n > 1$.
Prove that if $n\ge 3$, then $\frac13 < \frac{b_n}{n \cdot a_n} < 1$
1994 IMO Shortlist, 6
Define the sequence $ a_1, a_2, a_3, ...$ as follows. $ a_1$ and $ a_2$ are coprime positive integers and $ a_{n \plus{} 2} \equal{} a_{n \plus{} 1}a_n \plus{} 1$. Show that for every $ m > 1$ there is an $ n > m$ such that $ a_m^m$ divides $ a_n^n$. Is it true that $ a_1$ must divide $ a_n^n$ for some $ n > 1$?
1982 Austrian-Polish Competition, 4
Let $P(x)$ denote the product of all (decimal) digits of a natural number $x$. For any positive integer $x_1$, define the sequence $(x_n)$ recursively by $x_{n+1} = x_n + P(x_n)$. Prove or disprove that the sequence $(x_n)$ is necessarily bounded.
2018 IFYM, Sozopol, 7
The rows $x_n$ and $y_n$ of positive real numbers are such that:
$x_{n+1}=x_n+\frac{1}{2y_n}$ and $y_{n+1}=y_n+\frac{1}{2x_n}$
for each positive integer $n$.
Prove that at least one of the numbers $x_{2018}$ and $y_{2018}$ is bigger than 44,9
2001 Mongolian Mathematical Olympiad, Problem 1
Suppose that a sequence $x_1,x_2,\ldots,x_{2001}$ of positive real numbers satisfies
$$3x^2_{n+1}=7x_nx_{n+1}-3x_{n+1}-2x^2_n+x_n\enspace\text{ and }\enspace x_{37}=x_{2001}.$$Find the maximum possible value of $x_1$.
1999 Brazil Team Selection Test, Problem 3
A sequence $a_n$ is defined by
$$a_0=0,\qquad a_1=3;$$$$a_n=8a_{n-1}+9a_{n-2}+16\text{ for }n\ge2.$$Find the least positive integer $h$ such that $a_{n+h}-a_n$ is divisible by $1999$ for all $n\ge0$.
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 ]\]