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

2021 Taiwan TST Round 2, N

For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ [I]United Kingdom[/i]

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.

1992 IMO Shortlist, 14

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.

2006 QEDMO 3rd, 10

Define a sequence $\left( a_{n}\right) _{n\in\mathbb{N}}$ by $a_{1}=a_{2}=a_{3}=1$ and $a_{n+1}=\dfrac{a_{n}^{2}+a_{n-1}^{2}}{a_{n-2}}$ for every integer $n\geq3$. Show that all elements $a_{i}$ of this sequence are integers. (L. J. Mordell and apparently Dana Scott, see also http://oeis.org/A064098)

1993 Austrian-Polish Competition, 7

The sequence $(a_n)$ is defined by $a_0 = 0$ and $a_{n+1} = [\sqrt[3]{a_n +n}]^3$ for $n \ge 0$. (a) Find $a_n$ in terms of $n$. (b) Find all $n$ for which $a_n = n$.

2016 China National Olympiad, 1

Let $a_1,a_2,\cdots, a_{31} ;b_1,b_2, \cdots, b_{31}$ be positive integers such that $a_1< a_2<\cdots< a_{31}\leq2015$ , $ b_1< b_2<\cdots<b_{31}\leq2015$ and $a_1+a_2+\cdots+a_{31}=b_1+b_2+\cdots+b_{31}.$ Find the maximum value of $S=|a_1-b_1|+|a_2-b_2|+\cdots+|a_{31}-b_{31}|.$

2022 Belarusian National Olympiad, 11.7

Numbers $-1011, -1010, \ldots, -1, 1, \ldots, 1011$ in some order form the sequence $a_1,a_2,\ldots, a_{2022}$. Find the maximum possible value of the sum $$|a_1|+|a_1+a_2|+\ldots+|a_1+\ldots+a_{2022}|$$

1998 Belarusian National Olympiad, 5

Is there an infinite sequence of positive real numbers $x_1,x_2,...,x_n$ satisfying for all $n\ge 1$ the relation $x_{n+2}= \sqrt{x_{n+1}}-\sqrt{x_n}$?

1988 Czech And Slovak Olympiad IIIA, 1

Let $f$ be a representation of the set $M = \{1, 2,..., 1988\}$ into $M$. For any natural $n$, let $x_1 = f(1)$, $x_{n+1} = f(x_n)$. Find out if there exists $m$ such that $x_{2m} = x_m$.

2024 Benelux, 1

Let $a_0,a_1,\dots,a_{2024}$ be real numbers such that $\left|a_{i+1}-a_i\right| \le 1$ for $i=0,1,\dots,2023$. a) Find the minimum possible value of $$a_0a_1+a_1a_2+\dots+a_{2023}a_{2024}$$ b) Does there exist a real number $C$ such that $$a_0a_1-a_1a_2+a_2a_3-a_3a_4+\dots+a_{2022}a_{2023}-a_{2023}a_{2024} \ge C$$ for all real numbers $a_0,a_1,\dots,a_2024$ such that $\left|a_{i+1}-a_i\right| \le 1$ for $i=0,1,\dots,2023$.

2024 OMpD, 4

Let \(a_0, a_1, a_2, \dots\) be an infinite sequence of positive integers with the following properties: - \(a_0\) is a given positive integer; - For each integer \(n \geq 1\), \(a_n\) is the smallest integer greater than \(a_{n-1}\) such that \(a_n + a_{n-1}\) is a perfect square. For example, if \(a_0 = 3\), then \(a_1 = 6\), \(a_2 = 10\), \(a_3 = 15\), and so on. (a) Let \(T\) be the set of numbers of the form \(a_k - a_l\), with \(k \geq l \geq 0\) integers. Prove that, regardless of the value of \(a_0\), the number of positive integers not in \(T\) is finite. (b) Calculate, as a function of \(a_0\), the number of positive integers that are not in \(T\).

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

2005 AMC 12/AHSME, 10

The first term of a sequence is 2005. Each succeeding term is the sum of the cubes of the digits of the previous terms. What is the 2005th term of the sequence? $ \textbf{(A)}\ 29\qquad \textbf{(B)}\ 55\qquad \textbf{(C)}\ 85\qquad \textbf{(D)}\ 133\qquad \textbf{(E)}\ 250$

1977 All Soviet Union Mathematical Olympiad, 239

Tags: limit , sequence , algebra
Given infinite sequence $a_n$. It is known that the limit of $$b_n=a_{n+1}-a_n/2$$ equals zero. Prove that the limit of $a_n$ equals zero.

2015 Dutch BxMO/EGMO TST, 2

Given are positive integers $r$ and $k$ and an infi nite sequence of positive integers $a_1 \le a_2 \le ...$ such that $\frac{r}{a_r}= k + 1$. Prove that there is a $t$ satisfying $\frac{t}{a_t}=k$.

2015 Postal Coaching, 4

The sequence $<a_n>$ is defined as follows, $a_1=a_2=1$, $a_3=2$, $$a_{n+3}=\frac{a_{n+2}a_{n+1}+n!}{a_n},$$ $n \ge 1$. Prove that all the terms in the sequence are integers.

1957 Moscow Mathematical Olympiad, 363

Eight consecutive numbers are chosen from the Fibonacci sequence $1, 2, 3, 5, 8, 13, 21,...$. Prove that the sequence does not contain the sum of chosen numbers.

1973 Spain Mathematical Olympiad, 1

Tags: algebra , sequence
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.

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]

2008 Thailand Mathematical Olympiad, 3

For each positive integer $n$, define $a_n = n(n + 1)$. Prove that $$n^{1/a_1} + n^{1/a_3} + n^{1/a_5} + ...+ n^{1/a_{2n-1}} \ge n^{a_{3n+2}/a_{3n+1}}$$ .

1953 Miklós Schweitzer, 3

[b]3.[/b] Denoting by $E$ the class of trigonometric polynomials of the form $f(x)=c_{0}+c_{1}cos(x)+\dots +c_{n} cos(nx)$, where $c_{0} \geq c_{1} \geq \dots \geq c_{n}>0$, prove that $(1-\frac{2}{\pi})\frac{1}{n+1}\leq min_{{f\epsilon E}}( \frac{max_{\frac{\pi}{2}\leq x\leq \pi} \left | f(x) \right |}{max_{0\leq x\leq 2\pi} \left | f(x) \right |})\leq (\frac{1}{2}+\frac{1}{\sqrt{2}})\frac{1}{n+1}$. [b](S. 24)[/b]

2021 Romania Team Selection Test, 3

Tags: algebra , sequence
Let $\alpha$ be a real number in the interval $(0,1).$ Prove that there exists a sequence $(\varepsilon_n)_{n\geq 1}$ where each term is either $0$ or $1$ such that the sequence $(s_n)_{n\geq 1}$ \[s_n=\frac{\varepsilon_1}{n(n+1)}+\frac{\varepsilon_2}{(n+1)(n+2)}+...+\frac{\varepsilon_n}{(2n-1)2n}\]verifies the inequality \[0\leq \alpha-2ns_n\leq\frac{2}{n+1}\] for any $n\geq 2.$

2019 Azerbaijan IMO TST, 3

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

2009 IMAR Test, 4

Given any $n$ positive integers, and a sequence of $2^n$ integers (with terms among them), prove there exists a subsequence made of consecutive terms, such that the product of its terms is a perfect square. Also show that we cannot replace $2^n$ with any lower value (therefore $2^n$ is the threshold value for this property).

2021 IMO Shortlist, N7

Let $a_1,a_2,a_3,\ldots$ be an infinite sequence of positive integers such that $a_{n+2m}$ divides $a_{n}+a_{n+m}$ for all positive integers $n$ and $m.$ Prove that this sequence is eventually periodic, i.e. there exist positive integers $N$ and $d$ such that $a_n=a_{n+d}$ for all $n>N.$