Found problems: 1239
1998 Tuymaada Olympiad, 7
All possible sequences of numbers $-1$ and $+1$ of length $100$ are considered. For each of them, the square of the sum of the terms is calculated. Find the arithmetic average of the resulting values.
2021 Baltic Way, 3
Determine all infinite sequences $(a_1,a_2,\dots)$ of positive integers satisfying
\[a_{n+1}^2=1+(n+2021)a_n\]
for all $n \ge 1$.
2024 IFYM, Sozopol, 3
The sequence \( (a_n)_{n\geq 1} \) of positive integers is such that \( a_1 = 1 \) and \( a_{m+n} \) divides \( a_m + a_n \) for any positive integers \( m \) and \( n \).
a) Prove that if the sequence is unbounded, then \( a_n = n \) for all \( n \).
b) Does there exist a non-constant bounded sequence with the above properties?
(A sequence \( (a_n)_{n\geq 1} \) of positive integers is bounded if there exists a positive integer \( A \) such that \( a_n \leq A \) for all \( n \), and unbounded otherwise.)
2017 Serbia Team Selection Test, 5
Let $n \geq 2$ be a positive integer and $\{x_i\}_{i=0}^n$ a sequence such that not all of its elements are zero and there is a positive constant $C_n$ for which:
(i) $x_1+ \dots +x_n=0$, and
(ii) for each $i$ either $x_i\leq x_{i+1}$ or $x_i\leq x_{i+1} + C_n x_{i+2}$ (all indexes are assumed modulo $n$).
Prove that
a) $C_n\geq 2$, and
b) $C_n=2$ if and only $2 \mid n$.
2024 Benelux, 1
Let $a_0,a_1,\dots,a_{2024}$ be real numbers such that $\left|a_{i+1}-a_i\right| \le 1$ for $i=0,1,\dots,2023$.
a) Find the minimum possible value of $$a_0a_1+a_1a_2+\dots+a_{2023}a_{2024}$$
b) Does there exist a real number $C$ such that $$a_0a_1-a_1a_2+a_2a_3-a_3a_4+\dots+a_{2022}a_{2023}-a_{2023}a_{2024} \ge C$$ for all real numbers $a_0,a_1,\dots,a_2024$ such that $\left|a_{i+1}-a_i\right| \le 1$ for $i=0,1,\dots,2023$.
2025 China Team Selection Test, 14
Let \( p_1, p_2, \cdots, p_{2025} \) be real numbers. For \( 1 \leq i \leq 2025 \), let
\[\{a_n^{(i)}\}_{n \geq 0}\]
be an infinite real sequence satisfying
\[a_0^{(i)} = 0.\]
It is known that:
(1)
\[a_1^{(1)}, a_1^{(2)}, \cdots, a_1^{(2025)}\]
are not all zero.
(2) For any integer \( n \geq 0 \) and any \( 1 \leq i \leq 2025 \), the following holds:
\[p_i \cdot a_n^{(i+1)} = a_{n-1}^{(i)} + a_n^{(i)} + a_{n+1}^{(i)},\]
where the sequence
\[\{a_n^{(2026)}\}\]
satisfies
\[a_n^{(2026)} = a_n^{(1)}, \, n = 0, 1, 2, \cdots.\]
Prove that there exists a positive real number \( r \) such that for infinitely many positive integers \( n \),
\[\max \left\{ |a_n^{(1)}|, |a_n^{(2)}|, \cdots, |a_n^{(2025)}|\right\} \geq r.\]
2017 Azerbaijan Team Selection Test, 1
Consider the sequence of rational numbers defined by $x_1=\frac{4}{3}$, and $x_{n+1}=\frac{x_n^2}{x_n^2-x_n+1}$. Show that the nu,erator of the lowest term expression of each sum $x_1+x_2+...+x_k$ is a perfect square.
2015 APMO, 3
A sequence of real numbers $a_0, a_1, . . .$ is said to be good if the following three conditions hold.
(i) The value of $a_0$ is a positive integer.
(ii) For each non-negative integer $i$ we have $a_{i+1} = 2a_i + 1 $ or $a_{i+1} =\frac{a_i}{a_i + 2} $
(iii) There exists a positive integer $k$ such that $a_k = 2014$.
Find the smallest positive integer $n$ such that there exists a good sequence $a_0, a_1, . . .$ of real numbers with the property that $a_n = 2014$.
[i]Proposed by Wang Wei Hua, Hong Kong[/i]
1967 IMO Longlists, 57
Let $a_1,\ldots,a_8$ be reals, not all equal to zero. Let
\[ c_n = \sum^8_{k=1} a^n_k\]
for $n=1,2,3,\ldots$. Given that among the numbers of the sequence $(c_n)$, there are infinitely many equal to zero, determine all the values of $n$ for which $c_n = 0.$
2020 China Northern MO, P1
The function $f(x)=x^2+ \sin x$ and the sequence of positive numbers $\{ a_n \}$ satisfy $a_1=1$, $f(a_n)=a_{n-1}$, where $n \geq 2$. Prove that there exists a positive integer $n$ such that $a_1+a_2+ \dots + a_n > 2020$.
2007 Nicolae Coculescu, 2
Let be two sequences $ \left( a_n \right)_{n\ge 0} , \left( b_n \right)_{n\ge 0} $ satisfying the following system:
$$ \left\{ \begin{matrix} a_0>0,& \quad a_{n+1} =a_ne^{-a_n} , &\quad\forall n\ge 0 \\ b_{0}\in (0,1) ,& \quad b_{n+1} =b_n\cos \sqrt{b_n} ,& \quad\forall n\ge 0 \end{matrix} \right. $$
Calculate $ \lim_{n\to\infty} \frac{a_n}{b_n} . $
[i]Florian Dumitrel[/i]
2010 Victor Vâlcovici, 1
Let $ \left( a_n\right)_{n\ge 1} $ be a sequence defined by $ a_1>0 $ and $ \frac{a_{n+1}}{a}=\frac{a_n}{a}+\frac{a}{a_n} , $ with $ a>0. $ Calculate $ \lim_{n\to\infty} \frac{a_n}{\sqrt{n+a}} . $
[i]Florin Rotaru[/i]
2021 Taiwan TST Round 1, N
For each positive integer $n$, define $V_n=\lfloor 2^n\sqrt{2020}\rfloor+\lfloor 2^n\sqrt{2021}\rfloor$. Prove that, in the sequence $V_1,V_2,\ldots,$ there are infinitely many odd integers, as well as infinitely many even integers.
[i]Remark.[/i] $\lfloor x\rfloor$ is the largest integer that does not exceed the real number $x$.
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.$$
1990 French Mathematical Olympiad, Problem 1
Let the sequence $u_n$ be defined by $u_0=0$ and $u_{2n}=u_n$, $u_{2n+1}=1-u_n$ for each $n\in\mathbb N_0$.
(a) Calculate $u_{1990}$.
(b) Find the number of indices $n\le1990$ for which $u_n=0$.
(c) Let $p$ be a natural number and $N=(2^p-1)^2$. Find $u_N$.
1989 Bulgaria National Olympiad, Problem 2
Prove that the sequence $(a_n)$, where
$$a_n=\sum_{k=1}^n\left\{\frac{\left\lfloor2^{k-\frac12}\right\rfloor}2\right\}2^{1-k},$$converges, and determine its limit as $n\to\infty$.
1980 IMO, 2
Find the greatest natural number $n$ such there exist natural numbers $x_{1}, x_{2}, \ldots, x_{n}$ and natural $a_{1}< a_{2}< \ldots < a_{n-1}$ satisfying the following equations for $i =1,2,\ldots,n-1$: \[x_{1}x_{2}\ldots x_{n}= 1980 \quad \text{and}\quad x_{i}+\frac{1980}{x_{i}}= a_{i}.\]
1989 IMO Longlists, 93
Prove that for each positive integer $ n$ there exist $ n$ consecutive positive integers none of which is an integral power of a prime number.
1983 IMO Shortlist, 5
Consider the set of all strictly decreasing sequences of $n$ natural numbers having the property that in each sequence no term divides any other term of the sequence. Let $A = (a_j)$ and $B = (b_j)$ be any two such sequences. We say that $A$ precedes $B$ if for some $k$, $a_k < b_k$ and $a_i = b_i$ for $i < k$. Find the terms of the first sequence of the set under this ordering.
2006 Petru Moroșan-Trident, 3
Let be a sequence $ \left( u_n \right)_{n\ge 1} $ given by the recurrence relation $ u_{n+1} =u_n+\sqrt{u_n^2-u_1^2} , $ and the constraints $ u_2\ge u_1>0. $
Calculate $ \lim_{n\to\infty }\frac{2^n}{u_n} . $
[i]Dan Negulescu[/i]
1988 Greece National Olympiad, 4
Let $a_1=5$ and $a_{n+1}= a^2_{n}-2$ for any $n=1,2,...$.
a) Find $\lim_{n \rightarrow \infty}\frac{a_{n+1}}{a_1a_2 ...a_{n}}$
b) Find $\lim_{\nu \rightarrow \infty}\left(\frac{1}{a_1}+\frac{1}{a_1a_2}+...+\frac{1}{a_1a_2 ...a_{\nu}}\right)$
2013 Regional Competition For Advanced Students, 3
For non-negative real numbers $a,$ $b$ let $A(a, b)$ be their arithmetic mean and $G(a, b)$ their geometric mean. We consider the sequence $\langle a_n \rangle$ with $a_0 = 0,$ $a_1 = 1$ and $a_{n+1} = A(A(a_{n-1}, a_n), G(a_{n-1}, a_n))$ for $n > 0.$
(a) Show that each $a_n = b^2_n$ is the square of a rational number (with $b_n \geq 0$).
(b) Show that the inequality $\left|b_n - \frac{2}{3}\right| < \frac{1}{2^n}$ holds for all $n > 0.$
1977 IMO Shortlist, 11
Let $n$ be an integer greater than $1$. Define
\[x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \qquad \text{for }i = 1, 2, \ldots\ ,\]
where $[z]$ denotes the largest integer less than or equal to $z$. Prove that
\[ \min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]\]
1991 IMO Shortlist, 13
Given any integer $ n \geq 2,$ assume that the integers $ a_1, a_2, \ldots, a_n$ are not divisible by $ n$ and, moreover, that $ n$ does not divide $ \sum^n_{i\equal{}1} a_i.$ Prove that there exist at least $ n$ different sequences $ (e_1, e_2, \ldots, e_n)$ consisting of zeros or ones such $ \sum^n_{i\equal{}1} e_i \cdot a_i$ is divisible by $ n.$
1979 All Soviet Union Mathematical Olympiad, 281
The finite sequence $a_1, a_2, ... , a_n$ of ones and zeroes should satisfy a condition:
[i]for every $k$ from $0$ to $(n-1)$ the sum a_1a_{k+1} + a_2a_{k+2} + ... + a_{n-k}a_n should be odd.[/i]
a) Construct such a sequence for $n=25$.
b) Prove that there exists such a sequence for some $n > 1000$.