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: 280

2006 VTRMC, Problem 5

Let $\{a_n\}$ be a monotonically decreasing sequence of positive real numbers with limit $0$. Let $\{b_n\}$ be a rearrangement of the sequence such that for every non-negative integer $m$, the terms $b_{3m+1}$, $b_{3m+2}$, $b_{3m+3}$ are a rearrangement of the terms $a_{3m+1}$, $a_{3m+2}$, $a_{3m+3}$. Prove or give a counterexample to the following statement: the series $\sum_{n=1}^\infty(-1)^nb_n$ is convergent.

2013 Bogdan Stan, 2

Let $ \left( a_n \right) ,\left( b_n \right) $ be two sequences of real numbers from the interval $ (-1,1) $ having the property that $$ \max\left( \left| a_{n+1} -a_n \right| ,\left| b_{n+1} -b_n \right| \right) \le\frac{1}{(n+4)(n+5)} , $$ for any natural number. Prove that $ \left| a_nb_n -a_1b_1 \right|\le 1/2, $ for any natural number $ n. $ [i]Cristinel Mortici[/i]

1961 Putnam, B7

Given a sequence $(a_n)$ of non-negative real numbers such that $a_{n+m}\leq a_{n} a_{m} $ for all pairs of positive integers $m$ and $n,$ prove that the sequence $(\sqrt[n]{a_n })$ converges.

1990 Czech and Slovak Olympiad III A, 1

Let $(a_n)_{n\ge1}$ be a sequence given by \begin{align*} a_1 &= 1, \\ a_{2^k+j} &= -a_j\text{ for any } k\ge0,1\le j\le 2^k. \end{align*} Show that the sequence is not periodic.

VMEO I 2004, 6

Consider all binary sequences of length $n$. In a sequence that allows the interchange of positions of an arbitrary set of $k$ adjacent numbers, ($k < n$), two sequences are said to be [i]equivalent [/i] if they can be transformed from one sequence to another by a finite number of transitions as above. Find the number of sequences that are not equivalent.

2015 Romania Team Selection Tests, 2

Let $(a_n)_{n \geq 0}$ and $(b_n)_{n \geq 0}$ be sequences of real numbers such that $ a_0>\frac{1}{2}$ , $a_{n+1} \geq a_n$ and $b_{n+1}=a_n(b_n+b_{n+2})$ for all non-negative integers $n$ . Show that the sequence $(b_n)_{n \geq 0}$ is bounded .

2019-IMOC, N5

Initially, Alice is given a positive integer $a_0$. At time $i$, Alice has two choices, $$\begin{cases}a_i\mapsto\frac1{a_{i-1}}\\a_i\mapsto2a_{i-1}+1\end{cases}$$ Note that it is dangerous to perform the first operation, so Alice cannot choose this operation in two consecutive turns. However, if $x>8763$, then Alice could only perform the first operation. Determine all $a_0$ so that $\{i\in\mathbb N\mid a_i\in\mathbb N\}$ is an infinite set.

1973 IMO Shortlist, 8

Prove that there are exactly $\binom{k}{[k/2]}$ arrays $a_1, a_2, \ldots , a_{k+1}$ of nonnegative integers such that $a_1 = 0$ and $|a_i-a_{i+1}| = 1$ for $i = 1, 2, \ldots , k.$

2004 Germany Team Selection Test, 1

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.

VII Soros Olympiad 2000 - 01, 11.7

Consider all possible functions defined for $x = 1, 2, ..., M$ and taking values $​​y = 1, 2, ..., n$. We denote the set of such functions by $T.$ By $T_0$ we denote the subset of $T$ consisting of functions whose value changes exactly by $ 1$ (in one direction or another) when the argument changes by $1$. Prove that if $M\ge 2n-4$, then among the functions from of the set $T$, there is a function that coincides at least at one point with any function from $T_0$. Specify at least one such function. Prove that if $M <2n-4$, then there is no such function.

2019 Simon Marais Mathematical Competition, A4

Suppose $x_1,x_2,x_3,\dotsc$ is a strictly decreasing sequence of positive real numbers such that the series $x_1+x_2+x_3+\cdots$ diverges. Is it necessary true that the series $\sum_{n=2}^{\infty}{\min \left\{ x_n,\frac{1}{n\log (n)}\right\} }$ diverges?

2024 Middle European Mathematical Olympiad, 1

Consider two infinite sequences $a_0,a_1,a_2,\dots$ and $b_0,b_1,b_2,\dots$ of real numbers such that $a_0=0$, $b_0=0$ and \[a_{k+1}=b_k, \quad b_{k+1}=\frac{a_kb_k+a_k+1}{b_k+1}\] for each integer $k \ge 0$. Prove that $a_{2024}+b_{2024} \ge 88$.

1979 IMO Shortlist, 19

Consider the sequences $(a_n), (b_n)$ defined by \[a_1=3, \quad b_1=100 , \quad a_{n+1}=3^{a_n} , \quad b_{n+1}=100^{b_n} \] Find the smallest integer $m$ for which $b_m > a_{100}.$

1989 Greece National Olympiad, 3

Find the limit of the sequence $x_n$ defined by recurrence relation $$x_{n+2}=\frac{1}{12}x_{n+1}+\frac{1}{2}x_{n}+1$$ where $n=0,1,2,...$ for any initial values $x_2,x_1$.

2000 Romania National Olympiad, 2

Study the convergence of a sequence $ \left( x_n\right)_{n\ge 0} $ for which $ x_0\in\mathbb{R}\setminus\mathbb{Q} , $ and $ x_{n+1}\in \left\{ \frac{x_n+1}{x_n} , \frac{x_n+2}{2x_n-1}\right\} , $ for all $ n\ge 1. $

2023 CIIM, 3

Given a $3 \times 3$ symmetric real matrix $A$, we define $f(A)$ as a $3 \times 3$ matrix with the same eigenvectors of $A$ such that if $A$ has eigenvalues $a$, $b$, $c$, then $f(A)$ has eigenvalues $b+c$, $c+a$, $a+b$ (in that order). We define a sequence of symmetric real $3\times3$ matrices $A_0, A_1, A_2, \ldots$ such that $A_{n+1} = f(A_n)$ for $n \geq 0$. If the matrix $A_0$ has no zero entries, determine the maximum number of indices $j \geq 0$ for which the matrix $A_j$ has any null entries.

2019 Pan-African Shortlist, A5

Let a sequence $(a_i)_{i=10}^{\infty}$ be defined as follows: [list=a] [*] $a_{10}$ is some positive integer, which can of course be written in base 10. [*] For $i \geq 10$ if $a_i > 0$, let $b_i$ be the positive integer whose base-$(i + 1)$ representation is the same as $a_i$'s base-$i$ representation. Then let $a_{i + 1} = b_i - 1$. If $a_i = 0$, $a_{i + 1} = 0$. [/list] For example, if $a_{10} = 11$, then $b_{10} = 11_{11} (= 12_{10})$; $a_{11} = 11_{11} - 1 = 10_{11} (= 11_{10})$; $b_{11} = 10_{12} (= 12_{10})$; $a_{12} = 11$. Does there exist $a_{10}$ such that $a_i$ is strictly positive for all $i \geq 10$?

2019 Jozsef Wildt International Math Competition, W. 7

If $$\Omega_n=\sum \limits_{k=1}^n \left(\int \limits_{-\frac{1}{k}}^{\frac{1}{k}}(2x^{10} + 3x^8 + 1)\cos^{-1}(kx)dx\right)$$Then find $$\Omega=\lim \limits_{n\to \infty}\left(\Omega_n-\pi H_n\right)$$

1987 Bulgaria National Olympiad, Problem 4

The sequence $(x_n)_{n\in\mathbb N}$ is defined by $x_1=x_2=1$, $x_{n+2}=14x_{n+1}-x_n-4$ for each $n\in\mathbb N$. Prove that all terms of this sequence are perfect squares.

2014 Albania Round 2, 2

Sides of a triangle form an arithmetic sequence with common difference $2$, and its area is $6 \text{ cm }^2$. Find its sides.

2023 SEEMOUS, P4

Let $f:\mathbb{R}\to\mathbb{R}$ be a continuous, strictly decreasing function such that $f([0,1])\subseteq[0,1]$. [list=i] [*]For all positive integers $n{}$ prove that there exists a unique $a_n\in(0,1)$, solution of the equation $f(x)=x^n$. Moreover, if $(a_n){}$ is the sequence defined as above, prove that $\lim_{n\to\infty}a_n=1$. [*]Suppose $f$ has a continuous derivative, with $f(1)=0$ and $f'(1)<0$. For any $x\in\mathbb{R}$ we define \[F(x)=\int_x^1f(t) \ dt.\]Let $\alpha{}$ be a real number. Study the convergence of the series \[\sum_{n=1}^\infty F(a_n)^\alpha.\] [/list]

2019 Jozsef Wildt International Math Competition, W. 11

Tags: Sequences , limit
Let $(s_n)_{n\geq 1}$ be a sequence given by $s_n=-2\sqrt{n}+\sum \limits_{k=1}^n\frac{1}{\sqrt{k}}$ with $\lim \limits_{n \to \infty}s_n=s=$Ioachimescu constant and $(a_n)_{n\geq 1}$ , $(b_n)_{n\geq 1}$ be a positive real sequences such that $$\lim \limits_{n\to \infty}\frac{a_{n+1}}{na_n}=a\in \mathbb{R}^*_+, \lim \limits_{n\to \infty}\frac{b_{n+1}}{b_n\sqrt{n}}=b\in \mathbb{R}^*_+$$Compute$$\lim \limits_{n\to \infty}\left(1+e^{s_n}-e^{s_{n+1}}\right)^{\sqrt[n]{a_nb_n}}$$

1999 Bundeswettbewerb Mathematik, 2

The sequences $(a_n)$ and $(b_n)$ are defined by $a_1 = b_1 = 1$ and $a_{n+1} = a_n +b_n, b_{n+1} = a_nb_n$ for $n = 1,2,...$ Show that every two distinct terms of the sequence $(a_n)$ are coprime

2017 Dutch IMO TST, 2

Tags: Sequences , algebra
let $a_1,a_2,...a_n$ a sequence of real numbers such that $a_1+....+a_n=0$. define $b_i=a_1+a_2+....a_i$ for all $1 \leq i \leq n$ .suppose $b_i(a_{j+1}-a_{i+1}) \geq 0$ for all $1 \leq i \leq j \leq n-1$. Show that $$\max_{1 \leq l \leq n} |a_l| \geq \max_{1 \leq m \leq n} |b_m|$$

2024 Middle European Mathematical Olympiad, 1

Let $\mathbb{N}_0$ denote the set of non-negative integers. Determine all non-negative integers $k$ for which there exists a function $f: \mathbb{N}_0 \to \mathbb{N}_0$ such that $f(2024) = k$ and $f(f(n)) \leq f(n+1) - f(n)$ for all non-negative integers $n$.