Found problems: 1239
Do there exist a positive integer $k$ and a non-constant sequence $a_1, a_2, a_3, ...$ of positive integers such that $a_n = gcd(a_{n+k}, a_{n+k+1})$ for all positive integers $n$?
Prove that there are exactly $\binom{k}{[k/2]}$ arrays $a_1, a_2, \ldots , a_{k+1}$ of nonnegative integers such that $a_1 = 0$ and $|a_i-a_{i+1}| = 1$ for $i = 1, 2, \ldots , k.$
Let $m_1<m_2<\cdots<m_s$ be a sequence of $s\ge2$ positive integers, none of which can be written as the sum of (two or more) distinct other numbers in the sequence. For every integer $r$ with $1\le r<s$, prove that
\[ r\cdot m_r+m_s ~\ge~ (r+1)(s-1). \]
(Proposed by Gerhard Woeginger, Austria)
Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.
Let $a_0$ be a fixed positive integer. We define an infinite sequence of positive integers $\{a_n\}_{n\ge 1}$ in an inductive way as follows: if we are given the terms $a_0,a_1,...a_{n-1}$ , then $a_n$ is the smallest positive integer such that $\sqrt[n]{a_0\cdot a_1\cdot ...\cdot a_n}$ is a positive integer. Show that the sequence $\{a_n\}_{n\ge 1}$ is eventually constant.
[b]Note:[/b] The sequence $\{a_n\}_{n\ge 1}$ is eventually constant if there exists a positive integer $k$ such that $a_n=c$, for every $n\ge k$.
For a sequence $ \left( x_n \right)_{n\ge 1} $ of real numbers that are at least $ 1, $ prove that the series $ \sum_{i=1}^{\infty } \frac{1}{x_i} $ converges if and only if the series $ \sum_{i=1}^{\infty } \frac{1}{1+x_i} $ converges if and only if the series $ \sum_{i=1}^{\infty } \frac{1}{\lfloor x_i\rfloor } $ converges.
Define the sequence $a_1, a_2, \ldots$ and $b_1, b_2, \ldots$ as $a_0=1,a_1=4,a_2=49$ and for $n \geq 0$
$$
\begin{cases}
a_{n+1}=7a_n+6b_n-3, \\
b_{n+1}=8a_n+7b_n-4.
\end{cases}
$$
Prove that for any non-negative integer $n,$ $a_n$ is a perfect square.
The sequence $(a_n)$ is defined by $a_1=0$,
$$
a_{n+1}={a_1+a_2+\ldots+a_n\over n}+1.
$$
Prove that $a_{2016}>{1\over 2}+a_{1000}$.
Show that the number
\[p_n=\left(\frac{3+\sqrt5}{2}\right)^n+\left(\frac{3-\sqrt5}{2}\right)^n-2\]
is a positive integer for any positive integer $n.$ Furthermore, show that the numbers $p_{2n-1}$ and $p_{2n}/5$ are perfect squares $($for any positive integer $n).$
Let $x_0,x_1,x_2,\ldots$ be a sequence of rational numbers defined recursively as follows: $x_0$ can be any rational number and, for $n\ge 0$,
\[
x_{n+1}=\begin{cases} \left|\frac{x_n}2-1\right| & \text{if the numerator of }x_n\text{ is even}, \\
\left|\frac1{x_n}-1\right| & \text{if the numerator of }x_n\text{ is odd},\end{cases}
\]
where by numerator of a rational number we mean the numerator of the fraction in its lowest terms. Prove that for any value of $x_0$:
(a) the sequence contains only finitely many distinct terms;
(b) the sequence contains exactly one of the numbers $0$ and $2/3$ (namely, either there exists an index $k$ such that $x_k=0$, or there exists an index $m$ such that $x_m=2/3$, but not both).
Given three infinite arithmetic progressions of natural numbers such that each of the numbers 1,2,3,4,5,6,7 and 8 belongs to at least one of them, prove that the number 1980 also belongs to at least one of them.
If $$\Omega_n=\sum \limits_{k=1}^n \left(\int \limits_{-\frac{1}{k}}^{\frac{1}{k}}(2x^{10} + 3x^8 + 1)\cos^{-1}(kx)dx\right)$$Then find $$\Omega=\lim \limits_{n\to \infty}\left(\Omega_n-\pi H_n\right)$$
Let $\frac{2}{\sqrt5+1}\leq p < 1$, and let the real sequence $\{ a_n \}$ have the following property: for every sequence $\{ e_n \}$ of $0$'s and $\pm 1$'s for which $\sum_{n=1}^\infty e_np^n=0$, we also have $\sum_{n=1}^\infty e_na_n=0$. Prove that there is a number $c$ such that $a_n=cp^n$ for all $n$. [Z. Daroczy, I. Katai]
Define sequence of positive integers $(a_n)$ as $a_1 = a$ and $a_{n+1} = a^2_n + 1$ for $n \ge 1$. Prove that there is no index $n$ for which $$\prod_{k=1}^{n} \left(a^2_k + a_k + 1\right)$$ is a perfect square.
The sequence of positive integers $\{a_n, n\ge 1\}$ is such that $a_n\le a_{n+1}\le a_n+5$ and $a_n$ is divisible by $n$ for all $n \ge 1$. What are the possible values of $a_1$?
Determine all natural numbers $n$ for which there exists a permutation $(a_1,a_2,\ldots,a_n)$ of the numbers $0,1,\ldots,n-1$ such that, if $b_i$ is the remainder of $a_1a_2\cdots a_i$ upon division by $n$ for $i=1,\ldots,n$, then $(b_1,b_2,\ldots,b_n)$ is also a permutation of $0,1,\ldots,n-1$.
Let $(x_n)_{n\geq 1}$ be the sequence defined recursively as such: \[x_1=1, \ x_{n+1}=\frac{x_1}{n+1}+\frac{x_2}{n+2}+\cdots+\frac{x_n}{2n} \ \forall n\geq 1.\]Consider the sequence $(y_n)_{n\geq 1}$ such that $y_n=(x_1^2+x_2^2+\cdots x_n^2)/n$ for all $n\geq 1.$ Prove that
[list=a]
[*]$x_{n+1}^2<y_n/2$ and $y_{n+1}<(2n+1)/(2n+2)\cdot y_n$ for all $n\geq 1;$
[*]$\lim_{n\to\infty}x_n=0.$
[/list]
Define the sequence $x_1,x_2,\dots$ by the initial terms $x_1=2, x_2=4$, and the recurrence relation
\[x_{n+2}=3x_{n+1}-2x_n+\frac{2^n}{x_n} \quad \text{for} \quad n \ge 1.\]
Prove that $\lim_{n \to \infty} \frac{x_n}{2^n}$ exists and satisfies
\[\frac{1+\sqrt{3}}{2} \le \lim_{n \to \infty} \frac{x_n}{2^n} \le \frac{3}{2}.\]
An infinite, strictly increasing sequence $\{a_n\}$ of positive integers satisfies the condition $a_{a_n}\le a_n + a_{n + 3}$ for all $n\ge 1$. Prove that there are infinitely many triples $(k, l, m)$ of positive integers such that $k <l <m$ and $a_k + a_m = 2a_l$.
The finite sequence $a_1, a_2, ... , a_n$ of ones and zeroes should satisfy a condition:
[i]for every $k$ from $0$ to $(n-1)$ the sum a_1a_{k+1} + a_2a_{k+2} + ... + a_{n-k}a_n should be odd.[/i]
a) Construct such a sequence for $n=25$.
b) Prove that there exists such a sequence for some $n > 1000$.
Let $P(x) = x^4-x^3+x$.
a) Prove that for all positive real numbers $a$, the polynomial $P(x) - a$ has a unique positive zero.
b) A sequence $(a_n)$ is defined by $a_1 = \dfrac{1}{3}$ and for all $n \geq 1$, $a_{n+1}$ is the positive zero of the polynomial $P(x) - a_n$. Prove that the sequence $(a_n)$ converges, and find the limit of the sequence.
Let $a_1, \ldots, a_n$ be $n$ positive numbers and $0 < q < 1.$ Determine $n$ positive numbers $b_1, \ldots, b_n$ so that:
[i]a.)[/i] $ a_{k} < b_{k}$ for all $k = 1, \ldots, n,$
[i]b.)[/i] $q < \frac{b_{k+1}}{b_{k}} < \frac{1}{q}$ for all $k = 1, \ldots, n-1,$
[i]c.)[/i] $\sum \limits^n_{k=1} b_k < \frac{1+q}{1-q} \cdot \sum \limits^n_{k=1} a_k.$
Let $B$ be a set of $k$ sequences each having $n$ terms equal to $1$ or $-1$. The product of two such sequences $(a_1, a_2, \ldots , a_n)$ and $(b_1, b_2, \ldots , b_n)$ is defined as $(a_1b_1, a_2b_2, \ldots , a_nb_n)$. Prove that there exists a sequence $(c_1, c_2, \ldots , c_n)$ such that the intersection of $B$ and the set containing all sequences from $B$ multiplied by $(c_1, c_2, \ldots , c_n)$ contains at most $\frac{k^2}{2^n}$ sequences.
Let $a_1,a_2,\cdots, a_{31} ;b_1,b_2, \cdots, b_{31}$ be positive integers such that
$a_1< a_2<\cdots< a_{31}\leq2015$ , $ b_1< b_2<\cdots<b_{31}\leq2015$ and $a_1+a_2+\cdots+a_{31}=b_1+b_2+\cdots+b_{31}.$
Find the maximum value of $S=|a_1-b_1|+|a_2-b_2|+\cdots+|a_{31}-b_{31}|.$
Define a sequence of integers by $a_0=1$ , and $a_n=\sum_{k=0}^{n-1} \binom{n}{k}a_k$ , $n \geq 1$ . Let $m$ be a positive integer , let $p$ be a prime , and let $q$ and $r$ be non-negative integers . Prove that :
$$a_{p^mq+r} \equiv a_{p^{m-1}q+r} \pmod{p^m}$$