Found problems: 307
1993 IMO Shortlist, 1
Define a sequence $\langle f(n)\rangle^{\infty}_{n=1}$ of positive integers by $f(1) = 1$ and \[f(n) = \begin{cases} f(n-1) - n & \text{ if } f(n-1) > n;\\ f(n-1) + n & \text{ if } f(n-1) \leq n, \end{cases}\]
for $n \geq 2.$ Let $S = \{n \in \mathbb{N} \;\mid\; f(n) = 1993\}.$
[b](i)[/b] Prove that $S$ is an infinite set.
[b](ii)[/b] Find the least positive integer in $S.$
[b](iii)[/b] If all the elements of $S$ are written in ascending order as \[ n_1 < n_2 < n_3 < \ldots , \] show that \[ \lim_{i\rightarrow\infty} \frac{n_{i+1}}{n_i} = 3. \]
1992 Tournament Of Towns, (348) 6
Consider the sequence $a(n)$ defined by the following conditions: $$a(1) = 1\,\,\,\, a(n + 1) = a(n) + [\sqrt{a(n)}] \,\,\, , \,\,\,\, n = 1,2,3,...$$
Prove that the sequence contains an infinite number of perfect squares. (Note: $[x]$ means the integer part of $x$, that is the greatest integer not greater than $x$.)
(A Andjans)
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]
1985 IMO Longlists, 63
Let $x_n = \sqrt[2]{2+\sqrt[3]{3+\cdots+\sqrt[n]{n}}}.$ Prove that
\[x_{n+1}-x_n <\frac{1}{n!} \quad n=2,3,\cdots\]
1992 Yugoslav Team Selection Test, Problem 2
Periodic sequences $(a_n),(b_n),(c_n)$ and $(d_n)$ satisfy the following conditions:
$$a_{n+1}=a_n+b_n,\enspace\enspace b_{n+1}=b_n+c_n,$$
$$c_{n+1}=c_n+d_n,\enspace\enspace d_{n+1}=d_n+a_n,$$
for $n=1,2,\ldots$. Prove that $a_2=b_2=c_2=d_2=0$.
1969 IMO Shortlist, 28
$(GBR 5)$ Let us define $u_0 = 0, u_1 = 1$ and for $n\ge 0, u_{n+2} = au_{n+1}+bu_n, a$ and $b$ being positive integers. Express $u_n$ as a polynomial in $a$ and $b.$ Prove the result. Given that $b$ is prime, prove that $b$ divides $a(u_b -1).$
2001 All-Russian Olympiad Regional Round, 11.5
Given a sequence $\{x_k\}$ such that $x_1 = 1$, $x_{n+1} = n \sin x_n+ 1$. Prove that the sequence is non-periodic.
1973 Spain Mathematical Olympiad, 3
The sequence $(a_n)$ of complex numbers is considered in the complex plane, in which is: $$a_0 = 1, \,\,\, a_n = a_{n-1} +\frac{1}{n}(\cos 45^o + i \sin 45^o )^n.$$
Prove that the sequence of the real parts of the terms of $(a_n)$ is convergent and its limit is a number between $0.85$ and $1.15$.
1995 North Macedonia National Olympiad, 1
Let $ a_0 $ be a real number. The sequence $ \{a_n \} $ is given by $ a_ {n + 1} = 3 ^ n-5a_n $, $ n = 0,1,2, \ldots $.
a) Express the general member $ a_n $ through $ a_0 $ and $ n. $
b) Find such $ a_0, $ that $ a_ {n + 1}> a_n, $ for every $ n. $
1980 IMO Longlists, 2
Define the numbers $a_0, a_1, \ldots, a_n$ in the following way:
\[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \]
Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]
1976 Polish MO Finals, 2
Four sequences of real numbers $(a_n), (b_n), (c_n), (d_n)$ satisfy for all $n$,
$$a_{n+1} = a_n +b_n, b_{n+1} = b_n +c_n,$$
$$c_{n+1} = c_n +d_n, d_{n+1} = d_n +a_n.$$
Prove that if $a_{k+m} = a_m, b_{k+m} = b_m, c_{k+m} = c_m, d_{k+m} = d_m$ for some $k\ge 1,n \ge 1$, then $a_2 = b_2 = c_2 = d_2 = 0$.
2012 Balkan MO Shortlist, N2
Let the sequences $(a_n)_{n=1}^{\infty}$ and $(b_n)_{n=1}^{\infty}$ satisfy $a_0 = b_0 = 1, a_n = 9a_{n-1} -2b_{n-1}$ and $b_n = 2a_{n-1} + 4b_{n-1}$ for all positive integers $n$. Let $c_n = a_n + b_n$ for all positive integers $n$.
Prove that there do not exist positive integers $k, r, m$ such that $c^2_r = c_kc_m$.
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$.
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.
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}$.
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 ]\]
1990 Czech and Slovak Olympiad III A, 1
Let $(a_n)_{n\ge1}$ be a sequence given by
\begin{align*}
a_1 &= 1, \\
a_{2^k+j} &= -a_j\text{ for any } k\ge0,1\le j\le 2^k.
\end{align*}
Show that the sequence is not periodic.
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}$.
1996 IMO Shortlist, 9
Let the sequence $ a(n), n \equal{} 1,2,3, \ldots$ be generated as follows with $ a(1) \equal{} 0,$ and for $ n > 1:$
\[ a(n) \equal{} a\left( \left \lfloor \frac{n}{2} \right \rfloor \right) \plus{} (\minus{}1)^{\frac{n(n\plus{}1)}{2}}.\]
1.) Determine the maximum and minimum value of $ a(n)$ over $ n \leq 1996$ and find all $ n \leq 1996$ for which these extreme values are attained.
2.) How many terms $ a(n), n \leq 1996,$ are equal to 0?
2018 Peru IMO TST, 5
Let $d$ be a positive integer.
The seqeunce $a_1, a_2, a_3,...$ of positive integers is defined by $a_1 = 1$ and $a_{n + 1} = n\left \lfloor \frac{a_n}{n} \right \rfloor+ d$ for $n = 1,2,3, ...$ .
Prove that there exists a positive integer $N$ so that the terms $a_N,a_{N + 1}, a_{N + 2},...$ form an arithmetic progression.
Note: If $x$ is a real number, $\left \lfloor x \right \rfloor $ denotes the largest integer that is less than or equal to $x$.
2019 Ecuador Juniors, 6
Let $x_0, a, b$ be reals given such that $b > 0$ and $x_0 \ne 0$. For every nonnegative integer $n$ a real value $x_{n+1}$ is chosen that satisfies $$x^2_{n+1}= ax_nx_{n+1} + bx^2_n .$$
a) Find how many different values $x_n$ can take.
b) Find the sum of all possible values of $x_n$ with repetitions as a function of $n, x_0, a, b$.
2009 Postal Coaching, 3
Let $N_0$ denote the set of nonnegative integers and $Z$ the set of all integers. Let a function $f : N_0 \times Z \to Z$ satisfy the conditions
(i) $f(0, 0) = 1$, $f(0, 1) = 1$
(ii) for all $k, k \ne 0, k \ne 1$, $f(0, k) = 0$ and
(iii) for all $n \ge 1$ and $k, f(n, k) = f(n -1, k) + f(n- 1, k - 2n)$. Find the value of
$$\sum_{k=0}^{2009 \choose 2} f(2008, k)$$
1986 Bundeswettbewerb Mathematik, 4
The sequence $a_1, a_2, a_3,...$ is defined by $$a_1 = 1\,\,\,, \,\,\,a_{n+1} =\frac{1}{16}(1 + 4a_n +\sqrt{1 + 24a_n}) \,\,\,(n \in N^* ).$$ Determine and prove a formula with which for every natural number $n$ the term $a_n$ can be computed directly without having to determine preceding terms of the sequence.
2016 Switzerland - Final Round, 6
Let $a_n$ be a sequence of natural numbers defined by $a_1 = m$ and for $n > 1$. We call apair$ (a_k, a_{\ell })$ [i]interesting [/i] if
(i) $0 < \ell - k < 2016$,
(ii) $a_k$ divides $a_{\ell }$.
Show that there exists a $m$ such that the sequence $a_n$ contains no interesting pair.
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)$.