Found problems: 5923
In quadrilateral $ABCD$, angles $A, B, C, D$ form an increasing arithmetic sequence. Also, $\angle ACB = 90^o$ . If $CD = 14$ and the length of the altitude from $C$ to $AB$ is $9$, compute the area of $ABCD$.
Let $\mathcal{S}$ be a set of $10$ points in a plane that lie within a disk of radius $1$ billion. Define a $move$ as picking a point $P \in \mathcal{S}$ and reflecting it across $\mathcal{S}$'s centroid. Does there always exist a sequence of at most $1500$ moves after which all points of $\mathcal{S}$ are contained in a disk of radius $10$?
[i]Advaith Avadhanam[/i]
Find the next number in the sequence $131, 111311, 311321, 1321131211,\cdots$
Let $a_1>a_2>a_3>\cdots$ be a sequence of real numbers which converges to 0. We put circles of radius $a_1$ into a unit square until no more can fit. (A previously laid circle must not be moved.) Then we put circles of radius $a_2$ in the remaining space until no more can fit, continuing the process for $a_3$,... What can the area covered by the circles be?
a similar problem involving circles in a square:
[url]https://artofproblemsolving.com/community/c7h1979044[/url]
Show that the recursion $n=x_n(x_{n-1}+x_n+x_{n+1})$, $n=1,2,\ldots$, $x_0=0$ has exaclty one nonnegative solution.
(translated by L. Erdős)
Find the smallest term of the sequence $a_1, a_2, a_3, \ldots$ defined by $a_1=2014^{2015^{2016}}$ and
$$
a_{n+1}=
\begin{cases}
\frac{a_n}{2} & \text{ if } a_n \text{ is even} \\
a_n + 7 & \text{ if } a_n \text{ is odd} \\
\end{cases}
$$
A student firstly wrote $x=3$ on the board. For each procces, the stutent deletes the number x and replaces it with either $(2x+4)$ or $(3x+8)$ or $(x^2+5x)$. Is this possible to make the number $(20^{17}+2016)$ on the board? \\
(Explain your answer) \\
[hide=Note]This type of the question is well known but I am going to make a collection so, :blush: [/hide]
Let $s_1$ be the sum of the first $n$ terms of the arithmetic sequence $8,12,\cdots$ and let $s_2$ be the sum of the first $n$ terms of the arithmetic sequence $17,19\cdots$. Assume $n\ne 0$. Then $s_1=s_2$ for:
$\text{(A)} \ \text{no value of n} \qquad \text{(B)} \ \text{one value of n} \qquad \text{(C)} \ \text{two values of n}$
$\text{(D)} \ \text{four values of n} \qquad \text{(E)} \ \text{more than four values of n}$
$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$
In the eight-term sequence $A, B, C, D, E, F, G, H$, the value of $C$ is $5$ and the sum of any three consecutive terms is $30$. What is $A + H$?
$ \textbf{(A)}\ 17 \qquad
\textbf{(B)}\ 18 \qquad
\textbf{(C)}\ 25 \qquad
\textbf{(D)}\ 26 \qquad
\textbf{(E)}\ 43
$
Given is a sequence of real numbers $\{a_n\}^{\infty}_{n=1}$ such that $a_n \ne a_m$ for $n\ne m,$ given is a natural number $k$. Construct an injective map $P:\{1,2,\ldots,20k\}\to\mathbb Z^+$ such that the following inequalities hold:
$$a_{p(1)}<a_{p(2)}<...<a_{p(10)}$$
$$ a_{p(10)}>a_{p(11)}>...>a_{p(20)}$$
$$a_{p(20)}<a_{p(21)}<...<a_{p(30)}$$
$$...$$
$$a_{p(20k-10)}>a_{p(20k-9)}>...>a_{p(20k)}$$
$$a_{p(10)}>a_{p(30)}>...>a_{p((20k-10))} $$
$$a_{p(1)}<a_{p(20)}<...<a_{p(20k)},$$
$k$ is a positive integer. The sequence $a_1, a_2, a_3, ...$ is defined by $a_1 = k+1$, $a_{n+1} = a_n ^2 - ka_n + k$. Show that $a_m$ and $a_n$ are coprime (for $m \not = n$).
Given an increasing sequence of different natural numbers $a_1 < a_2 < a_3 < ... < a_n$ such that for any two distinct numbers in this sequence their sum is not divisible by $10$. It is known that $a_n = 2023$.
a) Can $n$ be greater than $800$?
b) What is the largest possible value of $n$?
c) For the value $n$ found in question b), find the number of such sequences with $a_n = 2023$.
Let $ABC$ be a triangle whose angles measure $A$, $B$, $C$, respectively. Suppose $\tan A$, $\tan B$, $\tan C$ form a geometric sequence in that order. If $1\le \tan A+\tan B+\tan C\le 2015$, find the number of possible integer values for $\tan B$. (The values of $\tan A$ and $\tan C$ need not be integers.)
[i] Proposed by Justin Stevens [/i]
Let $M, \alpha, \beta \in \mathbb{R} $ with $M > 0$ and $\alpha, \beta \in (0,1)$. If $R>1$ is a real number, we say that a sequence of positive real numbers $\{ C_n \}_{n\geq 0}$ is $R$-[i]inoceronte[/i] if $ \sum_{i=1}^n R^{n-i}C_i \leq R^n \cdot M$ for all $n \geq 1$. Determine the smallest real $R>1$ for which exists a $R$-[i]inoceronte[/i] sequence $ \{ C_n \}_{n\geq 0}$ such that $\sum_{n=1}^{\infty} \beta ^n C_n^{\alpha}$ diverges.
Let $a_1,a_2,\cdots$ be an infinity sequence of positive integers such that $a_1=2021$ and
$$a_{n+1}=(a_1+a_2+\cdots+a_n)^2-1$$
for all positive integers $n$. Prove that for any integer $n\ge 2$, $a_n$ is the product of at least $2n$ (not necessarily distinct) primes.
Let $n$ be a positive integer. Nancy is given a rectangular table in which each entry is a positive integer. She is permitted to make either of the following two moves:
(1) select a row and multiply each entry in this row by $n$;
(2) select a column and subtract $n$ from each entry in this column.
Find all possible values of $n$ for which the following statement is true:
Given any rectangular table, it is possible for Nancy to perform a finite sequence of moves to create a table in which each entry is $0$.
Determine the greatest positive integer \(n\) for which there exists a sequence of distinct positive integers \(s_1\), \(s_2\), \(\ldots\), \(s_n\) satisfying \[s_1^{s_2}=s_2^{s_3}=\cdots=s_{n-1}^{s_n}.\]
[i]Proposed by Holden Mui[/i]
The following spiral sequence of squares is drawn on an infinite blackboard: The $1$st square $(1 \times 1)$ has a common vertical side with the $2$nd square (also $1\times 1$) drawn on the right side of it; the 3rd square $(2 \times 2)$ is drawn on the upper side of the $1$st and 2nd ones; the $4$th square $(3 \times 3)$ is drawn on the left side of the $1$st and $3$rd ones; the $5$th square $(5 \times 5)$ is drawn on the bottom side of the $4$th, 1st and $2$nd ones; the $6$th square $(8 \times 8)$ is drawn on the right side, and so on. Each of the squares has a common side with the rectangle consisting of squares constructed earlier. Prove that the centres of all the squares except the $1$st lie on two straight lines.
(A Andjans, Riga)
The sequence $a_1, a_2, ... , a_k, ...$ is constructed according to the rules: $$a_{2n} = a_n,a_{4n+1} = 1,a_{4n+3} = 0$$Prove that it is non-periodical sequence.
$ i(L) $ denotes the number of multiplicative binary operations over the set of elements of the finite additive group $ L $ such that the set of elements of $ L, $ along with these additive and multiplicative operations, form a ring. Prove that
[b]a)[/b] $ i\left( \mathbb{Z}_{12} \right) =4. $
[b]b)[/b] $ i(A\times B)\ge i(A)i(B) , $ for any two finite commutative groups $ B $ and $ A. $
[b]c)[/b] there exist two sequences $ \left( G_k \right)_{k\ge 1} ,\left( H_k \right)_{k\ge 1} $ of finite commutative groups such that
$$ \lim_{k\to\infty }\frac{\# G_k }{i\left( G_k \right)} =0 $$
and
$$ \lim_{k\to\infty }\frac{\# H_k }{i\left( H_k \right)} =\infty. $$
[i]Barbu Berceanu[/i]
Find the maximal constant $ M$, such that for arbitrary integer $ n\geq 3,$ there exist two sequences of positive real number $ a_{1},a_{2},\cdots,a_{n},$ and $ b_{1},b_{2},\cdots,b_{n},$ satisfying
(1):$ \sum_{k \equal{} 1}^{n}b_{k} \equal{} 1,2b_{k}\geq b_{k \minus{} 1} \plus{} b_{k \plus{} 1},k \equal{} 2,3,\cdots,n \minus{} 1;$
(2):$ a_{k}^2\leq 1 \plus{} \sum_{i \equal{} 1}^{k}a_{i}b_{i},k \equal{} 1,2,3,\cdots,n, a_{n}\equiv M$.
Let $s_1, s_2, \dots$ be an arithmetic progression of positive integers. Suppose that
\[ s_{s_1} = x+2, \quad s_{s_2} = x^2+18, \quad\text{and}\quad s_{s_3} = 2x^2+18. \]
Determine the value of $x$.
[i] Proposed by Evan Chen [/i]
Let $m$ and $n$ be positive integers. A sequence of points $(A_0,A_1,\ldots,A_n)$ on the Cartesian plane is called [i]interesting[/i] if $A_i$ are all lattice points, the slopes of $OA_0,OA_1,\cdots,OA_n$ are strictly increasing ($O$ is the origin) and the area of triangle $OA_iA_{i+1}$ is equal to $\frac{1}{2}$ for $i=0,1,\ldots,n-1$.
Let $(B_0,B_1,\cdots,B_n)$ be a sequence of points. We may insert a point $B$ between $B_i$ and $B_{i+1}$ if $\overrightarrow{OB}=\overrightarrow{OB_i}+\overrightarrow{OB_{i+1}}$, and the resulting sequence $(B_0,B_1,\ldots,B_i,B,B_{i+1},\ldots,B_n)$ is called an [i]extension[/i] of the original sequence. Given two [i]interesting[/i] sequences $(C_0,C_1,\ldots,C_n)$ and $(D_0,D_1,\ldots,D_m)$, prove that if $C_0=D_0$ and $C_n=D_m$, then we may perform finitely many [i]extensions[/i] on each sequence until the resulting two sequences become identical.
Every member, starting from the third one, of two sequences $\{a_n\}$ and $\{b_n\}$ equals to the sum of two preceding ones. First members are: $a_1 = 1, a_2 = 2, b_1 = 2, b_2 = 1$. How many natural numbers are encountered in both sequences (may be on the different places)?