Found problems: 963
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|$$
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]
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.$
2022 Belarus - Iran Friendly Competition, 1
Do there exist a sequence $a_1, a_2, \ldots , a_n, \ldots$ of positive integers such that for any
positive integers $i, j$:
$$d(a_i + a_j ) = i + j?$$
Here $d(n)$ is the number of positive divisors of a positive integer
2000 Tournament Of Towns, 4
(a) Does there exist an infinite sequence of real numbers such that the sum of every ten successive numbers is positive, while for every $n$ the sum of the first $10n + 1$ successive numbers is negative?
(b) Does there exist an infinite sequence of integers with the same properties?
(AK Tolpygo)
1973 Dutch Mathematical Olympiad, 4
We have an infinite sequence of real numbers $x_0,x_1, x_2, ... $ such that $x_{n+1} = \sqrt{x_n -\frac14}$ holds for all natural $n$ and moreover $x_0 \in \frac12$.
(a) Prove that for every natural $n$ holds: $x_n > \frac12$
(b) Prove that $\lim_{n \to \infty} x_n$ exists. Calculate this limit.
2019 Mediterranean Mathematics Olympiad, 2
Let $m_1<m_2<\cdots<m_s$ be a sequence of $s\ge2$ positive integers, none of which can be written as the sum of (two or more) distinct other numbers in the sequence. For every integer $r$ with $1\le r<s$, prove that
\[ r\cdot m_r+m_s ~\ge~ (r+1)(s-1). \]
(Proposed by Gerhard Woeginger, Austria)
2020 Baltic Way, 3
A real sequence $(a_n)_{n=0}^\infty$ is defined recursively by $a_0 = 2$ and the recursion formula
$$
a_{n} =
\begin{dcases}
a_{n-1}^2 & \text{if $a_{n-1}<\sqrt3$} \\
\frac{a_{n-1}^2}{3} & \text{if $a_{n-1}\geq\sqrt 3$.}
\end{dcases}
$$
Another real sequence $(b_n)_{n=1}^\infty$ is defined in terms of the first by the formula
$$
b_{n} =
\begin{dcases}
0 & \text{if $a_{n-1}<\sqrt3$} \\
\frac{1}{2^{n}} & \text{if $a_{n-1}\geq\sqrt 3$,}
\end{dcases}
$$
valid for each $n\geq 1$. Prove that
$$
b_1 + b_2 + \cdots + b_{2020} < \frac23.
$$
2009 Belarus 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]
1983 IMO Shortlist, 16
Let $F(n)$ be the set of polynomials $P(x) = a_0+a_1x+\cdots+a_nx^n$, with $a_0, a_1, . . . , a_n \in \mathbb R$ and $0 \leq a_0 = a_n \leq a_1 = a_{n-1 } \leq \cdots \leq a_{[n/2] }= a_{[(n+1)/2]}.$ Prove that if $f \in F(m)$ and $g \in F(n)$, then $fg \in F(m + n).$
1992 IMO Shortlist, 14
For any positive integer $ x$ define $ g(x)$ as greatest odd divisor of $ x,$ and
\[ f(x) \equal{} \begin{cases} \frac {x}{2} \plus{} \frac {x}{g(x)} & \text{if \ \(x\) is even}, \\
2^{\frac {x \plus{} 1}{2}} & \text{if \ \(x\) is odd}. \end{cases}
\]
Construct the sequence $ x_1 \equal{} 1, x_{n \plus{} 1} \equal{} f(x_n).$ Show that the number 1992 appears in this sequence, determine the least $ n$ such that $ x_n \equal{} 1992,$ and determine whether $ n$ is unique.
1966 Swedish Mathematical Competition, 1
Let $\{x\}$ denote the fractional part of $x$, $x - [x]$. The sequences $x_1, x_2, x_3, ...$ and $y_1, y_2, y_3, ...$ are such that $\lim \{x_n\} = \lim \{y_n\} = 0$. Is it true that $\lim \{x_n + y_n\} = 0$? $\lim \{x_n - y_n\} = 0$?
2018 China Northern MO, 6
For $a_1 = 3$, define the sequence $a_1, a_2, a_3, \ldots$ for $n \geq 1$ as $$na_{n+1}=2(n+1)a_n-n-2.$$
Prove that for any odd prime $p$, there exist positive integer $m,$ such that $p|a_m$ and $p|a_{m+1}.$
2016 ITAMO, 5
Let $x_0,x_1,x_2,\ldots$ be a sequence of rational numbers defined recursively as follows: $x_0$ can be any rational number and, for $n\ge 0$,
\[
x_{n+1}=\begin{cases} \left|\frac{x_n}2-1\right| & \text{if the numerator of }x_n\text{ is even}, \\
\left|\frac1{x_n}-1\right| & \text{if the numerator of }x_n\text{ is odd},\end{cases}
\]
where by numerator of a rational number we mean the numerator of the fraction in its lowest terms. Prove that for any value of $x_0$:
(a) the sequence contains only finitely many distinct terms;
(b) the sequence contains exactly one of the numbers $0$ and $2/3$ (namely, either there exists an index $k$ such that $x_k=0$, or there exists an index $m$ such that $x_m=2/3$, but not both).
2011 IFYM, Sozopol, 5
Does there exist a strictly increasing sequence $\{a_n\}_{n=1}^\infty$ of natural numbers with the following property: for $\forall$ $c\in \mathbb{Z}$ the sequence $c+a_1,c+a_2,...,c+a_n...$ has finite number of primes? Explain your answer.
1983 IMO Longlists, 33
Let $F(n)$ be the set of polynomials $P(x) = a_0+a_1x+\cdots+a_nx^n$, with $a_0, a_1, . . . , a_n \in \mathbb R$ and $0 \leq a_0 = a_n \leq a_1 = a_{n-1 } \leq \cdots \leq a_{[n/2] }= a_{[(n+1)/2]}.$ Prove that if $f \in F(m)$ and $g \in F(n)$, then $fg \in F(m + n).$
2024 EGMO, 4
For a sequence $a_1<a_2<\cdots<a_n$ of integers, a pair $(a_i,a_j)$ with $1\leq i<j\leq n$ is called [i]interesting[/i] if there exists a pair $(a_k,a_l)$ of integers with $1\leq k<l\leq n$ such that $$\frac{a_l-a_k}{a_j-a_i}=2.$$ For each $n\geq 3$, find the largest possible number of interesting pairs in a sequence of length $n$.
1999 Romania National Olympiad, 2
Let $k$ be a positive integer, let $z_1,z_2, \ldots, z_k \in \mathbb{C}$ be distinct and let $u_1,u_2,\ldots,u_k \in \mathbb{C}$ be such that the set $\big\{a_n=u_1z_1^n+u_2z_2^n+\ldots+u_kz_k^n : n \in \mathbb{Z}_{>0} \big\}$ is finite. Prove that there exists a positive integer $p$ such that $a_n=a_{n+p},$ for any positive integer $n.$
2005 Polish MO Finals, 2
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]
2008 Postal Coaching, 1
Define a sequence $<x_n>$ by $x_0 = 0$ and $$\large x_n = \left\{
\begin{array}{ll}
x_{n-1} + \frac{3^r-1}{2} & if \,\,n = 3^{r-1}(3k + 1)\\
& \\
x_{n-1} - \frac{3^r+1}{2} & if \,\, n = 3^{r-1}(3k + 2)\\
\end{array}
\right. $$
where $k, r$ are integers. Prove that every integer occurs exactly once in the sequence.
1976 IMO Shortlist, 4
A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where [x] denotes the smallest integer $\leq$ x)$.$
1998 Portugal MO, 6
Let $a_0$ be a positive real number and consider the general term sequence $a_n$ defined by $$a_n =a_{n-1} + \frac{1}{a_{n-1}} \,\,\, n=1,2,3,...$$ Prove that $a_{1998} > 63$.
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.
1971 IMO Longlists, 34
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.$
1991 Swedish Mathematical Competition, 3
The sequence $x_0, x_1, x_2, ...$ is defined by $x_0 = 0$, $x_{k+1} = [(n - \sum_0^k x_i)/2]$. Show that $x_k = 0$ for all sufficiently large $k$ and that the sum of the non-zero terms $x_k$ is $n-1$.