An arithmetic sequence is a sequence of $(a_1, a_2, \dots, a_n) $ such that the difference between any two consecutive terms is the same. That is, $a_ {i + 1} -a_i = d $ for all $i \in \{1,2, \dots, n-1 \} $, where $d$ is the difference of the progression. A sequence $(a_1, a_2, \dots, a_n) $ is [i]tlaxcalteca [/i] if for all $i \in \{1,2, \dots, n-1 \} $, there exists $m_i $ positive integer such that $a_i = \frac {1} {m_i}$. A taxcalteca arithmetic progression $(a_1, a_2, \dots, a_n )$ is said to be [i]maximal [/i] if $(a_1-d, a_1, a_2, \dots, a_n) $ and $(a_1, a_2, \dots, a_n, a_n + d) $ are not Tlaxcalan arithmetic progressions. Is there a maximal tlaxcalteca arithmetic progression of $11$ elements?

Find all real parameters $a$ for which the equation $x^8 +ax^4 +1 = 0$ has four real roots forming an arithmetic progression.

Prove that if the numbers $ a_1, a_2,\ldots, a_n $ ($ n $ - natural number $ \geq 2 $) form an arithmetic progression, and none of them is zero, then $$\frac{1}{a_1a_2} + \frac{1}{a_2a_3} + \ldots + \frac{1}{a_{n-1}a_n} = \frac{n-1}{a_1a_n}.$$

Omar made a list of all the arithmetic progressions of positive integer numbers such that the difference is equal to $2$ and the sum of its terms is $200$. How many progressions does Omar's list have?

The numbers $1,...,100$ are written on the board. Tzvi wants to colour $N$ numbers in blue, such that any arithmetic progression of length 10 consisting of numbers written on the board will contain blue number. What is the least possible value of $N$?

Determine whether there are infinitely many triples $(u,v,w)$ of positive integers such that $u,v,w$ form an arithmetic progression and the numbers $uv+1, vw+1$ and $wu+1$ are all perfect squares.

Determine all integers $n\geqslant 3$ such that there exist $n{}$ pairwise distinct real numbers $a_1,\ldots,a_n$ for which the sums $a_i+a_j$ over all $1\leqslant i<j\leqslant n$ form an arithmetic progression.

The sum of all terms of a finite arithmetical progression of integers is a power of two. Prove that the number of terms is also a power of two.

(a) Prove that in the set $ S=\{2008,2009,. . .,4200\}$ there are $ 5^3$ elements such that any three of them are not in arithmetic progression. (b) Bonus: Try to find a smaller integer $ n \in (2008,4200)$ such that in the set $ S'=\{2008,2009,...,n\}$ there are $ 5^3$ elements such that any three of them are not in arithmetic progression.

For a non-constant arithmetic progression $(a_n)$ there exists a natural $n$ such that $a_{n}+a_{n+1} = a_{1}+…+a_{3n-1}$ . Prove that there are no zero terms in this progression.

Let $P_1,P_2,\ldots ,P_n$, be infinite arithmetic progressions of positive integers, of differences $d_1,d_2,\ldots ,d_n$, respectively. Prove that if every positive integer appears in at least one of the $n$ progressions then one of the differences $d_i$ divides the least common multiple of the remaining $n-1$ differences. Note: $P_i=\left \{ a_i,a_i+d_i,a_i+2d_i,a_i+3d_i,a_i+4d_i,\cdots \right \}$ with $ a_i$ and $d_i$ positive integers.

Arithmetical progression $a_1, a_2, a_3, a_4,...$ contains $a_1^2 , a_2^2$ and $a_3^2$ at some positions. Prove that all terms of this progression are integers.

Given a polygon with $n$ sides, we assign the numbers $0,1,...,n-1$ to the vertices, and to each side is assigned the sum of the numbers assigned to its ends. The figure shows an example for $n = 5$. Notice that the numbers assigned to the sides are still in arithmetic progression. [img]https://cdn.artofproblemsolving.com/attachments/c/0/975969e29a7953dcb3e440884461169557f9a7.png[/img] $\bullet$ Make the respective assignment for a $9$-sided polygon, and generalize for odd $n$. $\bullet$ Prove that this is not possible if $n$ is even.

Given three infinite arithmetic progressions of natural numbers such that each of the numbers 1,2,3,4,5,6,7 and 8 belongs to at least one of them, prove that the number 1980 also belongs to at least one of them.

Sides of a triangle form an arithmetic sequence with common difference $2$, and its area is $6 \text{ cm }^2$. Find its sides.

Prove that if an arithmetic progression contains a perfect square, then it contains infinitely many perfect squares.

Suppose that primes $a_1, a_2, . . . , a_p$ form an increasing arithmetic progression and $a_1 > p$. Prove that if $p$ is a prime, then the difference of the progression is divisible by $p$.

Prove that if three prime numbers form an arithmetic progression whose difference is not divisible by 6, then the smallest of these numbers is $3 $.