Found problems: 492
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.$
Prove that the arithmetic progression $3,7,11,15,...$. contains infinitely many prime numbers.
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$.
(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.
Find infinitely many triples $(a, b, c)$ of positive integers such that $a$, $b$, $c$ are in arithmetic progression and such that $ab+1$, $bc+1$, and $ca+1$ are perfect squares.
Suppose $a_1$, $a_2$, $a_3$, $\dots$ is an arithmetic sequence such that \[a_1+a_2+a_3+\cdots+a_{48}+a_{49}=1421.\] Find the value of $a_1+a_4+a_7+a_{10}+\cdots+a_{49}$.
[i]Proposed by Tony Kim[/i]
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 $
For positive integers $ n,$ the numbers $ f(n)$ are defined inductively as follows: $ f(1) \equal{} 1,$ and for every positive integer $ n,$ $ f(n\plus{}1)$ is the greatest integer $ m$ such that there is an arithmetic progression of positive integers $ a_1 < a_2 < \ldots < a_m \equal{} n$ for which
\[ f(a_1) \equal{} f(a_2) \equal{} \ldots \equal{} f(a_m).\]
Prove that there are positive integers $ a$ and $ b$ such that $ f(an\plus{}b) \equal{} n\plus{}2$ for every positive integer $ n.$
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]
Find the arithmetic sequences of $ 5 $ integers $ n_1,n_2,n_3,n_4,n_5 $ that verify $ 5|n_1,2|n_2,11|n_3,7|n_4,17|n_5. $
The measures (in degrees) of the interior angles of a convex hexagon form an arithmetic sequence of positive integers. Let $m^{\circ}$ be the measure of the largest interior angle of the hexagon. The largest possible value of $m^{\circ}$ is
$ \textbf{(A)}\ 165^{\circ}\qquad\textbf{(B)}\ 167^{\circ}\qquad\textbf{(C)}\ 170^{\circ}\qquad\textbf{(D)}\ 175^{\circ}\qquad\textbf{(E)}\ 179^{\circ} $
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.
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]
Decide whether there is a member in the arithmetic sequence $\{a_n\}_{n=1}^\infty$ whose first member is $a_1=1998$ and the common difference $d=131$ which is a palindrome (palindrome is a number such that its decimal expansion is symmetric, e.g., $7$, $33$, $433334$, $2135312$ and so on).
An arithmetic sequence consists of $ 200$ numbers that are each at least $ 10$ and at most $ 100$. The sum of the numbers is $ 10{,}000$. Let $ L$ be the [i]least[/i] possible value of the $ 50$th term and let $ G$ be the [i]greatest[/i] possible value of the $ 50$th term. What is the value of $ G \minus{} L$?
Find all functions $f:\mathbb{Q}\rightarrow\mathbb{Q}$ such that\[f(x)+f(t)=f(y)+f(z)\]for all rational numbers $x<y<z<t$ that form an arithmetic progression. ($\mathbb{Q}$ is the set of all rational numbers.)
Determine all finite sets $M$ of real numbers such that $M$ contains at least $2$ numbers and any two elements of $M$ belong to an arithmetic progression of elements of $M$ with three terms.
An arithmetic sequence has $n \geq 3$ terms, initial term $a$ and common difference $d > 1$. Carl wrote down all the terms in this sequence correctly except for one term which was off by $1$. The sum of the terms was $222$. What was $a + d + n$
$\textbf{(A) } 24 \qquad \textbf{(B) } 20 \qquad \textbf{(C) } 22 \qquad \textbf{(D) } 28 \qquad \textbf{(E) } 26$
Say that a (nondegenerate) triangle is [i]funny[/i] if it satisfies the following condition: the altitude, median, and angle bisector drawn from one of the vertices divide the triangle into 4 non-overlapping triangles whose areas form (in some order) a 4-term arithmetic sequence. (One of these 4 triangles is allowed to be degenerate.) Find with proof all funny triangles.
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]
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]
Determine the largest integer $n\geq 3$ for which the edges of the complete graph on $n$ vertices
can be assigned pairwise distinct non-negative integers such that the edges of every triangle have numbers which form an arithmetic progression.
What is the difference between the sum of the first $ 2003$ even counting numbers and the sum of the first $ 2003$ odd counting numbers?
$ \textbf{(A)}\ 0 \qquad
\textbf{(B)}\ 1 \qquad
\textbf{(C)}\ 2 \qquad
\textbf{(D)}\ 2003 \qquad
\textbf{(E)}\ 4006$
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]
For $2k$ real numbers $a_1, a_2, ..., a_k$, $b_1, b_2, ..., b_k$ define a sequence of numbers $X_n$ by \[
X_n = \sum_{i=1}^k [a_in + b_i] \quad (n=1,2,...).
\] If the sequence $X_N$ forms an arithmetic progression, show that $\textstyle\sum_{i=1}^k a_i$ must be an integer. Here $[r]$ denotes the greatest integer less than or equal to $r$.