Found problems: 5923
Define the sequence $ (a_p)_{p\ge0}$ as follows: $ a_p\equal{}\displaystyle\frac{\binom p0}{2\cdot 4}\minus{}\frac{\binom p1}{3\cdot5}\plus{}\frac{\binom p2}{4\cdot6}\minus{}\ldots\plus{}(\minus{}1)^p\cdot\frac{\binom pp}{(p\plus{}2)(p\plus{}4)}$.
Find $ \lim_{n\to\infty}(a_0\plus{}a_1\plus{}\ldots\plus{}a_n)$.
Let $d(k)$ denote the number of natural divisors of a natural number $k$. Prove that for any natural number $n_0$ the sequence $\left\{d(n^2+1)\right\}^\infty_{n=n_0}$ is not strictly monotone.
Let $a_0 = 1$ and define the sequence $\{a_n\}$ by \[a_{n+1} = \frac{\sqrt{3}a_n - 1}{a_n + \sqrt{3}}.\] If $a_{2017}$ can be expressed in the form $a+b\sqrt{c}$ in simplest radical form, compute $a+b+c$.
[i]2016 CCA Math Bonanza Lightning #3.2[/i]
For each integer $n \ge 2$ we consider the last digit different from zero in the decimal expansion of $n!$. The infinite sequence of these digits starts with $2,6,4,2,2$. Determine all digits which occur at least once in this sequence, and show that each of those digits occurs in fact infinitely often.
A sequence $a_1,a_2,\dots$ satisfy
$$
\sum_{i =1}^n a_{\lfloor \frac{n}{i}\rfloor }=n^{10},
$$
for every $n\in\mathbb{N}$.
Let $c$ be a positive integer. Prove that, for every positive integer $n$,
$$
\frac{c^{a_n}-c^{a_{n-1}}}{n}
$$
is an integer.
Let $(F_n)_{n\in{N^*}}$ be the Fibonacci sequence defined by
$F_1=1$, $F_2=1$, $F_{n+1}=F_n+F_{n-1}$ for every $n\geq{2}$. Find
the limit: \[ \lim_{n \to \infty}(\sum_{i=1}^n{\frac{F_i}{2^i}}) \]
Let $v_0 = 0, v_1 = 1$ and $v_{n+1} = 8 \cdot v_n - v_{n-1},$ $n = 1,2, ...$. Prove that in the sequence $\{v_n\}$ there aren't terms of the form $3^{\alpha} \cdot 5^{\beta}$ with $\alpha, \beta \in \mathbb{N}.$
Define the numbers $a_0, a_1, \ldots, a_n$ in the following way:
\[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \]
Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]
Let $x_0, x_1, \dots , x_{n_0-1}$ be integers, and let $d_1, d_2, \dots, d_k$ be positive integers with $n_0 = d_1 > d_2 > \cdots > d_k$ and $\gcd (d_1, d_2, \dots , d_k) = 1$. For every integer $n \ge n_0$, define
\[
x_n = \left\lfloor{\frac{x_{n-d_1} + x_{n-d_2} + \cdots + x_{n-d_k}}{k}}\right\rfloor.
\]
Show that the sequence $\{x_n\}$ is eventually constant.
Prove that for every positive integer $ k$ there exists a sequence of $ k$ consecutive positive integers none of which can be represented as the sum of two squares.
We define a sequence of positive integers $a_1,a_2,a_3,\dots$ as follows: Let $a_1=1$ and iteratively, for $k =2,3,\dots$ let $a_k$ be the largest prime factor of $1+a_1a_2\cdots a_{k-1}$. Show that the number $11$ is not an element of this sequence.
Let $\{a_n \}_{n=0}^{\infty}$ be a sequence given recrusively such that $a_0=1$ and $$a_{n+1}=\frac{7a_n+\sqrt{45a_n^2-36}}{2}$$ for $n\geq 0$
Show that :
a) $a_n$ is a positive integer.
b) $a_n a_{n+1}-1$ is a square of an integer.
[i]Proposed by Stefan Gyurki (Matej Bel University, Banska Bystrica).[/i]
How many sequences of integers $1 \le a_1 \le a_2\le ... \le a_{11 }\le 2015$ that satisfy $a_i \equiv i^2$ (mod $12$) for all $1 \le i \le 11$ are there?
(Le Anh Vinh)
$(x_n)$ is sequence, such that $x_{n+2}=|x_{n+1}|-x_n$. Prove, that it is periodic.
Consider the sequence formed by the first digits of the powers of $5$:$$1,5,2,1,6,...$$ Prove any segment in this sequence, when written in reversed order, will be encountered in the sequence of the first digits of the powers of $2:$
$$1,2,4,8,1,3,6,1...$$
Does there exist a sequence $\{a_n\}$ of positive integers satisfying the following conditions:
$a)$ every natural number occurs in this sequence and exactly once;
$b)$ $a_1 + a_2 +... + a_n$ is divisible by $n^n$ for each $n = 1,2,3, ...$
?
Sequence ${u_n}$ is defined with $u_0=0,u_1=\frac{1}{3}$ and
$$\frac{2}{3}u_n=\frac{1}{2}(u_{n+1}+u_{n-1})$$ $\forall n=1,2,...$
Show that $|u_n|\leq1$ $\forall n\in\mathbb{N}.$
Show that a sequence $(a_n)$ of $+1$ and $-1$ is periodic with period a power of $2$ if and only if $a_n=(-1)^{P(n)}$, where $P$ is an integer-valued polynomial with rational coefficients.
Consider the sequence $u_0, u_1, u_2, ...$ defined by $u_0 = 0, u_1 = 1,$ and $u_n = 6u_{n - 1} + 7u_{n - 2}$ for $n \ge 2$. Show that there are no non-negative integers $a, b, c, n$ such that
$$ab(a + b)(a^2 + ab + b^2) = c^{2022} + 42 = u_n.$$
Given distinct straight lines $ OA$ and $ OB$. From a point in $ OA$ a perpendicular is drawn to $ OB$; from the foot of this perpendicular a line is drawn perpendicular to $ OA$. From the foot of this second perpendicular a line is drawn perpendicular to $ OB$; and so on indefinitely. The lengths of the first and second perpendiculars are $ a$ and $ b$, respectively. Then the sum of the lengths of the perpendiculars approaches a limit as the number of perpendiculars grows beyond all bounds. This limit is:
$ \textbf{(A)}\ \frac {b}{a \minus{} b} \qquad \textbf{(B)}\ \frac {a}{a \minus{} b} \qquad \textbf{(C)}\ \frac {ab}{a \minus{} b} \qquad \textbf{(D)}\ \frac {b^2}{a \minus{} b} \qquad \textbf{(E)}\ \frac {a^2}{a \minus{} b}$
Determine all integers $n\ge 2$ such that for any two infinite sequences of positive integers $a_1<a_2< \cdots $ and $b_1, b_2, \cdots$, such that $a_i\mid a_j$ for all $i<j$, there always exists a real number $c$ such that $$\lfloor{ca_i}\rfloor \equiv b_i \pmod {n}$$ for all $i\ge 1$.
[i]Proposed by Wong Jer Ren & Ivan Chan Kai Chin[/i]
We arranged all the prime numbers in the ascending order: $p_1=2<p_2<p_3<\cdots$.
Also assume that $n_1<n_2<\cdots$ is a sequence of positive integers that for all $i=1,2,3,\cdots$ the equation $x^{n_i} \equiv 2 \pmod {p_i}$ has a solution for $x$.
Is there always a number $x$ that satisfies all the equations?
[i]Proposed by Mahyar Sefidgaran , Yahya Motevasel[/i]
Let $ \xi_1,\xi_2,...$ be independent random variables such that $ E\xi_n=m>0$ and $ \textrm{Var}(\xi_n)=\sigma^2 < \infty \;(n=1,2,...)\ .$ Let $ \{a_n \}$ be a sequence of positive numbers such that $ a_n\rightarrow 0$ and $ \sum_{n=1}^{\infty} a_n= \infty$. Prove that \[ P \left( \lim_{n\rightarrow \infty} %Error. "diaplaymath" is a bad command.
\sum_{k=1}^n a_k \xi_k =\infty \right)=1.\]
[i]P. Revesz[/i]
a) Let $ n_{1},n_{2},\dots$ be a sequence of natural number such that $ n_{i}\geq2$ and $ \epsilon_{1},\epsilon_{2},\dots$ be a sequence such that $ \epsilon_{i}\in\{1,2\}$. Prove that the sequence: \[ \sqrt[n_{1}]{\epsilon_{1}\plus{}\sqrt[n_{2}]{\epsilon_{2}\plus{}\dots\plus{}\sqrt[n_{k}]{\epsilon_{k}}}}\]is convergent and its limit is in $ (1,2]$. Define $ \sqrt[n_{1}]{\epsilon_{1}\plus{}\sqrt[n_{2}]{\epsilon_{2}\plus{}\dots}}$ to be this limit.
b) Prove that for each $ x\in(1,2]$ there exist sequences $ n_{1},n_{2},\dots\in\mathbb N$ and $ n_{i}\geq2$ and $ \epsilon_{1},\epsilon_{2},\dots$, such that $ n_{i}\geq2$ and $ \epsilon_{i}\in\{1,2\}$, and $ x\equal{}\sqrt[n_{1}]{\epsilon_{1}\plus{}\sqrt[n_{2}]{\epsilon_{2}\plus{}\dots}}$
Let $u, v,w$ be real numbers in geometric progression such that $u > v > w$. Suppose $u^{40} = v^n = w^{60}$. Find the value of $n$.