Olympiad problems

2020 Moldova EGMO TST, 3

Tags: sequence , algebra

Let the sequence $a_n$, $n\geq2$, $a_n=\frac{\sqrt[3]{n^3+n^2-n-1}}{n} $. Find the greatest natural number $k$ ,such that $a_2 \cdot a_3 \cdot . . .\cdot a_k <8$

2017 Puerto Rico Team Selection Test, 4

Tags: algebra , sequence

We define the sequences $a_n =\frac{n (n + 1)}{2}$ and $b_n = a_1 + a_2 +… + a_n$. Prove that there is no integer $n$ such that $b_n = 2017$.

2016 IFYM, Sozopol, 7

Tags: number theory , gcd , lcm , sequence

We are given a non-infinite sequence $a_1,a_2…a_n$ of natural numbers. While it is possible, on each turn are chosen two arbitrary indexes $i<j$ such that $a_i \nmid a_j$, and then $a_i$ and $a_j$ are changed with their $gcd$ and $lcm$. Prove that this process is non-infinite and the created sequence doesn’t depend on the made choices.

2010 Peru IMO TST, 9

Tags: modular arithmetic , number theory , sequence , divisibility

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]

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

1994 Tournament Of Towns, (414) 2

Tags: algebra , rational , sequence , periodic

Consider a sequence of numbers between $0$ and $1$ in which the next number after $x$ is $1 - |1 - 2x|$. ($|x| = x$ if$ x \ge 0$, $|x| = -x$ if $x < 0$.) Prove that (a) if the first number of the sequence is rational, then the sequence will be periodic (i.e. the terms repeat with a certain cycle length after a certain term in the sequence); (b) if the sequence is periodic, then the first number is rational. (G Shabat)

2009 Ukraine Team Selection Test, 7

Tags: number theory , modular arithmetic , sequence , divisibility

Let $ a_1$, $ a_2$, $ \ldots$, $ a_n$ be distinct positive integers, $ n\ge 3$. Prove that there exist distinct indices $ i$ and $ j$ such that $ a_i \plus{} a_j$ does not divide any of the numbers $ 3a_1$, $ 3a_2$, $ \ldots$, $ 3a_n$. [i]Proposed by Mohsen Jamaali, Iran[/i]

2020 Kosovo National Mathematical Olympiad, 1

Tags: sequence , terms , algebra , combinatorics

Some positive integers, sum of which is $23$, are written in sequential form. Neither one of the terms nor the sum of some consecutive terms in the sequence is equal to $3$. [b]a) [/b]Is it possible that the sequence contains exactly $11$ terms? [b]b)[/b]Is it possible that the sequence contains exactly $12$ terms?

2017 Romania National Olympiad, 1

Tags: real analysis , function , continuity , sequence

Let be a surjective function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that has the property that if the sequence $ \left( f\left( x_n \right) \right)_{n\ge 1} $ is convergent, then the sequence $ \left( x_n \right)_{n\ge 1} $ is convergent. Prove that it is continuous.

1999 Belarusian National Olympiad, 3

Tags: sequence , algebra

A sequence of numbers $a_1,a_2,...,a_{1999}$ is given. In each move it is allowed to choose two of the numbers, say $a_m,a_n$, and replace them by the numbers $$\frac{a_n^2}{a_m^2}-\frac{n}{m}\left(\frac{a_m^2}{a_n}-a_m\right), \frac{a_m^2}{a_n^2}-\frac{m}{n}\left(\frac{a_n^2}{a_m}-a_n\right) $$ respectively. Starting with the sequence $a_i = 1$ for $20 \nmid i$ and $a_i =\frac{1}{5}$ for $20 \mid i$, is it possible to obtain a sequence whose all terms are integers?

2015 APMO, 5

Tags: sequence , number theory

Determine all sequences $a_0 , a_1 , a_2 , \ldots$ of positive integers with $a_0 \ge 2015$ such that for all integers $n\ge 1$: (i) $a_{n+2}$ is divisible by $a_n$ ; (ii) $|s_{n+1} - (n + 1)a_n | = 1$, where $s_{n+1} = a_{n+1} - a_n + a_{n-1} - \cdots + (-1)^{n+1} a_0$ . [i]Proposed by Pakawut Jiradilok and Warut Suksompong, Thailand[/i]

2007 India IMO Training Camp, 1

Tags: floor function , algebra , sequence , recurrence relation , periodic sequence

A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula \[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0; \]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large. [i]Proposed by Harmel Nestra, Estionia[/i]

1998 Portugal MO, 6

Tags: inequalities , algebra , sequence , recurrence relation

Let $a_0$ be a positive real number and consider the general term sequence $a_n$ defined by $$a_n =a_{n-1} + \frac{1}{a_{n-1}} \,\,\, n=1,2,3,...$$ Prove that $a_{1998} > 63$.

2011 Miklós Schweitzer, 7

Tags: real analysis , sequence

prove that for any sequence of nonnegative numbers $(a_n)$, $$\liminf_{n\to\infty} (n^2(4a_n(1-a_{n-1})-1))\leq\frac{1}{4}$$

1992 French Mathematical Olympiad, Problem 4

Tags: sequence , recurrence relation , algebra

Given $u_0,u_1$ with $0<u_0,u_1<1$, define the sequence $(u_n)$ recurrently by the formula $$u_{n+2}=\frac12\left(\sqrt{u_{n+1}}+\sqrt{u_n}\right).$$(a) Prove that the sequence $u_n$ is convergent and find its limit. (b) Prove that, starting from some index $n_0$, the sequence $u_n$ is monotonous.

2007 IMO Shortlist, 5

Tags: inequalities , sequence , bounded , recurrence relation , bodan last post

Let $ c > 2,$ and let $ a(1), a(2), \ldots$ be a sequence of nonnegative real numbers such that \[ a(m \plus{} n) \leq 2 \cdot a(m) \plus{} 2 \cdot a(n) \text{ for all } m,n \geq 1, \] and $ a\left(2^k \right) \leq \frac {1}{(k \plus{} 1)^c} \text{ for all } k \geq 0.$ Prove that the sequence $ a(n)$ is bounded. [i]Author: Vjekoslav Kovač, Croatia[/i]

2020 Vietnam National Olympiad, 1

Tags: sequence

Let a sequence $(x_n)$ satisfy :$x_1=1$ and $x_{n+1}=x_n+3\sqrt{x_n} + \frac{n}{\sqrt{x_n}}$,$\forall$n$\ge1$ a) Prove lim$\frac{n}{x_n}=0$ b) Find lim$\frac{n^2}{x_n}$

1995 IMO Shortlist, 2

Tags: algebra , sequence , maximization , maximum value

Find the maximum value of $ x_{0}$ for which there exists a sequence $ x_{0},x_{1}\cdots ,x_{1995}$ of positive reals with $ x_{0} \equal{} x_{1995}$, such that \[ x_{i \minus{} 1} \plus{} \frac {2}{x_{i \minus{} 1}} \equal{} 2x_{i} \plus{} \frac {1}{x_{i}}, \] for all $ i \equal{} 1,\cdots ,1995$.

1984 Bundeswettbewerb Mathematik, 3

Tags: algebra , recurrence relation , sequence

The sequences $a_1, a_2, a_3,...$ and $b_1, b_2, b_3,... $suffices for all positive integers $n$ of the following recursion: $a_{n+1} = a_n - b_n$ and $b_{n+1} = 2b_n$, if $a_n \ge b_n$, $a_{n+1} = 2a_n$ and $b_{n+1} = b_n - a_n$, if $a_n < b_n$. For which pairs $(a_1, b_1)$ of positive real initial terms is there an index $k$ with $a_k = 0$?

2009 Postal Coaching, 1

Tags: sequence , power of 2 , recurrence relation , algebra

Let $a_1, a_2, a_3, . . . , a_n, . . . $ be an infinite sequence of natural numbers in which $a_1$ is not divisible by $5$. Suppose $a_{n+1} = a_n + b_n$ where bn is the last digit of $a_n$, for every $n$. Prove that the sequence $\{a_n\}$ contains infinitely many powers of 2.

1992 IMO Longlists, 18

Tags: combinatorics , fibonacci , fibonacci sequence , combinatorics of words , sequence

Fibonacci numbers are defined as follows: $F_0 = F_1 = 1, F_{n+2} = F_{n+1}+F_n, n \geq 0$. Let $a_n$ be the number of words that consist of $n$ letters $0$ or $1$ and contain no two letters $1$ at distance two from each other. Express $a_n$ in terms of Fibonacci numbers.

1980 IMO Shortlist, 13

Tags: algebra , arithmetic sequence , arithmetic progression , sequence

Given three infinite arithmetic progressions of natural numbers such that each of the numbers 1,2,3,4,5,6,7 and 8 belongs to at least one of them, prove that the number 1980 also belongs to at least one of them.

2008 Indonesia TST, 2

Tags: algebra , inequalities , sequence , sum

Let $\{a_n\}_{n \in N}$ be a sequence of real numbers with $a_1 = 2$ and $a_n =\frac{n^2 + 1}{\sqrt{n^3 - 2n^2 + n}}$ for all positive integers $n \ge 2$. Let $s_n = a_1 + a_2 + ...+ a_n$ for all positive integers $n$. Prove that $$\frac{1}{s_1s_2}+\frac{1}{s_2s_3}+ ...+\frac{1}{s_ns_{n+1}}<\frac15$$ for all positive integers $n$.

2018 Poland - Second Round, 6

Tags: algebra , analysis , sequence

Let $k$ be a positive integer and $a_1, a_2, ...$ be a sequence of terms from set $\{ 0, 1, ..., k \}$. Let $b_n = \sqrt[n] {a_1^n + a_2^n + ... + a_n^n}$ for all positive integers $n$. Prove, that if in sequence $b_1, b_2, b_3, ...$ are infinitely many integers, then all terms of this series are integers.

2007 Germany Team Selection Test, 1

Tags: calculus , floor function , number theory , sequence , summation

We define a sequence $ \left(a_{1},a_{2},a_{3},\ldots \right)$ by \[ a_{n} \equal{} \frac {1}{n}\left(\left\lfloor\frac {n}{1}\right\rfloor \plus{} \left\lfloor\frac {n}{2}\right\rfloor \plus{} \cdots \plus{} \left\lfloor\frac {n}{n}\right\rfloor\right), \] where $\lfloor x\rfloor$ denotes the integer part of $x$. [b]a)[/b] Prove that $a_{n+1}>a_n$ infinitely often. [b]b)[/b] Prove that $a_{n+1}<a_n$ infinitely often. [i]Proposed by Johan Meyer, South Africa[/i]