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

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}.$

1978 Germany Team Selection Test, 3

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 ]\]

2015 China Northern MO, 8

The sequence $\{a_n\}$ is defined as follows: $a_1$ is a positive rational number, $a_n= \frac{p_n}{q_n}$, ($n= 1,2,…$) is a positive integer, where $p_n$ and $q_n$ are positive integers that are relatively prime, then $a_{n+1} = \frac{p_n^2+2015}{p_nq_n}$ Is there a$_1>2015$, making the sequence $\{a_n\}$ a bounded sequence? Justify your conclusion.

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}.\]

1985 Tournament Of Towns, (084) T5

Every member of a given sequence, beginning with the second , is equal to the sum of the preceding one and the sum of its digits . The first member equals $1$ . Is there, among the members of this sequence, a number equal to $123456$ ? (S. Fomin , Leningrad)

VI Soros Olympiad 1999 - 2000 (Russia), 9.5

Let b be a given real number. The sequence of integers $a_1, a_2,a_3, ...$ is such that $a_1 =(b]$ and $a_{n+1}=(a_n+b]$ for all $n\ge 1$ Prove that the sum $a_1+\frac{a_2}{2}+\frac{a_3}{3}+...+\frac{a_n}{n}$ is an integer number for any natural $n$ . (In the condition of the problem, $(x]$ denotes the smallest integer that is greater than or equal to $x$)

1987 ITAMO, 5

Let $a_1,a_2,...$ and $b_1,b_2,..$. be two arbitrary infinite sequences of natural numbers. Prove that there exist different indices $r$ and $s$ such that $a_r \ge a_s$ and $b_r \ge b_s$.

1976 IMO Longlists, 13

A sequence $(u_{n})$ is defined by \[ u_{0}=2 \quad u_{1}=\frac{5}{2}, u_{n+1}=u_{n}(u_{n-1}^{2}-2)-u_{1} \quad \textnormal{for } n=1,\ldots \] Prove that for any positive integer $n$ we have \[ [u_{n}]=2^{\frac{(2^{n}-(-1)^{n})}{3}} \](where $[x]$ denotes the smallest integer $\leq x)$

2014 IMO Shortlist, A1

Let $a_0 < a_1 < a_2 < \dots$ be an infinite sequence of positive integers. Prove that there exists a unique integer $n\geq 1$ such that \[a_n < \frac{a_0+a_1+a_2+\cdots+a_n}{n} \leq a_{n+1}.\] [i]Proposed by Gerhard Wöginger, Austria.[/i]

2015 All-Russian Olympiad, 4

We denote by $S(k)$ the sum of digits of a positive integer number $k$. We say that the positive integer $a$ is $n$-good, if there is a sequence of positive integers $a_0$, $a_1, \dots , a_n$, so that $a_n = a$ and $a_{i + 1} = a_i -S (a_i)$ for all $i = 0, 1,. . . , n-1$. Is it true that for any positive integer $n$ there exists a positive integer $b$, which is $n$-good, but not $(n + 1)$-good? A. Antropov

1982 Tournament Of Towns, (017) 3

a) Prove that in an infinite sequence ${a_k}$ of integers, pairwise distinct and each member greater than $1$, one can find $100$ members for which $a_k > k$. b) Prove that in an infinite sequence ${a_k}$ of integers, pairwise distinct and each member greater than $1$ there are infinitely many such numbers $a_k$ such that $a_k > k$. (A Andjans, Riga) PS. (a) for juniors (b) for seniors

1992 Poland - Second Round, 6

The sequences $(x_n)$ and $(y_n)$ are defined as follows: $$ x_{n+1} = \frac{x_n+2}{x_n+1},\quad y_{n+1}=\frac{y_n^2+2}{2y_n} \quad \text{ for } n= 0,1,2,\ldots.$$ Prove that for every integer $ n\geq 0 $ the equality $ y_n = x_{2^n-1} $ holds.

2019 ISI Entrance Examination, 6

For all natural numbers $n$, let $$A_n=\sqrt{2-\sqrt{2+\sqrt{2+\cdots+\sqrt{2}}}}\quad\text{(n many radicals)}$$ [b](a)[/b] Show that for $n\geqslant 2$, $$A_n=2\sin\frac{\pi}{2^{n+1}}$$ [b](b)[/b] Hence or otherwise, evaluate the limit $$\lim_{n\to\infty} 2^nA_n$$

2016 Rioplatense Mathematical Olympiad, Level 3, 6

When the natural numbers are written one after another in an increasing way, you get an infinite succession of digits $123456789101112 ....$ Denote $A_k$ the number formed by the first $k$ digits of this sequence . Prove that for all positive integer $n$ there is a positive integer $m$ which simultaneously verifies the following three conditions: (i) $n$ divides $A_m$, (ii) $n$ divides $m$, (iii) $n$ divides the sum of the digits of $A_m$.

1973 Spain Mathematical Olympiad, 1

Tags: Sequence , algebra
Given the sequence $(a_n)$, in which $a_n =\frac14 n^4 - 10n^2(n - 1)$, with $n = 0, 1, 2,...$ Determine the smallest term of the sequence.

1992 Romania Team Selection Test, 2

For a positive integer $a$, define the sequence ($x_n$) by $x_1 = x_2 = 1$ and $x_{n+2 }= (a^4 +4a^2 +2)x_{n+1} -x_n -2a^2$ , for n $\ge 1$. Show that $x_n$ is a perfect square and that for $n > 2$ its square root equals the first entry in the matrix $\begin{pmatrix} a^2+1 & a \\ a & 1 \end{pmatrix}^{n-2}$

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]

2007 Gheorghe Vranceanu, 4

Let be a sequence $ \left( a_n \right)_{n\geqslant 1} $ of real numbers defined recursively as $$ a_n=2007+1004n^2-a_{n-1}-a_{n-2}-\cdots -a_2-a_1. $$ Calculate: $$ \lim_{n\to\infty} \frac{1}{n}\int_1^{a_n} e^{1/\ln t} dt $$

2020 China Girls Math Olympiad, 5

Tags: algebra , Sequence , CGMO
Find all the real number sequences $\{b_n\}_{n \geq 1}$ and $\{c_n\}_{n \geq 1}$ that satisfy the following conditions: (i) For any positive integer $n$, $b_n \leq c_n$; (ii) For any positive integer $n$, $b_{n+1}$ and $c_{n+1}$ is the two roots of the equation $x^2+b_nx+c_n=0$.

2010 IMO Shortlist, 7

Let $a_1, a_2, a_3, \ldots$ be a sequence of positive real numbers, and $s$ be a positive integer, such that \[a_n = \max \{ a_k + a_{n-k} \mid 1 \leq k \leq n-1 \} \ \textrm{ for all } \ n > s.\] Prove there exist positive integers $\ell \leq s$ and $N$, such that \[a_n = a_{\ell} + a_{n - \ell} \ \textrm{ for all } \ n \geq N.\] [i]Proposed by Morteza Saghafiyan, Iran[/i]

2021 Saudi Arabia Training Tests, 26

Given an infinite sequence of numbers $a_1, a_2, a_3, ...$ such that for each positive integer $k$, there exists positive integer $t$ for which $a_k = a_{k+t} = a_{k+2t} = ....$ Does this sequences must be periodic?

2015 Silk Road, 2

Let $\left\{ {{a}_{n}} \right\}_{n \geq 1}$ and $\left\{ {{b}_{n}} \right\}_{n \geq 1}$ be two infinite arithmetic progressions, each of which the first term and the difference are mutually prime natural numbers. It is known that for any natural $n$, at least one of the numbers $\left( a_n^2+a_{n+1}^2 \right)\left( b_n^2+b_{n+1}^2 \right) $ or $\left( a_n^2+b_n^2 \right) \left( a_{n+1}^2+b_{n+1}^2 \right)$ is an perfect square. Prove that ${{a}_{n}}={{b}_{n}}$, for any natural $n$ .

2016 Switzerland - Final Round, 6

Let $a_n$ be a sequence of natural numbers defined by $a_1 = m$ and for $n > 1$. We call apair$ (a_k, a_{\ell })$ [i]interesting [/i] if (i) $0 < \ell - k < 2016$, (ii) $a_k$ divides $a_{\ell }$. Show that there exists a $m$ such that the sequence $a_n$ contains no interesting pair.

2016 Saudi Arabia IMO TST, 1

Define the sequence $a_1, a_2,...$ as follows: $a_1 = 1$, and for every $n \ge 2$, $a_n = n - 2$ if $a_{n-1} = 0$ and $a_n = a_{n-1} - 1$, otherwise. Find the number of $1 \le k \le 2016$ such that there are non-negative integers $r, s$ and a positive integer $n$ satisfying $k = r + s$ and $a_{n+r} = a_n + s$.

1981 Austrian-Polish Competition, 2

The sequence $a_0, a_1, a_2, ...$ is defined by $a_{n+1} = a^2_n + (a_n - 1)^2$ for $n \ge 0$. Find all rational numbers $a_0$ for which there exist four distinct indices $k, m, p, q$ such that $a_q - a_p = a_m - a_k$.