Found problems: 1239
1961 All Russian Mathematical Olympiad, 011
Prove that for three arbitrary infinite sequences, of natural numbers $a_1,a_2,...,a_n,... $ , $b_1,b_2,...,b_n,... $, $c_1,c_2,...,c_n,...$ there exist numbers $p$ and $q$ such, that $a_p \ge a_q$, $b_p \ge b_q$ and $c_p \ge c_q$.
1996 Yugoslav Team Selection Test, Problem 3
The sequence $\{x_n\}$ is given by
$$x_n=\frac14\left(\left(2+\sqrt3\right)^{2n-1}+\left(2-\sqrt3\right)^{2n-1}\right),\qquad n\in\mathbb N.$$Prove that each $x_n$ is equal to the sum of squares of two consecutive integers.
2020 Kosovo National Mathematical Olympiad, 4
Let $a_0$ be a fixed positive integer. We define an infinite sequence of positive integers $\{a_n\}_{n\ge 1}$ in an inductive way as follows: if we are given the terms $a_0,a_1,...a_{n-1}$ , then $a_n$ is the smallest positive integer such that $\sqrt[n]{a_0\cdot a_1\cdot ...\cdot a_n}$ is a positive integer. Show that the sequence $\{a_n\}_{n\ge 1}$ is eventually constant.
[b]Note:[/b] The sequence $\{a_n\}_{n\ge 1}$ is eventually constant if there exists a positive integer $k$ such that $a_n=c$, for every $n\ge k$.
2004 Austrian-Polish Competition, 9
Given are the sequences
\[ (..., a_{-2}, a_{-1}, a_0, a_1, a_2, ...); (..., b_{-2}, b_{-1}, b_0, b_1, b_2, ...); (..., c_{-2}, c_{-1}, c_0, c_1, c_2, ...)\]
of positive real numbers. For each integer $n$ the following inequalities hold:
\[a_n \geq \frac{1}{2} (b_{n+1} + c_{n-1})\]
\[b_n \geq \frac{1}{2} (c_{n+1} + a_{n-1})\]
\[c_n \geq \frac{1}{2} (a_{n+1} + b_{n-1})\]
Determine $a_{2005}$, $b_{2005}$, $c_{2005}$, if $a_0 = 26, b_0 = 6, c_0 = 2004$.
2013 Denmark MO - Mohr Contest, 3
A sequence $x_0, x_1, x_2, . . .$ is given by $x_0 = 8$ and $x_{n+1} =\frac{1 + x_n}{1- x_n}$ for $n = 0, 1, 2, . . . .$ Determine the number $x_{2013}$.
1982 All Soviet Union Mathematical Olympiad, 344
Given a sequence of real numbers $a_1, a_2, ... , a_n$. Prove that it is possible to choose some of the numbers providing $3$ conditions:
a) not a triple of successive members is chosen,
b) at least one of every triple of successive members is chosen,
c) the absolute value of chosen numbers sum is not less that one sixth part of the initial numbers' absolute values sum.
2007 Nicolae Coculescu, 2
Let $ F:\mathbb{R}\longrightarrow\mathbb{R} $ be a primitive with $ F(0)=0 $ of the function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ defined by $ f(x)=\frac{x}{1+e^x} , $ and let be a sequence $ \left( x_n \right)_{n\ge 0} $ such that $ x_0>0 $ and defined as $ x_n=F\left( x_{n-1} \right) . $
Calculate $ \lim_{n\to\infty } \frac{1}{n}\sum_{k=1}^n \frac{x_k}{\sqrt{x_{k+1}}} $
[i]Florian Dumitrel[/i]
2017 Kazakhstan National Olympiad, 3
$\{a_n\}$ is an infinite, strictly increasing sequence of positive integers and $a_{a_n}\leq a_n+a_{n+3}$ for all $n\geq 1$. Prove that, there are infinitely many triples $(k,l,m)$ of positive integers such that $k<l<m$ and $a_k+a_m=2a_l$
2009 IMO Shortlist, 4
Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$,$\ldots$, $a_n$ satisfying: \[a_{k+1}=\frac{a_k^2+1}{a_{k-1}+1}-1\] for every $k$ with $2\leq k\leq n-1$.
[i]Proposed by North Korea[/i]
2023 Olimphíada, 2
The Fibonacci sequence is defined by $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for every integer $n$. A sequence $(a_n)$ of integers is said to be $\textit{phirme}$ if there is a fixed integer $k$ such that $a_n + a_{n+1} = F_{n+k}$ for all $n \geq 1$. Show that if $(a_n)$ is a $\textit{phirme}$ sequence, then there exists an integer $c$ such that $$a_n = F_{n+k-2} + (-1)^nc.$$
2020 Kyiv Mathematical Festival, 1.1
(a) Find the numbers $a_0,. . . , a_{100}$, such that $a_0 = 0, a_{100} = 1$ and for all $k = 1,. . . , 99$ :
$$a_k = \frac12 a_{k- 1} + \frac12 a_{k+1 }$$
(b) Find the numbers $a_0,. . . , a_{100}$, such that $a_0 = 0, a_{100} = 1$ and for all $k = 1,. . . , 99$ :
$$a_k = 1+\frac12 a_{k- 1} + \frac12 a_{k+1 }$$.
2016 IFYM, Sozopol, 2
Let $a_0,a_1,a_2...$ be a sequence of natural numbers with the following property: $a_n^2$ divides $a_{n-1} a_{n+1}$ for $\forall$ $n\in \mathbb{N}$. Prove that, if for some natural $k\geq 2$ the numbers $a_1$ and $a_k$ are coprime, then $a_1$ divides $a_0$.
1989 Greece National Olympiad, 3
Find the limit of the sequence $x_n$ defined by recurrence relation $$x_{n+2}=\frac{1}{12}x_{n+1}+\frac{1}{2}x_{n}+1$$ where $n=0,1,2,...$ for any initial values $x_2,x_1$.
2000 Moldova National Olympiad, Problem 7
The Fibonacci sequence is defined by $F_0=F_1=1$ and $F_{n+2}=F_{n+1}+F_n$ for $n\ge0$. Prove that the sum of $2000$ consecutive terms of the Fibonacci sequence is never a term of the sequence.
2010 Ukraine Team Selection Test, 8
Consider an infinite sequence of positive integers in which each positive integer occurs exactly once. Let $\{a_n\}, n\ge 1$ be such a sequence. We call it [i]consistent [/i] if, for an arbitrary natural $k$ and every natural $n ,m$ such that $a_n <a_m$, the inequality $a_{kn} <a _{km}$ also holds. For example, the sequence $a_n = n$ is consistent .
a) Prove that there are consistent sequences other than $a_n = n$.
b) Are there consistent sequences for which $a_n \ne n, n\ge 2$ ?
c) Are there consistent sequences for which $a n \ne n, n\ge 1$ ?
2025 Alborz Mathematical Olympiad, P3
For every positive integer \( n \), do there exist pairwise distinct positive integers \( a_1, a_2, \dots, a_n \) that satisfy the following condition?
For every \( 3 \leq m \leq n \), there exists an \( i \leq m-2 \) such that:
$$
a_m = a_{\gcd(m-1, i)} + \gcd(a_{m-1}, a_i).
$$
Proposed by Alireza Jannati
2006 VTRMC, Problem 5
Let $\{a_n\}$ be a monotonically decreasing sequence of positive real numbers with limit $0$. Let $\{b_n\}$ be a rearrangement of the sequence such that for every non-negative integer $m$, the terms $b_{3m+1}$, $b_{3m+2}$, $b_{3m+3}$ are a rearrangement of the terms $a_{3m+1}$, $a_{3m+2}$, $a_{3m+3}$. Prove or give a counterexample to the following statement: the series $\sum_{n=1}^\infty(-1)^nb_n$ is convergent.
2008 Germany Team Selection Test, 1
Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions:
\[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n;
\]
\[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n.
\]
[i]Author: Dusan Dukic, Serbia[/i]
2011 N.N. Mihăileanu Individual, 4
[b]a)[/b] Prove that there exists an unique sequence of real numbers $ \left( x_n \right)_{n\ge 1} $ satisfying
$$ -\text{ctg} x_n=x_n\in\left( (2n+1)\pi /2,(n+1)\pi \right) , $$
for any nonnegative integer $ n. $
[b]b)[/b] Show that $ \lim_{n\to\infty } \left( \frac{x_n}{(n+1)\pi } \right)^{n^2} =e^{-1/\pi^2} . $
[i]Cătălin Zârnă[/i]
2018 South Africa National Olympiad, 5
Determine all sequences $a_1, a_2, a_3, \dots$ of nonnegative integers such that $a_1 < a_2 < a_3 < \dots$ and $a_n$ divides $a_{n - 1} + n$ for all $n \geq 2$.
1968 All Soviet Union Mathematical Olympiad, 109
Two finite sequences $a_1,a_2,...,a_n,b_1,b_2,...,b_n$ are just rearranged sequence $1, 1/2, ... , 1/n$ with $$a_1+b_1\ge a_2+b_2\ge...\ge a_n+b_n.$$ Prove that $a_m+a_n\ge 4/m$ for every $m$ ($1\le m\le n$) .
1983 IMO Shortlist, 19
Let $(F_n)_{n\geq 1} $ be the Fibonacci sequence $F_1 = F_2 = 1, F_{n+2} = F_{n+1} + F_n (n \geq 1),$ and $P(x)$ the polynomial of degree $990$ satisfying
\[ P(k) = F_k, \qquad \text{ for } k = 992, . . . , 1982.\]
Prove that $P(1983) = F_{1983} - 1.$
2012 Indonesia TST, 1
The sequence $a_i$ is defined as $a_1 = 2, a_2 = 3$, and
$a_{n+1} = 2a_{n-1}$ or $a_{n+1} = 3a_n - 2a_{n-1}$ for all integers $n \ge 2$.
Prove that no term in $a_i$ is in the range $[1612, 2012]$.
2023 Brazil Cono Sur TST, 4
Let $p$ be a prime number. Determine all positive integers $a$ such that the sequence $(a_n)_{n\geq 0}$ defined by $a_0=a$ and $a_{n+1}=pa_n-(p-1)\lfloor \sqrt[p]{a_ n} \rfloor^p$, for every $n\geq0$, is eventually constant.
2025 Vietnam National Olympiad, 1
Let $P(x) = x^4-x^3+x$.
a) Prove that for all positive real numbers $a$, the polynomial $P(x) - a$ has a unique positive zero.
b) A sequence $(a_n)$ is defined by $a_1 = \dfrac{1}{3}$ and for all $n \geq 1$, $a_{n+1}$ is the positive zero of the polynomial $P(x) - a_n$. Prove that the sequence $(a_n)$ converges, and find the limit of the sequence.