The sequence $\{u_n\}$ is defined by $u_1 = 1, u_2 = 1, u_n = u_{n-1} + 2u_{n-2} for n \geq 3$. Prove that for any positive integers $n, p \ (p > 1), u_{n+p} = u_{n+1}u_{p} + 2u_nu_{p-1}$. Also find the greatest common divisor of $u_n$ and $u_{n+3}.$

The (Fibonacci) sequence $f_n$ is defined by $f_1=f_2=1$ and $f_{n+2}=f_{n+1}+f_n$ for $n\ge1$. Prove that the area of the triangle with the sides $\sqrt{f_{2n+1}},\sqrt{f_{2n+2}},$ and $\sqrt{f_{2n+3}}$ is equal to $\frac12$.

Let $(a_n), (b_n)$, $n = 1,2,...$ be two sequences of integers defined by $a_1 = 1, b_1 = 0$ and for $n \geq 1$ $a_{n+1} = 7a_n + 12b_n + 6$ $b_{n+1} = 4a_n + 7b_n + 3$ Prove that $a_n^2$ is the difference of two consecutive cubes.

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$?

$F_{n}$ denotes the Fibonacci Sequence where $F_{1}=0, F_{2}=1, F_{n}=F_{n-1}+F_{n-2},\ \forall \ n \geq 3$ Find$$\sum\limits_{n=3}^{\infty}\frac{18+999F_n}{F_{n-1}\times F_{n+1}}$$ [list=1] [*] 2016 [*] 2017 [*] 2018 [*] None of these [/list]

Let $p$ be an odd prime. A degree $d$ polynomial $f$ with non-negative integer coefficients less than $p$ is called $p-floppy$ if the coefficients of $f(x)f(-x) - f(x^2)$ are all divisible by $p$ and if exactly $d$ entries in the sequence $(f(0), f(1), f(2), \dots , f(p-1))$ are divisible by $p$. How many non-constant $61$-floppy polynomials are there?

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]

Let $ABC$ be a triangle with medians $m_a$ , $m_b$, $m_c$. Prove that: (a) There is a triangle with side lengths $m_a$ ,$m_b$, $m_c$. (b) This triangle is similar to $ABC$ if and only if the squares of the side lengths of triangle $ABC$ form an arithmetical sequence.

Determine whether there exists an infinite sequence of nonzero digits $a_1 , a_2 , a_3 , \cdots $ and a positive integer $N$ such that for every integer $k > N$, the number $\overline{a_k a_{k-1}\cdots a_1 }$ is a perfect square.

The eyes of a magician are blindfolded while a person $A$ from the audience arranges $n$ identical coins in a row, some are heads and the others are tails. The assistant of the magician asks $A$ to write an integer between $1$ and $n$ inclusive and to show it to the audience. Having seen the number, the assistant chooses a coin and turns it to the other side (so if it was heads it becomes tails and vice versa) and does not touch anything else. Afterwards, the bandages are removed from the magician, he sees the sequence and guesses the written number by $A$. For which $n$ is this possible? [hide=Spoiler hint] The original formulation asks: a) Show that if $n$ is possible, so is $2n$; b) Show that only powers of $2$ are possible; I have omitted this from the above formulation, for the reader's interest. [/hide]

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}.\]

The set $M=\{1,2,\ldots,2007\}$ has the following property: If $n$ is an element of $M$, then all terms in the arithmetic progression with its first term $n$ and common difference $n+1$, are in $M$. Does there exist an integer $m$ such that all integers greater than $m$ are elements of $M$?

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$.