Found problems: 5923
Let $\{n_{k}\}_{k \ge 1}$ be a sequence of natural numbers such that for $i<j$, the decimal representation of $n_{i}$ does not occur as the leftmost digits of the decimal representation of $n_{j}$. Prove that \[\sum^{\infty}_{k=1}\frac{1}{n_{k}}\le \frac{1}{1}+\frac{1}{2}+\cdots+\frac{1}{9}.\]
For an infinite sequence $a_1, a_2,. . .$ denote as it's [i]first derivative[/i] is the sequence $a'_n= a_{n + 1} - a_n$ (where $n = 1, 2,..$.), and her $k$- th derivative as the first derivative of its $(k-1)$-th derivative ($k = 2, 3,...$). We call a sequence [i]good[/i] if it and all its derivatives consist of positive numbers.
Prove that if $a_1, a_2,. . .$ and $b_1, b_2,. . .$ are good sequences, then sequence $a_1\cdot b_1, a_2 \cdot b_2,..$ is also a good one.
R. Salimov
Let \((a_n)_{n \geq 1}\) s sequence of reals such that \(\sum_{n \geq 1}{\frac{a_n}{n}}\) converges. Show that
\(\lim_{n \rightarrow \infty}{\frac{1}{n} \cdot \sum_{k=1}^{n}{a_k}} = 0\)
The sequence of numbers $a_0,a_1,a_2,...$ is determined by $a_0 = 0$, and
$$a_n= \begin{cases} 1+a_{n-1} \,\,\, when\,\,\, n \,\,\, is \,\,\, positive \,\,\, and \,\,\, odd \\
3a_{n/2} \,\,\,when \,\,\,n \,\,\,is \,\,\,positive \,\,\,and \,\,\,even\end{cases}$$
How many of these numbers are less than $2007$ ?
[url=https://artofproblemsolving.com/community/c677808][b]Cyprus IMO TST 2018[/b][/url]
[url=https://artofproblemsolving.com/community/c6h1666662p10591751][b]Problem 1.[/b][/url] Determine all integers $n \geq 2$ for which the number $11111$ in base $n$ is a perfect square.
[url=https://artofproblemsolving.com/community/c6h1666663p10591753][b]Problem 2.[/b][/url] Consider a trapezium $AB \Gamma \Delta$, where $A\Delta \parallel B\Gamma$ and $\measuredangle A = 120^{\circ}$. Let $E$ be the midpoint of $AB$ and let $O_1$ and $O_2$ be the circumcenters of triangles $AE \Delta$ and $BE\Gamma$, respectively. Prove that the area of the trapezium is equal to six time the area of the triangle $O_1 E O_2$.
[url=https://artofproblemsolving.com/community/c6h1666660p10591747][b]Problem 3.[/b][/url] Find all triples $(\alpha, \beta, \gamma)$ of positive real numbers for which the expression
$$K = \frac{\alpha+3 \gamma}{\alpha + 2\beta + \gamma} + \frac{4\beta}{\alpha+\beta+2\gamma} - \frac{8 \gamma}{\alpha+ \beta + 3\gamma}$$obtains its minimum value.
[url=https://artofproblemsolving.com/community/c6h1666661p10591749][b]Problem 4.[/b][/url] Let $\Lambda= \{1, 2, \ldots, 2v-1,2v\}$ and $P=\{\alpha_1, \alpha_2, \ldots, \alpha_{2v-1}, \alpha_{2v}\}$ be a permutation of the elements of $\Lambda$.
(a) Prove that
$$\sum_{i=1}^v \alpha_{2i-1}\alpha_{2i} \leq \sum_{i=1}^v (2i-1)2i.$$(b) Determine the largest positive integer $m$ such that we can partition the $m\times m$ square into $7$ rectangles for which every pair of them has no common interior points and their lengths and widths form the following sequence:
$$1,2,3,4,5,6,7,8,9,10,11,12,13,14.$$
Show that $r = 2$ is the largest real number $r$ which satisfies the following condition:
If a sequence $a_1$, $a_2$, $\ldots$ of positive integers fulfills the inequalities
\[a_n \leq a_{n+2} \leq\sqrt{a_n^2+ra_{n+1}}\]
for every positive integer $n$, then there exists a positive integer $M$ such that $a_{n+2} = a_n$ for every $n \geq M$.
Let $\{F_n\}_{n\ge1}$ be the Fibonacci sequence defined by $F_1=F_2=1$ and for all $n\ge3$, $F_n=F_{n-1}+F_{n-2}$. Prove that among the first $10000000000000002$ terms of the sequence there is one term that ends up with $8$ zeroes.
[i]Proposed by José Luis Díaz-Barrero[/i]
Anna writes a sequence of integers starting with the number 12. Each subsequent integer she writes is chosen randomly with equal chance from among the positive divisors of the previous integer (including the possibility of the integer itself). She keeps writing integers until she writes the integer 1 for the first time, and then she stops. One such sequence is \[ 12, 6, 6, 3, 3, 3, 1. \]
What is the expected value of the number of terms in Anna’s sequence?
An arithmetical progression (whose difference is not equal to zero) consists of natural numbers without any nines in its decimal notation.
(a) Prove that the number of its terms is less than $100$.
(b) Give an example of such a progression with $72$ terms.
(c) Prove that the number of terms in any such progression does not exceed $72$.
(V. Bugaenko and Tarasov, Moscow)
Fix a positive integer $n\geq 3$. Does there exist infinitely many sets $S$ of positive integers $\lbrace a_1,a_2,\ldots, a_n$, $b_1,b_2,\ldots,b_n\rbrace$, such that $\gcd (a_1,a_2,\ldots, a_n$, $b_1,b_2,\ldots,b_n)=1$, $\lbrace a_i\rbrace _{i=1}^n$, $\lbrace b_i\rbrace _{i=1}^n$ are arithmetic progressions, and $\prod_{i=1}^n a_i = \prod_{i=1}^n b_i$?
Let $a_1,a_2,a_3,\cdots $ be an infinite sequence of distinct integers. Prove that there are infinitely many primes $p$ that distinct positive integers $i,j,k$ can be found such that $p\mid a_ia_ja_k-1$.
[i]Proposed by Mohsen Jamali[/i]
Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties:
[list=disc]
[*]every term in the sequence is less than or equal to $2^{2023}$, and
[*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\]
[/list]
A positive integer $b$ and a sequence $a_0,a_1,a_2,\dots$ of integers $0\le a_i<b$ is given. It is known that $a_0\neq 0$ and the sequence $\{a_i\}$ is eventually periodic but has infinitely many nonzero terms. Let $S$ be the set of positive integers $n$ so that $n\mid (a_0a_1\dots a_n)_b$. Given that $S$ is infinite, show that there are infinitely many primes that divide at least one element of $S$.
[i]Proposed by Carl Schildkraut and Holden Mui[/i]
We consider two sequences of real numbers $x_{1} \geq x_{2} \geq \ldots \geq x_{n}$ and $\ y_{1} \geq y_{2} \geq \ldots \geq y_{n}.$ Let $z_{1}, z_{2}, .\ldots, z_{n}$ be a permutation of the numbers $y_{1}, y_{2}, \ldots, y_{n}.$ Prove that $\sum \limits_{i=1}^{n} ( x_{i} -\ y_{i} )^{2} \leq \sum \limits_{i=1}^{n}$ $( x_{i} - z_{i})^{2}.$
Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[ 2, \; 2^2, \; 2^{2^2}, \; 2^{2^{2^2}}, \ldots (\mbox{mod} \; n) \] is eventually constant.
[The tower of exponents is defined by $a_1 = 2, \; a_{i+1} = 2^{a_i}$. Also $a_i \; (\mbox{mod} \; n)$ means the remainder which results from dividing $a_i$ by $n$.]
An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that
\[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1
\]
for every pair of distinct nonnegative integers $ i, j$.
For every $n$, the decreasing sequence $\{x_k\}$ satisfies a condition $$x_1+x_4/2+x_9/3+...+x_n^2/n \le 1$$
Prove that for every $n$, it also satisfies $$x_1+x_2/2+x_3/3+...+x_n/n\le 3$$
Christian Reiher and Reid Barton want to open a security box, they already managed to discover the algorithm to generate the key codes and they obtained the following information:
$i)$ In the screen of the box will appear a sequence of $n+1$ numbers, $C_0 = (a_{0,1},a_{0,2},...,a_{0,n+1})$
$ii)$ If the code $K = (k_1,k_2,...,k_n)$ opens the security box then the following must happen:
a) A sequence $C_i = (a_{i,1},a_{i,2},...,a_{i,n+1})$ will be asigned to each $k_i$ defined as follows:
$a_{i,1} = 1$ and $a_{i,j} = a_{i-1,j}-k_ia_{i,j-1}$, for $i,j \ge 1$
b) The sequence $(C_n)$ asigned to $k_n$ satisfies that $S_n = \sum_{i=1}^{n+1}|a_i|$ has its least possible value, considering all possible sequences $K$.
The sequence $C_0$ that appears in the screen is the following:
$a_{0,1} = 1$ and $a_0,i$ is the sum of the products of the elements of each of the subsets with $i-1$ elements of the set $A =$ {$1,2,3,...,n$}, $i\ge 2$, such that $a_{0, n+1} = n!$
Find a sequence $K = (k_1,k_2,...,k_n)$ that satisfies the conditions of the problem and show that there exists at least $n!$ of them.
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)
Prove that the sum of the squares of the medians of a triangle is at least $ 9/4 $ if the circumradius of the triangle, the area of the triangle and the inradius of the triangle (in this order) are in arithmetic progression.
[i]Dumitru Crăciun[/i]
For some fixed positive integer $n>2$, suppose $x_1$, $x_2$, $x_3$, $\ldots$ is a nonconstant sequence of real numbers such that $x_i=x_j$ if $i \equiv j \pmod{n}$. Let $f(i)=x_i + x_i x_{i+1} + \dots + x_i x_{i+1} \dots x_{i+n-1}$. Given that $$f(1)=f(2)=f(3)=\cdots$$ find all possible values of the product $x_1 x_2 \ldots x_n$.
Mary divides a circle into $12$ sectors. The central angles of these sectors, measured in degrees, are all integers and they form an arithmetic sequence. What is the degree measure of the smallest possible sector angle?
$ \textbf{(A)}\ 5\qquad\textbf{(B)}\ 6\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 12 $
Let $ \left( x_n\right)_{n\ge 1} $ be a sequence of integers defined recursively as $ x_{n+2}=5x_{n+1}-x_n. $
Prove that $ \left( x_n\right)_{n\ge 1} $ has a subsequence whose terms are multiples of $ 22 $ if $ \left( x_n\right)_{n\ge 1} $ has a term that is multiple of $ 22. $
We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n},\] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof.
Prove that $F_{n-1}F_{n}F_{n+1}L_{n-1}L_{n}L_{n+1}(n \geq 2)$ is not a perfect square.
Let $a,b,c,d,e,f$ be positive numbers such that $a,b,c,d$ is an arithmetic progression, and $a,e,f,d$ is a geometric progression. Prove that $bc\ge ef$.