Found problems: 1239
Suppose the numbers $a_0, a_1, a_2, ... , a_n$ satisfy the following conditions:
$a_0 =\frac12$, $a_{k+1} = a_k +\frac{1}{n}a_k^2$ for $k = 0, 1, ... , n - 1$.
Prove that $1 - \frac{1}{n}< a_n < 1$
Let $m$ be a positive integer. Find all bounded sequences of integers $a_1, a_2, a_3,... $for which $a_n + a_{n+1} + a_{n+m }= 0$ for all $n \in N$.
For every positive integer $n$, we define the function $p_n$ for $x\ge 1$ by
$$p_n(x) = \frac12 \left(\left(x+\sqrt{x^2-1}\right)^n+\left(x-\sqrt{x^2-1}\right)^n\right).$$
Prove that $p_n(x) \ge 1$ and that $p_{mn}(x) = p_m(p_n(x))$.
We observe that number $10001=73\cdot137$ is not prime. Show that every member of infinite sequence $10001, 100010001, 1000100010001,...$ is not prime
Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define
$$x_{k+1} = \begin{cases}
x_k + d &\text{if } a \text{ does not divide } x_k \\
x_k/a & \text{if } a \text{ divides } x_k
\end{cases}$$
Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.
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 $ a_0$, $ a_1$, $ a_2$, $ \ldots$ be a sequence of positive integers such that the greatest common divisor of any two consecutive terms is greater than the preceding term; in symbols, $ \gcd (a_i, a_{i \plus{} 1}) > a_{i \minus{} 1}$. Prove that $ a_n\ge 2^n$ for all $ n\ge 0$.
[i]Proposed by Morteza Saghafian, Iran[/i]
Given a positive integer $k$ show that there exists a prime $p$ such that one can choose distinct integers $a_1,a_2\cdots, a_{k+3} \in \{1, 2, \cdots ,p-1\}$ such that p divides $a_ia_{i+1}a_{i+2}a_{i+3}-i$ for all $i= 1, 2, \cdots, k$.
[i]South Africa [/i]
Let $k$ be a positive integer, let $z_1,z_2, \ldots, z_k \in \mathbb{C}$ be distinct and let $u_1,u_2,\ldots,u_k \in \mathbb{C}$ be such that the set $\big\{a_n=u_1z_1^n+u_2z_2^n+\ldots+u_kz_k^n : n \in \mathbb{Z}_{>0} \big\}$ is finite. Prove that there exists a positive integer $p$ such that $a_n=a_{n+p},$ for any positive integer $n.$
The sequence $(a_n)$ of complex numbers is considered in the complex plane, in which is: $$a_0 = 1, \,\,\, a_n = a_{n-1} +\frac{1}{n}(\cos 45^o + i \sin 45^o )^n.$$
Prove that the sequence of the real parts of the terms of $(a_n)$ is convergent and its limit is a number between $0.85$ and $1.15$.
Let $A$ be a set of $2025$ non-negative integers and $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ be a function with the following two properties:
1) For every two distinct positive integers $x,y$ there exists $a\in A$, such that $x-y$ divides $f(x+a) - f(y+a)$.
2) For every positive integer $N$ there exists a positive integer $t$ such that $f(x) \neq f(y)$ whenever $x,y \in [t, t+N]$ are distinct.
Prove that there are infinitely many primes $p$ such that $p$ divides $f(x)$ for some positive integer $x$.
Let $\mathcal{S}$ be a set consisting of $n \ge 3$ positive integers, none of which is a sum of two other distinct members of $\mathcal{S}$. Prove that the elements of $\mathcal{S}$ may be ordered as $a_1, a_2, \dots, a_n$ so that $a_i$ does not divide $a_{i - 1} + a_{i + 1}$ for all $i = 2, 3, \dots, n - 1$.
For each positive integer $n$, put
$$p_n =\left(1+\frac{1}{n}\right)^{n},\; P_n =\left(1+\frac{1}{n}\right)^{n+1}, \; h_n = \frac{2 p_n P_{n}}{ p_n + P_n }.$$
Prove that $h_1 < h_2 < h_3 <\ldots$
Sequence $(G_n)$ is defined by $G_0 = 0, G_1 = 1$ and $G_n = G_{n-1} + G_{n-2} + 1$ for every $n \ge2$. Prove that for every positive integer $m$ there exist two consecutive terms in the sequence that are both divisible by $m$.
Define the sequences $ a_n, b_n, c_n$ as follows. $ a_0 \equal{} k, b_0 \equal{} 4, c_0 \equal{} 1$.
If $ a_n$ is even then $ a_{n \plus{} 1} \equal{} \frac {a_n}{2}$, $ b_{n \plus{} 1} \equal{} 2b_n$, $ c_{n \plus{} 1} \equal{} c_n$.
If $ a_n$ is odd, then $ a_{n \plus{} 1} \equal{} a_n \minus{} \frac {b_n}{2} \minus{} c_n$, $ b_{n \plus{} 1} \equal{} b_n$, $ c_{n \plus{} 1} \equal{} b_n \plus{} c_n$.
Find the number of positive integers $ k < 1995$ such that some $ a_n \equal{} 0$.
Define a sequence $ a_n = n^n + (n - 1)^{n+1}$ when $n$ is a positive integer.
Define all those positive integer $m$ , for which this sequence of numbers is eventually periodic modulo $m$, e.g. there are such positive integers $K$ and $s$ such that $a_k \equiv a_{k+s}$ ($mod \,m$), where $k$ is an integer with $k \ge K$.
Consider the sequence $z_n = (1+i)(2+i)...(n+i)$.
Prove that the sequence $Im$ $z_n$ contains infinitely many positive and infinitely many negative numbers.
Given a sequence $\{x_n\}$, $$x_1 = x_2 = 1, x_{n+2} = x^2_{n+1} - \frac{x_n}{2}$$ Prove that the sequence has limit and find it.
Let $a_1,a_2,\ldots$ be an infinite sequence of real numbers, for which there exists a real number $c$ with $0\leq a_i\leq c$ for all $i$, such that \[\left\lvert a_i-a_j \right\rvert\geq \frac{1}{i+j} \quad \text{for all }i,\ j \text{ with } i \neq j. \] Prove that $c\geq1$.
Let $(a_n)$ be sequnce of positive integers such that first $k$ members $a_1,a_2,...,a_k$ are distinct positive integers, and for each $n>k$, number $a_n$ is the smallest positive integer that can't be represented as a sum of several (possibly one) of the numbers $a_1,a_2,...,a_{n-1}$. Prove that $a_n=2a_{n-1}$ for all sufficently large $n$.
The $n^{th}$ term of a sequence is $t_n$. For $n \ge 1$, $t_n$ is given by the relation:
$$t_n= n^3+\frac12 n^2+ \frac13 n + \frac14$$
The $n^{th}$ term of a second sequence $T_n$, where $T_n$ represents the smallest integer greater than $t_n$. Calculate: $$(T_1+T_2+...+T_{1014}) -(t_1+t_2+...+t_{1014}) $$
a) Prove that in an infinite sequence ${a_k}$ of integers, pairwise distinct and each member greater than $1$, one can find $100$ members for which $a_k > k$.
b) Prove that in an infinite sequence ${a_k}$ of integers, pairwise distinct and each member greater than $1$ there are infinitely many such numbers $a_k$ such that $a_k > k$.
(A Andjans, Riga)
PS. (a) for juniors (b) for seniors
A sequence of real numbers $u_1, u_2, u_3, \dots$ is determined by $u_1$ and the following recurrence relation for $n \geq 1$:
\[4u_{n+1} = \sqrt[3]{ 64u_n + 15.}\]
Describe, with proof, the behavior of $u_n$ as $n \to \infty.$
Let $(a_n)_{n\geq 1}$ be a positive real sequence given by $a_n=\sum \limits_{k=1}^n \frac{1}{k}$. Compute $$\lim \limits_{n \to \infty}e^{-2a_n} \sum \limits_{k=1}^n \left \lfloor \left(\sqrt[2k]{k!}+\sqrt[2(k+1)]{(k+1)!}\right)^2 \right \rfloor$$where we denote by $\lfloor x\rfloor$ the integer part of $x$.
$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]