Found problems: 1239
2015 IMC, 3
Let $F(0)=0$, $F(1)=\frac32$, and $F(n)=\frac{5}{2}F(n-1)-F(n-2)$
for $n\ge2$.
Determine whether or not $\displaystyle{\sum_{n=0}^{\infty}\,
\frac{1}{F(2^n)}}$ is a rational number.
(Proposed by Gerhard Woeginger, Eindhoven University of Technology)
2022 Brazil Team Selection Test, 4
Let $a_1,a_2,a_3,\ldots$ be an infinite sequence of positive integers such that $a_{n+2m}$ divides $a_{n}+a_{n+m}$ for all positive integers $n$ and $m.$ Prove that this sequence is eventually periodic, i.e. there exist positive integers $N$ and $d$ such that $a_n=a_{n+d}$ for all $n>N.$
2016 Korea USCM, 2
Suppose $\{a_n\}$ is a decreasing sequence of reals and $\lim\limits_{n\to\infty} a_n = 0$. If $S_{2^k} - 2^k a_{2^k} \leq 1$ for any positive integer $k$, show that
$$\sum_{n=1}^{\infty} a_n \leq 1$$
(At here, $S_m = \sum_{n=1}^m a_n$ is a partial sum of $\{a_n\}$.)
2022 China Girls Math Olympiad, 1
Consider all the real sequences $x_0,x_1,\cdots,x_{100}$ satisfying the following two requirements:
(1)$x_0=0$;
(2)For any integer $i,1\leq i\leq 100$,we have $1\leq x_i-x_{i-1}\leq 2$.
Find the greatest positive integer $k\leq 100$,so that for any sequence $x_0,x_1,\cdots,x_{100}$ like this,we have
\[x_k+x_{k+1}+\cdots+x_{100}\geq x_0+x_1+\cdots+x_{k-1}.\]
2010 Dutch IMO TST, 1
Consider sequences $a_1, a_2, a_3,...$ of positive integers. Determine the smallest possible value of $a_{2010}$ if
(i) $a_n < a_{n+1}$ for all $n\ge 1$,
(ii) $a_i + a_l > a_j + a_k$ for all quadruples $ (i, j, k, l)$ which satisfy $1 \le i < j \le k < l$.
2014 Cezar Ivănescu, 1
For a sequence $ \left( x_n \right)_{n\ge 1} $ of real numbers that are at least $ 1, $ prove that the series $ \sum_{i=1}^{\infty } \frac{1}{x_i} $ converges if and only if the series $ \sum_{i=1}^{\infty } \frac{1}{1+x_i} $ converges if and only if the series $ \sum_{i=1}^{\infty } \frac{1}{\lfloor x_i\rfloor } $ converges.
1978 All Soviet Union Mathematical Olympiad, 257
Prove that there exists such an infinite sequence $\{x_i\}$, that for all $m$ and all $k$ ($m\ne k$) holds the inequality $$|x_m-x_k|>1/|m-k|$$
2011 SEEMOUS, Problem 4
Let $f:[0,1]\to\mathbb R$ be a twice continuously differentiable increasing function. Define the sequences given by $L_n=\frac1n\sum_{k=0}^{n-1}f\left(\frac kn\right)$ and $U_n=\frac1n\sum_{k=0}^nf\left(\frac kn\right)$, $n\ge1$. 1. The interval $[L_n,U_n]$ is divided into three equal segments. Prove that, for large enough $n$, the number $I=\int^1_0f(x)\text dx$ belongs to the middle one of these three segments.
2025 Turkey Team Selection Test, 8
A positive real number sequence $a_1, a_2, a_3,\dots $ and a positive integer \(s\) is given.
Let $f_n(0) = \frac{a_n+\dots+a_1}{n}$ and for each $0<k<n$
\[f_n(k)=\frac{a_n+\dots+a_{k+1}}{n-k}-\frac{a_k+\dots+a_1}{k}\]
Then for every integer $n\geq s,$ the condition
\[a_{n+1}=\max_{0\leq k<n}(f_n(k))\]
is satisfied. Prove that this sequence must be eventually constant.
2005 Germany Team Selection Test, 1
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]
2021 SAFEST Olympiad, 2
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]
2007 Germany Team Selection Test, 1
The sequence of real numbers $a_0,a_1,a_2,\ldots$ is defined recursively by \[a_0=-1,\qquad\sum_{k=0}^n\dfrac{a_{n-k}}{k+1}=0\quad\text{for}\quad n\geq 1.\]Show that $ a_{n} > 0$ for all $ n\geq 1$.
[i]Proposed by Mariusz Skalba, Poland[/i]
1985 IMO, 6
For every real number $x_1$, construct the sequence $x_1,x_2,\ldots$ by setting: \[ x_{n+1}=x_n(x_n+{1\over n}). \] Prove that there exists exactly one value of $x_1$ which gives $0<x_n<x_{n+1}<1$ for all $n$.
2016 Taiwan TST Round 3, 2
Let $k$ be a positive integer. A sequence $a_0,a_1,...,a_n,n>0$ of positive integers satisfies the following conditions:
$(i)$ $a_0=a_n=1$;
$(ii)$ $2\leq a_i\leq k$ for each $i=1,2,...,n-1$;
$(iii)$For each $j=2,3,...,k$, the number $j$ appears $\phi(j)$ times in the sequence $a_0,a_1,...,a_n$, where $\phi(j)$ is the number of positive integers that do not exceed $j$ and are coprime to $j$;
$(iv)$For any $i=1,2,...,n-1$, $\gcd(a_i,a_{i-1})=1=\gcd(a_i,a_{i+1})$, and $a_i$ divides $a_{i-1}+a_{i+1}$.
Suppose there is another sequence $b_0,b_1,...,b_n$ of integers such that $\frac{b_{i+1}}{a_{i+1}}>\frac{b_i}{a_i}$ for all $i=0,1,...,n-1$. Find the minimum value of $b_n-b_0$.
1997 IMO Shortlist, 2
Let $ R_1,R_2, \ldots$ be the family of finite sequences of positive integers defined by the following rules: $ R_1 \equal{} (1),$ and if $ R_{n - 1} \equal{} (x_1, \ldots, x_s),$ then
\[ R_n \equal{} (1, 2, \ldots, x_1, 1, 2, \ldots, x_2, \ldots, 1, 2, \ldots, x_s, n).\]
For example, $ R_2 \equal{} (1, 2),$ $ R_3 \equal{} (1, 1, 2, 3),$ $ R_4 \equal{} (1, 1, 1, 2, 1, 2, 3, 4).$ Prove that if $ n > 1,$ then the $ k$th term from the left in $ R_n$ is equal to 1 if and only if the $ k$th term from the right in $ R_n$ is different from 1.
1977 Vietnam National Olympiad, 5
The real numbers $a_0, a_1, ... , a_{n+1}$ satisfy $a_0 = a_{n+1} = 0$ and $|a_{k-1} - 2a_k + a_{k+1}| \le 1$ for $k = 1, 2, ... , n$. Show that $|a_k| \le \frac{ k(n + 1 - k)}{2}$ for all $k$.
2018 Korea USCM, 8
Suppose a sequence of reals $\{a_n\}_{n\geq 0}$ satisfies $a_0 = 0$, $\frac{100}{101} <a_{100}<1$, and
$$2a_n - a_{n-1} -a_{n+1} \leq 2 (1-a_n )^3$$
for every $n\geq 1$.
(1) Define a sequence $b_n = a_n - \frac{n}{n+1}$. Prove that $b_n\leq b_{n+1}$ for any $n\geq 100$.
(2) Determine whether infinite series $\sum_{n=1}^\infty \frac{a_n}{n^2}$ converges or diverges.
1967 IMO Shortlist, 6
Given a segment $AB$ of the length 1, define the set $M$ of points in the
following way: it contains two points $A,B,$ and also all points obtained from $A,B$ by iterating the following rule: With every pair of points $X,Y$ the set $M$ contains also the point $Z$ of the segment $XY$ for which $YZ = 3XZ.$
2018 India IMO Training Camp, 2
Let $n\ge 2$ be a natural number. Let $a_1\le a_2\le a_3\le \cdots \le a_n$ be real numbers such that $a_1+a_2+\cdots +a_n>0$ and $n(a_1^2+a_2^2+\cdots +a_n^2)=2(a_1+a_2+\cdots +a_n)^2.$ If $m=\lfloor n/2\rfloor+1$, the smallest integer larger than $n/2$, then show that $a_m>0.$
2001 Moldova National Olympiad, Problem 2
Let $m\ge2$ be an integer. The sequence $(a_n)_{n\in\mathbb N}$ is defined by $a_0=0$ and $a_n=\left\lfloor\frac nm\right\rfloor+a_{\left\lfloor\frac nm\right\rfloor}$ for all $n$. Determine $\lim_{n\to\infty}\frac{a_n}n$.
2018 VTRMC, 6
For $n \in \mathbb{N}$, define $a_n = \frac{1 + 1/3 + 1/5 + \dots + 1/(2n-1)}{n+1}$ and $b_n = \frac{1/2 + 1/4 + 1/6 + \dots + 1/(2n)}{n}$. Find the maximum and minimum of $a_n - b_n$ for $1 \leq n \leq 999$.
2021 JBMO Shortlist, A2
Let $n > 3$ be a positive integer. Find all integers $k$ such that $1 \le k \le n$ and for
which the following property holds:
If $x_1, . . . , x_n$ are $n$ real numbers such that $x_i + x_{i + 1} + ... + x_{i + k - 1} = 0$ for all integers $i > 1$ (indexes are taken modulo $n$), then $x_1 = . . . = x_n = 0$.
Proposed by [i]Vincent Jugé and Théo Lenoir, France[/i]
2022 Nigerian Senior MO Round 2, Problem 4
Define sequence $(a_{n})_{n=1}^{\infty}$ by $a_1=a_2=a_3=1$ and $a_{n+3}=a_{n+1}+a_{n}$ for all $n \geq 1$. Also, define sequence $(b_{n})_{n=1}^{\infty}$ by $b_1=b_2=b_3=b_4=b_5=1$ and $b_{n+5}=b_{n+4}+b_{n}$ for all $n \geq 1$. Prove that $\exists N \in \mathbb{N}$ such that $a_n = b_{n+1} + b_{n-8}$ for all $n \geq N$.
1996 Greece National Olympiad, 1
Let $a_n$ be a sequence of positive numbers such that:
i) $\dfrac{a_{n+2}}{a_n}=\dfrac{1}{4}$, for every $n\in\mathbb{N}^{\star}$
ii) $\dfrac{a_{k+1}}{a_k}+\dfrac{a_{n+1}}{a_n}=1$, for every $ k,n\in\mathbb{N}^{\star}$ with $|k-n|\neq 1$.
(a) Prove that $(a_n)$ is a geometric progression.
(n) Prove that exists $t>0$, such that $\sqrt{a_{n+1}}\leq \dfrac{1}{2}a_n+t$
2016 Lusophon Mathematical Olympiad, 5
A numerical sequence is called lusophone if it satisfies the following three conditions:
i) The first term of the sequence is number $1$.
ii) To obtain the next term of the sequence we can multiply the previous term by a positive prime number ($2,3,5,7,11, ...$) or add $1$.
(iii) The last term of the sequence is the number $2016$.
For example: $1\overset{{\times 11}}{\to}11 \overset{{\times 61}}{\to} 671 \overset{{+1}}{\to}672 \overset{{\times 3}}{\to}2016$
How many Lusophone sequences exist in which (as in the example above) the add $1$ operation was used exactly once and not multiplied twice by the same prime number?