Found problems: 1239
Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]
For any sequence ($a_1,a_2,...,a_{2013}$) of integers, we call a triple ($i,j, k$) satisfying $1 \le i < j < k \le 2013$ to be [i]progressive [/i] if $a_k-a_j = a_j -a_i = 1$. Determine the maximum number of progressive triples that a sequence of $2013$ integers could have.
Let be given the sequence $(x_n)$ defined by $x_1 = 1$ and $x_{n+1} = 3x_n + \lfloor x_n \sqrt5 \rfloor$ for all $n = 1,2,3,...,$ where $\lfloor x \rfloor$ denotes the greatest integer that does not exceed $x$. Prove that for any positive integer $n$ we have $$x_nx_{n+2} - x^2_{n+1} = 4^{n-1}$$
Trần Nam Dũng
We consider the sequence $\{u_n\}$ defined by recursion $u_{n+1} =\frac{u_n(u_n + 1)}{n}$ for $n \ge 1$.
(a) Determine the terms of the sequence for $u_1 = 1$.
(b) Show that if a member of the sequence is rational, then all subsequent members are also rational numbers.
(c) Show that for every natural number $K$ there is a $u_1 > 1$ such that the first $K$ terms of the sequence are natural numbers.
For every positive integer \( n \), do there exist pairwise distinct positive integers \( a_1, a_2, \dots, a_n \) that satisfy the following condition?
For every \( 3 \leq m \leq n \), there exists an \( i \leq m-2 \) such that:
$$
a_m = a_{\gcd(m-1, i)} + \gcd(a_{m-1}, a_i).
$$
Proposed by Alireza Jannati
Let $A_o =\{1, 2\}$ and for $n> 0, A_n$ results from $A_{n-1}$ by adding the natural numbers to $A_{n-1}$ which can be represented as the sum of two different numbers from $A_{n-1}$. Let $a_n = |A_n |$ be the number of numbers in $A_n$. Determine $a_n$ as a function of $n$.
Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$,$\ldots$, $a_n$ satisfying: \[a_{k+1}=\frac{a_k^2+1}{a_{k-1}+1}-1\] for every $k$ with $2\leq k\leq n-1$.
[i]Proposed by North Korea[/i]
Let $(x_1,x_2,\ldots)$ be a sequence of positive real numbers satisfying ${\displaystyle \sum_{n=1}^{\infty}\frac{x_n}{2n-1}=1}$. Prove that $$ \displaystyle \sum_{k=1}^{\infty} \sum_{n=1}^{k} \frac{x_n}{k^2} \le2. $$
(Proposed by Gerhard J. Woeginger, The Netherlands)
Let $a_1, a_2, \ldots$ and $b_1, b_2, \ldots$ be sequences such that $a_ib_i - a_i - b_i = 0$ and $a_{i+1} = \frac{2-a_ib_i}{1-b_i}$ for all $i \ge 1$. If $a_1 = 1 + \frac{1}{\sqrt[4]{2}}$, then what is $b_{6}$?
[i]Proposed by Andrew Wu[/i]
Let $a$ be an odd natural number and $b$ be a positive integer. We define a sequence of reals $(u_n)$ as follows: $u_0=b$ and, for all $n\in\mathbb N_0$, $u_{n+1}$ is $\frac{u_n}2$ if $u_n$ is even and $a+u_n$ otherwise.
(a) Prove that one can find an element of $u_n$ smaller than $a$.
(b) Prove that the sequence is eventually periodic.
We define the sequences $a_n =\frac{n (n + 1)}{2}$ and $b_n = a_1 + a_2 +… + a_n$.
Prove that there is no integer $n$ such that $b_n = 2017$.
Determine all increasing sequences $\{a_n\}_{n=1}^\infty$ of natural numbers with the following property: for each two natural numbers $i$ and $j$ (not necessarily different), the numbers $i+j$ and $a_i+a_j$ have an equal number of distinct natural divisors.
A sequence $(a_n)$ is defined by means of the recursion
\[a_1 = 1, a_{n+1} = \frac{1 + 4a_n +\sqrt{1+ 24a_n}}{16}.\]
Find an explicit formula for $a_n.$
Prove or disprove that if a real sequence $(a_n)$ satisfies $a_{n+1}-a_n\to0$ and $a_{2n}-2a_n\to0$ as $n\to\infty$, then $a_n\to0$.
For each $n\in \mathbb{Z}_{>0}$ let $a_n$ be the closest integer to $\sqrt{n}$. Compute the general term of the sequence: $(b_n)_{n\geqslant 1}$ with
\[b_n=\sum_{k=1}^{n^2} a_k.\]
[i]Pall Dalyay[/i]
Let $c$ be a positive integer. The sequence $\{f_n\}$ is defined as follows:
\[f_1 = 1, f_2 = c, f_{n+1} = 2f_n - f_{n-1} + 2 \quad (n \geq 2).\]
Show that for each $k \in \mathbb N$ there exists $r \in \mathbb N$ such that $f_kf_{k+1}= f_r.$
Let $ n \geq 3 $ be an integer and let
\begin{align*}
x_1,x_2, \ldots, x_n
\end{align*}
be $ n $ distinct integers. Prove that
\begin{align*}
(x_1 - x_2)^2 + (x_2 - x_3)^2 + \ldots + (x_n - x_1)^2 \geq 4n - 6.
\end{align*}
Let $(a_n)_{n \geq 0}$ and $(b_n)_{n \geq 0}$ be sequences of real numbers such that $ a_0>\frac{1}{2}$ , $a_{n+1} \geq a_n$ and $b_{n+1}=a_n(b_n+b_{n+2})$ for all non-negative integers $n$ . Show that the sequence $(b_n)_{n \geq 0}$ is bounded .
Let $a_n = 2^{n-1}$ for $n > 0$. Let
\[
b_n = \sum\limits_{r+s \leq n} a_ra_s
\]
Find $b_n-b_{n-1}$, $b_n-2b_{n-1}$ and $b_n$.
Prove that for every positive integer $d > 1$ and $m$ the sequence $a_n=2^{2^n}+d$ contains two terms $a_k$ and $a_l$ ($k \neq l$) such that their greatest common divisor is greater than $m$.
[i]Proposed by T. Hakobyan[/i]
Define the polymonial sequence $\left \{ f_n\left ( x \right ) \right \}_{n\ge 1}$ with $f_1\left ( x \right )=1$, $$f_{2n}\left ( x \right )=xf_n\left ( x \right ), \; f_{2n+1}\left ( x \right ) = f_n\left ( x \right )+ f_{n+1} \left ( x \right ), \; n\ge 1.$$ Look for all the rational number $a$ which is a root of certain $f_n\left ( x \right ).$
Given are positive integers $r$ and $k$ and an infi nite sequence of positive integers $a_1 \le a_2 \le ...$ such that $\frac{r}{a_r}= k + 1$. Prove that there is a $t$ satisfying $\frac{t}{a_t}=k$.
Let be two nonnegative real numbers $ a,b $ with $ b>a, $ and a sequence $ \left( x_n \right)_{n\ge 1} $ of real numbers such that the sequence $ \left( \frac{x_1+x_2+\cdots +x_n}{n^a} \right)_{n\ge 1} $ is bounded.
Show that the sequence $ \left( x_1+\frac{x_2}{2^b} +\frac{x_3}{3^b} +\cdots +\frac{x_n}{n^b} \right)_{n\ge 1} $ is convergent.
Let $x_0=a,x_1=b$ and $x_{n+1}=2x_n-9x_{n-1}$ for each $n\in\mathbb N$, where $a,b$ are integers. Find the necessary and sufficient condition on $a$ and $b$ for the existence of an $x_n$ which is a multiple of $7$.
Let ${a_n}$ be a sequence defined by $a_1=2$, $a_{n+1}=\left[ \frac {3a_n}{2}\right]$ $\forall n \in \mathbb N$
$0.a_1a_2...$ rational or irrational?