Found problems: 766
Let $m_1,m_2,...,m_{2013} > 1$ be 2013 pairwise relatively prime positive integers and $A_1,A_2,...,A_{2013}$ be 2013 (possibly empty) sets with $A_i\subseteq \{1,2,...,m_i-1\}$ for $i=1,2,...,2013$. Prove that there is a positive integer $N$ such that
\[ N \le \left( 2\left\lvert A_1 \right\rvert + 1 \right)\left( 2\left\lvert A_2 \right\rvert + 1 \right)\cdots\left( 2\left\lvert A_{2013} \right\rvert + 1 \right) \]
and for each $i = 1, 2, ..., 2013$, there does [i]not[/i] exist $a \in A_i$ such that $m_i$ divides $N-a$.
[i]Proposed by Victor Wang[/i]
Let there be a sequence $a_n$ such that $a_1 = 2,a_2 = 0, a_3 = 1, a_4 = 0$, and for $n \ge 1, a_{n+4}$ is the remainder when $a_n + 2a_{n+1} + 3a_{n+2} + 4a_{n+3}$ is divided by $9$. Prove that there are no positive integer $k$ such that $$a_k = 0, a_{k+1} = 1, a_{k+2} = 0,a_{k+3} = 2.$$
Let $ \{a_k\}^{\infty}_1$ be a sequence of non-negative real numbers such that:
\[ a_k \minus{} 2 a_{k \plus{} 1} \plus{} a_{k \plus{} 2} \geq 0
\]
and $ \sum^k_{j \equal{} 1} a_j \leq 1$ for all $ k \equal{} 1,2, \ldots$. Prove that:
\[ 0 \leq a_{k} \minus{} a_{k \plus{} 1} < \frac {2}{k^2}
\]
for all $ k \equal{} 1,2, \ldots$.
Given that a sequence satisfies $x_0=0$ and $|x_k|=|x_{k-1}+3|$ for all integers $k\ge 1,$ find the minimum possible value of $|x_1+x_2+\cdots+x_{2006}|$.
The Fibonacci numbers are defined by $F_1=1,$ $F_2=1,$ and $F_n=F_{n-1}+F_{n-2}$ for $n\geq 3.$ What is $$\dfrac{F_2}{F_1}+\dfrac{F_4}{F_2}+\dfrac{F_6}{F_3}+\cdots+\dfrac{F_{20}}{F_{10}}?$$
$\textbf{(A) }318 \qquad\textbf{(B) }319\qquad\textbf{(C) }320\qquad\textbf{(D) }321\qquad\textbf{(E) }322$
Suppose that $a_0=1$ and that $a_{n+1}=a_n+e^{-a_n}$ for $n=0,1,2,\dots.$ Does $a_n-\log n$ have a finite limit as $n\to\infty?$ (Here $\log n=\log_en=\ln n.$)
Take $r$ such that $1\le r\le n$, and consider all subsets of $r$ elements of the set $\{1,2,\ldots,n\}$. Each subset has a smallest element. Let $F(n,r)$ be the arithmetic mean of these smallest elements. Prove that: \[ F(n,r)={n+1\over r+1}. \]
Find all pair of positive integers $(x, y)$ satisfying the equation
\[x^2 + y^2 - 5 \cdot x \cdot y + 5 = 0.\]
The sequence $\{x_{n}\}$ is defined by \[x_{0}\in [0, 1], \; x_{n+1}=1-\vert 1-2 x_{n}\vert.\] Prove that the sequence is periodic if and only if $x_{0}$ is irrational.
In the sequence $1, 0, 1, 0, 1, 0, 3, 5, \cdots$, each member after the sixth one is equal to the last digit of the sum of the six members just preceeding it. Prove that in this sequence one cannot find the following group of six consecutive members: \[0, 1, 0, 1, 0, 1\]
An integer sequence $\{a_{n}\}_{n \ge 1}$ is defined by \[a_{0}=0, \; a_{1}=1, \; a_{n+2}=2a_{n+1}+a_{n}\] Show that $2^{k}$ divides $a_{n}$ if and only if $2^{k}$ divides $n$.
A needle (a segment) lies on a plane. One can rotate it $45^{\circ}$ round any of its endpoints. Is it possible that after several rotations the needle returns to initial position with the endpoints interchanged?
Sir Alex plays the following game on a row of 9 cells. Initially, all cells are empty. In each move, Sir Alex is allowed to perform exactly one of the following two operations:
[list=1]
[*] Choose any number of the form $2^j$, where $j$ is a non-negative integer, and put it into an empty cell.
[*] Choose two (not necessarily adjacent) cells with the same number in them; denote that number by $2^j$. Replace the number in one of the cells with $2^{j+1}$ and erase the number in the other cell.
[/list]
At the end of the game, one cell contains $2^n$, where $n$ is a given positive integer, while the other cells are empty. Determine the maximum number of moves that Sir Alex could have made, in terms of $n$.
[i]Proposed by Warut Suksompong, Thailand[/i]
Positive numbers $b_1, b_2,..., b_n$ are given so that $b_1 + b_2 + ...+ b_n \le 10$.
Further, $a_1 = b_1$ and $a_m = sa_{m-1} + b_m$ for $m > 1$, where $0 \le s < 1$.
Show that $a^2_1 + a^2_2 + ... + a^2_n \le \frac{100}{1 - s^2} $
We call a set $ A$ a good set if it has the following properties:
1. $ A$ consists circles in plane.
2. No two element of $ A$ intersect.
Let $ A,B$ be two good sets. We say $ A,B$ are equivalent if we can reach from $ A$ to $ B$ by moving circles in $ A$, making them bigger or smaller in such a way that during these operations each circle does not intersect with other circles.
Let $ a_{n}$ be the number of inequivalent good subsets with $ n$ elements. For example $ a_{1}\equal{} 1,a_{2}\equal{} 2,a_{3}\equal{} 4,a_{4}\equal{} 9$.
[img]http://i5.tinypic.com/4r0x81v.png[/img]
If there exist $ a,b$ such that $ Aa^{n}\leq a_{n}\leq Bb^{n}$, we say growth ratio of $ a_{n}$ is larger than $ a$ and is smaller than $ b$.
a) Prove that growth ratio of $ a_{n}$ is larger than 2 and is smaller than 4.
b) Find better bounds for upper and lower growth ratio of $ a_{n}$.
The sequence $(a_n)_{n\geq 1}$ is defined by $a_1=1,a_2=2,a_3=24,$ and, for $n\geq 4,$ \[a_n=\dfrac{6a_{n-1}^2a_{n-3}-8a_{n-1}a_{n-2}^2}{a_{n-2}a_{n-3}}.\] Show that, for all $n$, $a_n$ is an integer multiple of $n$.
Prove that the sum:
\[ S_n=\binom{n}{1}+\binom{n}{3}\cdot 2005+\binom{n}{5}\cdot 2005^2+...=\sum_{k=0}^{\left\lfloor\frac{n-1}{2}\right\rfloor}\binom{n}{2k+1}\cdot 2005^k \]
is divisible by $2^{n-1}$ for any positive integer $n$.
A sequence of integers $(a_n)$ satisfies $a_{n+1} = a_n^3 + 1999$ for $n = 1,2,....$
Prove that there exists at most one $n$ for which $a_n$ is a perfect square.
For an integer $m\geq 4,$ let $T_{m}$ denote the number of sequences $a_{1},\dots,a_{m}$ such that the following conditions hold:
(1) For all $i=1,2,\dots,m$ we have $a_{i}\in \{1,2,3,4\}$
(2) $a_{1} = a_{m} = 1$ and $a_{2}\neq 1$
(3) For all $i=3,4\cdots, m, a_{i}\neq a_{i-1}, a_{i}\neq a_{i-2}.$
Prove that there exists a geometric sequence of positive integers $\{g_{n}\}$ such that for $n\geq 4$ we have that \[ g_{n} - 2\sqrt{g_{n}} < T_{n} < g_{n} + 2\sqrt{g_{n}}.\]
A sequence of real numbers $ a_{0},\ a_{1},\ a_{2},\dots$ is defined by the formula
\[ a_{i \plus{} 1} \equal{} \left\lfloor a_{i}\right\rfloor\cdot \left\langle a_{i}\right\rangle\qquad\text{for}\quad i\geq 0;
\]here $a_0$ is an arbitrary real number, $\lfloor a_i\rfloor$ denotes the greatest integer not exceeding $a_i$, and $\left\langle a_i\right\rangle=a_i-\lfloor a_i\rfloor$. Prove that $a_i=a_{i+2}$ for $i$ sufficiently large.
[i]Proposed by Harmel Nestra, Estionia[/i]
Show that there is a unique sequence of integers $\{a_{n}\}_{n \ge 1}$ with \[a_{1}=1, \; a_{2}=2, \; a_{4}=12, \; a_{n+1}a_{n-1}=a_{n}^{2}\pm1 \;\; (n \ge 2).\]
A sequence of integers $a_0, a_1 …$ is called [i]kawaii[/i] if $a_0 =0, a_1=1,$ and $$(a_{n+2}-3a_{n+1}+2a_n)(a_{n+2}-4a_{n+1}+3a_n)=0$$ for all integers $n \geq 0$. An integer is called [i]kawaii[/i] if it belongs to some kawaii sequence.
Suppose that two consecutive integers $m$ and $m+1$ are both kawaii (not necessarily belonging to the same kawaii sequence). Prove that $m$ is divisible by $3,$ and that $m/3$ is also kawaii.
Let $ \{a_k\}^{\infty}_1$ be a sequence of non-negative real numbers such that:
\[ a_k \minus{} 2 a_{k \plus{} 1} \plus{} a_{k \plus{} 2} \geq 0
\]
and $ \sum^k_{j \equal{} 1} a_j \leq 1$ for all $ k \equal{} 1,2, \ldots$. Prove that:
\[ 0 \leq a_{k} \minus{} a_{k \plus{} 1} < \frac {2}{k^2}
\]
for all $ k \equal{} 1,2, \ldots$.
The sequence of integers $\{ x_{n}\}_{n\ge1}$ is defined as follows: \[x_{1}=1, \;\; x_{n+1}=1+{x_{1}}^{2}+\cdots+{x_{n}}^{2}\;(n=1,2,3 \cdots).\] Prove that there are no squares of natural numbers in this sequence except $x_{1}$.
A sequence of positive integers is constructed as follows. If the last digit of $a_n$ is greater than $5$, then $a_{n+1}$ is $9a_n$. If the last digit of $a_n$ is $5$ or less and an has more than one digit, then $a_{n+1}$ is obtained from $a_n$ by deleting the last digit. If $a_n$ has only one digit, which is $5$ or less, then the sequence terminates. Can we choose the first member of the sequence so that it does not terminate?