Found problems: 492
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
Three fair dice are tossed at random (i.e., all faces have the same probability of coming up). What is the probability that the three numbers turned up can be arranged to form an arithmetic progression with common difference one?
$\textbf{(A) }\frac{1}{6}\qquad\textbf{(B) }\frac{1}{9}\qquad\textbf{(C) }\frac{1}{27}\qquad\textbf{(D) }\frac{1}{54}\qquad \textbf{(E) }\frac{7}{36}$
Let $n$ be a positive integer greater than or equal to $6$, and suppose that $a_1, a_2, ...,a_n$ are real numbers such that the sums $a_i + a_j$ for $1 \le i<j\le n$, taken in some order, form consecutive terms of an arithmetic progression $A$, $A + d$, $...$ ,$A + (k-1)d$, where $k = n(n-1)/2$. What are the possible values of $d$?
The roots of the equation
\[ x^3-3ax^2+bx+18c=0 \]
form a non-constant arithmetic progression and the roots of the equation
\[ x^3+bx^2+x-c^3=0 \]
form a non-constant geometric progression. Given that $a,b,c$ are real numbers, find all positive integral values $a$ and $b$.
Let $n$ be a positive integer. For each partition of the set $\{1,2,\dots,3n\}$ into arithmetic progressions, we consider the sum $S$ of the respective common differences of these arithmetic progressions. What is the maximal value that $S$ can attain?
(An [i]arithmetic progression[/i] is a set of the form $\{a,a+d,\dots,a+kd\}$, where $a,d,k$ are positive integers, and $k\geqslant 2$; thus an arithmetic progression has at least three elements, and successive elements have difference $d$, called the [i]common difference[/i] of the arithmetic progression.)
Within an arithmetic progression of length $ 2005, $ find the number of arithmetic subprogressions of length $ 501 $ that don't contain the $ \text{1000-th} $ term of the progression.
A harmonic progression is a sequence of numbers such that their reciprocals are in arithmetic progression.
Let $S_n$ represent the sum of the first $n$ terms of the harmonic progression; for example $S_3$ represents the sum of the first three terms. If the first three terms of a harmonic progression are $3,4,6$, then:
$ \textbf{(A)}\ S_4=20 \qquad\textbf{(B)}\ S_4=25\qquad\textbf{(C)}\ S_5=49\qquad\textbf{(D)}\ S_6=49\qquad\textbf{(E)}\ S_2=\frac12 S_4 $
One member of an infinite arithmetic sequence in the set of natural numbers is a perfect square. Show that there are infinitely many members of this sequence having this property.
Peter and Basil together thought of ten quadratic trinomials. Then, Basil began calling consecutive natural numbers starting with some natural number. After each called number, Peter chose one of the ten polynomials at random and plugged in the called number. The results were recorded on the board. They eventually form a sequence. After they finished, their sequence was arithmetic. What is the greatest number of numbers that Basil could have called out?
How many non-congruent scalene triangles with perimeter $21$ have integer side lengths that form an arithmetic sequence? (In an arithmetic sequence, successive terms differ by the same amount.)
$\text{(A) }0\qquad\text{(B) }1\qquad\text{(C) }3\qquad\text{(D) }4\qquad\text{(E) }6$
Five distinct positive integers form an arithmetic progression. Can their product be equal to $a^{2008}$ for some positive integer $a$ ?
Let $n$ be a positive integer and let $(1+iT)^n=f(T)+ig(T)$ where $i$ is the square root of $-1$, and $f$ and $g$ are polynomials with real coefficients. Show that for any real number $k$ the equation $f(T)+kg(T)=0$ has only real roots.
For a natural number $d$, $M_d$ denotes the set of natural numbers which are not representable as the sum of at least two consecutive terms of an arithmetic progression with the common difference d whose terms are integers. Prove that each $c\in M_3$ can be written in the form $c=ab$, where $a\in M_1$ and $b\in M_2\setminus\{2\}$.
Let be a sequence $ \left( b_n \right)_{n\ge 1} $ of integers, having the following properties:
$ \text{(i)} $ the sequence $ \left( \frac{b_n}{n} \right)_{n\ge 1} $ is convergent.
$ \text{(ii)} m-n|b_m-b_n, $ for any natural numbers $ m>n. $
Prove that there exists an index from which the sequence $ \left( b_n \right)_{n\ge 1} $ is an arithmetic one.
[i]Cristinel Mortici[/i]
A circle with area $A_1$ is contained in the interior of a larger circle with area $A_1+A_2$. If the radius of the larger circle is $3$, and if $A_1 , A_2, A_1 + A_2$ is an arithmetic progression, then the radius of the smaller circle is
$\textbf{(A) }\frac{\sqrt{3}}{2}\qquad\textbf{(B) }1\qquad\textbf{(C) }\frac{2}{\sqrt{3}}\qquad\textbf{(D) }\frac{3}{2}\qquad\textbf{(E) }\sqrt{3}$
Let $S = \{a_1, \ldots, a_n \}$ be a finite set of positive integers of size $n \ge 1$, and let $T$ be the set of all positive integers that can be expressed as sums of perfect powers (including $1$) of distinct numbers in $S$, meaning
\[ T = \left\{ \sum_{i=1}^n a_i^{e_i} \mid e_1, e_2, \dots, e_n \ge 0 \right\}. \]
Show that there is a positive integer $N$ (only depending on $n$) such that $T$ contains no arithmetic progression of length $N$.
[i]Yang Liu[/i]
Let $P_1, \ldots , P_s$ be arithmetic progressions of integers, the following conditions being satisfied:
[b](i)[/b] each integer belongs to at least one of them;
[b](ii)[/b] each progression contains a number which does not belong to other progressions.
Denote by $n$ the least common multiple of the ratios of these progressions; let $n=p_1^{\alpha_1} \cdots p_k^{\alpha_k}$ its prime factorization.
Prove that \[s \geq 1 + \sum^k_{i=1} \alpha_i (p_i - 1).\]
[i]Proposed by Dierk Schleicher, Germany[/i]
Let $A$ be the set $A = \{ 1,2, \ldots, n\}$. Determine the maximum number of elements of a subset $B\subset A$ such that for all elements $x,y$ from $B$, $x+y$ cannot be divisible by $x-y$.
[i]Mircea Lascu, Dorel Mihet[/i]
Initially Alex, Betty, and Charlie had a total of $444$ peanuts. Charlie had the most peanuts, and Alex had the least. The three numbers of peanuts that each person had form a geometric progression. Alex eats 5 of his peanuts, Betty eats 9 of her peanuts, and Charlie eats 25 of his peanuts. Now the three numbers of peanuts that each person has form an arithmetic progression. Find the number of peanuts Alex had initially.
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$
In the five-sided star shown, the letters $A,B,C,D,$ and $E$ are replaced by the numbers $3,5,6,7,$ and $9$, although not necessarily in this order. The sums of the numbers at the ends of the line segments $\overline{AB}$,$\overline{BC}$,$\overline{CD}$,$\overline{DE}$, and $\overline{EA}$ form an arithmetic sequence, although not necessarily in this order. What is the middle term of the arithmetic sequence?
[asy]
size(150);
defaultpen(linewidth(0.8));
string[] strng = {'A','D','B','E','C'};
pair A=dir(90),B=dir(306),C=dir(162),D=dir(18),E=dir(234);
draw(A--B--C--D--E--cycle);
for(int i=0;i<=4;i=i+1)
{
path circ=circle(dir(90-72*i),0.125);
unfill(circ);
draw(circ);
label("$"+strng[i]+"$",dir(90-72*i));
}
[/asy]
$ \textbf{(A)}\ 9\qquad
\textbf{(B)}\ 10\qquad
\textbf{(C)}\ 11\qquad
\textbf{(D)}\ 12\qquad
\textbf{(E)}\ 13$
The sequence $\left(a_n \right)$ is defined by $a_1=1, \ a_2=2$ and
$$a_{n+2} = 2a_{n+1}-pa_n, \ \forall n \ge 1,$$ for some prime $p.$ Find all $p$ for which there exists $m$ such that $a_m=-3.$
Is it possible to choose $1983$ distinct positive integers, all less than or equal to $10^5$, no three of which are consecutive terms of an arithmetic progression?
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$.
Let $p\ge 17$ be a prime. Prove that $t=3$ is the largest positive integer which satisfies the following condition:
For any integers $a,b,c,d$ such that $abc$ is not divisible by $p$ and $(a+b+c)$ is divisible by $p$, there exists integers $x,y,z$ belonging to the set $\{0,1,2,\ldots , \left\lfloor \frac{p}{t} \right\rfloor - 1\}$ such that $ax+by+cz+d$ is divisible by $p$.