Found problems: 492
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?
Find the greatest positive integer $m$ with the following property:
For every permutation $a_1, a_2, \cdots, a_n,\cdots$ of the set of positive integers, there exists positive integers $i_1<i_2<\cdots <i_m$ such that $a_{i_1}, a_{i_2}, \cdots, a_{i_m}$ is an arithmetic progression with an odd common difference.
A rug is made with three different colors as shown. The areas of the three differently colored regions form an arithmetic progression. The inner rectangle is one foot wide, and each of the two shaded regions is $1$ foot wide on all four sides. What is the length in feet of the inner rectangle?
[asy]
size(6cm);
defaultpen(fontsize(9pt));
path rectangle(pair X, pair Y){
return X--(X.x,Y.y)--Y--(Y.x,X.y)--cycle;
}
filldraw(rectangle((0,0),(7,5)),gray(0.5));
filldraw(rectangle((1,1),(6,4)),gray(0.75));
filldraw(rectangle((2,2),(5,3)),white);
label("$1$",(0.5,2.5));
draw((0.3,2.5)--(0,2.5),EndArrow(TeXHead));
draw((0.7,2.5)--(1,2.5),EndArrow(TeXHead));
label("$1$",(1.5,2.5));
draw((1.3,2.5)--(1,2.5),EndArrow(TeXHead));
draw((1.7,2.5)--(2,2.5),EndArrow(TeXHead));
label("$1$",(4.5,2.5));
draw((4.5,2.7)--(4.5,3),EndArrow(TeXHead));
draw((4.5,2.3)--(4.5,2),EndArrow(TeXHead));
label("$1$",(4.1,1.5));
draw((4.1,1.7)--(4.1,2),EndArrow(TeXHead));
draw((4.1,1.3)--(4.1,1),EndArrow(TeXHead));
label("$1$",(3.7,0.5));
draw((3.7,0.7)--(3.7,1),EndArrow(TeXHead));
draw((3.7,0.3)--(3.7,0),EndArrow(TeXHead));
[/asy]
$\textbf{(A) } 1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } 4 \qquad \textbf{(D) } 6 \qquad \textbf{(E) }8$
The number of terms in an A.P. (Arithmetic Progression) is even. The sum of the odd and even-numbered terms are 24 and 30, respectively. If the last term exceeds the first by 10.5, the number of terms in the A.P. is
$ \textbf{(A)}\ 20 \qquad
\textbf{(B)}\ 18 \qquad
\textbf{(C)}\ 12 \qquad
\textbf{(D)}\ 10 \qquad
\textbf{(E)}\ 8$
Triangle $ABC$ has side lengths in arithmetic progression, and the smallest side has length $6.$ If the triangle has an angle of $120^\circ,$ what is the area of $ABC$?
$\textbf{(A)}\ 12\sqrt 3 \qquad\textbf{(B)}\ 8\sqrt 6 \qquad\textbf{(C)}\ 14\sqrt 2 \qquad\textbf{(D)}\ 20\sqrt 2 \qquad\textbf{(E)}\ 15\sqrt 3$
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]
For which positive integers $m$ does there exist an infinite arithmetic sequence of integers $a_1, a_2, . . .$ and an infinite geometric sequence of integers $g_1, g_2, . . .$ satisfying the following properties?
[list]
[*] $a_n - g_n$ is divisible by $m$ for all integers $n \ge 1$;
[*] $a_2 - a_1$ is not divisible by $m$.
[/list]
[i]Holden Mui[/i]
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|.$
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.
How many four-digit integers $abcd$, with $a \neq 0$, have the property that the three two-digit integers $ab<bc<cd$ form an increasing arithmetic sequence? One such number is $4692$, where $a=4$, $b=6$, $c=9$, and $d=2$.
$\textbf{(A)}\ 9\qquad\textbf{(B)}\ 15\qquad\textbf{(C)}\ 16\qquad\textbf{(D)}\ 17\qquad\textbf{(E)}\ 20$
Let $f$ be a bijection of the set of all natural numbers on to itself. Prove that there exists positive integers $a < a+d < a+ 2d$ such that $f(a) < f(a+d) <f(a+2d)$
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$.
The zeroes of a fourth degree polynomial $f(x)$ form an arithmetic progression. Prove that the three zeroes of the polynomial $f'(x)$ also form an arithmetic progression.
Can we partition the positive integers in two sets such that none of the sets contains an infinite arithmetic progression of nonzero ratio ?
Convex quadrilateral $ABCD$ has $AB = 18, \angle{A} = 60 \textdegree$, and $\overline{AB} \parallel \overline{CD}$. In some order, the lengths of the four sides form an arithmetic progression, and side $\overline{AB}$ is a side of maximum length. The length of another side is $a$. What is the sum of all possible values of $a$?
$\textbf{(A) } 24 \qquad \textbf{(B) } 42 \qquad \textbf{(C) } 60 \qquad \textbf{(D) } 66 \qquad \textbf{(E) } 84$
Let $f : \mathbb{R} \to \mathbb{R}$ be a function such that $|f(x)-f(y)| \leq |x-y|$, for all $x,y \in \mathbb{R}$.
Prove that if for any real $x$, the sequence $x,f(x),f(f(x)),\ldots$ is an arithmetic progression, then there is $a \in \mathbb{R}$ such that $f(x)=x+a$, for all $x \in \mathbb R$.
Given a geometric sequence with the first term $ \neq 0$ and $ r \neq 0$ and an arithmetic sequence with the first term $ \equal{}0$. A third sequence $ 1,1,2\ldots$ is formed by adding corresponding terms of the two given sequences. The sum of the first ten terms of the third sequence is:
$ \textbf{(A)}\ 978 \qquad
\textbf{(B)}\ 557 \qquad
\textbf{(C)}\ 467 \qquad
\textbf{(D)}\ 1068 \\
\textbf{(E)}\ \text{not possible to determine from the information given}$
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 the equation $x^2 + y^2 + z^2 = ( x-y)(y-z)(z-x)$ has infintely many solutions in integers $x,y,z$.
Show that the set $\{1,2,....,2^n\}$ can be partitioned in two classes, none of which contains an arithmetic progression of length $2n$.
The numbers $ \log(a^3b^7)$, $ \log(a^5b^{12})$, and $ \log(a^8b^{15})$ are the first three terms of an arithmetic sequence, and the $ 12^\text{th}$ term of the sequence is $ \log{b^n}$. What is $ n$?
$ \textbf{(A)}\ 40 \qquad
\textbf{(B)}\ 56 \qquad
\textbf{(C)}\ 76 \qquad
\textbf{(D)}\ 112 \qquad
\textbf{(E)}\ 143$
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]
In an arithmetic sequence, the di fference of consecutive terms in constant. We consider sequences of integers in which the di fference of consecutive terms equals the sum of the differences of all preceding consecutive terms.
Which of these sequences with $a_0 = 2012$ and $1\leqslant d = a_1-a_0 \leqslant 43$ contain square numbers?
Let $ \,n > 6\,$ be an integer and $ \,a_{1},a_{2},\cdots ,a_{k}\,$ be all the natural numbers less than $ n$ and relatively prime to $ n$. If
\[ a_{2} \minus{} a_{1} \equal{} a_{3} \minus{} a_{2} \equal{} \cdots \equal{} a_{k} \minus{} a_{k \minus{} 1} > 0,
\]
prove that $ \,n\,$ must be either a prime number or a power of $ \,2$.
Let $ABCD$ be a convex quadrilateral with precisely one pair of parallel sides.
$(a)$ Show that the lengths of its sides $AB,BC,CD, DA$ (in this order) do not form an arithmetic progression.
$(b)$ Show that there is such a quadrilateral for which the lengths of its sides $AB ,BC,CD,DA$ form an arithmetic progression after the order of the lengths is changed.