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

2006 IMO Shortlist, 1

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]

2023 Belarusian National Olympiad, 11.5

A sequence of positive integers is given such that the sum of any $6$ consecutive terms does not exceed $11$. Prove that for any positive integer $a$ in the sequence one can find consecutive terms with sum $a$

2015 APMO, 3

A sequence of real numbers $a_0, a_1, . . .$ is said to be good if the following three conditions hold. (i) The value of $a_0$ is a positive integer. (ii) For each non-negative integer $i$ we have $a_{i+1} = 2a_i + 1 $ or $a_{i+1} =\frac{a_i}{a_i + 2} $ (iii) There exists a positive integer $k$ such that $a_k = 2014$. Find the smallest positive integer $n$ such that there exists a good sequence $a_0, a_1, . . .$ of real numbers with the property that $a_n = 2014$. [i]Proposed by Wang Wei Hua, Hong Kong[/i]

1996 Czech And Slovak Olympiad IIIA, 1

A sequence $(G_n)_{n=0}^{\infty}$ satisfies $G(0) = 0$ and $G(n) = n-G(G(n-1))$ for each $n \in N$. Show that (a) $G(k) \ge G(k -1)$ for every $k \in N$; (b) there is no integer $k$ for which $G(k -1) = G(k) = G(k +1)$.

2018 Bosnia And Herzegovina - Regional Olympiad, 2

Tags: sum , sequence , algebra
Let $a_1, a_2,...,a_{2018}$ be a sequence of numbers such that all its elements are elements of a set $\{-1,1\}$. Sum $$S=\sum \limits_{1 \leq i < j \leq 2018} a_i a_j$$ can be negative and can also be positive. Find the minimal value of this sum

2022 Greece Team Selection Test, 3

Find largest possible constant $M$ such that, for any sequence $a_n$, $n=0,1,2,...$ of real numbers, that satisfies the conditions : i) $a_0=1$, $a_1=3$ ii) $a_0+a_1+...+a_{n-1} \ge 3 a_n - a_{n+1}$ for any integer $n\ge 1$ to be true that $$\frac{a_{n+1}}{a_n} >M$$ for any integer $n\ge 0$.

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

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

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.

1983 IMO Longlists, 9

Consider the set of all strictly decreasing sequences of $n$ natural numbers having the property that in each sequence no term divides any other term of the sequence. Let $A = (a_j)$ and $B = (b_j)$ be any two such sequences. We say that $A$ precedes $B$ if for some $k$, $a_k < b_k$ and $a_i = b_i$ for $i < k$. Find the terms of the first sequence of the set under this ordering.

2020 Romania EGMO TST, P1

Let $a$ be a positive integer and $(a_n)_{n\geqslant 1}$ be a sequence of positive integers satisfying $a_n<a_{n+1}\leqslant a_n+a$ for all $n\geqslant 1$. Prove that there are infinitely many primes which divide at least one term of the sequence. [i]Moldavia Olympiad, 1994[/i]

2012 Indonesia TST, 1

The sequence $a_i$ is defined as $a_1 = 2, a_2 = 3$, and $a_{n+1} = 2a_{n-1}$ or $a_{n+1} = 3a_n - 2a_{n-1}$ for all integers $n \ge 2$. Prove that no term in $a_i$ is in the range $[1612, 2012]$.

2019 Federal Competition For Advanced Students, P1, 1

We consider the two sequences $(a_n)_{n\ge 0}$ and $(b_n) _{n\ge 0}$ of integers, which are given by $a_0 = b_0 = 2$ and $a_1= b_1 = 14$ and for $n\ge 2$ they are defined as $a_n = 14a_{n-1} + a_{n-2}$ , $b_n = 6b_{n-1}-b_{n-2}$. Determine whether there are infinite numbers that occur in both sequences

VMEO II 2005, 3

Given positive integers $a_1$, $a_2$, $...$, $a_m$ ($m \ge 1$). Consider the sequence $\{u_n\}_{n=1}^{\infty}$, with $$u_n = a_1^n + a_2^n + ... + a_m^n.$$ We know that this sequence has a finite number of prime divisors. Prove that $a_1 = a_2 = ...= a_m$.

2022 Brazil EGMO TST, 5

For a given value $t$, we consider number sequences $a_1, a_2, a_3,...$ such that $a_{n+1} =\frac{a_n + t}{a_n + 1}$ for all $n \ge 1$. (a) Suppose that $t = 2$. Determine all starting values $a_1 > 0$ such that $\frac43 \le a_n \le \frac32$ holds for all $n \ge 2$. (b) Suppose that $t = -3$. Investigate whether $a_{2020} = a_1$ for all starting values $a_1$ different from $-1$ and $1$.

2024 Belarus Team Selection Test, 2.1

A sequence $\{y_i\}$ is given, where $y_0=-\frac{1}{4},y_1=0$. For every positive integer $n$ the following equality holds: $$y_{n-1}+y_{n+1}=4y_n+1$$ Prove that for every positive integer $n$ the number $2y_{2n}+\frac{3}{2}$ a) is a positive integer b) is a square of a positive integer [i]D. Zmiaikou[/i]

2019 Estonia Team Selection Test, 12

Let $a_0,a_1,a_2,\dots $ be a sequence of real numbers such that $a_0=0, a_1=1,$ and for every $n\geq 2$ there exists $1 \leq k \leq n$ satisfying \[ a_n=\frac{a_{n-1}+\dots + a_{n-k}}{k}. \]Find the maximum possible value of $a_{2018}-a_{2017}$.

VMEO IV 2015, 10.1

Where $n$ is a positive integer, the sequence $a_n$ is determined by the formula $$a_{n+1}=\frac{1}{a_1 + a_2 +... + a_n} -\sqrt2, \,a_1 = 1.$$ Find the limit of the sequence $S_n$ defined by $S_n=a_1 + a_2 +... + a_n$.

2017 International Zhautykov Olympiad, 1

Let $(a_n)$ be sequnce of positive integers such that first $k$ members $a_1,a_2,...,a_k$ are distinct positive integers, and for each $n>k$, number $a_n$ is the smallest positive integer that can't be represented as a sum of several (possibly one) of the numbers $a_1,a_2,...,a_{n-1}$. Prove that $a_n=2a_{n-1}$ for all sufficently large $n$.

2022 Thailand Mathematical Olympiad, 8

Determine all possible values of $a_1$ for which there exists a sequence $a_1, a_2, \dots$ of rational numbers satisfying $$a_{n+1}^2-a_{n+1}=a_n$$ for all positive integers $n$.

2013 Korea Junior Math Olympiad, 3

$\{a_n\}$ is a positive integer sequence such that $a_{i+2} = a_{i+1} +a_i$ (for all $i \ge 1$). For positive integer $n$, de fine as $$b_n=\frac{1}{a_{2n+1}}\Sigma_{i=1}^{4n-2}a_i$$ Prove that $b_n$ is positive integer.

2005 Morocco TST, 3

Let $a_1,a_2,\ldots$ be an infinite sequence of real numbers, for which there exists a real number $c$ with $0\leq a_i\leq c$ for all $i$, such that \[\left\lvert a_i-a_j \right\rvert\geq \frac{1}{i+j} \quad \text{for all }i,\ j \text{ with } i \neq j. \] Prove that $c\geq1$.

2016 ISI Entrance Examination, 8

Suppose that $(a_n)_{n\geq 1}$ is a sequence of real numbers satisfying $a_{n+1} = \frac{3a_n}{2+a_n}$. (i) Suppose $0 < a_1 <1$, then prove that the sequence $a_n$ is increasing and hence show that $\lim_{n \to \infty} a_n =1$. (ii) Suppose $ a_1 >1$, then prove that the sequence $a_n$ is decreasing and hence show that $\lim_{n \to \infty} a_n =1$.

1954 Moscow Mathematical Olympiad, 282

Given a sequence of numbers $a_1, a_2, ..., a_{15}$, one can always construct a new sequence $b_1,b_2, ..., b_{15}$, where $b_i$ is equal to the number of terms in the sequence $\{a_k\}^{15}_{k=1}$ less than $a_i$ ($i = 1, 2,..., 15$). Is there a sequence $\{a_k\}^{15}_{k=1}$ for which the sequence $\{b_k\}^{15}_{k=1}$ is $$1, 0, 3, 6, 9, 4, 7, 2, 5, 8, 8, 5, 10, 13, 13 \,?$$

2020 New Zealand MO, 8

For a positive integer $x$, define a sequence $a_0, a_1, a_2, . . .$ according to the following rules: $a_0 = 1$, $a_1 = x + 1$ and $$a_{n+2} = xa_{n+1} - a_n$$ for all $n \ge 0$. Prove that there exist infinitely many positive integers x such that this sequence does not contain a prime number.