Found problems: 1239
2017 Kazakhstan NMO, Problem 3
An infinite, strictly increasing sequence $\{a_n\}$ of positive integers satisfies the condition $a_{a_n}\le a_n + a_{n + 3}$ for all $n\ge 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$.
2019 Serbia National Math Olympiad, 6
Sequences $(a_n)_{n=0}^{\infty}$ and $(b_n)_{n=0}^{\infty}$ are defined with recurrent relations :
$$a_0=0 , \;\;\; a_1=1, \;\;\;\; a_{n+1}=\frac{2018}{n} a_n+ a_{n-1}\;\;\; \text {for }\;\;\; n\geq 1$$ and
$$b_0=0 , \;\;\; b_1=1, \;\;\;\; b_{n+1}=\frac{2020}{n} b_n+ b_{n-1}\;\;\; \text {for }\;\;\; n\geq 1$$
Prove that :$$\frac{a_{1010}}{1010}=\frac{b_{1009}}{1009}$$
1986 ITAMO, 2
Determine the general term of the sequence ($a_n$) given by $a_0 =\alpha > 0$ and $a_{n+1} =\frac{a_n}{1+a_n}$
.
1985 Tournament Of Towns, (102) 6
The numerical sequence $x_1 , x_2 ,.. $ satisfies $x_1 = \frac12$ and $x_{k+1} =x^2_k+x_k$ for all natural integers $k$ . Find the integer part of the sum $\frac{1}{x_1+1}+\frac{1}{x_2+1}+...+\frac{1}{x_{100}+1}$
{A. Andjans, Riga)
2010 IMO Shortlist, 4
A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$
[i]Proposed by Gerhard Wöginger, Austria[/i]
1975 All Soviet Union Mathematical Olympiad, 217
Given a polynomial $P(x)$ with
a) natural coefficients;
b) integer coefficients;
Let us denote with $a_n$ the sum of the digits of $P(n)$ value. Prove that there is a number encountered in the sequence $a_1, a_2, ... , a_n, ...$ infinite times.
1981 Bundeswettbewerb Mathematik, 1
A sequence $a_1, a_2, a_3, \ldots $ is defined as follows: $a_1$ is a positive integer and
$$a_{n+1} = \left\lfloor \frac{3}{2} a_n \right\rfloor +1$$
for all $n \in \mathbb{N}$. Can $a_1$ be chosen in such a way that the first $100000$ terms of the sequence are even, but the $100001$-th term is odd?
1978 Germany Team Selection Test, 4
Let $B$ be a set of $k$ sequences each having $n$ terms equal to $1$ or $-1$. The product of two such sequences $(a_1, a_2, \ldots , a_n)$ and $(b_1, b_2, \ldots , b_n)$ is defined as $(a_1b_1, a_2b_2, \ldots , a_nb_n)$. Prove that there exists a sequence $(c_1, c_2, \ldots , c_n)$ such that the intersection of $B$ and the set containing all sequences from $B$ multiplied by $(c_1, c_2, \ldots , c_n)$ contains at most $\frac{k^2}{2^n}$ sequences.
2019 District Olympiad, 4
Let $f: [0, \infty) \to [0, \infty)$ be a continuous function with $f(0)>0$ and having the property $$x-y<f(y)-f(x) \le 0~\forall~0 \le x<y.$$ Prove that:
$a)$ There exists a unique $\alpha \in (0, \infty)$ such that $(f \circ f)(\alpha)=\alpha.$
$b)$ The sequence $(x_n)_{n \ge 1},$ defined by $x_1 \ge 0$ and $x_{n+1}=f(x_n)~\forall~n \in \mathbb{N}$ is convergent.
2015 District Olympiad, 4
Let $ \left( x_n\right)_{n\ge 1} $ be a sequence of real numbers of the interval $ [1,\infty) . $ Suppose that the sequence $ \left( \left[ x_n^k\right]\right)_{n\ge 1} $ is convergent for all natural numbers $ k. $ Prove that $ \left( x_n\right)_{n\ge 1} $ is convergent.
Here, $ [\beta ] $ means the greatest integer smaller than $ \beta . $
2021 Taiwan TST Round 1, N
Given a positive integer $k$ show that there exists a prime $p$ such that one can choose distinct integers $a_1,a_2\cdots, a_{k+3} \in \{1, 2, \cdots ,p-1\}$ such that p divides $a_ia_{i+1}a_{i+2}a_{i+3}-i$ for all $i= 1, 2, \cdots, k$.
[i]South Africa [/i]
1991 IMO Shortlist, 25
Suppose that $ n \geq 2$ and $ x_1, x_2, \ldots, x_n$ are real numbers between 0 and 1 (inclusive). Prove that for some index $ i$ between $ 1$ and $ n \minus{} 1$ the
inequality
\[ x_i (1 \minus{} x_{i\plus{}1}) \geq \frac{1}{4} x_1 (1 \minus{} x_{n})\]
2004 IMO Shortlist, 4
Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$.
[i]Proposed by Jaroslaw Wroblewski, Poland[/i]
2013 Singapore Senior Math Olympiad, 3
Let $b_1,b_2,... $ be a sequence of positive real numbers such that for each $ n\ge 1$, $$b_{n+1}^2 \ge \frac{b_1^2}{1^3}+\frac{b_2^2}{2^3}+...+\frac{b_n^2}{n^3}$$
Show that there is a positive integer $M$ such that $$\sum_{n=1}^M \frac{b_{n+1}}{b_1+b_2+...+b_n} > \frac{2013}{1013}$$
2009 Germany Team Selection Test, 2
Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$.
[i]Proposed by Mohsen Jamaali, Iran[/i]
2005 Germany Team Selection Test, 1
Let $a_0$, $a_1$, $a_2$, ... be an infinite sequence of real numbers satisfying the equation $a_n=\left|a_{n+1}-a_{n+2}\right|$ for all $n\geq 0$, where $a_0$ and $a_1$ are two different positive reals.
Can this sequence $a_0$, $a_1$, $a_2$, ... be bounded?
[i]Proposed by Mihai Bălună, Romania[/i]
1980 All Soviet Union Mathematical Olympiad, 303
The number $x$ from $[0,1]$ is written as an infinite decimal fraction. Having rearranged its first five digits after the point we can obtain another fraction that corresponds to the number $x_1$. Having rearranged five digits of $x_k$ from $(k+1)$-th till $(k+5)$-th after the point we obtain the number $x_{k+1}$.
a) Prove that the sequence $x_i$ has limit.
b) Can this limit be irrational if we have started with the rational number?
c) Invent such a number, that always produces irrational numbers, no matter what digits were transposed.
2015 Bulgaria National Olympiad, 3
The sequence $a_1, a_2,...$ is de fined by the equalities $a_1 = 2, a_2 = 12$ and $a_{n+1} = 6a_n-a_{n-1}$ for every positive integer $n \ge 2$. Prove that no member of this sequence is equal to a perfect power (greater than one) of a positive integer.
2024 Middle European Mathematical Olympiad, 1
Consider two infinite sequences $a_0,a_1,a_2,\dots$ and $b_0,b_1,b_2,\dots$ of real numbers such that $a_0=0$, $b_0=0$ and
\[a_{k+1}=b_k, \quad b_{k+1}=\frac{a_kb_k+a_k+1}{b_k+1}\]
for each integer $k \ge 0$. Prove that $a_{2024}+b_{2024} \ge 88$.
1992 IMO Longlists, 62
Let $c_1, \cdots, c_n \ (n \geq 2)$ be real numbers such that $0 \leq \sum c_i \leq n$. Prove that there exist integers $k_1, \cdots , k_n$ such that $\sum k_i=0$ and $1-n \leq c_i + nk_i \leq n$ for every $i = 1, \cdots , n.$
1948 Putnam, A3
Let $(a_n)$ be a decreasing sequence of positive numbers with limit $0$ such that
$$b_n = a_n -2 a_{n+1}+a_{n+2} \geq 0$$
for all $n.$ Prove that
$$\sum_{n=1}^{\infty} n b_n =a_1.$$
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.\]
2018 Swedish Mathematical Competition, 3
Let m be a positive integer. An $m$-[i]pattern [/i] is a sequence of $m$ symbols of strict inequalities. An $m$-pattern is said to be [i]realized [/i] by a sequence of $m + 1$ real numbers when the numbers meet each of the inequalities in the given order. (For example, the $5$-pattern $ <, <,>, < ,>$ is realized by the sequence of numbers $1, 4, 7, -3, 1, 0$.)
Given $m$, which is the least integer $n$ for which there exists any number sequence $x_1,... , x_n$ such that each $m$-pattern is realized by a subsequence $x_{i_1},... , x_{i_{m + 1}}$ with $1 \le i_1 <... < i_{m + 1} \le n$?
2016 Peru IMO TST, 2
Determine how many $100$-positive integer sequences satisfy the two conditions following:
- At least one term of the sequence is equal to $4$ or $5$.
- Any two adjacent terms differ as a maximum in $2$.
1984 All Soviet Union Mathematical Olympiad, 389
Given a sequence $\{x_n\}$, $$x_1 = x_2 = 1, x_{n+2} = x^2_{n+1} - \frac{x_n}{2}$$ Prove that the sequence has limit and find it.