Found problems: 492
$(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.$
Let $a<b<c$ be three integers such that $a,b,c$ is an arithmetic progression and $a,c,b$ is a geometric progression. What is the smallest possible value of $c$?
$\textbf{(A) }-2\qquad
\textbf{(B) }1\qquad
\textbf{(C) }2\qquad
\textbf{(D) }4\qquad
\textbf{(E) }6\qquad$
Let be a natural number $ m\ge 2. $
[b]a)[/b] Let be $ m $ pairwise distinct rational numbers. Prove that there is an ordering of these numbers such that these are terms of an arithmetic progression.
[b]b)[/b] Given that for any $ m $ pairwise distinct real numbers there is an ordering of them such that they are terms of an arithmetic sequence, determine the number $ m. $
[i]Bogdan Blaga[/i]
Prove that the set $\{1,2,…,12001\}$ can be partitioned into 5 groups so that none of them contains an arithmetic progression with length 11.
A sequence of three real numbers forms an arithmetic progression with a first term of $ 9$. If $ 2$ is added to the second term and $ 20$ is added to the third term, the three resulting numbers form a geometric progression. What is the smallest possible value for the third term of the geometric progression?
$ \textbf{(A)}\ 1\qquad
\textbf{(B)}\ 4\qquad
\textbf{(C)}\ 36\qquad
\textbf{(D)}\ 49\qquad
\textbf{(E)}\ 81$
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.
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 $ f(0) \equal{} f(1) \equal{} 0$ and
\[ f(n\plus{}2) \equal{} 4^{n\plus{}2} \cdot f(n\plus{}1) \minus{} 16^{n\plus{}1} \cdot f(n) \plus{} n \cdot 2^{n^2}, \quad n \equal{} 0, 1, 2, \ldots\]
Show that the numbers $ f(1989), f(1990), f(1991)$ are divisible by $ 13.$
Let $ u_1$, $ u_2$, $ \ldots$, $ u_{1987}$ be an arithmetic progression with $ u_1 \equal{} \frac {\pi}{1987}$ and the common difference $ \frac {\pi}{3974}$. Evaluate
\[ S \equal{} \sum_{\epsilon_i\in\left\{ \minus{} 1, 1\right\}}\cos\left(\epsilon_1 u_1 \plus{} \epsilon_2 u_2 \plus{} \cdots \plus{} \epsilon_{1987} u_{1987}\right)
\]
Let $ f(0) \equal{} f(1) \equal{} 0$ and
\[ f(n\plus{}2) \equal{} 4^{n\plus{}2} \cdot f(n\plus{}1) \minus{} 16^{n\plus{}1} \cdot f(n) \plus{} n \cdot 2^{n^2}, \quad n \equal{} 0, 1, 2, \ldots\]
Show that the numbers $ f(1989), f(1990), f(1991)$ are divisible by $ 13.$
There are $n$ children around a round table. Erika is the oldest among them and she has $n$ candies, while no other child has any candy. Erika decided to distribute the candies according to the following rules. In every round, she chooses a child with at least two candies and the chosen child sends a candy to each of his/her two neighbors. (So in the first round Erika must choose herself). For which $n \ge 3$ is it possible to end the distribution after a finite number of rounds with every child having exactly one candy?
For every integer $d \geq 1$, let $M_d$ be the set of all positive integers that cannot be written as a sum of an arithmetic progression with difference $d$, having at least two terms and consisting of positive integers. Let $A = M_1$, $B = M_2 \setminus \{2 \}, C = M_3$. Prove that every $c \in C$ may be written in a unique way as $c = ab$ with $a \in A, b \in B.$
Does there exist an integer $n \ge 3$ and an arithmetic sequence $a_0, a_1, ... , a_n$ such that the polynomial $a_nx^n +... + a_1x + a_0$ has $n$ roots which also form an arithmetic sequence?
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 \}$.
The first four terms of an arithmetic sequence are $ p,9,3p\minus{}q,$ and $ 3p\plus{}q$. What is the $ 2010^{\text{th}}$ term of the sequence?
$ \textbf{(A)}\ 8041\qquad \textbf{(B)}\ 8043\qquad \textbf{(C)}\ 8045\qquad \textbf{(D)}\ 8047\qquad \textbf{(E)}\ 8049$
Find an infinite non-constant arithmetic progression of natural numbers such that each term is neither a sum of two squares, nor a sum of two cubes (of natural numbers).
A finite arithmetic progression of positive integers $a_1,a_2,\ldots,a_n$ satisfies the condition that for all $1\leq i<j\leq n$, the number of positive divisors of $\gcd\left(a_i,a_j\right)$ is equal to $j-i$. Find the maximum possible value of $n$.
$\text{(A) }2\qquad\text{(B) }3\qquad\text{(C) }4\qquad\text{(D) }5\qquad\text{(E) }6$
An acute triangle $ABC$ has side lenghths $a$, $b$, $c$ such that $a$, $b$, $c$ forms an arithmetic sequence. Given that the area of triangle $ABC$ is an integer, what is the smallest value of its perimeter?
[i]2017 CCA Math Bonanza Lightning Round #3.3[/i]
Show that it is possible to color the set of integers \[M=\{ 1, 2, 3, \cdots, 1987 \},\] using four colors, so that no arithmetic progression with $10$ terms has all its members the same color.
For every integer $d \geq 1$, let $M_d$ be the set of all positive integers that cannot be written as a sum of an arithmetic progression with difference $d$, having at least two terms and consisting of positive integers. Let $A = M_1$, $B = M_2 \setminus \{2 \}, C = M_3$. Prove that every $c \in C$ may be written in a unique way as $c = ab$ with $a \in A, b \in B.$
Given a sequence $<a_1,a_2,a_3,\cdots >$ of real numbers, we define $m_n$ as the arithmetic mean of the numbers $a_1$ to $a_n$ for $n\in\mathbb{Z}^+$.
If there is a real number $C$, such that
\[ (i-j)m_k+(j-k)m_i+(k-i)m_j=C\]
for every triple $(i,j,k)$ of distinct positive integers, prove that the sequence $<a_1,a_2,a_3,\cdots >$ is an arithmetic progression.
Prove that the arithmetic sequence $5, 11, 17, 23, 29, \ldots$ contains infinitely many primes.
Let $P(x)$ be a polynomial of degree $n \le 10$ with integral coefficients such that for every $k \in \{1, 2, \dots, 10\}$ there is an integer $m$ with $P(m) = k$. Furthermore, it is given that $|P(10) - P(0)| < 1000$. Prove that for every integer $k$ there is an integer $m$ such that $P(m) = k.$
Find all natural numbers $n$ greater than $2$ such that there exist $n$ natural numbers $a_{1},a_{2},\ldots,a_{n}$ such that they are not all equal, and the sequence $a_{1}a_{2},a_{2}a_{3},\ldots,a_{n}a_{1}$ forms an arithmetic progression with nonzero common difference.
Suppose that $S$ is a finite set of real numbers with the property that any two distinct elements of $S$ form an arithmetic progression with another element in $S$. Give an example of such a set with 5 elements and show that no such set exists with more than $5$ elements.