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

If $ a$, $ b$, $ c$, and $ d$ are positive real numbers such that $ a$, $ b$, $ c$, $ d$ form an increasing arithmetic sequence and $ a$, $ b$, $ d$ form a geometric sequence, then $ \frac{a}{d}$ is $ \textbf{(A)}\ \frac{1}{12} \qquad \textbf{(B)}\ \frac{1}{6} \qquad \textbf{(C)}\ \frac{1}{4} \qquad \textbf{(D)}\ \frac{1}{3} \qquad \textbf{(E)}\ \frac{1}{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}})$.

The circles $(R, r)$ and $(P, \rho)$, where $r > \rho$, touch externally at $A$. Their direct common tangent touches $(R, r)$ at B and $(P, \rho)$ at $C$. The line $RP$ meets the circle $(P, \rho)$ again at $D$ and the line $BC$ at $E$. If $|BC| = 6|DE|$, prove that: [b](a)[/b] the lengths of the sides of the triangle $RBE$ are in an arithmetic progression, and [b](b)[/b] $|AB| = 2|AC|.$

Suppose that every positve integer has been given one of the colors red, blue,arbitrarily. Prove that there exists an infinite sequence of positive integers $ a_{1} < a_{2} < a_{3} < \cdots < a_{n} < \cdots,$ such that inifinite sequence of positive integers $ a_{1},\frac {a_{1} \plus{} a_{2}}{2},a_{2},\frac {a_{2} \plus{} a_{3}}{2},a_{3},\frac {a_{3} \plus{} a_{4}}{2},\cdots$ has the same color.

Show that there exists an infinite arithmetic progression of natural numbers such that the first term is $16$ and the number of positive divisors of each term is divisible by $5$. Of all such sequences, find the one with the smallest possible common difference.

A series of numbers is called complete if it has non-zero natural terms and any nonzero integer has at least one among multiple series. Show that the arithmetic progression is a complete sequence if and only if it divides the first term relationship.

The sequence $ a_1<a_2<...<a_M$ of real numbers is called a weak arithmetic progression of length $ M$ if there exists an arithmetic progression $ x_0,x_1,...,x_M$ such that: $ x_0 \le a_1<x_1 \le a_2<x_2 \le ... \le a_M<x_M.$ $ (a)$ Prove that if $ a_1<a_2<a_3$ then $ (a_1,a_2,a_3)$ is a weak arithmetic progression. $ (b)$ Prove that any subset of $ \{ 0,1,2,...,999 \}$ with at least $ 730$ elements contains a weak arithmetic progression of length $ 10$.

Find the value of $a_2 + a_4 + a_6 + \dots + a_{98}$ if $a_1$, $a_2$, $a_3$, $\dots$ is an arithmetic progression with common difference 1, and $a_1 + a_2 + a_3 + \dots + a_{98} = 137$.

Call a triple of numbers [b]Nice[/b] if one of them is the average of the other two. Assume that we have $2k+1$ distinct real numbers with $k^2$ [b] Nice[/b] triples. Prove that these numbers can be devided into two arithmetic progressions with equal ratios Proposed by [i]Morteza Saghafian[/i]

Let $\mathbb Z$ be the set of integers. We consider functions $f :\mathbb Z\to\mathbb Z$ satisfying \[f\left(f(x+y)+y\right)=f\left(f(x)+y\right)\] for all integers $x$ and $y$. For such a function, we say that an integer $v$ is [i]f-rare[/i] if the set \[X_v=\{x\in\mathbb Z:f(x)=v\}\] is finite and nonempty. (a) Prove that there exists such a function $f$ for which there is an $f$-rare integer. (b) Prove that no such function $f$ can have more than one $f$-rare integer. [i]Netherlands[/i]

How many sets of two or more consecutive positive integers have a sum of 15? $ \textbf{(A) } 1\qquad \textbf{(B) } 2\qquad \textbf{(C) } 3\qquad \textbf{(D) } 4\qquad \textbf{(E) } 5$

Equilateral triangle $ABC$ has side length $6$. Circles with centers at $A$, $B$, and $C$ are drawn such that their respective radii $r_A$, $r_B$, and $r_C$ form an arithmetic sequence with $r_A<r_B<r_C$. If the shortest distance between circles $A$ and $B$ is $3.5$, and the shortest distance between circles $A$ and $C$ is $3$, then what is the area of the shaded region? Express your answer in terms of pi. [asy] size(8cm); draw((0,0)--(6,0)--6*dir(60)--cycle); draw(circle((0,0),1)); draw(circle(6*dir(60),1.5)); draw(circle((6,0),2)); filldraw((0,0)--arc((0,0),1,0,60)--cycle, grey); filldraw(6*dir(60)--arc(6*dir(60),1.5,240,300)--cycle, grey); filldraw((6,0)--arc((6,0),2,120,180)--cycle, grey); label("$A$",(0,0),SW); label("$B$",6*dir(60),N); label("$C$",(6,0),SE); [/asy]

Decide if it is possible to generate an infinite sequence of positive integers $a_n$ such that in the sequence there are no three terms that are in arithmetic progression and that for all $n$ $\left |a_n-n^2\right | &lt;\frac{n}{2}$. Clarification: Three numbers $a$, $b$, $c$ are in arithmetic progression if and only if $2b=a+c$.

The side lengths of a triangle area $t$ form an arithmetic progression with difference $d$. Find the sides and angles of the triangle. Specifically, solve this problem for $d=1$ and $t=6$.

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$

The function $f(x) = x^2+ax+b$ has two distinct zeros. If $f(x^2+2x-1)=0$ has four distinct zeros $x_1<x_2<x_3<x_4$ that form an arithmetic sequence, compute the range of $a-b$. [i](Source: China National High School Mathematics League 2021, Zhejiang Province, Problem 11)[/i]

Let $x$, $y$, and $z$ be nonnegative integers that are less than or equal to 100. Suppose that $x + y + z$, $xy + z$, $x + yz$, and $xyz$ are (in some order) four consecutive terms of an arithmetic sequence. Compute the number of such ordered triples $(x, y, z)$.

Let $n \ge 4$ be a natural number. Let $A_1A_2
\cdots
A_n$ be a regular polygon and $X = \{ 1,2,3....,n \} $. A subset $\{ i_1, i_2,\cdots, i_k \} $ of $X$, with $k \ge 3$ and $i_1 < i_2 <
\cdots < i_k$, is called a good subset if the angles of the polygon $A_{i_1}A_{i_2}\cdots
A_{i_k}$ , when arranged in the increasing order, are in an arithmetic progression. If $n$ is a prime, show that a proper good subset of $X$ contains exactly four elements.

Suppose that $a_1,...,a_{15}$ are prime numbers forming an arithmetic progression with common difference $d > 0$ if $a_1 > 15$ show that $d > 30000$

Determine all positive integers $n$, $n\ge2$, such that the following statement is true: If $(a_1,a_2,...,a_n)$ is a sequence of positive integers with $a_1+a_2+\cdots+a_n=2n-1$, then there is block of (at least two) consecutive terms in the sequence with their (arithmetic) mean being an integer.

Five distinct positive integers form an arithmetic progression. Can their product be equal to $a^{2008}$ for some positive integer $a$ ?

Let $S_i$ be the sum of the first $i$ terms of the arithmetic sequence $a_1,a_2,a_3\ldots $. Show that the value of the expression \[\frac{S_i}{i}(j-k) + \frac{S_j}{j}(k-i) +\ \frac{S_k}{k}(i-j)\] does not depend on the numbers $i,j,k$ nor on the choice of the arithmetic sequence $a_1,a_2,a_3,\ldots$.

Prove that for every real number $M$ there exists an infinite arithmetic progression such that: - each term is a positive integer and the common difference is not divisible by 10 - the sum of the digits of each term (in decimal representation) exceeds $M$.

Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $n\in \mathbb{N}$: \[f(f(m)+f(n))=m+n.\]