Found problems: 5923
A sequence $ (x_n)$ is given by $ x_1\equal{}2$ and $ nx_n\equal{}2(2n\minus{}1)x_{n\minus{}1}$ for $ n>1$. Prove that $ x_n$ is an integer for every $ n \in \mathbb{N}$.
A real sequence $(a_n)_{n=0}^\infty$ is defined recursively by $a_0 = 2$ and the recursion formula
$$
a_{n} =
\begin{dcases}
a_{n-1}^2 & \text{if $a_{n-1}<\sqrt3$} \\
\frac{a_{n-1}^2}{3} & \text{if $a_{n-1}\geq\sqrt 3$.}
\end{dcases}
$$
Another real sequence $(b_n)_{n=1}^\infty$ is defined in terms of the first by the formula
$$
b_{n} =
\begin{dcases}
0 & \text{if $a_{n-1}<\sqrt3$} \\
\frac{1}{2^{n}} & \text{if $a_{n-1}\geq\sqrt 3$,}
\end{dcases}
$$
valid for each $n\geq 1$. Prove that
$$
b_1 + b_2 + \cdots + b_{2020} < \frac23.
$$
Let $\{a_n\}$, $\{b_n\}$ be sequences of positive real numbers satisfying $$a_n=\sqrt{\frac{1}{100} \sum\limits_{j=1}^{100} b_{n-j}^2}$$ and $$b_n=\sqrt{\frac{1}{100} \sum\limits_{j=1}^{100} a_{n-j}^2}$$
For all $n\ge 101$. Prove that there exists $m\in \mathbb{N}$ such that $|a_m-b_m|<0.001$
[url=https://zhuanlan.zhihu.com/p/417529866] Link [/url]
The bivariate functions $f_0, f_1, f_2, f_3, \dots$ are sequentially defined by the relations $f_0(x,y) = 0$ and $f_{n+1}(x,y) = \bigl|x+|y+f_n(x,y)|\bigr|$ for all integers $n \geq 0$. For independently and randomly selected values $x_0, y_0 \in [-2, 2]$, let $p_n$ be the probability that $f_n(x_0, y_0) < 1$. Let $a,b,c,$ and $d$ be positive integers such that the limit of the sequence $p_1,p_3,p_5,p_7,\dots$ is $\frac{\pi^2+a}{b}$ and the limit of the sequence $p_0,p_2,p_4,p_6,p_8, \dots$ is $\frac{\pi^2+c}{d}$. Compute $1000a+100b+10c+d$.
[i]Proposed by Sean Li[/i]
The Fibonacci sequence is defined by $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for every integer $n$. A sequence $(a_n)$ of integers is said to be $\textit{phirme}$ if there is a fixed integer $k$ such that $a_n + a_{n+1} = F_{n+k}$ for all $n \geq 1$. Show that if $(a_n)$ is a $\textit{phirme}$ sequence, then there exists an integer $c$ such that $$a_n = F_{n+k-2} + (-1)^nc.$$
Let $n\ge 2$ be a natural number. Let $a_1\le a_2\le a_3\le \cdots \le a_n$ be real numbers such that $a_1+a_2+\cdots +a_n>0$ and $n(a_1^2+a_2^2+\cdots +a_n^2)=2(a_1+a_2+\cdots +a_n)^2.$ If $m=\lfloor n/2\rfloor+1$, the smallest integer larger than $n/2$, then show that $a_m>0.$
Let $A\in\mathbb{R}^{n\times n}$ such that $3A^3=A^2+A+I$. Show that the sequence $A^k$ converges to an idempotent matrix. (idempotent: $B^2=B$)
Let $a_1,a_2,a_3,\dots$ be an infinite sequence of non-zero reals satisfying \[a_{i} = \frac{a_{i-1}a_{i-2}-2}{a_{i-3}}\]for all $i\geq 4$. Determine all positive integers $n$ such that if $a_1,a_2,\dots,a_n$ are integers, then all elements of the sequence are integers.
a) For integer $n \ge 3$, suppose that $0 < a_1 < a_2 < ...< a_n$ is a arithmetic sequence and $0 < b_1 < b_2 < ... < b_n$ is a geometric sequence with $a_1 = b_1, a_n = b_n$. Prove that a_k > b_k for all $k = 2,3,..., n -1$.
b) Prove that for every positive integer $n \ge 3$, there exist an integer arithmetic sequence $(a_n)$ and an integer geometric sequence $(b_n)$ such that $0 < b_1 < a_1 < b_2 < a_2 < ... < b_n < a_n$.
Let the sequence ($a_n$) be defined by $a_n = n^6 +5n^4 -12n^2 -36, n \ge 2$.
(a) Prove that any prime number divides some term in this sequence.
(b) Prove that there is a positive integer not dividing any term in the sequence.
(c) Determine the least $n \ge 2$ for which $1989 | a_n$.
A geometric sequence consists of $11$ terms. The arithmetic mean of the first $6$ terms is $63$, and the arithmetic mean of the last $6$ terms is $2016$. Find the $7$th term in the sequence.
[i]Proposed by Powell Zhang[/i]
There is a sequence with $a(2)=0$, $a(3)=1$ and $a(n)=a\left(\left\lfloor\dfrac n2\right\rfloor\right)+a\left(\left\lceil\dfrac n2\right\rceil\right)$ for $n\geq 4$. Find $a(2014)$. [Note that $\left\lfloor\dfrac n2\right\rfloor$ and $\left\lceil\dfrac n2\right\rceil$ denote the floor function (largest integer $\leq\tfrac n2$) and the ceiling function (smallest integer $\geq\tfrac n2$), respectively.]
Let $x_0, x_1, \ldots$ be a sequence of real numbers such that $x_n = \frac{1 + x_{n -1}}{x_{n - 2}}$ for $n \geq 2$.
Find the number of ordered pairs of positive integers $(x_0, x_1)$ such that the sequence gives $x_{2018} = \frac{1}{1000}$.
For each $x>e^e$ define a sequence $S_x=u_0,u_1,\ldots$ recursively as follows: $u_0=e$, and for $n\ge0$, $u_{n+1}=\log_{u_n}x$. Prove that $S_x$ converges to a number $g(x)$ and that the function $g$ defined in this way is continuous for $x>e^e$.
A sequence of integers $a_1,a_2,\ldots $ is such that $a_1=1,a_2=2$ and for $n\ge 1$,
\[a_{n+2}=\left\{\begin{array}{cl}5a_{n+1}-3a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is even},\\ a_{n+1}-a_{n}, &\text{if}\ a_n\cdot a_{n+1}\ \text{is odd},\end{array}\right. \]
Prove that $a_n\not= 0$ for all $n$.
Andrea flips a fair coin repeatedly, continuing until she either flips two heads in a row (the sequence HH) or flips tails followed by heads (the sequence TH). What is the probability that she will stop after flipping HH?
Determine all sequences $(x_1,x_2,\ldots,x_{2011})$ of positive integers, such that for every positive integer $n$ there exists an integer $a$ with \[\sum^{2011}_{j=1} j x^n_j = a^{n+1} + 1\]
[i]Proposed by Warut Suksompong, Thailand[/i]
If $ a$, $ b$, $ c$, and $ d$ are positive real numbers such that $ a$, $ b$, $ c$, $ d$ form an increasing arithmetic sequence and $ a$, $ b$, $ d$ form a geometric sequence, then $ \frac{a}{d}$ is
$ \textbf{(A)}\ \frac{1}{12} \qquad
\textbf{(B)}\ \frac{1}{6} \qquad
\textbf{(C)}\ \frac{1}{4} \qquad
\textbf{(D)}\ \frac{1}{3} \qquad
\textbf{(E)}\ \frac{1}{2}$
$\{a_{n}\}_{n\geq 0}$ and $\{b_{n}\}_{n\geq 0}$ are two sequences of positive integers that $a_{i},b_{i}\in \{0,1,2,\cdots,9\}$. There is an integer number $M$ such that $a_{n},b_{n}\neq 0$ for all $n\geq M$ and for each $n\geq 0$
$$(\overline{a_{n}\cdots a_{1}a_{0}})^{2}+999 \mid(\overline{b_{n}\cdots b_{1}b_{0}})^{2}+999 $$
prove that $a_{n}=b_{n}$ for $n\geq 0$.\\
(Note that $(\overline{x_nx_{n-1}\dots x_0}) = 10^n\times x_n + \dots + 10\times x_1 + x_0$.)
[i]Proposed by Yahya Motevassel[/i]
Show that for any natural number $n$ there exist two prime numbers $p$ and $q, p \neq q$, such that $n$ divides their difference.
Define a sequence of integers $a_0=m, a_1=n$ and $a_{k+1}=4a_k-5a_{k-1}$ for all $k \ge 1$. Suppose $p>5$ is a prime with $p \equiv 1 \pmod{4}$. Prove that it is possible to choose $m,n$ such that $p \nmid a_k$ for any $k \ge 0$.
Given a sequence of eight integers $x_{1},x_{2},...,x_{8}$ in a single operation one replaces these numbers with $|x_{1}-x_{2}|,|x_{2}-x_{3}|,...,|x_{8}-x_{1}|$. Find all the eight-term sequences of integers which reduce to a sequence with all the terms equal after finitely many single operations.
For a positive integer $k\ge 2$ define $\mathcal{T}_k=\{(x,y)\mid x,y=0,1,\ldots, k-1\}$ to be a collection of $k^2$ lattice points on the cartesian coordinate plane. Let $d_1(k)>d_2(k)>\cdots$ be the decreasing sequence of the distinct distances between any two points in $T_k$. Suppose $S_i(k)$ be the number of distances equal to $d_i(k)$.
Prove that for any three positive integers $m>n>i$ we have $S_i(m)=S_i(n)$.
$a_1,a_2,\ldots,a_n$ is a sequence of positive integers that has at least $\frac {2n}{3}+1$ distinct numbers and each positive integer has occurred at most three times in it. Prove that there exists a permutation $b_1,b_2,\ldots,b_n$ of $a_i $'s such that all the $n$ sums $b_i+b_{i+1}$ are distinct ($1\le i\le n $ , $b_{n+1}\equiv b_1 $)
[i]Proposed by Mohsen Jamali[/i]
Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.