Find all triangles such that its angles form an arithmetic sequence and the corresponding sides form a geometric sequence.

Given positive integer $n$ and positive number $M$. For all arithmetic squence $a_1,a_2,\cdots,$ that $a_1^2+a_{n+1}^2\leq M$, find the maximum value of $S=a_{n+1}+a_{n+2}+\cdots,a_{2n+1}$.

The first four terms of an arithmetic sequence are $a, x, b, 2x$. The ratio of $a$ to $b$ is $ \textbf{(A)}\ \frac{1}{4} \qquad\textbf{(B)}\ \frac{1}{3} \qquad\textbf{(C)}\ \frac{1}{2} \qquad\textbf{(D)}\ \frac{2}{3} \qquad\textbf{(E)}\ 2 $

Find the smallest positive integer $n$ with the following property: there does not exist an arithmetic progression of $1999$ real numbers containing exactly $n$ integers.

Consider a countinuous function $ f:\mathbb{R}_{>0}\longrightarrow\mathbb{R}_{>0} $ that verifies the following conditions: $ \text{(1)} x f(f(x))=(f(x))^2,\quad\forall x\in\mathbb{R}_{>0} $ $ \text{(2)} \lim_{\stackrel{x\to 0}{x>0}} \frac{f(x)}{x}\in\mathbb{R}\cup\{ \pm\infty \} $ [b]a)[/b] Show that $ f $ is bijective. [b]b)[/b] Prove that the sequences $ \left( (\underbrace{f\circ f\circ\cdots \circ f}_{\text{n times}} ) (x) \right)_{n\ge 1} ,\left( (\underbrace{f^{-1}\circ f^{-1}\circ\cdots \circ f^{-1}}_{\text{n times}} ) (x) \right)_{n\ge 1} $ are both arithmetic progressions, for any fixed $ x\in\mathbb{R}_{>0} . $ [b]c)[/b] Determine the function $ f. $ [i]Nelu Chichirim[/i]

Prove that with $ n\ge 1 $ distinct numbers we can form an arithmetic progression if and only if there are exactly $ n-1 $ distinct elements in the set of positive differences between any two of these numbers.

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 sequence $a_1,a_2,\ldots ,a_n,\ldots$ of natural numbers is defined by the rule \[a_{n+1}=a_n+b_n\ (n=1,2,\ldots)\] where $b_n$ is the last digit of $a_n$. Prove that such a sequence contains infinitely many powers of $2$ if and only if $a_1$ is not divisible by $5$.

For real numbers $a, b$ and $c$ we have \[(2b-a)^2 + (2b-c)^2 = 2(2b^2-ac).\] Prove that the numbers $a, b$ and $c$ are three consecutive terms in some arithmetic sequence.

Prove that for every real number $M$ there exists an infinite arithmetical progression of positive integers such that [list] [*] the common difference is not divisible by $10$, [*] the sum of digits of each term exceeds $M$. [/list]

Let $f : R^+ \to R$ be a strictly increasing function such that $f\left(\frac{x+y}{2}\right) < \frac{f(x)+ f(y)}{2}$ for all $x,y > 0$. Prove that the sequence $a_n = f(n)$ ($n \in N$) does not contain an infinite arithmetic progression.

Given a sequence $(a_n)$ of real numbers such that the set $\{a_n\}$ is finite. If for every $k>1$ subsequence $(a_{kn})$ is periodic, is it true that the sequence $(a_n)$ must be periodic?

From a fixed set formed by the first consecutive natural numbers, find the number of subsets having exactly three elements, and these in arithmetic progression.

In $\triangle ABC$, $A,B,C$ are arithmetic sequence, and $c-a$ is equal to height on side $BC$, then $\sin\frac{C-A}{2}=$________.

Prove that if the lengths of the sides of a triangle form an arithmetic progression, then the radius of the inscribed circle is one third of one of the heights of the triangle.

In a given arithmetic sequence the first term is $2$, the last term is $29$, and the sum of all the terms is $155$. The common difference is: $\text{(A)} \ 3 \qquad \text{(B)} \ 2 \qquad \text{(C)} \ \frac{27}{19} \qquad \text{(D)} \ \frac{13}9 \qquad \text{(E)} \ \frac{23}{38}$

Let $n\geq3$ be an integer. We say that an arrangement of the numbers $1$, $2$, $\dots$, $n^2$ in a $n \times n$ table is [i]row-valid[/i] if the numbers in each row can be permuted to form an arithmetic progression, and [i]column-valid[/i] if the numbers in each column can be permuted to form an arithmetic progression. For what values of $n$ is it possible to transform any row-valid arrangement into a column-valid arrangement by permuting the numbers in each row?

a) We have a geometric sequence of $3$ terms. If the sum of these terms is $26$ , and their sum of squares is $364$ , find the terms of the sequence. b) Suppose that $a,b,c,u,v,w$ are positive real numbers , and each of $a,b,c$ and $u,v,w$ are geometric sequences. Suppose also that $a+u,b+v,c+w$ are an arithmetic sequence. Prove that $a=b=c$ and $u=v=w$ c) Let $a,b,c,d$ be real numbers (not all zero), and let $f(x,y,z)$ be the polynomial in three variables defined by$$f(x,y,z) = axyz + b(xy + yz + zx) + c(x+y+z) + d$$.Prove that $f(x,y,z)$ is reducible if and only if $a,b,c,d$ is a geometric sequence.

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.

Given: (i) $a$, $b > 0$; (ii) $a$, $A_1$, $A_2$, $b$ is an arithmetic progression; (iii) $a$, $G_1$, $G_2$, $b$ is a geometric progression. Show that \[A_1 A_2 \ge G_1 G_2.\]

Suppose $f:\mathbb{R}\to\mathbb{R}$ is a differentiable function for which the inequality $f'(x) \leq f'(x+\frac{1}{n})$ holds for every $x\in\mathbb{R}$ and every $n\in\mathbb{N}$.Prove that f is continiously differentiable

Is it possible to mark four points on the plane so that the distances between any point and three other points form an arithmetic progression? (V. Brayman)

The first three terms of an arithmetic progression are $ x \minus{} 1, x \plus{} 1, 2x \plus{} 3,$ in the order shown. The value of $ x$ is: $ \textbf{(A)}\ \minus{} 2 \qquad \textbf{(B)}\ 0 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ \text{undetermined}$

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$

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.