Found problems: 1239
2025 Romania National Olympiad, 4
Let $m \geq 2$ be a fixed positive integer, and $(a_n)_{n\geq 1}$ be a sequence of nonnegative real numbers such that, for all $n\geq 1$, we have that $a_{n+1} \leq a_n - a_{mn}$.
a) Prove that the sequence $b_n = \sum_{k=1}^{n} a_k$ is bounded above.
b) Prove that the sequence $c_n = \sum_{k=1}^{n} k^2 a_k$ is bounded above.
2024 VJIMC, 4
Let $(b_n)_{n \ge 0}$ be a sequence of positive integers satisfying $b_n=d\left(\sum_{i=0}^{n-1} b_k\right)$ for all $n \ge 1$. (By $d(m)$ we denote the number of positive divisors of $m$.)
a) Prove that $(b_n)_{n \ge 0}$ is unbounded.
b) Prove that there are infinitely many $n$ such that $b_n>b_{n+1}$.
1973 Dutch Mathematical Olympiad, 5
An infinite sequence of integers $a_1,a_2,a_3, ...$ is given with $a_1 = 0$ and further holds for every natural number $n$ that $a_{n+1} = a_n - n$ if $a_n \ge n$ and $a_{n+1} = a_n + n$ if $a_n < n$ .
(a) Prove that there are infinitely many numbers in the sequence equal to $0$.
(b) Express in terms of $k$ the ordinal number of the $k^e$ number from the sequence, which is equal to $0$.
1991 Romania Team Selection Test, 4
A sequence $(a_n)$ of positive integers satisfies$(a_m,a_n) = a_{(m,n)}$ for all $m,n$.
Prove that there is a unique sequence $(b_n)$ of positive integers such that $a_n = \prod_{d|n} b_d$
1966 IMO Shortlist, 42
Given a finite sequence of integers $a_{1},$ $a_{2},$ $...,$ $a_{n}$ for $n\geq 2.$ Show that there exists a subsequence $a_{k_{1}},$ $a_{k_{2}},$ $...,$ $a_{k_{m}},$ where $1\leq k_{1}\leq k_{2}\leq...\leq k_{m}\leq n,$ such that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}$ is divisible by
$n.$
[b]Note by Darij:[/b] Of course, the $1\leq k_{1}\leq k_{2}\leq ...\leq k_{m}\leq n$ should be understood as $1\leq k_{1}<k_{2}<...<k_{m}\leq n;$ else, we could take $m=n$ and $k_{1}=k_{2}=...=k_{m},$ so that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}=n^{2}a_{k_{1}}^{2}$ will surely be divisible by $n.$
2024 IFYM, Sozopol, 3
Let $(a_n)_{n\geq 1}$ be a (not necessarily strictly) increasing sequence of positive integers, such that $a_n \leq 1000n^{0.999}$ for every positive integer $n$. Prove that there exist infinitely many positive integers $n$ for which $a_n$ divides $n$.
1997 IMO Shortlist, 26
For every integer $ n \geq 2$ determine the minimum value that the sum $ \sum^n_{i\equal{}0} a_i$ can take for nonnegative numbers $ a_0, a_1, \ldots, a_n$ satisfying the condition $ a_0 \equal{} 1,$ $ a_i \leq a_{i\plus{}1} \plus{} a_{i\plus{}2}$ for $ i \equal{} 0, \ldots, n \minus{} 2.$
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.
1992 All Soviet Union Mathematical Olympiad, 570
Define the sequence $a_1 = 1, a_2, a_3, ...$ by $$a_{n+1} = a_1^2 + a_2 ^2 + a_3^2 + ... + a_n^2 + n$$ Show that $1$ is the only square in the sequence.
2021 Iran Team Selection Test, 5
Call a triple of numbers [b]Nice[/b] if one of them is the average of the other two. Assume that we have $2k+1$ distinct real numbers with $k^2$ [b] Nice[/b] triples. Prove that these numbers can be devided into two arithmetic progressions with equal ratios
Proposed by [i]Morteza Saghafian[/i]
2015 Peru MO (ONEM), 4
Let $b$ be an odd positive integer. The sequence $a_1, a_2, a_3, a_4$, is definedin the next way: $a_1$ and $a_2$ are positive integers and for all $k \ge 2$,
$$a_{k+1}= \begin{cases} \frac{a_k + a_{k-1}}{2} \,\,\, if \,\,\, a_k + a_{k-1} \,\,\, is \,\,\, even \\ \frac{a_k + a_{k-1+b}}{2}\,\,\, if \,\,\, a_k + a_{k-1}\,\,\, is \,\,\,odd\end{cases}$$
a) Prove that if $b = 1$, then after a certain term, the sequence will become constant.
b) For each $b \ge 3$ (odd), prove that there exist values of $a_1$ and $a_2$ for which the sequence will become constant after a certain term.
1996 IMC, 4
Let $a_{1}=1$, $a_{n}=\frac{1}{n} \sum_{k=1}^{n-1}a_{k}a_{n-k}$ for $n\geq 2$. Show that
i) $\limsup_{n\to \infty} |a_{n}|^{\frac{1}{n}}<2^{-\frac{1}{2}}$;
ii) $\limsup_{n\to \infty} |a_{n}|^{\frac{1}{n}}\geq \frac{2}{3}$
2020 Jozsef Wildt International Math Competition, W20
Let $p\in(0,1)$ and $a>0$ be real numbers. Determine the asymptotic behavior of the sequence $\{a_n\}_{n=1}^\infty$ defined recursively by
$$a_1=a,a_{n+1}=\frac{a_n}{1+a_n^p},n\in\mathbb N$$
[i]Proposed by Arkady Alt[/i]
2017 Mathematical Talent Reward Programme, MCQ: P 8
How many finite sequances $x_1,x_2,\cdots,x_m$ are there such that $x_i=1$ or 2 and $\sum \limits_{i=1}^mx_i=10$ ?
[list=1]
[*] 89
[*] 73
[*] 107
[*] 119
[/list]
1993 Romania Team Selection Test, 1
Consider the sequence $z_n = (1+i)(2+i)...(n+i)$.
Prove that the sequence $Im$ $z_n$ contains infinitely many positive and infinitely many negative numbers.
2000 Saint Petersburg Mathematical Olympiad, 11.3
Every month a forester Ermolay has planted 2000 trees along a fence. On every tree, he has written how many oaks there are among itself and trees at his right and left. This way a sequence of 2000 numbers was created. How many distinct sequences could the forester Ermolay get? (oak is a certain type of tree)
[I]Proposed by A. Khrabrov, D.Rostovski[/i]
2005 Serbia Team Selection Test, 3
Find all polynomial with real coefficients such that:
P(x^2+1)=P(x)^2+1
2010 Peru IMO TST, 9
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]
1980 Bundeswettbewerb Mathematik, 4
A sequence of integers $a_1,a_2,\ldots $ is defined by $a_1=1,a_2=2$ and for $n\geq 1$,
$$a_{n+2}=\left\{\begin{array}{cl}5a_{n+1}-3a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is even},\\ a_{n+1}-a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is odd},\end{array}\right. $$
(a) Prove that the sequence contains infinitely many positive terms and infinitely many negative terms.
(b) Prove that no term of the sequence is zero.
(c) Show that if $n = 2^k - 1$ for $k\geq 2$, then $a_n$ is divisible by $7$.
2014 IFYM, Sozopol, 8
Let $c>1$ be a real constant. For the sequence $a_1,a_2,...$ we have: $a_1=1$, $a_2=2$,
$a_{mn}=a_m a_n$, and $a_{m+n}\leq c(a_m+a_n)$. Prove that $a_n=n$.
2021 Ukraine National Mathematical Olympiad, 7
The sequence $a_1,a_2, ..., a_{2n}$ of integers is such that each number occurs in no more than $n$ times. Prove that there are two strictly increasing sequences of indices $b_1,b_2, ..., b_{n}$ and $c_1,c_2, ..., c_{n}$ are such that every positive integer from the set $\{1,2,...,2n\}$ occurs exactly in one of these two sequences, and for each $1\le i \le n$ is true the condition $a_{b_i} \ne a_{c_i}$
.
(Anton Trygub)
1974 Chisinau City MO, 73
For the real numbers $a_1,...,a_n, b_1,...,b_m$ , the following relations hold:
1) $|a_i|= |b_j|=1$, $i=1,...,n$ ,$j=1,...,m$
2) $a_1\sqrt{2+a_2\sqrt{2+...+a_n\sqrt2}}=b_1\sqrt{2+b_2\sqrt{2+...+b_m\sqrt2}}$
Prove that $n = m$ and $a_i=b_i$ , $i=1,...,n$
2020 JBMO Shortlist, 2
Consider the sequence $a_1, a_2, a_3, ...$ defined by $a_1 = 9$ and
$a_{n + 1} = \frac{(n + 5)a_n + 22}{n + 3}$
for $n \ge 1$.
Find all natural numbers $n$ for which $a_n$ is a perfect square of an integer.
2001 China Team Selection Test, 2
Let ${a_n}$ be a non-increasing sequence of positive numbers. Prove that if for $n \ge 2001$, $na_{n} \le 1$, then for any positive integer $m \ge 2001$ and $x \in \mathbb{R}$, the following inequality holds:
$\left | \sum_{k=2001}^{m} a_{k} \sin kx \right | \le 1 + \pi$
2020 Jozsef Wildt International Math Competition, W53
Define the sequence $(w_n)_{n\ge0}$ by the recurrence relation
$$w_{n+2}=2w_{n+1}+3w_n,\enspace\enspace w_0=1,w_1=i,\enspace n=0,1,\ldots$$
(1) Find the general formula for $w_n$ and compute the first $9$ terms.
(2) Show that $|\Re w_n-\Im w_n|=1$ for all $n\ge1$.
[i]Proposed by Ovidiu Bagdasar[/i]