Let $ p $ and $ q $ be given primes and the sequence $ \{ p_n \}_{n = 1}^{\infty} $ defined recursively as follows: $ p_1 = p $, $ p_2 = q $, and $ p_{n+2} $ is the largest prime divisor of the number $( p_n + p_{n + 1} + 2016) $ for all $ n \geq 1 $. Prove that this sequence is bounded. That is, there exists a positive real number $ M $ such that $ p_n < M $ for all positive integers $ n $.

Let $ \left\{x_n\right\}$, with $ n \equal{} 1, 2, 3, \ldots$, be a sequence defined by $ x_1 \equal{} 603$, $ x_2 \equal{} 102$ and $ x_{n \plus{} 2} \equal{} x_{n \plus{} 1} \plus{} x_n \plus{} 2\sqrt {x_{n \plus{} 1} \cdot x_n \minus{} 2}$ $ \forall n \geq 1$. Show that: [b](1)[/b] The number $ x_n$ is a positive integer for every $ n \geq 1$. [b](2)[/b] There are infinitely many positive integers $ n$ for which the decimal representation of $ x_n$ ends with 2003. [b](3)[/b] There exists no positive integer $ n$ for which the decimal representation of $ x_n$ ends with 2004.

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

The sequence $a_1, a_2, a_3, ...$ is defined by $a_1 = 0$, $a_n = a_{[n/2]} + (-1)^{n(n+1)/2}$. Show that for any positive integer $k$ we can find $n$ in the range $2^k \leq n < 2^{k+1}$ such that $a_n = 0$.

The sequence $(u_n)$ is defined by $u_1 = 1, u_2 = 2$ and $u_{n+1} = 3u_n - u_{n-1}$ for $n \ge 2$. Set $v_n =\sum_{k=1}^n \text{arccot }u_k$. Compute $\lim_{n\to\infty} v_n$.

Let $u_0, u_1, u_2, \ldots$ be integers such that $u_0 = 100$; $u_{k+2} \geqslant 2 + u_k$ for all $k \geqslant 0$; and $u_{\ell+5} \leqslant 5 + u_\ell$ for all $\ell \geqslant 0$. Find all possible values for the integer $u_{2023}$.

Is it possible to choose $1983$ distinct positive integers, all less than or equal to $10^5$, no three of which are consecutive terms of an arithmetic progression?

The cubic equation $x^3+2x-1=0$ has exactly one real root $r$. Note that $0.4<r<0.5$. (a) Find, with proof, an increasing sequence of positive integers $a_1 < a_2 < a_3 < \cdots$


such that \[\frac{1}{2}=r^{a_1}+r^{a_2}+r^{a_3}+\cdots.\] (b) Prove that the sequence that you found in part (a) is the unique increasing sequence with the above property.

Let $p$ be a prime number, and define a sequence by: $x_i=i$ for $i=,0,1,2...,p-1$ and $x_n=x_{n-1}+x_{n-p}$ for $n \geq p$ Find the remainder when $x_{p^3}$ is divided by $p$.

It is possible to place positive integers into the vacant twenty-one squares of the $5 \times 5$ square shown below so that the numbers in each row and column form arithmetic sequences. Find the number that must occupy the vacant square marked by the asterisk (*). [asy] int i; for(i=1; i<5; i=i+1) { draw((0,2*i)--(10,2*i)); draw((2*i,0)--(2*i,10)); } string[] no={"0", "74", "103", "*", "186"}; pair[] yes={(1,1), (3,7), (5,3), (7,9), (9,5)}; for(i=0; i<5; i=i+1) { label(no[i], yes[i]); } draw(origin--(10,0)--(10,10)--(0,10)--cycle, linewidth(2));[/asy]

5. We call $(P_n)_{n\in \mathbb{N}}$ an arithmetic sequence with common difference $Q(x)$ if $\forall n: P_{n+1} = P_n + Q$ $\newline$ We have an arithmetic sequence with a common difference $Q(x)$ and the first term $P(x)$ such that $P,Q$ are monic polynomials with integer coefficients and don't share an integer root. Each term of the sequence has at least one integer root. Prove that: $\newline$ a) $P(x)$ is divisible by $Q(x)$ $\newline$ b) $\text{deg}(\frac{P(x)}{Q(x)}) = 1$

Metadieu, Tercieu and Quartieu are three bodybuilder warriors who fight against an $n$-headed monster. Each of them can attack the monster according to the following rules: (1) Metadieu's attack consists of cutting off half of the monster's heads, then cutting off one more head. If the monster's number of heads is odd, Metadieu cannot attack; (2) Tercieu's attack consists of cutting off a third of the monster's heads, then cutting off two more heads. If the monster's number of heads is not a multiple of 3, Tercieu cannot attack; (3) Quartieu's attack consists of cutting off a quarter of the monster's heads, then cutting off three more heads. If the monster's number of heads is not a multiple of 4, Quartieu cannot attack; If none of the three warriors can attack the monster at some point, then it will devour our three heroes. The objective of the three warriors is to defeat the monster, and for that they need to cut off all its heads, one warrior attacking at a time. For what positive integer values of $n$ is it possible for the three warriors to combine a sequence of attacks in order to defeat the monster?

Is there an infinite sequence of prime numbers $p_1$, $p_2$, $\ldots$, $p_n$, $p_{n+1}$, $\ldots$ such that $|p_{n+1}-2p_n|=1$ for each $n \in \mathbb{N}$?

Prove that there exists an infinite sequence of perfect squares with the following properties: (i) The arithmetic mean of any two consecutive terms is a perfect square, (ii) Every two consecutive terms are coprime, (iii) The sequence is strictly increasing.

Given a succession $C$ of $1001$ positive real numbers (not necessarily distinct), and given a set $K$ of distinct positive integers, the permitted operation is: select a number $k\in{K}$, then select $k$ numbers in $C$, calculate the arithmetic mean of those $k$ numbers, and replace each of those $k$ selected numbers with the mean. If $K$ is a set such that for each $C$ we can reach, by a sequence of permitted operations, a state where all the numbers are equal, determine the smallest possible value of the maximum element of $K$.