This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1239

1977 IMO Shortlist, 15

In a finite sequence of real numbers the sum of any seven successive terms is negative and the sum of any eleven successive terms is positive. Determine the maximum number of terms in the sequence.

2012 China Northern MO, 5

Let $\{a_n\}$ be the sequance with $a_0=0$, $a_n=\frac{1}{a_{n-1}-2}$ ($n\in N_+$). Select an arbitrary term $a_k$ in the sequence $\{a_n\}$ and construct the sequence $\{b_n\}$: $b_0=a_k$, $b_n=\frac{2b_{n-1}+1} {b_{n-1}}$ ($n\in N_+$) . Determine whether the sequence $\{b_n\}$ is a finite sequence or an infinite sequence and give proof.

2010 Indonesia TST, 1

Tags: sequence , algebra
Sequence ${u_n}$ is defined with $u_0=0,u_1=\frac{1}{3}$ and $$\frac{2}{3}u_n=\frac{1}{2}(u_{n+1}+u_{n-1})$$ $\forall n=1,2,...$ Show that $|u_n|\leq1$ $\forall n\in\mathbb{N}.$

1949 Putnam, B5

Tags: sequence
let $(a_{n})$ be an arbitrary sequence of positive numbers. Show that $$\limsup_{n\to \infty} \left(\frac{a_1 +a_{n+1}}{a_{n}}\right)^{n} \geq e.$$

1979 All Soviet Union Mathematical Olympiad, 273

For every $n$, the decreasing sequence $\{x_k\}$ satisfies a condition $$x_1+x_4/2+x_9/3+...+x_n^2/n \le 1$$ Prove that for every $n$, it also satisfies $$x_1+x_2/2+x_3/3+...+x_n/n\le 3$$

2015 Hanoi Open Mathematics Competitions, 1

Tags: algebra , sequence
What is the $7$th term of the sequence $\{-1, 4,-2, 3,-3, 2,...\}$? (A) $ -1$ (B) $ -2$ (C) $-3$ (D) $-4$ (E) None of the above

2023 Francophone Mathematical Olympiad, 1

Let $u_0, u_1, u_2, \ldots$ be integers such that $u_0 = 100$; $u_{k+2} \geqslant 2 + u_k$ for all $k \geqslant 0$; and $u_{\ell+5} \leqslant 5 + u_\ell$ for all $\ell \geqslant 0$. Find all possible values for the integer $u_{2023}$.

1985 IMO Longlists, 63

Let $x_n = \sqrt[2]{2+\sqrt[3]{3+\cdots+\sqrt[n]{n}}}.$ Prove that \[x_{n+1}-x_n <\frac{1}{n!} \quad n=2,3,\cdots\]

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]

2022 Korea National Olympiad, 3

Suppose that the sequence $\{a_n\}$ of positive integers satisfies the following conditions: [list] [*]For an integer $i \geq 2022$, define $a_i$ as the smallest positive integer $x$ such that $x+\sum_{k=i-2021}^{i-1}a_k$ is a perfect square. [*]There exists infinitely many positive integers $n$ such that $a_n=4\times 2022-3$. [/list] Prove that there exists a positive integer $N$ such that $\sum_{k=n}^{n+2021}a_k$ is constant for every integer $n \geq N$. And determine the value of $\sum_{k=N}^{N+2021}a_k$.

2024 District Olympiad, P2

Tags: limit , analysis , sequence
Let $k\geqslant 2$ be an integer. Consider the sequence $(x_n)_{n\geqslant 1}$ defined by $x_1=a>0$ and $x_{n+1}=x_n+\lfloor k/x_n\rfloor$ for $n\geqslant 1.$ Prove that the sequence is convergent and determine its limit.

1996 Singapore Team Selection Test, 3

Let $S = \{0, 1, 2, .., 1994\}$. Let $a$ and $b$ be two positive numbers in $S$ which are relatively prime. Prove that the elements of $S$ can be arranged into a sequence $s_1, s_2, s_3,... , s_{1995}$ such that $s_{i+1} - s_i \equiv \pm a$ or $\pm b$ (mod $1995$) for $i = 1, 2, ... , 1994$

2011 Germany Team Selection Test, 1

A sequence $x_1, x_2, \ldots$ is defined by $x_1 = 1$ and $x_{2k}=-x_k, x_{2k-1} = (-1)^{k+1}x_k$ for all $k \geq 1.$ Prove that $\forall n \geq 1$ $x_1 + x_2 + \ldots + x_n \geq 0.$ [i]Proposed by Gerhard Wöginger, Austria[/i]

2011 Singapore Junior Math Olympiad, 4

Any positive integer $n$ can be written in the form $n = 2^aq$, where $a \ge 0$ and $q$ is odd. We call $q$ the [i]odd part[/i] of $n$. Define the sequence $a_0,a_1,...$ as follows: $a_0 = 2^{2011}-1$ and for $m > 0, a_{m+i}$ is the odd part of $3a_m + 1$. Find $a_{2011}$.

1982 IMO Shortlist, 11

[b](a)[/b] Find the rearrangement $\{a_1, \dots , a_n\}$ of $\{1, 2, \dots, n\}$ that maximizes \[a_1a_2 + a_2a_3 + \cdots + a_na_1 = Q.\] [b](b)[/b] Find the rearrangement that minimizes $Q.$

2010 Belarus Team Selection Test, 1.4

$x_1=\frac{1}{2}$ and $x_{k+1}=\frac{x_k}{x_1^2+...+x_k^2}$ Prove that $\sqrt{x_k^4+4\frac{x_{k-1}}{x_{k+1}}}$ is rational

2015 Peru IMO TST, 6

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

2023 Indonesia TST, 2

Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define $$x_{k+1} = \begin{cases} x_k + d &\text{if } a \text{ does not divide } x_k \\ x_k/a & \text{if } a \text{ divides } x_k \end{cases}$$ Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.

1953 Moscow Mathematical Olympiad, 257

Let $x_0 = 10^9$, $x_n = \frac{x^2_{n-1}+2}{2x_{n-1}}$ for $n > 0$. Prove that $0 < x_{36} - \sqrt2 < 10^{-9}$.

2020 IMO Shortlist, N7

Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.

2010 Saudi Arabia BMO TST, 4

Let $f : N \to [0, \infty)$ be a function satisfying the following conditions: a) $f(4)=2$ b) $\frac{1}{f( 0 ) + f( 1)} + \frac{1}{f( 1 ) + f( 2 )} + ... + \frac{1}{f (n ) + f(n + 1) }= f ( n + 1)$ for all integers $n \ge 0$. Find $f(n)$ in closed form.

2012 Grand Duchy of Lithuania, 4

Tags: algebra , sequence
Let $m$ be a positive integer. Find all bounded sequences of integers $a_1, a_2, a_3,... $for which $a_n + a_{n+1} + a_{n+m }= 0$ for all $n \in N$.

1996 Singapore Team Selection Test, 3

Let $S$ be a sequence $n_1, n_2,..., n_{1995}$ of positive integers such that $n_1 +...+ n_{1995 }=m < 3990$. Prove that for each integer $q$ with $1 \le q \le m$, there is a sequence $n_{i_1} , n_{i_2} , ... , n_{i_k}$ , where $1 \le i_1 < i_2 < ...< i_k \le 1995$, $n_{i_1} + ...+ n_{i_k} = q$ and $k$ depends on $q$.

2025 District Olympiad, P4

Tags: sequence
Let $(x_n)_{n\geq 1}$ be an increasing and unbounded sequence of positive integers such that $x_1=1$ and $x_{n+1}\leq 2x_n$ for all $n\geq 1$. Prove that every positive integer can be written as a finite sum of distinct terms of the sequence. [i]Note:[/i] Two terms $x_i$ and $x_j$ of the sequence are considered distinct if $i\neq j$.

1999 Yugoslav Team Selection Test, Problem 3

Tags: algebra , sequence
Consider the set $A_n=\{x_1,x_2,\ldots,x_n,y_1,y_2,\ldots,y_n\}$ of $2n$ variables. How many permutations of set $A_n$ are there for which it is possible to assign real values from the interval $(0,1)$ to the $2n$ variables so that: (i) $x_i+y_i=1$ for each $i$; (ii) $x_1<x_2<\ldots<x_n$; (iii) the $2n$ terms of the permutation form a strictly increasing sequence?