Found problems: 492
1998 Moldova Team Selection Test, 8
Let $M=\{\frac{1}{n}|n\in\mathbb{N}\}$. Numbers $a_1,a_2,\ldots,a_l$ from an [i]arithmetic progression of maximum length[/i] $l$ $(l\geq 3)$ if they verify the properties:
a) numbers $a_1,a_2,\ldots,a_l$ from a finite arithmetic progression;
b) there is no number $b\in M$ such that numbers $b,a_1,a_2,\ldots,a_l$ or $a_1,a_2,\ldots,a_l, b$ form a finite arithmetic progression. For example numbers $\frac{1}{6},\frac{1}{3},\frac{1}{2}\in M$ form an arithmetic progression of maximum length $3$.
a) FInd an arithmetic progression of maximum length $1998$.
b) Prove that there exist maximum arithmetic progressions of any length $l \geq 3$.
2011 Baltic Way, 19
Let $p\neq 3$ be a prime number. Show that there is a non-constant arithmetic sequence of positive integers $x_1,x_2,\ldots ,x_p$ such that the product of the terms of the sequence is a cube.
2020 Estonia Team Selection Test, 1
Let $a_1, a_2,...$ a sequence of real numbers.
For each positive integer $n$, we denote $m_n =\frac{a_1 + a_2 +... + a_n}{n}$.
It is known that there exists a real number $c$ such that for any different positive integers $i, j, k$: $(i - j) m_k + (j - k) m_i + (k - i) m_j = c$.
Prove that the sequence $a_1, a_2,..$ is arithmetic
2025 Philippine MO, P3
Let $d$ be a positive integer. Define the sequence $a_1, a_2, a_3, \dots$ such that \[\begin{cases} a_1 = 1 \\ a_{n+1} = n\left\lfloor\frac{a_n}{n}\right\rfloor + d, \quad n \ge 1.\end{cases}\] Prove that there exists a positive integer $M$ such that $a_M, a_{M+1}, a_{M+2}, \dots$ is an arithmetic sequence.
1994 AMC 12/AHSME, 20
Suppose $x,y,z$ is a geometric sequence with common ratio $r$ and $x \neq y$. If $x, 2y, 3z$ is an arithmetic sequence, then $r$ is
$ \textbf{(A)}\ \frac{1}{4} \qquad\textbf{(B)}\ \frac{1}{3} \qquad\textbf{(C)}\ \frac{1}{2} \qquad\textbf{(D)}\ 2 \qquad\textbf{(E)}\ 4$
2007 Spain Mathematical Olympiad, Problem 1
Let $a_0, a_1, a_2, a_3, a_4$ be five positive numbers in the arithmetic progression with a difference $d$. Prove that $a^3_2 \leq \frac{1}{10}(a^3_0 + 4a^3_1 + 4a^3_3 + a^3_4).$
2021 Taiwan Mathematics Olympiad, 2.
Find all integers $n=2k+1>1$ so that there exists a permutation $a_0, a_1,\ldots,a_{k}$ of $0, 1, \ldots, k$ such that
\[a_1^2-a_0^2\equiv a_2^2-a_1^2\equiv \cdots\equiv a_{k}^2-a_{k-1}^2\pmod n.\]
[i]Proposed by usjl[/i]
2013 USAMTS Problems, 3
An infinite sequence of positive real numbers $a_1,a_2,a_3,\dots$ is called [i]territorial[/i] if for all positive integers $i,j$ with $i<j$, we have $|a_i-a_j|\ge\tfrac1j$. Can we find a territorial sequence $a_1,a_2,a_3,\dots$ for which there exists a real number $c$ with $a_i<c$ for all $i$?
2012 Iran MO (3rd Round), 2
Suppose $W(k,2)$ is the smallest number such that if $n\ge W(k,2)$, for each coloring of the set $\{1,2,...,n\}$ with two colors there exists a monochromatic arithmetic progression of length $k$. Prove that
$W(k,2)=\Omega (2^{\frac{k}{2}})$.
1977 Polish MO Finals, 3
Consider the set $A = \{0, 1, 2, . . . , 2^{2n} - 1\}$. The function $f : A \rightarrow A$ is given by: $f(x_0 + 2x_1 + 2^2x_2 + ... + 2^{2n-1}x_{2n-1})=$$(1 - x_0) + 2x_1 + 2^2(1 - x_2) + 2^3x_3 + ... + 2^{2n-1}x_{2n-1}$
for every $0-1$ sequence $(x_0, x_1, . . . , x_{2n-1})$. Show that if $a_1, a_2, . . . , a_9$ are consecutive terms of an arithmetic progression, then the sequence $f(a_1), f(a_2), . . . , f(a_9)$ is not increasing.
2017 Mathematical Talent Reward Programme, SAQ: P 5
Let $\mathbb{N}$ be the set of all natural numbers. Let $f:\mathbb{N} \to \mathbb{N}$ be a bijective function. Show that there exists three numbers $a$, $b$, $c$ in arithmatic progression such that $f(a)<f(b)<f(c)$
2019 Belarus Team Selection Test, 6.3
Let $n \ge 2018$ be an integer, and let $a_1, a_2, \dots, a_n, b_1, b_2, \dots, b_n$ be pairwise distinct positive integers not exceeding $5n$. Suppose that the sequence
\[ \frac{a_1}{b_1}, \frac{a_2}{b_2}, \dots, \frac{a_n}{b_n} \]
forms an arithmetic progression. Prove that the terms of the sequence are equal.
2005 Regional Competition For Advanced Students, 4
Prove: if an infinte arithmetic sequence ($ a_n\equal{}a_0\plus{}nd$) of positive real numbers contains two different powers of an integer $ a>1$, then the sequence contains an infinite geometric sequence ($ b_n\equal{}b_0q^n$) of real numbers.
2005 AIME Problems, 2
For each positive integer $k$, let $S_k$ denote the increasing arithmetic sequence of integers whose first term is $1$ and whose common difference is $k$. For example, $S_3$ is the sequence $1,4,7,10,...$. For how many values of $k$ does $S_k$ contain the term $2005$?
2007 China Team Selection Test, 3
Consider a $ 7\times 7$ numbers table $ a_{ij} \equal{} (i^2 \plus{} j)(i \plus{} j^2), 1\le i,j\le 7.$ When we add arbitrarily each term of an arithmetical progression consisting of $ 7$ integers to corresponding to term of certain row (or column) in turn, call it an operation. Determine whether such that each row of numbers table is an arithmetical progression, after a finite number of operations.
1973 AMC 12/AHSME, 28
If $ a$, $ b$, and $ c$ are in geometric progression (G.P.) with $ 1 < a < b < c$ and $ n > 1$ is an integer, then $ \log_an$, $ \log_b n$, $ \log_c n$ form a sequence
$ \textbf{(A)}\ \text{which is a G.P} \qquad$
$ \textbf{(B)}\ \text{whichi is an arithmetic progression (A.P)} \qquad$
$ \textbf{(C)}\ \text{in which the reciprocals of the terms form an A.P} \qquad$
$ \textbf{(D)}\ \text{in which the second and third terms are the }n\text{th powers of the first and second respectively} \qquad$
$ \textbf{(E)}\ \text{none of these}$
2024 Indonesia TST, N
Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products
\[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\]
form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.
2010 Romania Team Selection Test, 1
A nonconstant polynomial $f$ with integral coefficients has the property that, for each prime $p$, there exist a prime $q$ and a positive integer $m$ such that $f(p) = q^m$. Prove that $f = X^n$ for some positive integer $n$.
[i]AMM Magazine[/i]
2005 China Northern MO, 3
Let positive numbers $a_1, a_2, ..., a_{3n}$ $(n \geq 2)$ constitute an arithmetic progression with common difference $d > 0$. Prove that among any $n + 2$ terms in this progression, there exist two terms $a_i, a_j$ $(i \neq j)$ satisfying $1 < \frac{|a_i - a_j|}{nd} < 2$.
1998 National Olympiad First Round, 8
$ a_{1} \equal{}1$, $ a_{n\plus{}1} \equal{}\frac{a_{n} }{\sqrt{1\plus{}4a_{n}^{2} } }$ for $ n\ge 1$. What is the least $ k$ such that $ a_{k} <10^{\minus{}2}$ ?
$\textbf{(A)}\ 2501 \qquad\textbf{(B)}\ 251 \qquad\textbf{(C)}\ 2499 \qquad\textbf{(D)}\ 249 \qquad\textbf{(E)}\ \text{None}$
2006 AMC 10, 19
How many non-similar triangle have angles whose degree measures are distinct positive integers in arithmetic progression?
$ \textbf{(A) } 0 \qquad \textbf{(B) } 1 \qquad \textbf{(C) } 59 \qquad \textbf{(D) } 89 \qquad \textbf{(E) } 178$
1955 AMC 12/AHSME, 45
Given a geometric sequence with the first term $ \neq 0$ and $ r \neq 0$ and an arithmetic sequence with the first term $ \equal{}0$. A third sequence $ 1,1,2\ldots$ is formed by adding corresponding terms of the two given sequences. The sum of the first ten terms of the third sequence is:
$ \textbf{(A)}\ 978 \qquad
\textbf{(B)}\ 557 \qquad
\textbf{(C)}\ 467 \qquad
\textbf{(D)}\ 1068 \\
\textbf{(E)}\ \text{not possible to determine from the information given}$
1964 AMC 12/AHSME, 28
The sum of $n$ terms of an arithmetic progression is $153$, and the common difference is $2$. If the first interm is an integer, and $n>1$, then the number of possible values for $n$ is:
$ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6 $
2002 National High School Mathematics League, 8
Consider the expanded form of $\left(x+\frac{1}{2\sqrt[4]{x}}\right)^n$, put all items in number (from high power to low power). If the coefficients of the first three items are arithmetic sequence, then the number of items with an integral power is________.
2006 Czech-Polish-Slovak Match, 2
There are $n$ children around a round table. Erika is the oldest among them and she has $n$ candies, while no other child has any candy. Erika decided to distribute the candies according to the following rules. In every round, she chooses a child with at least two candies and the chosen child sends a candy to each of his/her two neighbors. (So in the first round Erika must choose herself). For which $n \ge 3$ is it possible to end the distribution after a finite number of rounds with every child having exactly one candy?