This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 150

There is a unique positive real number $x$ such that the three numbers $\log_8(2x),\log_4x,$ and $\log_2x,$ in that order, form a geometric progression with positive common ratio. The number $x$ can be written as $\tfrac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
In $ \triangle ABC$, $ AB \equal{} BC$, and $ BD$ is an altitude. Point $ E$ is on the extension of $ \overline{AC}$ such that $ BE \equal{} 10$. The values of $ \tan CBE$, $ \tan DBE$, and $ \tan ABE$ form a geometric progression, and the values of $ \cot DBE$, $ \cot CBE$, $ \cot DBC$ form an arithmetic progression. What is the area of $ \triangle ABC$? [asy]unitsize(3mm); defaultpen(linewidth(.8pt)+fontsize(10pt)); pair D=(0,0), C=(3,0), A=(-3,0), B=(0, 8), Ep=(6,0); draw(A--B--Ep--cycle); draw(D--B--C); label("$A$",A,S); label("$D$",D,S); label("$C$",C,S); label("$E$",Ep,S); label("$B$",B,N);[/asy]$ \textbf{(A)}\ 16 \qquad \textbf{(B)}\ \frac {50}{3} \qquad \textbf{(C)}\ 10\sqrt3 \qquad \textbf{(D)}\ 8\sqrt5 \qquad \textbf{(E)}\ 18$
If $x, 2x+2, 3x+3, \dots$ are in geometric progression, the fourth term is: ${{ \textbf{(A)}\ -27 \qquad\textbf{(B)}\ -13\frac{1}{2} \qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 13\frac{1}{2} }\qquad\textbf{(E)}\ 27 } $
Determine the number of angles $\theta$ between $0$ and $2 \pi$, other than integer multiples of $\pi /2$, such that the quantities $\sin \theta, \cos \theta, $ and $\tan \theta$ form a geometric sequence in some order.
Given a set of $4n$ positive numbers such that any distinct choice of ordered foursomes of these numbers constitutes a geometric progression. Prove that at least $4$ numbers of the set are identical.
Show that the number $x$ is rational if and only if three distinct terms that form a geometric progression can be chosen from the sequence \[x, ~ x+1, ~ x+2,~ x+3,\ldots . \]
Let (i) $a_1,a_2,a_3$ is an arithmetic progression and $a_1+a_2+a_3=18$ (ii) $b_1,b_2,b_3$ is a geometric progression and $b_1b_2b_3=64$ If $a_1+b_1,a_2+b_2,a_3+b_3$ are all positive integers and it is a ageometric progression, then find the maximum value of $a_3$.
The first three terms of a geometric progression are $\sqrt{2}, \sqrt[3]{2}, \sqrt[6]{2}$. Find the fourth term. ${{ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ \sqrt[7]{2} \qquad\textbf{(C)}\ \sqrt[8]{2} \qquad\textbf{(D)}\ \sqrt[9]{2} }\qquad\textbf{(E)}\ \sqrt[10]{2} } $
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.$
A quarry wants to sell a large pile of gravel. At full price, the gravel would sell for $3200$ dollars. But during the first week the quarry only sells $60\%$ of the gravel at full price. The following week the quarry drops the price by $10\%$, and, again, it sells $60\%$ of the remaining gravel. Each week, thereafter, the quarry reduces the price by another $10\%$ and sells $60\%$ of the remaining gravel. This continues until there is only a handful of gravel left. How many dollars does the quarry collect for the sale of all its gravel?
In a geometric sequence of real numbers, the sum of the first two terms is 7, and the sum of the first 6 terms is 91. The sum of the first 4 terms is $\text{(A)}\ 28 \qquad \text{(B)}\ 32 \qquad \text{(C)}\ 35 \qquad \text{(D)}\ 49 \qquad \text{(E)}\ 84$
Let $a,b$ be real numbers ($b\ne 0$) and consider the infinite arithmetic sequence $a, a+b ,a +2b , \ldots.$ Show that this sequence contains an infinite geometric subsequence if and only if $\frac{a}{b}$ is rational.
Consider infinite sequences $\{x_n\}$ of positive reals such that $x_0=1$ and $x_0\ge x_1\ge x_2\ge\ldots$. [b]a)[/b] Prove that for every such sequence there is an $n\ge1$ such that: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999. \] [b]b)[/b] Find such a sequence such that for all $n$: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4. \]
Given positive integers $a,c$ and integer $b$, prove that there exists a positive integer $x$ such that \[ a^x + x \equiv b \pmod c, \] that is, there exists a positive integer $x$ such that $c$ is a divisor of $a^x + x - b$.
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$.
Prove that every infinite arithmetic progression $a$, $a+d$, $a+2d$,... where $a$ and $d$ are positive integers, contains infinte geometric progression $b$, $bq$, $bq^2$,... where $b$ and $q$ are also positive integers
Let $x \ne 1$ be a fixed positive number and $a_1, a_2, a_3,...$ some kind of number sequence. Prove that $x^{a_1},x^{a_2},x^{a_3},...$ is a non-constant geometric sequence if and only if $a_1, a_2, a_3,...$. is a non-constant arithmetic sequence.
A high school basketball game between the Raiders and Wildcats was tied at the end of the first quarter. The number of points scored by the Raiders in each of the four quarters formed an increasing geometric sequence, and the number of points scored by the Wildcats in each of the four quarters formed an increasing arithmetic sequence. At the end of the fourth quarter, the Raiders had won by one point. Neither team scored more than $ 100$ points. What was the total number of points scored by the two teams in the first half? $ \textbf{(A)}\ 30 \qquad \textbf{(B)}\ 31 \qquad \textbf{(C)}\ 32 \qquad \textbf{(D)}\ 33 \qquad \textbf{(E)}\ 34$
In base $R_1$ the expanded fraction $F_1$ becomes $0.373737...$, and the expanded fraction $F_2$ becomes $0.737373...$. In base $R_2$ fraction $F_1$, when expanded, becomes $0.252525...$, while fraction $F_2$ becomes $0.525252...$. The sum of $R_1$ and $R_2$, each written in base ten is: $\text{(A)}\ 24 \qquad \text{(B)}\ 22\qquad \text{(C)}\ 21\qquad \text{(D)}\ 20\qquad \text{(E)}\ 19$
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$
Let $(a_i)_{i\in \mathbb{N}}$ and $(p_i)_{i\in \mathbb{N}}$ be two sequences of positive integers such that the following conditions hold: $\bullet ~~a_1\ge 2$. $\bullet~~ p_n$ is the smallest prime divisor of $a_n$ for every integer $n\ge 1$ $\bullet~~ a_{n+1}=a_n+\frac{a_n}{p_n}$ for every integer $n\ge 1$ Prove that there is a positive integer $N$ such that $a_{n+3}=3a_n$ for every integer $n>N$
Let be a matrix $ A\in\mathcal{M}_2(\mathbb{R}) $ having the property that the numbers $ \det (A+X) ,\det (A^2+X^2) ,\det (A^3+X^3) $ are (in this order) in geometric progression, for any matrix $ X\in\mathcal{M}_2(\mathbb{R}) . $ Prove that $ A=0. $ [i]Marius Ghergu[/i]
In a rectangular plot of land, a man walks in a very peculiar fashion. Labeling the corners $ABCD$, he starts at $A$ and walks to $C$. Then, he walks to the midpoint of side $AD$, say $A_1$. Then, he walks to the midpoint of side $CD$ say $C_1$, and then the midpoint of $A_1D$ which is $A_2$. He continues in this fashion, indefinitely. The total length of his path if $AB=5$ and $BC=12$ is of the form $a + b\sqrt{c}$. Find $\displaystyle\frac{abc}{4}$.
If the discriminant of $ ax^2\plus{}2bx\plus{}c\equal{}0$ is zero, then another true statement about $ a$, $ b$, and $ c$ is that: $ \textbf{(A)}\ \text{they form an arithmetic progression} \\ \textbf{(B)}\ \text{they form a geometric progression} \\ \textbf{(C)}\ \text{they are unequal} \\ \textbf{(D)}\ \text{they are all negative numbers} \\ \textbf{(E)}\ \text{only b is negative and a and c are positive}$
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)}$.