Find all positive integers $n \geqslant 2$ for which there exist $n$ real numbers $a_1<\cdots<a_n$ and a real number $r>0$ such that the $\tfrac{1}{2}n(n-1)$ differences $a_j-a_i$ for $1 \leqslant i<j \leqslant n$ are equal, in some order, to the numbers $r^1,r^2,\ldots,r^{\frac{1}{2}n(n-1)}$.

We say that $(a,b,c)$ form a [i]fantastic triplet[/i] if $a,b,c$ are positive integers, $a,b,c$ form a geometric sequence, and $a,b+1,c$ form an arithmetic sequence. For example, $(2,4,8)$ and $(8,12,18)$ are fantastic triplets. Prove that there exist infinitely many fantastic triplets.

An equilateral triangle is originally painted black. Each time the triangle is changed, the middle fourth of each black triangle turns white. After five changes, what fractional part of the original area of the black triangle remains black? [asy] unitsize(36); fill((0,0)--(2,0)--(1,sqrt(3))--cycle,gray); draw((0,0)--(2,0)--(1,sqrt(3))--cycle,linewidth(1)); fill((4,0)--(6,0)--(5,sqrt(3))--cycle,gray); fill((5,0)--(9/2,sqrt(3)/2)--(11/2,sqrt(3)/2)--cycle,white); draw((5,sqrt(3))--(4,0)--(5,0)--(9/2,sqrt(3)/2)--(11/2,sqrt(3)/2)--(5,0)--(6,0)--cycle,linewidth(1)); fill((8,0)--(10,0)--(9,sqrt(3))--cycle,gray); fill((9,0)--(17/2,sqrt(3)/2)--(19/2,sqrt(3)/2)--cycle,white); fill((17/2,0)--(33/4,sqrt(3)/4)--(35/4,sqrt(3)/4)--cycle,white); fill((9,sqrt(3)/2)--(35/4,3*sqrt(3)/4)--(37/4,3*sqrt(3)/4)--cycle,white); fill((19/2,0)--(37/4,sqrt(3)/4)--(39/4,sqrt(3)/4)--cycle,white); draw((9,sqrt(3))--(35/4,3*sqrt(3)/4)--(37/4,3*sqrt(3)/4)--(9,sqrt(3)/2)--(35/4,3*sqrt(3)/4)--(33/4,sqrt(3)/4)--(35/4,sqrt(3)/4)--(17/2,0)--(33/4,sqrt(3)/4)--(8,0)--(9,0)--(17/2,sqrt(3)/2)--(19/2,sqrt(3)/2)--(9,0)--(19/2,0)--(37/4,sqrt(3)/4)--(39/4,sqrt(3)/4)--(19/2,0)--(10,0)--cycle,linewidth(1)); label("Change 1",(3,3*sqrt(3)/4),N); label("$\Longrightarrow $",(3,5*sqrt(3)/8),S); label("Change 2",(7,3*sqrt(3)/4),N); label("$\Longrightarrow $",(7,5*sqrt(3)/8),S); [/asy] $\text{(A)}\ \frac{1}{1024} \qquad \text{(B)}\ \frac{15}{64} \qquad \text{(C)}\ \frac{243}{1024} \qquad \text{(D)}\ \frac{1}{4} \qquad \text{(E)}\ \frac{81}{256}$

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 in the geometric progression? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 36 \qquad \textbf{(D)}\ 49 \qquad \textbf{(E)}\ 81$

Let $ \left( a_n \right)_{n\ge 1} $ be a non-constant arithmetic progression of positive numbers and $ \left( g_n \right)_{n\ge 1} $ be a non-constant geometric progression of positive numbers satisfying $ a_1=g_1 $ and $ a_{2019} =g_{2019} . $ Specify the set $ \left\{ k\in\mathbb{N} \big| a_k\le g_k \right\} $ and prove that it bijects the natural numbers. [i]Gheorghe Rotariu[/i]

Alison has an analog clock whose hands have the following lengths: $a$ inches (the hour hand), $b$ inches (the minute hand), and $c$ inches (the second hand), with $a < b < c$. The numbers $a$, $b$, and $c$ are consecutive terms of an arithmetic sequence. The tips of the hands travel the following distances during a day: $A$ inches (the hour hand), $B$ inches (the minute hand), and $C$ inches (the second hand). The numbers $A$, $B$, and $C$ (in this order) are consecutive terms of a geometric sequence. What is the value of $\frac{B}{A}$?

Decide whether it is possible to color the $1984$ natural numbers $1, 2, 3, \cdots, 1984$ using $15$ colors so that no geometric sequence of length $3$ of the same color exists.

$\Delta oa_1b_1$ is isosceles with $\angle a_1ob_1 = 36^\circ$. Construct $a_2,b_2,a_3,b_3,...$ as below, with $|oa_{i+1}| = |a_ib_i|$ and $\angle a_iob_i = 36^\circ$, Call the summed area of the first $k$ triangles $A_k$. Let $S$ be the area of the isocseles triangle, drawn in - - -, with top angle $108^\circ$ and $|oc|=|od|=|oa_1|$, going through the points $b_2$ and $a_2$ as shown on the picture. (yes, $cd$ is parallel to $a_1b_1$ there) Show $A_k < S$ for every positive integer $k$. [img]http://www.mathlinks.ro/Forum/album_pic.php?pic_id=284[/img]

Source: 1976 Euclid Part B Problem 2 ----- Given that $x$, $y$, and $2$ are in geometric progression, and that $x^{-1}$, $y^{-1}$, and $9x^{-2}$ are in are in arithmetic progression, then find the numerical value of $xy$.

An [i]arithmetic sequence[/i] is an infinite sequence of the form $a_n=a_0+n\cdot d$ with $d\neq 0$. A [i]geometric sequence[/i] is an infinite sequence of the form $b_n=b_0 \cdot q^n$ where $q\neq 1,0,-1$. [list=a] [*] Does every arithmetic sequence of [b]integers[/b] have an infinite subsequence which is geometric? [*] Does every arithmetic sequence of [b]real numbers[/b] have an infinite subsequence which is geometric? [/list]

For every positive integer $n$, let $\operatorname{mod_5}(n)$ be the remainder obtained when $n$ is divided by $5$. Define a function $f : \{0, 1, 2, 3, \dots\} \times \{0, 1, 2, 3, 4\} \to \{0, 1, 2, 3, 4\}$ recursively as follows: \[f(i, j) = \begin{cases} \operatorname{mod_5}(j+1) & \text{if }i=0\text{ and }0\leq j\leq 4 \\ f(i-1, 1) & \text{if }i\geq 1\text{ and }j=0 \text{, and}\\ f(i-1, f(i, j-1)) & \text{if }i\geq 1\text{ and }1\leq j\leq 4 \end{cases}\] What is $f(2015, 2)$? $\textbf{(A) }0 \qquad\textbf{(B) }1 \qquad\textbf{(C) }2 \qquad\textbf{(D) }3 \qquad\textbf{(E) }4$

Find all triples of natural numbers $(a,b,c)$ such that $a$, $b$ and $c$ are in geometric progression and $a + b + c = 111$.

$(a_n)$ is an arithmetic sequence, $(b_n)$ is a geometric sequence. If $b_1=a_1^2,b_2=a_2^2,b_3=a_3^2(a_1<a_2)$, and $\lim_{n\to\infty}(b_1+b_2+\cdots+b_n)=\sqrt2+1$, find $a_n$.

Professor Piraldo takes part in soccer matches with a lot of goals and judges a match in his own peculiar way. A match with score of $m$ goals to $n$ goals, $m\geq n$, is [i]tough[/i] when $m\leq f(n)$, where $f(n)$ is defined by $f(0) = 0$ and, for $n \geq 1$, $f(n) = 2n-f(r)+r$, where $r$ is the largest integer such that $r < n$ and $f(r) \leq n$. Let $\phi ={1+\sqrt 5\over 2}$. Prove that a match with score of $m$ goals to $n$, $m\geq n$, is tough if $m\leq \phi n$ and is not tough if $m \geq \phi n+1$.

Prove that among the elements of the sequence $\left\{ \left\lfloor n\sqrt{2003} \right\rfloor \right\}_{n\geq 1}$ one can find a geometric progression having any number of terms, and having the ratio bigger than $k$, where $k$ can be any positive integer. [i]Radu Gologan[/i]

Can the numbers $1,2,3,\ldots,100$ be covered with $12$ geometric progressions? [i]A. Golovanov[/i]

Five distinct $2$-digit numbers are in a geometric progression. Find the middle term.

Find all three digit natural numbers of the form $(abc)_{10}$ such that $(abc)_{10}$, $(bca)_{10}$ and $(cab)_{10}$ are in geometric progression. (Here $(abc)_{10}$ is representation in base $10$.)

Let $a_1, \ldots, a_n$ be $n$ positive numbers and $0 < q < 1.$ Determine $n$ positive numbers $b_1, \ldots, b_n$ so that: [i]a.)[/i] $ a_{k} < b_{k}$ for all $k = 1, \ldots, n,$ [i]b.)[/i] $q < \frac{b_{k+1}}{b_{k}} < \frac{1}{q}$ for all $k = 1, \ldots, n-1,$ [i]c.)[/i] $\sum \limits^n_{k=1} b_k < \frac{1+q}{1-q} \cdot \sum \limits^n_{k=1} a_k.$

If $P$ is the product of $n$ quantities in Geometric Progression, $S$ their sum, and $S'$ the sum of their reciprocals, then $P$ in terms of $S$, $S'$, and $n$ is $\textbf{(A) }(SS')^{\frac{1}{2}n}\qquad\textbf{(B) }(S/S')^{\frac{1}{2}n}\qquad\textbf{(C) }(SS')^{n-2}\qquad\textbf{(D) }(S/S')^n\qquad \textbf{(E) }(S/S')^{\frac{1}{2}(n-1)}$

Given a geometric progression of five terms, each a positive integer less than $100$. The sum of the five terms is $211$. If $S$ is the sum of those terms in the progression which are squares of integers, then $S$ is: $\textbf{(A)}\ 0\qquad \textbf{(B)}\ 91\qquad \textbf{(C)}\ 133\qquad \textbf{(D)}\ 195\qquad \textbf{(E)}\ 211$

Sines of three acute angles form an arithmetic progression, while the cosines of these angles form a geometric progression. Prove that all three angles are equal.

The cubic equation $x^3+2x-1=0$ has exactly one real root $r$. Note that $0.4<r<0.5$. (a) Find, with proof, an increasing sequence of positive integers $a_1 < a_2 < a_3 < \cdots$


such that \[\frac{1}{2}=r^{a_1}+r^{a_2}+r^{a_3}+\cdots.\] (b) Prove that the sequence that you found in part (a) is the unique increasing sequence with the above property.

Find all positive integers $n \geqslant 2$ for which there exist $n$ real numbers $a_1<\cdots<a_n$ and a real number $r>0$ such that the $\tfrac{1}{2}n(n-1)$ differences $a_j-a_i$ for $1 \leqslant i<j \leqslant n$ are equal, in some order, to the numbers $r^1,r^2,\ldots,r^{\frac{1}{2}n(n-1)}$.

Sixteen natural numbers written in the decimal system may form a geometric sequence, of which the first five members have nine digits, five further members have ten digits, four members have eleven digits and two terms have twelve digits. Prove that there is exactly one sequence with these properties.