Found problems: 1239
1981 All Soviet Union Mathematical Olympiad, 313
Find all the sequences of natural $k_n$ with two properties:
a) $k_n \le n \sqrt {n}$ for all $n$
b) $(k_n - k_m)$ is divisible by $(m-n)$ for all $m>n$
2024 Czech and Slovak Olympiad III A, 5
Let $(a_k)^{\infty}_{k=0}$ be a sequence of real numbers such that if $k$ is a non-negative integer, then
$$a_{k+1} = 3a_k - \lfloor 2a_k \rfloor - \lfloor a_k \rfloor.$$
Definitely all positive integers $n$ such that if $a_0 = 1/n$, then this sequence is constant after a certain term.
2012 IFYM, Sozopol, 5
We are given the following sequence: $a_1=8,a_2=20,a_{n+2}=a_{n+1}^2+12a_n a_{n+1}+11a_n$. Prove that none of the members of the sequence can be presented as a sum of three seventh powers of natural numbers.
2024 Belarus Team Selection Test, 2.1
A sequence $\{y_i\}$ is given, where $y_0=-\frac{1}{4},y_1=0$. For every positive integer $n$ the following equality holds:
$$y_{n-1}+y_{n+1}=4y_n+1$$
Prove that for every positive integer $n$ the number $2y_{2n}+\frac{3}{2}$
a) is a positive integer
b) is a square of a positive integer
[i]D. Zmiaikou[/i]
2022 Iran MO (3rd Round), 2
For two rational numbers $r,s$ we say:$$r\mid s$$whenever there exists $k\in\mathbb{Z}$ such that:$$s=kr$$
${(a_n)}_{n\in\mathbb{N}}$ is an increasing sequence of pairwise coprime natural numbers and ${(b_n)}_{n\in\mathbb{N}}$ is a sequence of distinct natural numbers. Assume that for all $n\in\mathbb{N}$ we have:
$$\sum_{i=1}^{n}\frac{1}{a_i}\mid\sum_{i=1}^{n}\frac{1}{b_i}$$
Prove that [b]for all[/b] $n\in\mathbb{N}$ we have: $a_n=b_n$.
2005 Taiwan TST Round 3, 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]
VMEO IV 2015, 10.1
Where $n$ is a positive integer, the sequence $a_n$ is determined by the formula $$a_{n+1}=\frac{1}{a_1 + a_2 +... + a_n} -\sqrt2, \,a_1 = 1.$$ Find the limit of the sequence $S_n$ defined by $S_n=a_1 + a_2 +... + a_n$.
2010 Saudi Arabia BMO TST, 3
Let $(a_n )_{n \ge o}$ and $(b_n )_{n \ge o}$ be sequences defined by $a_{n+2} = a_{n+1}+ a_n$ , $n = 0 , 1 , . .. $, $a_0 = 1$, $a_1 = 2$, and $b_{n+2} = b_{n+1} + b_n$ , $n = 0 , 1 , . . .$, $b_0 = 2$, $b_1 = 1$. How many integers do the sequences have in common?
2016 Saudi Arabia Pre-TST, 2.2
Given four numbers $x, y, z, t$, let $(a, b, c, d)$ be a permutation of $(x, y, z, t)$ and set $x_1 =|a- b|$, $y_1 = |b-c|$, $z_1 = |c-d|$, and $t_1 = |d -a|$. From $x_1, y_1, z_1, t_1$, form in the same fashion the numbers $x_2, y_2, z_2, t_2$, and so on. It is known that $x_n = x, y_n = y, z_n = z, t_n = t$ for some $n$. Find all possible values of $(x, y, z, t)$.
1962 All-Soviet Union Olympiad, 3
Given integers $a_0,a_1, ... , a_{100}$, satisfying $a_1>a_0$, $a_1>0$, and $a_{r+2}=3 a_{r+1}-2a_r$ for $r=0, 1, ... , 98$. Prove $a_{100}>299$
2024 China Western Mathematical Olympiad, 2
Find all integers $k$, such that there exists an integer sequence ${\{a_n\}}$ satisfies two conditions below
(1) For all positive integers $n$,$a_{n+1}={a_n}^3+ka_n+1$
(2) $|a_n| \leq M$ holds for some real $M$
2017 Bosnia and Herzegovina EGMO TST, 3
For positive integer $n$ we define $f(n)$ as sum of all of its positive integer divisors (including $1$ and $n$). Find all positive integers $c$ such that there exists strictly increasing infinite sequence of positive integers $n_1, n_2,n_3,...$ such that for all $i \in \mathbb{N}$ holds $f(n_i)-n_i=c$
1976 All Soviet Union Mathematical Olympiad, 223
The natural numbers $x_1$ and $x_2$ are less than $1000$. We construct a sequence:
$$x_3 = |x_1 - x_2|$$
$$x_4 = min \{ |x_1 - x_2|, |x_1 - x_3|, |x_2 - x_3|\}$$
$$...$$
$$x_k = min \{ |x_i - x_j|, 0 <i < j < k\}$$
$$...$$
Prove that $x_{21} = 0$.
2003 IMO Shortlist, 3
Consider pairs of the sequences of positive real numbers \[a_1\geq a_2\geq a_3\geq\cdots,\qquad b_1\geq b_2\geq b_3\geq\cdots\] and the sums \[A_n = a_1 + \cdots + a_n,\quad B_n = b_1 + \cdots + b_n;\qquad n = 1,2,\ldots.\] For any pair define $c_n = \min\{a_i,b_i\}$ and $C_n = c_1 + \cdots + c_n$, $n=1,2,\ldots$.
(1) Does there exist a pair $(a_i)_{i\geq 1}$, $(b_i)_{i\geq 1}$ such that the sequences $(A_n)_{n\geq 1}$ and $(B_n)_{n\geq 1}$ are unbounded while the sequence $(C_n)_{n\geq 1}$ is bounded?
(2) Does the answer to question (1) change by assuming additionally that $b_i = 1/i$, $i=1,2,\ldots$?
Justify your answer.
2024 Singapore MO Open, Q4
Alice and Bob play a game. Bob starts by picking a set $S$ consisting of $M$ vectors of length $n$ with entries either $0$ or $1$. Alice picks a sequence of numbers $y_1\le y_2\le\dots\le y_n$ from the interval $[0,1]$, and a choice of real numbers $x_1,x_2\dots,x_n\in \mathbb{R}$. Bob wins if he can pick a vector $(z_1,z_2,\dots,z_n)\in S$ such that $$\sum_{i=1}^n x_iy_i\le \sum_{i=1}^n x_iz_i,$$otherwise Alice wins. Determine the minimum value of $M$ so that Bob can guarantee a win.
[i]Proposed by DVDthe1st[/i]
2001 Moldova National Olympiad, Problem 7
Set $a_n=\frac{2n}{n^4+3n^2+4},n\in\mathbb N$. Prove that the sequence $S_n=a_1+a_2+\ldots+a_n$ is upperbounded and lowerbounded and find its limit as $n\to\infty$.
2015 Dutch BxMO/EGMO TST, 2
Given are positive integers $r$ and $k$ and an infi nite sequence of positive integers $a_1 \le a_2 \le ...$ such that $\frac{r}{a_r}= k + 1$. Prove that there is a $t$ satisfying $\frac{t}{a_t}=k$.
2013 Saudi Arabia BMO TST, 2
Define Fibonacci sequence $\{F\}_{n=0}^{\infty}$ as $F_0 = 0, F_1 = 1$ and $F_{n+1} = F_n +F_{n-1}$ for every integer $n > 1$. Determine all quadruples $(a, b, c,n)$ of positive integers with a $< b < c$ such that each of $a, b,c,a + n, b + n,c + 2n$ is a term of the Fibonacci sequence.
1985 All Soviet Union Mathematical Olympiad, 402
Given unbounded strictly increasing sequence $a_1, a_2, ... , a_n, ...$ of positive numbers. Prove that
a) there exists a number $k_0$ such that for all $k>k_0$ the following inequality is valid:
$$\frac{a_1}{a_2}+ \frac{a_2}{a_3} + ... + \frac{a_k}{a_{k-1} }< k - 1$$
b) there exists a number $k_0$ such that for all $k>k_0$ the following inequality is valid:
$$\frac{a_1}{a_2}+ \frac{a_2}{a_3} + ... + \frac{a_k}{a_{k-1} }< k - 1985$$
India EGMO 2023 TST, 5
Let $k$ be a positive integer. A sequence of integers $a_1, a_2, \cdots$ is called $k$-pop if the following holds: for every $n \in \mathbb{N}$, $a_n$ is equal to the number of distinct elements in the set $\{a_1, \cdots , a_{n+k} \}$. Determine, as a function of $k$, how many $k$-pop sequences there are.
[i]Proposed by Sutanay Bhattacharya[/i]
2005 AMC 10, 11
The first term of a sequence is 2005. Each succeeding term is the sum of the cubes of the digits of the previous terms. What is the 2005th term of the sequence?
$ \textbf{(A)}\ 29\qquad
\textbf{(B)}\ 55\qquad
\textbf{(C)}\ 85\qquad
\textbf{(D)}\ 133\qquad
\textbf{(E)}\ 250$
1998 French Mathematical Olympiad, Problem 2
Let $(u_n)$ be a sequence of real numbers which satisfies
$$u_{n+2}=|u_{n+1}|-u_n\qquad\text{for all }n\in\mathbb N.$$Prove that there exists a positive integer $p$ such that $u_n=u_{n+p}$ holds for all $n\in\mathbb N$.
2021-IMOC, N3
Define the function $f:\mathbb N_{>1}\to\mathbb N_{>1}$ such that $f(x)$ is the greatest prime factor of $x$. A sequence of positive integers $\{a_n\}$ satisfies $a_1=M>1$ and
$$a_{n+1}=\begin{cases}a_n-f(a_n)&\text{if }a_n\text{ is composite.}\\a_n+k&\text{otherwise.}\end{cases}$$
Show that for any positive integers $M,k$, the sequence $\{a_n\}$ is bounded.
(TAN768092100853)
1994 Tournament Of Towns, (428) 5
The periods of two periodic sequences are $7$ and $13$. What is the maximal length of initial sections of the two sequences which can coincide? (The period $p$ of a sequence $a_1$,$a_2$, $...$ is the minimal $p$ such that $a_n = a_{n+p}$ for all $n$.)
(AY Belov)
1994 Austrian-Polish Competition, 2
The sequences $(a_n)$ and (c_n) are given by $a_0 =\frac12$, $c_0=4$ , and for $n \ge 0$ , $a_{n+1}=\frac{2a_n}{1+a_n^2}$, $c_{n+1}=c_n^2-2c_n+2$
Prove that for all $n\ge 1$, $a_n=\frac{2c_0c_1...c_{n-1}}{c_n}$