Let $m$, $n$ be positive integers. Prove that, for some positive integer $a$, each of $\phi(a)$, $\phi(a+1)$, $\cdots$, $\phi(a+n)$ is a multiple of $m$.

$a_n$ sequence is a arithmetic sequence with all terms be positive integers. (for $a_n$ non-constant sequence) Let $p_n$ is greatest prime divisor of $a_n$. Prove that $$(\frac{a_n}{p_n})$$ sequence is infinity. [hide]Note: If we find a $M>0$ constant such that $x_n \leq M$ for all $n \in {\mathbb N}$'s, $(x_n)$ sequence is non-infinite, but we can't find $M$, $(x_n)$ sequence is infinity [/hide]

The angles $\alpha, \beta, \gamma$ of a triangle are in arithmetic progression. If $\sin 20\alpha$, $\sin 20\beta$, and $\sin 20\gamma$ are in arithmetic progression, how many different values can $\alpha$ take? $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{None of the above} $

Natural numbers have been divided in groups as follow: $(1), (2, 4), (3, 5, 7), (6, 8, 10, 12), (9, 11, 13, 15, 17), \ldots$. Let $S_n$ be the sum of the elements of the $n$th group. Prove that $\frac{S_{2n+1}}{2n+1}-\frac{S_{2n}}{2n}$ is even.

You are given $n\ge 4$ positive real numbers. It turned out that all $\frac{n(n-1)}{2}$ of their pairwise products form an arithmetic progression in some order. Show that all given numbers are equal. [i](Proposed by Anton Trygub)[/i]

The degree measures of the angles of nondegenerate hexagon $ABCDEF$ are integers that form a non-constant arithmetic sequence in some order, and $\angle A$ is the smallest angle of the (not necessarily convex) hexagon. Compute the sum of all possible degree measures of $\angle A$. [i]Proposed by Lewis Chen[/i]

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

For a positive integer $a$, let $S_{a}$ be the set of primes $p$ for which there exists an odd integer $b$ such that $p$ divides $(2^{2^{a}})^{b}-1.$ Prove that for every $a$ there exist infinitely many primes that are not contained in $S_{a}$.

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]

Let $ n \ge 3$ be a prime number and $ a_{1} < a_{2} < \cdots < a_{n}$ be integers. Prove that $ a_{1}, \cdots,a_{n}$ is an arithmetic progression if and only if there exists a partition of $ \{0, 1, 2, \cdots \}$ into sets $ A_{1},A_{2},\cdots,A_{n}$ such that \[ a_{1} \plus{} A_{1} \equal{} a_{2} \plus{} A_{2} \equal{} \cdots \equal{} a_{n} \plus{} A_{n},\] where $ x \plus{} A$ denotes the set $ \{x \plus{} a \vert a \in A \}$.

Consider all arithmetical sequences of real numbers $(x_i)^{\infty}=1$ and $(y_i)^{\infty} =1$ with the common first term, such that for some $k > 1, x_{k-1}y_{k-1} = 42, x_ky_k = 30$, and $x_{k+1}y_{k+1} = 16$. Find all such pairs of sequences with the maximum possible $k$.

Determine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_1, A_2, \ldots, A_k$ such that for all integers $n \geq 15$ and all $i \in \{1, 2, \ldots, k\}$ there exist two distinct elements of $A_i$ whose sum is $n.$ [i]Proposed by Igor Voronovich, Belarus[/i]

Let $d(n)$ denote the number of divisors of a positive integer $n$. If $k$ is a given odd number, prove that there exist an increasing arithmetic progression in positive integers $(a_1,a_2,\ldots a_{2019}) $ such that $gcd(k,d(a_1)d(a_2)\ldots d(a_{2019})) =1$

In the notebooks of Peter and Nick, two numbers are written. Initially, these two numbers are 1 and 2 for Peter and 3 and 4 for Nick. Once a minute, Peter writes a quadratic trinomial $f(x)$, the roots of which are the two numbers in his notebook, while Nick writes a quadratic trinomial $g(x)$ the roots of which are the numbers in [i]his[/i] notebook. If the equation $f(x)=g(x)$ has two distinct roots, one of the two boys replaces the numbers in his notebook by those two roots. Otherwise, nothing happens. If Peter once made one of his numbers 5, what did the other one of his numbers become?

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

Let $P(x)$ be a polynomial of degree $n \ge 2$ with rational coefficients such that $P(x)$ has $n$ pairwise different real roots forming an arithmetic progression. Prove that among the roots of $P(x)$ there are two that are also the roots of some polynomial of degree $2$ with rational coefficients.

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

The angles in a particular triangle are in arithmetic progression, and the side lengths are $4,5,x$. The sum of the possible values of $x$ equals $a+\sqrt{b}+\sqrt{c}$ where $a, b$, and $c$ are positive integers. What is $a+b+c$? $ \textbf{(A)}\ 36\qquad\textbf{(B)}\ 38\qquad\textbf{(C)}\ 40\qquad\textbf{(D)}\ 42\qquad\textbf{(E)}\ 44$

Let $n,d$ be natural numbers. Prove that there is an arithmetic sequence of positive integers. $$a_1,a_2,...,a_n$$ with common difference of $d$ and $a_i$ with prime factor greater than or equal to $i$ for all values $i=1,2,...,n$. [i](nooonuii)[/i]

Let $a_1,a_2,...$ be an arithmetic sequence with the common difference between terms is positive. Assume there are $k$ terms of this sequence creates an geometric sequence with common ratio $d$. Prove that $n\ge 2^{k-1}$.

Let $ \left( a_n \right)_{n\ge 1} $ be an arithmetic progression of positive real numbers, and $ m $ be a natural number. Calculate: [b]a)[/b] $ \lim_{n\to\infty } \frac{1}{n^{2m+2}} \sum_{1\le i<j\le n} a_i^ma_j^m $ [b]b)[/b] $ \lim_{n\to\infty } \frac{1}{a_n^{2m+2}} \sum_{1\le i<j\le n} a_i^ma_j^m $ [i]Dumitru Acu[/i]

Two infinite arithmetic sequences with positive integers are given:$$a_1<a_2<a_3<\cdots ; b_1<b_2<b_3<\cdots$$ It is known that there are infinitely many pairs of positive integers $(i,j)$ for which $i\leq j\leq i+2021$ and $a_i$ divides $b_j$. Prove that for every positive integer $i$ there exists a positive integer $j$ such that $a_i$ divides $b_j$.

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]

An increasing arithmetic sequence with infinitely many terms is determined as follows. A single die is thrown and the number that appears is taken as the first term. The die is thrown again and the second number that appears is taken as the common difference between each pair of consecutive terms. Determine with proof how many of the 36 possible sequences formed in this way contain at least one perfect square.