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

1992 IMO Longlists, 55

For any positive integer $ x$ define $ g(x)$ as greatest odd divisor of $ x,$ and \[ f(x) \equal{} \begin{cases} \frac {x}{2} \plus{} \frac {x}{g(x)} & \text{if \ \(x\) is even}, \\ 2^{\frac {x \plus{} 1}{2}} & \text{if \ \(x\) is odd}. \end{cases} \] Construct the sequence $ x_1 \equal{} 1, x_{n \plus{} 1} \equal{} f(x_n).$ Show that the number 1992 appears in this sequence, determine the least $ n$ such that $ x_n \equal{} 1992,$ and determine whether $ n$ is unique.

1963 Putnam, A4

Tags: limsup , sequence
Let $(a_n)$ be a sequence of positive real numbers. Show that $$ \limsup_{n \to \infty} n \left(\frac{1 +a_{n+1}}{a_n } -1 \right) \geq 1$$ and prove that $1$ cannot be replaced by any larger number.

1966 IMO Longlists, 42

Given a finite sequence of integers $a_{1},$ $a_{2},$ $...,$ $a_{n}$ for $n\geq 2.$ Show that there exists a subsequence $a_{k_{1}},$ $a_{k_{2}},$ $...,$ $a_{k_{m}},$ where $1\leq k_{1}\leq k_{2}\leq...\leq k_{m}\leq n,$ such that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}$ is divisible by $n.$ [b]Note by Darij:[/b] Of course, the $1\leq k_{1}\leq k_{2}\leq ...\leq k_{m}\leq n$ should be understood as $1\leq k_{1}<k_{2}<...<k_{m}\leq n;$ else, we could take $m=n$ and $k_{1}=k_{2}=...=k_{m},$ so that the number $a_{k_{1}}^{2}+a_{k_{2}}^{2}+...+a_{k_{m}}^{2}=n^{2}a_{k_{1}}^{2}$ will surely be divisible by $n.$

2022 Assara - South Russian Girl's MO, 6

There are $2022$ numbers arranged in a circle $a_1, a_2, . . ,a_{2022}$. It turned out that for any three consecutive $a_i$, $a_{i+1}$, $a_{i+2}$ the equality $a_i =\sqrt2 a_{i+2} - \sqrt3 a_{i+1}$. Prove that $\sum^{2022}_{i=1} a_ia_{i+2} = 0$, if we know that $a_{2023} = a_1$, $a_{2024} = a_2$.

2020 Caucasus Mathematical Olympiad, 3

Let $a_n$ be a sequence given by $a_1 = 18$, and $a_n = a_{n-1}^2+6a_{n-1}$, for $n>1$. Prove that this sequence contains no perfect powers.

2019 Thailand TSTST, 1

Let $\{x_i\}^{\infty}_{i=1}$ and $\{y_i\}^{\infty}_{i=1}$ be sequences of real numbers such that $x_1=y_1=\sqrt{3}$, $$x_{n+1}=x_n+\sqrt{1+x_n^2}\quad\text{and}\quad y_{n+1}=\frac{y_n}{1+\sqrt{1+y_n^2}}$$ for all $n\geq 1$. Prove that $2<x_ny_n<3$ for all $n>1$.

2014 IMC, 1

Tags: sequence
For a positive integer $x$, denote its $n^{\mathrm{th}}$ decimal digit by $d_n(x)$, i.e. $d_n(x)\in \{ 0,1, \dots, 9\}$ and $x=\sum_{n=1}^{\infty} d_n(x)10^{n-1}$. Suppose that for some sequence $(a_n)_{n=1}^{\infty}$, there are only finitely many zeros in the sequence $(d_n(a_n))_{n=1}^{\infty}$. Prove that there are infinitely many positive integers that do not occur in the sequence $(a_n)_{n=1}^{\infty}$. (Proposed by Alexander Bolbot, State University, Novosibirsk)

2015 India IMO Training Camp, 3

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]

1995 IMO, 4

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

2014 Hanoi Open Mathematics Competitions, 3

Tags: sequence , digit , algebra
How many $0$'s are there in the sequence $x_1, x_2,..., x_{2014}$ where $x_n =\big[ \frac{n + 1}{\sqrt{2015}}\big] -\big[ \frac{n }{\sqrt{2015}}\big]$ , $n = 1, 2,...,2014$ ? (A): $1128$, (B): $1129$, (C): $1130$, (D): $1131$, (E) None of the above.

2023 China National Olympiad, 1

Tags: algebra , sequence
Define the sequences $(a_n),(b_n)$ by \begin{align*} & a_n, b_n > 0, \forall n\in\mathbb{N_+} \\ & a_{n+1} = a_n - \frac{1}{1+\sum_{i=1}^n\frac{1}{a_i}} \\ & b_{n+1} = b_n + \frac{1}{1+\sum_{i=1}^n\frac{1}{b_i}} \end{align*} 1) If $a_{100}b_{100} = a_{101}b_{101}$, find the value of $a_1-b_1$; 2) If $a_{100} = b_{99}$, determine which is larger between $a_{100}+b_{100}$ and $a_{101}+b_{101}$.

2018 Peru Cono Sur TST, 9

Find the largest possible value of the positive integer $N$ given that there exist positive integers $a_1, a_2, \dots, a_N$ satisfying $$ a_n = \sqrt{(a_{n-1})^2 + 2018 \, a_{n-2}}\:, \quad \text{for } n = 3,4,\dots,N. $$

2023 Brazil Cono Sur TST, 4

Tags: sequence
Let $p$ be a prime number. Determine all positive integers $a$ such that the sequence $(a_n)_{n\geq 0}$ defined by $a_0=a$ and $a_{n+1}=pa_n-(p-1)\lfloor \sqrt[p]{a_ n} \rfloor^p$, for every $n\geq0$, is eventually constant.

1978 IMO Longlists, 24

Let $0<f(1)<f(2)<f(3)<\ldots$ a sequence with all its terms positive$.$ The $n-th$ positive integer which doesn't belong to the sequence is $f(f(n))+1.$ Find $f(240).$

2022 Kazakhstan National Olympiad, 6

Given an infinite positive integer sequence $\{x_i\}$ such that $$x_{n+2}=x_nx_{n+1}+1$$ Prove that for any positive integer $i$ there exists a positive integer $j$ such that $x_j^j$ is divisible by $x_i^i$. [i]Remark: Unfortunately, there was a mistake in the problem statement during the contest itself. In the last sentence, it should say "for any positive integer $i>1$ ..."[/i]

1969 IMO Shortlist, 28

$(GBR 5)$ Let us define $u_0 = 0, u_1 = 1$ and for $n\ge 0, u_{n+2} = au_{n+1}+bu_n, a$ and $b$ being positive integers. Express $u_n$ as a polynomial in $a$ and $b.$ Prove the result. Given that $b$ is prime, prove that $b$ divides $a(u_b -1).$

2010 VTRMC, Problem 6

Define a sequence by $a_1=1,a_2=\frac12$, and $a_{n+2}=a_{n+1}-\frac{a_na_{n+1}}2$ for $n$ a positive integer. Find $\lim_{n\to\infty}na_n$.

2023 Olimphíada, 2

The Fibonacci sequence is defined by $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for every integer $n$. A sequence $(a_n)$ of integers is said to be $\textit{phirme}$ if there is a fixed integer $k$ such that $a_n + a_{n+1} = F_{n+k}$ for all $n \geq 1$. Show that if $(a_n)$ is a $\textit{phirme}$ sequence, then there exists an integer $c$ such that $$a_n = F_{n+k-2} + (-1)^nc.$$

1990 Tournament Of Towns, (271) 5

The numerical sequence $\{x_n\}$ satisfies the condition $$x_{n+1}=|x_n|-x_{n-1}$$ for all $n > 1$. Prove that the sequence is periodic with period $9$, i.e. for any $n > 1$ we have $x_n = x_{n+9}$. (M Kontsevich, Moscow)

1983 Austrian-Polish Competition, 8

(a) Prove that $(2^{n+1}-1)!$ is divisible by $ \prod_{i=0}^n (2^{n+1-i}-1)^{2^i }$, for every natural number n (b) Define the sequence ($c_n$) by $c_1=1$ and $c_{n}=\frac{4n-6}{n}c_{n-1}$ for $n\ge 2$. Show that each $c_n$ is an integer.

1989 Czech And Slovak Olympiad IIIA, 6

Consider a finite sequence $a_1, a_2,...,a_n$ whose terms are natural numbers at most equal to $n$. Determine the maximum number of terms of such a sequence, if you know that every two of its neighboring terms are different and at the same time there is no quartet of terms in it such that $a_p = a_r \ne a_q = a_s$ for $p < q < r < s$.

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

1968 All Soviet Union Mathematical Olympiad, 109

Two finite sequences $a_1,a_2,...,a_n,b_1,b_2,...,b_n$ are just rearranged sequence $1, 1/2, ... , 1/n$ with $$a_1+b_1\ge a_2+b_2\ge...\ge a_n+b_n.$$ Prove that $a_m+a_n\ge 4/m$ for every $m$ ($1\le m\le n$) .

2018 District Olympiad, 3

Let $(a_n)_{n\ge 1}$ be a sequence such that $a_n > 1$ and $a_{n+1}^2 \ge a_n a_{n + 2}$, for any $n\ge 1$. Show that the sequence $(x_n)_{n\ge 1}$ given by $x_n = \log_{a_n} a_{n + 1}$ for $n\ge 1$ is convergent and compute its limit.

2014 Federal Competition For Advanced Students, 3

Let $a_n$ be a sequence de fined by some $a_0$ and the recursion $a_{n+1} = a_n + 2 \cdot 3^n$ for $n \ge 0$. Determine all rational values of $a_0$ such that $a^j_k / a^k_j$ is an integer for all integers $j$ and $k$ with $0 < j < k$.