Školjka

%V0 Find all positive integers $n$ such that there exists a sequence of positive integers $a_1$, $a_2$, ..., $a_n$ satisfying $$a_{k+1}=\frac{a_k^2+1}{a_{k-1}+1}-1$$ for every $k$ with $2 \leqslant k \leqslant n-1$. Proposed by North Korea

%V0 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 + 1}) > a_{i - 1}$. Prove that $a_n\ge 2^n$ for all $n\ge 0$. Proposed by Morteza Saghafian, Iran

%V0 We define a sequence $\left(a_{1},a_{2},a_{3},...\right)$ by setting $$a_{n} = \frac {1}{n}\left(\left[\frac {n}{1}\right] + \left[\frac {n}{2}\right] + \cdots + \left[\frac {n}{n}\right]\right)$$ for every positive integer $n$. Hereby, for every real $x$, we denote by $\left[x\right]$ the integral part of $x$ (this is the greatest integer which is $\leq x$). a) Prove that there is an infinite number of positive integers $n$ such that $a_{n + 1} > a_{n}$. b) Prove that there is an infinite number of positive integers $n$ such that $a_{n + 1} < a_{n}$.

%V0 Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by $$x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots$$ has all of its terms relatively prime to $m$.

%V0 Define the sequence $a_1, a_2, a_3, ...$ as follows. $a_1$ and $a_2$ are coprime positive integers and $a_{n + 2} = a_{n + 1}a_n + 1$. Show that for every $m > 1$ there is an $n > m$ such that $a_m^m$ divides $a_n^n$. Is it true that $a_1$ must divide $a_n^n$ for some $n > 1$?

%V0 $M$ is a subset of $\{1, 2, 3, \ldots, 15\}$ such that the product of any three distinct elements of $M$ is not a square. Determine the maximum number of elements in $M.$