Found problems: 5923
Let $a_1, a_2, a_3, \ldots$ be a sequence of reals such that there exists $N\in\mathbb{N}$ so that $a_n=1$ for all $n\geq N$, and for all $n\geq 2$ we have
\[a_{n}\leq a_{n-1}+2^{-n}a_{2n}.\]
Show that $a_k>1-2^{-k}$ for all $k\in\mathbb{N}$.
[i]
Proposed by usjl[/i]
Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.
A sequence of convex polygons $(P_n),n\ge0,$ is defined inductively as follows. $P_0$ is an equilateral triangle with side length $1$. Once $P_n$ has been determined, its sides are trisected; the vertices of $P_{n+1}$ are the interior trisection points of the sides of $P_n$.
Express $\lim_{n\to\infty}[P_n]$ in the form $\frac{\sqrt a}b$, where $a,b$ are integers.
Let $(a_{n})_{n\geq 1}$ be a sequence defined by $a_{n}=2^{n}+49$. Find all values of $n$ such that $a_{n}=pg, a_{n+1}=rs$, where $p,q,r,s$ are prime numbers with $p<q, r<s$ and $q-p=s-r$.
Let $i = \sqrt{-1}$. Define a sequence of complex numbers by $z_{1} = 0, z_{n+1} = z_{n}^{2}+i$ for $n \ge 1$. In the complex plane, how far from the origin is $z_{111}$?
$ \textbf{(A)}\ 1\qquad\textbf{(B)}\ \sqrt{2}\qquad\textbf{(C)}\ \sqrt{3}\qquad\textbf{(D)}\ \sqrt{110}\qquad\textbf{(E)}\ \sqrt{2^{55}} $
Let $a_1, a_2, a_3, \ldots$ a sequence of positive integers that satisfy the following conditions:
$$a_1=1, a_{n+1}=a_n+a_{\lfloor \sqrt{n} \rfloor}, \forall n\ge 1$$
Prove that for every positive integer $k$ there exists a term $a_i$ that is divisible by $k$
Let $a\geq 2$ a fixed natural number, and let $a_{n}$ be the sequence $a_{n}=a^{a^{.^{.^{a}}}}$ (e.g $a_{1}=a$, $a_{2}=a^a$, etc.). Prove that $(a_{n+1}-a_{n})|(a_{n+2}-a_{n+1})$ for every natural number $n$.
Let $x_1,x_2,\dots,x_n$ be a sequence of integers, such that $-1\leq x_i\leq 2$, for $i=1,2,\dots,n$, $x_1+x_2+\dots+x_n = 7$ and $x_1^8+x_2^8+\dots x_n^8 =2009$. Let $m$ and $M$ be the minimal and maximal possible value of $x_1^9+x_2^9+\dots x_n^9$, respectively. Find the $\frac{M}{m}$. Round your answer to nearest integer, if necessary.
Consider an inifinte sequence $x_1, x_2,\dots$ of positive integers such that, for every integer $n\geq 1$:
[list] [*]If $x_n$ is even, $x_{n+1}=\dfrac{x_n}{2}$;
[*]If $x_n$ is odd, $x_{n+1}=\dfrac{x_n-1}{2}+2^{k-1}$, where $2^{k-1}\leq x_n<2^k$.[/list]
Determine the smaller possible value of $x_1$ for which $2020$ is in the sequence.
The sequence $a_i$ is defined as $a_1 = 1$ and
\[a_n = a_{\left\lfloor \dfrac{n}{2} \right\rfloor} + a_{\left\lfloor \dfrac{n}{3} \right\rfloor} + a_{\left\lfloor \dfrac{n}{4} \right\rfloor} + \cdots + a_{\left\lfloor \dfrac{n}{n} \right\rfloor} + 1\]
for every positive integer $n > 1$. Prove that there are infinitely many values of $n$ such that $a_n \equiv n \mod 2012$.
In a triangle, the line between the center of the inscribed circle and the center of gravity is parallel to one of the sides. Prove that the sidelengths form an arithmetic sequence.
Turbo the snail sits on a point on a circle with circumference $1$. Given an infinite sequence of positive real numbers $c_1, c_2, c_3, \dots$, Turbo successively crawls distances $c_1, c_2, c_3, \dots$ around the circle, each time choosing to crawl either clockwise or counterclockwise.
Determine the largest constant $C > 0$ with the following property: for every sequence of positive real numbers $c_1, c_2, c_3, \dots$ with $c_i < C$ for all $i$, Turbo can (after studying the sequence) ensure that there is some point on the circle that it will never visit or crawl across.
In the real axis, there is bug standing at coordinate $x=1$. Each step, from the position $x=a$, the bug can jump to either $x=a+2$ or $x=\frac{a}{2}$. Show that there are precisely $F_{n+4}-(n+4)$ positions (including the initial position) that the bug can jump to by at most $n$ steps.
Recall that $F_n$ is the $n^{th}$ element of the Fibonacci sequence, defined by $F_0=F_1=1$, $F_{n+1}=F_n+F_{n-1}$ for all $n\geq 1$.
Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.
Three numbered tiles are arranged in a tray as shown:
[img]https://cdn.artofproblemsolving.com/attachments/d/0/d449364f92b7fae971fd348a82bafd25aa8ea1.jpg[/img]
Show that we cannot interchange the $1$ and the $3$ by a sequence of moves where we slide a tile to the adjacent vacant space.
In the sequence $ 2001, 2002, 2003, \ldots$, each term after the third is found by subtracting the previous term from the sum of the two terms that precede that term. For example, the fourth term is $ 2001 \plus{} 2002 \minus{} 2003 \equal{} 2000$. What is the $ 2004^\text{th}$ term in this sequence?
$ \textbf{(A)} \minus{} \! 2004 \qquad \textbf{(B)} \minus{} \! 2 \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ 4003 \qquad \textbf{(E)}\ 6007$
Let $x_0, x_1, \ldots$ be a sequence of real numbers such that $x_0=1$ and $x_{n+1}=\sin(x_n)+\frac{\pi} {2}-1$ for all $n \geq 0$. Show that the sequence converges and find its limit.
(a) Prove that for every natural number $k$, there are positive integers $a_1<a_2<\ldots <a_k$ such that $a_i-a_j$ divides $a_i$ for all $1\leq i, j\leq k, i\neq j$.
(b) Show that there is an absolute constant $C>0$ such that $a_1>k^{Ck}$ for every sequence $a_1,\ldots, a_k$ of numbers that satisfy the above divisibility condition.
[A. Balogh, I. Z. Ruzsa]
The sequence of positive integers $a_0, a_1, a_2, \ldots$ is recursively defined such that $a_0$ is not a power of $2$, and for all nonnegative integers $n$:
(i) if $a_n$ is even, then $a_{n+1} $ is the largest odd factor of $a_n$
(ii) if $a_n$ is odd, then $a_{n+1} = a_n + p^2$ where $p$ is the smallest prime factor of $a_n$
Prove that there exists some positive integer $M$ such that $a_{m+2} = a_m $ for all $m \geq M$.
[i]Proposed by Andrew Wen[/i]
Determine the number of sequences of points $(x_1, y_1),(x_2, y_2), \dots ,(x_{4570}, y_{4570})$ on the plane satisfying the following two properties:
$\text{(i)}$ $\{x_1,x_2,\dots,x_{4570}\}=\{1,2,\dots,2014\}$ and $\{y_1,y_2,\dots,y_{4570}\}=\{1,2,\dots,2557\}$
$\text{(ii)} $ For each $i = 1, 2,\dots , 4569$, exactly one of $x_i = x_{i+1}$ and $y_i = y_{i+1}$ holds.
Define the sequences $(a_n),(b_n)$ by
\begin{align*}
& a_n, b_n > 0, \forall n\in\mathbb{N_+} \\
& a_{n+1} = a_n - \frac{1}{1+\sum_{i=1}^n\frac{1}{a_i}} \\
& b_{n+1} = b_n + \frac{1}{1+\sum_{i=1}^n\frac{1}{b_i}}
\end{align*}
1) If $a_{100}b_{100} = a_{101}b_{101}$, find the value of $a_1-b_1$;
2) If $a_{100} = b_{99}$, determine which is larger between $a_{100}+b_{100}$ and $a_{101}+b_{101}$.
A polynomial $p(x)$ with real coefficients is said to be [i]almeriense[/i] if it is of the form:
$$
p(x) = x^3+ax^2+bx+a
$$
And its three roots are positive real numbers in arithmetic progression. Find all [i]almeriense[/i] polynomials such that $p\left(\frac{7}{4}\right) = 0$
The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection.
Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$.
[i]Proposed by Warut Suksompong, Thailand[/i]
For every $ n$ the sum of $ n$ terms of an arithmetic progression is $ 2n \plus{} 3n^2$. The $ r$th term is:
$ \textbf{(A)}\ 3r^2 \qquad \textbf{(B)}\ 3r^2 \plus{} 2r \qquad \textbf{(C)}\ 6r \minus{} 1 \qquad \textbf{(D)}\ 5r \plus{} 5 \qquad \textbf{(E)}\ 6r \plus{} 2 \qquad$
Consider the sequence of rational numbers defined by $x_1=\frac{4}{3}$, and $x_{n+1}=\frac{x_n^2}{x_n^2-x_n+1}$. Show that the nu,erator of the lowest term expression of each sum $x_1+x_2+...+x_k$ is a perfect square.