Olympiad problems

2021 Chile National Olympiad, 1

Consider the sequence of numbers defined by $a_1 = 7$, $a_2 = 7^7$ , $ ...$ , $a_n = 7^{a_{n-1}}$ for $n \ge 2$. Determine the last digit of the decimal representation of $a_{2021}$.

Mathley 2014-15, 5

Tags: sequence , recurrence relation , algebra

Given the sequence $(u_n)_{n=1}^{\infty}$, where $u_1 = 1, u_2 = 2$, and $u_{n + 2} = u_{n + 1} +u_ n+ \frac{(-1)^n-1}{2}$ for any positive integers $n$. Prove that every positive integers can be expressed as the sum of some distinguished numbers of the sequence of numbers $(u_n)_{n=1}^{\infty}$ Nguyen Duy Thai Son, The University of Danang, Da Nang.

2018 Thailand TSTST, 4

Tags: algebra , recurrence relation , sequence , inequality

Define the numbers $a_0, a_1, \ldots, a_n$ in the following way: \[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \] Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]

2008 China Team Selection Test, 2

Tags: induction , number theory , sequence , recurrence relation , algebra

The sequence $ \{x_{n}\}$ is defined by $ x_{1} \equal{} 2,x_{2} \equal{} 12$, and $ x_{n \plus{} 2} \equal{} 6x_{n \plus{} 1} \minus{} x_{n}$, $ (n \equal{} 1,2,\ldots)$. Let $ p$ be an odd prime number, let $ q$ be a prime divisor of $ x_{p}$. Prove that if $ q\neq2,3,$ then $ q\geq 2p \minus{} 1$.

2009 Argentina National Olympiad, 6

Tags: sum of digits , digit , recurrence relation , number theory

A sequence $a_0,a_1,a_2,...,a_n,...$ is such that $a_0=1$ and, for each $n\ge 0$ , $a_{n+1}=m \cdot a_n$ , where $m$ is an integer between $2$ and $9$ inclusive. Also, every integer between $2$ and $9$ has even been used at least once to get $a_{n+1} $ from $a_n$ . Let $Sn$ the sum of the digits of $a_n$ , $n=0,1,2,...$ . Prove that $S_n \ge S_{n+1}$ for infinite values of $n$.

2012 Switzerland - Final Round, 4

Tags: recurrence relation , prime , number theory

Show that there is no infinite sequence of primes $p_1, p_2, p_3, . . .$ there any for each $ k$: $p_{k+1} = 2p_k - 1$ or $p_{k+1} = 2p_k + 1$ is fulfilled. Note that not the same formula for every $k$.

2016 Saudi Arabia IMO TST, 1

Tags: combinatorial geometry , recurrence relation , point

On the Cartesian coordinate system $Oxy$, consider a sequence of points $A_n(x_n, y_n)$ in which $(x_n)^{\infty}_{n=1}$,$(y_n)^{\infty}_{n=1}$ are two sequences of positive numbers satisfing the following conditions: $$x_{n+1} =\sqrt{\frac{x_n^2+x_{n+2}^2}{2}}, y_{n+1} =\big( \frac{\sqrt{y_n}+\sqrt{y_{n+2}}}{2} \big)^2 \,\, \forall n \ge 1 $$ Suppose that $O, A_1, A_{2016}$ belong to a line $d$ and $A_1, A_{2016}$ are distinct. Prove that all the points $A_2, A_3,. .. , A_{2015}$ lie on one side of $d$.

2009 China Northern MO, 1

Tags: sequence , algebra , recurrence relation

Sequence {$x_n$} satisfies: $x_1=1$ , ${x_n=\sqrt{x_{n-1}^2+x_{n-1}}+x_{n-1}}$ ( ${n>=2}$ ) Find the general term of {$x_n$}

1972 Czech and Slovak Olympiad III A, 3

Tags: algebra , polynomial , sequence , recurrence relation

Consider a sequence of polynomials such that $P_0(x)=2,P_1(x)=x$ and for all $n\ge1$ \[P_{n+1}(x)+P_{n-1}(x)=xP_n(x).\] a) Determine the polynomial \[Q_n(x)=P^2_n(x)-xP_n(x)P_{n-1}(x)+P^2_{n-1}(x)\] for $n=1972.$ b) Express the polynomial \[\bigl(P_{n+1}(x)-P_{n-1}(x)\bigr)^2\] in terms of $P_n(x),Q_n(x).$

1980 IMO, 2

Tags: sequence , recurrence relation , number theory

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

2001 Moldova National Olympiad, Problem 2

Tags: recurrence relation , sequence , algebra

Let $m\ge2$ be an integer. The sequence $(a_n)_{n\in\mathbb N}$ is defined by $a_0=0$ and $a_n=\left\lfloor\frac nm\right\rfloor+a_{\left\lfloor\frac nm\right\rfloor}$ for all $n$. Determine $\lim_{n\to\infty}\frac{a_n}n$.

1993 Abels Math Contest (Norwegian MO), 3

Tags: fermat number , coprime , recurrence relation , number theory

The Fermat-numbers are defined by $F_n = 2^{2^n}+1$ for $n\in N$. (a) Prove that $F_n = F_{n-1}F_{n-2}....F_1F_0 +2$ for $n > 0$. (b) Prove that any two different Fermat numbers are coprime

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.

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]

2023 ISI Entrance UGB, 6

Tags: inequalities , recurrence relation

Let $\{u_n\}_{n \ge 1}$ be a sequence of real numbers defined as $u_1 = 1$ and \[ u_{n+1} = u_n + \frac{1}{u_n} \text{ for all $n \ge 1$.}\] Prove that $u_n \le \frac{3\sqrt{n}}{2}$ for all $n$.

2019 Miklós Schweitzer, 6

Tags: recurrence relation

Let $d$ be a positive integer and $1 < a \le (d+2)/(d+1)$. For given $x_0, x_1,\dots, x_d \in (0, a-1)$, let $x_{k+1} = x_k (a - x_{k-d})$, $k \ge d$. Prove that $\lim_{k \to \infty} x_k = a-1$.

1969 IMO Shortlist, 31

Tags: combinatorics , counting , recurrence relation , permutation

$(GDR 3)$ Find the number of permutations $a_1, \cdots, a_n$ of the set $\{1, 2, . . ., n\}$ such that $|a_i - a_{i+1}| \neq 1$ for all $i = 1, 2, . . ., n - 1.$ Find a recurrence formula and evaluate the number of such permutations for $n \le 6.$

2021 Dutch IMO TST, 1

Tags: sequence , recurrence relation , number theory

The sequence of positive integers $a_0, a_1, a_2, . . .$ is defined by $a_0 = 3$ and $$a_{n+1} - a_n = n(a_n - 1)$$ for all $n \ge 0$. Determine all integers $m \ge 2$ for which $gcd (m, a_n) = 1$ for all $n \ge 0$.

2017 Korea USCM, 3

Tags: real analysis , limit , recurrence relation

Sequence $\{a_n\}$ defined by recurrence relation $a_{n+1} = 1+\frac{n^2}{a_n}$. Given $a_1>1$, find the value of $\lim\limits_{n\to\infty} \frac{a_n}{n}$ with proof.

1992 IMO Longlists, 49

Tags: recurrence relation , inequality , sequence , algebra

Given real numbers $x_i \ (i = 1, 2, \cdots, 4k + 2)$ such that \[\sum_{i=1}^{4k +2} (-1)^{i+1} x_ix_{i+1} = 4m \qquad ( \ x_1=x_{4k+3} \ )\] prove that it is possible to choose numbers $x_{k_{1}}, \cdots, x_{k_{6}}$ such that \[\sum_{i=1}^{6} (-1)^{i} k_i k_{i+1} > m \qquad ( \ x_{k_{1}} = x_{k_{7}} \ )\]