The three sides of a right triangle have integral lengths which form an arithmetic progression. One of the sides could have length $\text{(A)}\ 22 \qquad \text{(B)}\ 58 \qquad \text{(C)}\ 81 \qquad \text{(D)}\ 91 \qquad \text{(E)}\ 361$

Convex quadrilateral $ABCD$ has $AB = 18, \angle{A} = 60 \textdegree$, and $\overline{AB} \parallel \overline{CD}$. In some order, the lengths of the four sides form an arithmetic progression, and side $\overline{AB}$ is a side of maximum length. The length of another side is $a$. What is the sum of all possible values of $a$? $\textbf{(A) } 24 \qquad \textbf{(B) } 42 \qquad \textbf{(C) } 60 \qquad \textbf{(D) } 66 \qquad \textbf{(E) } 84$

Paul starts at $1$ and counts by threes: $1, 4, 7, 10, ... $. At the same time and at the same speed, Penny counts backwards from $2017$ by fives: $2017, 2012, 2007, 2002,...$ . Find the one number that both Paul and Penny count at the same time.

Prove that the arithmetic progression $3,7,11,15,...$. contains infinitely many prime numbers.

A five-digit palindrome is a positive integer with respective digits $abcba$, where $a$ is non-zero. Let $S$ be the sum of all five-digit palindromes. What is the sum of the digits of $S$? $\textbf{(A) }9\qquad \textbf{(B) }18\qquad \textbf{(C) }27\qquad \textbf{(D) }36\qquad \textbf{(E) }45\qquad$

Prove that the arithmetic sequence $5, 11, 17, 23, 29, \ldots$ contains infinitely many primes.

Let $A$ and $B$ be two sets of real numbers. Suppose that the elements of the set $AB = \{ab: a\in A, b\in B\}$ form a finite arithmetic progression. Prove that one of these sets contains no more than three elements

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

Each of the numbers in the set \(A = \{1,2, \cdots, 2017\}\) is colored either red or white. Prove that for \(n \geq 18\), there exists a coloring of the numbers in \(A\) such that any of its n-term arithmetic sequences contains both colors.

Suppose $f:\mathbb{R}\to\mathbb{R}$ is a differentiable function for which the inequality $f'(x) \leq f'(x+\frac{1}{n})$ holds for every $x\in\mathbb{R}$ and every $n\in\mathbb{N}$.Prove that f is continiously differentiable

Find $k \in \mathbb{N}$ such that [b]a.)[/b] For any $n \in \mathbb{N}$, there does not exist $j \in \mathbb{Z}$ which satisfies the conditions $0 \leq j \leq n - k + 1$ and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots, \left( \begin{array}{c} n\\ j + k - 1\end{array} \right)$ forms an arithmetic progression. [b]b.)[/b] There exists $n \in \mathbb{N}$ such that there exists $j$ which satisfies $0 \leq j \leq n - k + 2$, and $\left( \begin{array}{c} n\\ j\end{array} \right), \left( \begin{array}{c} n\\ j + 1\end{array} \right), \ldots , \left( \begin{array}{c} n\\ j + k - 2\end{array} \right)$ forms an arithmetic progression. Find all $n$ which satisfies part [b]b.)[/b]

For any positive integers $x,y,z$ and $w,$ prove that $x^2,y^2,z^2$ and $w^2$ cannot be four consecutive terms of arithmetic sequence.

An arithmetic sequence is a sequence in which each term after the first is obtained by adding a constant to the previous term. For example, $2,5,8,11,14$ is an arithmetic sequence with five terms, in which the first term is $2$ and the constant added is $3$. Each row and each column in this $5\times5$ array is an arithmetic sequence with five terms. What is the value of $X$? $\textbf{(A) }21\qquad\textbf{(B) }31\qquad\textbf{(C) }36\qquad\textbf{(D) }40\qquad \textbf{(E) }42$ [asy] size(3.85cm); label("$X$",(2.5,2.1),N); for (int i=0; i<=5; ++i) draw((i,0)--(i,5), linewidth(.5)); for (int j=0; j<=5; ++j) draw((0,j)--(5,j), linewidth(.5)); void draw_num(pair ll_corner, int num) { label(string(num), ll_corner + (0.5, 0.5), p = fontsize(19pt)); } draw_num((0,0), 17); draw_num((4, 0), 81); draw_num((0, 4), 1); draw_num((4,4), 25); void foo(int x, int y, string n) { label(n, (x+0.5,y+0.5), p = fontsize(19pt)); } foo(2, 4, " "); foo(3, 4, " "); foo(0, 3, " "); foo(2, 3, " "); foo(1, 2, " "); foo(3, 2, " "); foo(1, 1, " "); foo(2, 1, " "); foo(3, 1, " "); foo(4, 1, " "); foo(2, 0, " "); foo(3, 0, " "); foo(0, 1, " "); foo(0, 2, " "); foo(1, 0, " "); foo(1, 3, " "); foo(1, 4, " "); foo(3, 3, " "); foo(4, 2, " "); foo(4, 3, " "); [/asy]

Consider an arithmetic progression $a_0,\ldots,a_n$ with $n\ge2$. Prove that $$\sum_{k=0}^n(-1)^k\binom{n}{k}a_k=0.$$

For what positive integers $n, k$ (with $k < n$) are the binomial coefficients $${n \choose k- 1} \,\,\, , \,\,\, {n \choose k} \,\,\, , \,\,\, {n \choose k + 1}$$ three successive terms of an arithmetic progression?

For real numbers $x,y,z$, $3x,4y,5z$ are geometric series, $\frac{1}{x},\frac{1}{y},\frac{1}{z}$ are arithmetic sequence. Then $\frac{x}{z}+\frac{z}{x}=$________.

Let $\varphi(k)$ denote the numbers of positive integers less than or equal to $k$ and relatively prime to $k$. Prove that for some positive integer $n$, \[ \varphi(2n-1) + \varphi(2n+1) < \frac{1}{1000} \varphi(2n). \][i]Proposed by Evan Chen[/i]

9.7 Is there an infinite arithmetic sequence $\{a_n\}\subset \mathbb N$ s.t. $a_n+...+a_{n+9}\mid a_n...a_{n+9}$ for all $n$? ([i]V. Senderov[/i])

Let $a, \overline{bcd}, \overline{aef}, \overline{cfg}, \overline{hci}, \overline{dea}, \overline{ifd}, \overline{jgf}, \overline{bfeg},\ldots$ be an increasing arithmetic progression. Find the $16$th term of this sequence.

Let $a,b$ be real numbers ($b\ne 0$) and consider the infinite arithmetic sequence $a, a+b ,a +2b , \ldots.$ Show that this sequence contains an infinite geometric subsequence if and only if $\frac{a}{b}$ is rational.

A donkey suffers an attack of hiccups and the first hiccup happens at $\text{4:00}$ one afternoon. Suppose that the donkey hiccups regularly every $5$ seconds. At what time does the donkey’s $\text{700th}$ hiccup occur? $\textbf{(A) }$ $15$ seconds after $\text{4:58}$ $\textbf{(B) }$ $20$ seconds after $\text{4:58}$ $\textbf{(C)}$ $25$ seconds after $\text{4:58}$ $\textbf{(D) }$ $30$ seconds after $\text{4:58}$ $\textbf{(E) }$ $35$ seconds after $\text{4:58}$

The interior angles of a convex polygon form an arithmetic progression with a common difference of $4^\circ$. Determine the number of sides of the polygon if its largest interior angle is $172^\circ.$

Find all infinite sequences $a_1, a_2, \ldots$ of positive integers satisfying the following properties: (a) $a_1 < a_2 < a_3 < \cdots$, (b) there are no positive integers $i$, $j$, $k$, not necessarily distinct, such that $a_i+a_j=a_k$, (c) there are infinitely many $k$ such that $a_k = 2k-1$.

Given a sequence $(a_n)$ of real numbers such that the set $\{a_n\}$ is finite. If for every $k>1$ subsequence $(a_{kn})$ is periodic, is it true that the sequence $(a_n)$ must be periodic?

$(CZS 6)$ Let $d$ and $p$ be two real numbers. Find the first term of an arithmetic progression $a_1, a_2, a_3, \cdots$ with difference $d$ such that $a_1a_2a_3a_4 = p.$ Find the number of solutions in terms of $d$ and $p.$