Found problems: 307
1975 IMO Shortlist, 14
Let $x_0 = 5$ and $x_{n+1} = x_n + \frac{1}{x_n} \ (n = 0, 1, 2, \ldots )$. Prove that
\[45 < x_{1000} < 45. 1.\]
2020 CHKMO, 1
Given that ${a_n}$ and ${b_n}$ are two sequences of integers defined by
\begin{align*}
a_1=1, a_2=10, a_{n+1}=2a_n+3a_{n-1} & ~~~\text{for }n=2,3,4,\ldots, \\
b_1=1, b_2=8, b_{n+1}=3b_n+4b_{n-1} & ~~~\text{for }n=2,3,4,\ldots.
\end{align*}
Prove that, besides the number $1$, no two numbers in the sequences are identical.
1980 IMO Longlists, 19
Find the greatest natural number $n$ such there exist natural numbers $x_{1}, x_{2}, \ldots, x_{n}$ and natural $a_{1}< a_{2}< \ldots < a_{n-1}$ satisfying the following equations for $i =1,2,\ldots,n-1$: \[x_{1}x_{2}\ldots x_{n}= 1980 \quad \text{and}\quad x_{i}+\frac{1980}{x_{i}}= a_{i}.\]
2006 Cuba MO, 7
The sequence $a_1, a_2, a_3, ...$ satisfies that $a_1 = 3$, $a_2 = -1$, $a_na_{n-2} +a_{n-1} = 2$ for all $n \ge 3$. Calculate $a_1 + a_2+ ... + a_{99}$.
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$.
2003 Czech And Slovak Olympiad III A, 3
A sequence $(x_n)_{n= 1}^{\infty}$ satisfies $x_1 = 1$ and for each $n > 1, x_n = \pm (n-1)x_{n-1} \pm (n-2)x_{n-2} \pm ... \pm 2x_2 \pm x_1$. Prove that the signs ” $\pm$” can be chosen so that $x_n \ne 12$ holds only for finitely many $n$.
2020 Spain Mathematical Olympiad, 2
Consider the succession of integers $\{f(n)\}_{n=1}^{\infty}$ defined as:
$\bullet$ $f(1) = 1$.
$\bullet$ $f(n) = f(n/2)$ if $n$ is even.
$\bullet$ If $n > 1$ odd and $f(n-1)$ odd, then $f(n) = f(n-1)-1$.
$\bullet$ If $n > 1$ odd and $f(n-1)$ even, then $f(n) = f(n-1)+1$.
a) Compute $f(2^{2020}-1)$.
b) Prove that $\{f(n)\}_{n=1}^{\infty}$ is not periodical, that is, there do not exist positive integers $t$ and $n_0$ such that $f(n+t) = f(n)$ for all $n \geq n_0$.
1992 IMO Longlists, 32
Let $S_n = \{1, 2,\cdots, n\}$ and $f_n : S_n \to S_n$ be defined inductively as follows: $f_1(1) = 1, f_n(2j) = j \ (j = 1, 2, \cdots , [n/2])$ and
[list]
[*][b][i](i)[/i][/b] if $n = 2k \ (k \geq 1)$, then $f_n(2j - 1) = f_k(j) + k \ (j = 1, 2, \cdots, k);$
[*][b][i](ii)[/i][/b] if $n = 2k + 1 \ (k \geq 1)$, then $f_n(2k + 1) = k + f_{k+1}(1), f_n(2j - 1) = k + f_{k+1}(j + 1) \ (j = 1, 2,\cdots , k).$[/list]
Prove that $f_n(x) = x$ if and only if $x$ is an integer of the form
\[\frac{(2n + 1)(2^d - 1)}{2^{d+1} - 1}\]
for some positive integer $d.$
2020 Australian Maths Olympiad, 4
Define the sequence $A_1, A_2, A_3, \dots$ by $A_1 = 1$ and for $n=1,2,3,\dots$
$$A_{n+1}=\frac{A_n+2}{A_n +1}.$$
Define the sequences $B_1, B_2, B_3,\dots$ by $B_1=1$ and for $n=1,2,3,\dots$
$$B_{n+1}=\frac{B_n^2 +2}{2B_n}.$$
Prove that $B_{n+1}=A_{2^n}$ for all non-negative integers $n$.
1971 IMO Shortlist, 1
Consider a sequence of polynomials $P_0(x), P_1(x), P_2(x), \ldots, P_n(x), \ldots$, where $P_0(x) = 2, P_1(x) = x$ and for every $n \geq 1$ the following equality holds:
\[P_{n+1}(x) + P_{n-1}(x) = xP_n(x).\]
Prove that there exist three real numbers $a, b, c$ such that for all $n \geq 1,$
\[(x^2 - 4)[P_n^2(x) - 4] = [aP_{n+1}(x) + bP_n(x) + cP_{n-1}(x)]^2.\]
1985 All Soviet Union Mathematical Olympiad, 414
Solve the equation ("$2$" encounters $1985$ times):
$$\dfrac{x}{2+ \dfrac{x}{2+\dfrac{x}{2+... \dfrac{x}{2+\sqrt {1+x}}}}}=1$$
2020 New Zealand MO, 8
For a positive integer $x$, define a sequence $a_0, a_1, a_2, . . .$ according to the following rules:
$a_0 = 1$, $a_1 = x + 1$ and $$a_{n+2} = xa_{n+1} - a_n$$ for all $n \ge 0$.
Prove that there exist infinitely many positive integers x such that this sequence does not contain a prime number.
1973 Swedish Mathematical Competition, 2
The Fibonacci sequence $f_1,f_2,f_3,\dots$ is defined by $f_1=f_2=1$, $f_{n+2}=f_{n+1}+f_n$. Find all $n$ such that $f_n = n^2$.
1988 Swedish Mathematical Competition, 6
The sequence $(a_n)$ is defined by $a_1 = 1$ and $a_{n+1} = \sqrt{a_n^2 +\frac{1}{a_n}}$ for $n \ge 1$.
Prove that there exists $a$ such that $\frac{1}{2} \le \frac{a_n}{n^a} \le 2$ for $n \ge 1$.
2013 Saudi Arabia Pre-TST, 4.1
Let $a_1,a_2, a_3,...$ be a sequence of real numbers which satisfy the relation $a_{n+1} =\sqrt{a_n^2 + 1}$
Suppose that there exists a positive integer $n_0$ such that $a_{2n_0} = 3a_{n_0}$ . Find the value of $a_{46}$.
1965 Dutch Mathematical Olympiad, 1
We consider the sequence $t_1,t_2,t_3,...$ By $P_n$ we mean the product of the first $n$ terms of the sequence. Given that $t_{n+1} = t_n \cdot t_{n+2}$ for each $n$, and that $P_{40} = P_{80} = 8$. Calculate $t_1$ and $t_2$.
1962 Dutch Mathematical Olympiad, 3
Consider the positive integers written in the decimal system with $n$ digits, the start of which is not zero and where there are no two sevens next to each other. The number of these numbers is called $u_n$. Derive a relation that expresses $u_{n+2}$ in terms of $u_{n+1}$ and $u_n$.
2007 India IMO Training Camp, 1
A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula
\[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0;
\]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large.
[i]Proposed by Harmel Nestra, Estionia[/i]
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$
1981 IMO Shortlist, 16
A sequence of real numbers $u_1, u_2, u_3, \dots$ is determined by $u_1$ and the following recurrence relation for $n \geq 1$:
\[4u_{n+1} = \sqrt[3]{ 64u_n + 15.}\]
Describe, with proof, the behavior of $u_n$ as $n \to \infty.$
1998 Slovenia Team Selection Test, 6
Let $a_0 = 1998$ and $a_{n+1} =\frac{a_n^2}{a_n +1}$ for each nonnegative integer $n$.
Prove that $[a_n] = 1994- n$ for $0 \le n \le 1000$
1976 IMO Longlists, 13
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)$
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$.
1980 Yugoslav Team Selection Test, Problem 3
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.
2011 Indonesia TST, 4
Let $a, b$, and $c$ be positive integers such that $gcd(a, b) = 1$. Sequence $\{u_k\}$, is given such that $u_0 = 0$, $u_1 = 1$, and u$_{k+2} = au_{k+1} + bu_k$ for all $k \ge 0$. Let $m$ be the least positive integer such that $c | u_m$ and $n$ be an arbitrary positive integer such that $c | u_n$. Show that $m | n$.
[hide=PS.] There was a typo in the last line, as it didn't define what n does. Wording comes from [b]tst-2011-1.pdf[/b] from [url=https://sites.google.com/site/imoidn/idntst/2011tst]here[/url]. Correction was made according to #2[/hide]