Found problems: 307
1983 IMO Longlists, 19
Let $a$ be a positive integer and let $\{a_n\}$ be defined by $a_0 = 0$ and
\[a_{n+1 }= (a_n + 1)a + (a + 1)a_n + 2 \sqrt{a(a + 1)a_n(a_n + 1)} \qquad (n = 1, 2 ,\dots ).\]
Show that for each positive integer $n$, $a_n$ is a positive integer.
1980 IMO Shortlist, 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.\]
1992 Tournament Of Towns, (354) 3
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,...$$ How many perfect squares no greater in value than $1000 000$ will be found among the first terms of the sequence? ( (Note: $[x]$ means the integer part of $x$, that is the greatest integer not greater than $x$.)
(A Andjans)
2014 Costa Rica - Final Round, 5
Let $f : N\to N$ such that $$f(1) = 0\,\, , \,\,f(3n) = 2f(n) + 2\,\, , \,\,f(3n-1) = 2f(n) + 1\,\, , \,\,f(3n-2) = 2f(n).$$ Determine the smallest value of $n$ so that $f (n) = 2014.$
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$.
1964 Vietnam National Olympiad, 4
Define the sequence of positive integers $f_n$ by $f_0 = 1, f_1 = 1, f_{n+2} = f_{n+1} + f_n$. Show that $f_n =\frac{ (a^{n+1} - b^{n+1})}{\sqrt5}$, where $a, b$ are real numbers such that $a + b = 1, ab = -1$ and $a > b$.
1981 Austrian-Polish Competition, 6
The sequences $(x_n), (y_n), (z_n)$ are given by $x_{n+1}=y_n +\frac{1}{x_n}$,$ y_{n+1}=z_n +\frac{1}{y_n}$,$z_{n+1}=x_n +\frac{1}{z_n} $ for $n \ge 0$ where $x_0,y_0, z_0$ are given positive numbers. Prove that these sequences are unbounded.
Oliforum Contest I 2008, 1
Consider the sequence of integer such that:
$ a_1 = 2$
$ a_2 = 5$
$ a_{n + 1} = (2 - n^2)a_n + (2 + n^2)a_{n - 1}, \forall n\ge 2$
Find all triplies $ (x,y,z) \in \mathbb{N}^3$ such that $ a_xa_y = a_z$.
1989 Poland - Second Round, 5
Given a sequence $ (c_n) $ of natural numbers defined recursively: $ c_1 = 2 $, $ c_{n+1} = \left[ \frac{3}{2}c_n\right] $. Prove that there are infinitely many even numbers and infinitely many odd numbers among the terms of this sequence.
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$.
2019 Saudi Arabia BMO TST, 2
Let sequences of real numbers $(x_n)$ and $(y_n)$ satisfy $x_1 = y_1 = 1$ and $x_{n+1} =\frac{x_n + 2}{x_n + 1}$ and $y_{n+1} = \frac{y_n^2 + 2}{2y_n}$ for $n = 1,2, ...$ Prove that $y_{n+1} = x_{2^n}$ holds for $n =0, 1,2, ... $
2007 Germany Team Selection Test, 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]
2022 Switzerland - Final Round, 5
For an integer $a \ge 2$, denote by $\delta_(a) $ the second largest divisor of $a$. Let $(a_n)_{n\ge 1}$ be a sequence
of integers such that $a_1 \ge 2$ and $$a_{n+1} = a_n + \delta_(a_n)$$
for all $n \ge 1$. Prove that there exists a positive integer $k$ such that $a_k$ is divisible by $3^{2022}$.
2017 Federal Competition For Advanced Students, P2, 3
Let $(a_n)_{n\ge 0}$ be the sequence of rational numbers with $a_0 = 2016$ and $a_{n+1} = a_n + \frac{2}{a_n}$ for all $n \ge 0$.
Show that the sequence does not contain a square of a rational number.
Proposed by Theresia Eisenkölbl
1984 Putnam, B1
Let $n$ be a positive integer, and define $f(n)=1!+2!+\ldots+n!$. Find polynomials $P$ and $Q$ such that
$$f(n+2)=P(n)f(n+1)+Q(n)f(n)$$for all $n\ge1$.
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}$.
1971 IMO Shortlist, 9
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.$
1977 IMO Longlists, 28
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 ]\]
1989 Austrian-Polish Competition, 7
Functions $f_0, f_1,f_2,...$ are recursively defined by
$f_0(x) = x$ and $f_{2k+1} (x) = 3^{f_{2k}(x)}$ and $f_{2k+2} = 2^{f_{2k+1}(x)}$, $k = 0,1,2,...$ for all $x \in R$.
Find the greater one of the numbers $f_{10}(1)$ and $f_9(2)$.
2009 Postal Coaching, 1
Let $a_1, a_2, a_3, . . . , a_n, . . . $ be an infinite sequence of natural numbers in which $a_1$ is not divisible by $5$. Suppose $a_{n+1} = a_n + b_n$ where bn is the last digit of $a_n$, for every $n$. Prove that the sequence $\{a_n\}$ contains infinitely many powers of 2.
1997 Singapore Team Selection Test, 3
Suppose the numbers $a_0, a_1, a_2, ... , a_n$ satisfy the following conditions:
$a_0 =\frac12$, $a_{k+1} = a_k +\frac{1}{n}a_k^2$ for $k = 0, 1, ... , n - 1$.
Prove that $1 - \frac{1}{n}< a_n < 1$
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$.
1972 Czech and Slovak Olympiad III A, 3
Consider a sequence of polynomials such that $P_0(x)=2,P_1(x)=x$ and for all $n\ge1$ \[P_{n+1}(x)+P_{n-1}(x)=xP_n(x).\]
a) Determine the polynomial \[Q_n(x)=P^2_n(x)-xP_n(x)P_{n-1}(x)+P^2_{n-1}(x)\] for $n=1972.$
b) Express the polynomial \[\bigl(P_{n+1}(x)-P_{n-1}(x)\bigr)^2\] in terms of $P_n(x),Q_n(x).$
1997 Tournament Of Towns, (551) 1
The sequence $x_1,x_2, ...$ is defined by the following equations:
$$x_1=19, \ \ x_2=97, \ \ x_{n+2} =x_n - \frac{1}{x_{n+1}}$$
for $n \ge 1$. Prove that there exists a positive integer $k$ such that $x_k=0$ and find $k$.
(A Berzinsh)
1977 IMO Shortlist, 11
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 ]\]