The Fibonacci numbers $f_n$ are defined for each natural number $n$ as follows: $f_0=f_1=1$ and for $n$ greater than or equal to $2$, by recurrence: $f_n=f_{n-1}+f_{n-2}$ Let $S=f_1+f_2+...+f_{2004}+f_{2005}$. Calculate the largest value of $N$, such that the Fibonacci number $f_N$ satisfies $f_N<S$

The sequence $(a_n)_{n\in\mathbb{N}}$ is defined by $a_1=3$ and $$a_n=a_1a_2\cdots a_{n-1}-1$$ Show that there exist infinitely many prime number that divide at least one number in this sequences

The sequence $a_1, a_2, a_3,...$ is defined so that $a_1 = 1$ and $a_{n+1} =\frac{a_1 + a_2 + ...+ a_n}{n}+1$ for $n \ge 1$. Show that for every positive real number $b$ we can find $a_k$ so that $a_k < bk$.

Find a sequence of natural numbers $a_i$ such that $a_i = \displaystyle\sum_{r=1}^{i+4} d_r$, where $d_r \neq d_s$ for $r \neq s$ and $d_r$ divides $a_i$.

Let $(a_n)_{n\ge0}$ be a sequence of positive numbers that satisfy the relations $a_{i-1}a_{i+1}\le a_i^2$ for all $i\in\mathbb N$. For any integer $n>1$, prove the inequality $$\frac{a_0+\ldots+a_n}{n+1}\cdot\frac{a_1+\ldots+a_{n-1}}{n-1}\ge\frac{a_0+\ldots+a_{n-1}}n\cdot\frac{a_1+\ldots+a_n}n.$$

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

A deck consists of $2^n$ cards. The deck is shuffled using the following operation: if the cards are initially in the order $a_1,a_2,a_3,a_4,...,a_{2^n-1},a_{2^n}$ then after shuffling the order becomes $a_{2^{n-1}+1},a_1,a_{2^{n-1}+2},a_2,...,a_{2^n},a_{2^{n-1}}$ . Find the smallest number of such operations after which the original order of the cards is restored. (R. Palm)

The sequence $ (x_n)_{n \in \mathbb{N}}$ is defined by $ x_1\equal{}2, x_2\equal{}3,$ and $ x_{2m\plus{}1}\equal{}x_{2m}\plus{}x_{2m\minus{}1}$ for $ m \ge 1;$ $ x_{2m}\equal{}x_{2m\minus{}1}\plus{}2x_{2m\minus{}2}$ for $ m \ge 2.$ Determine $ x_n$ as a function of $ n$.

In an infinite sequence of positive integers every element (starting with the second) is the harmonic mean of its neighbors. Show that all the numbers must be equal.

Consider sequences of positive real numbers of the form $ x,2000,y,...,$ in which every term after the first is 1 less than the product of its two immediate neighbors. For how many different values of $ x$ does the term 2001 appear somewhere in the sequence? $ \textbf{(A)} \ 1 \qquad \textbf{(B)} \ 2 \qquad \textbf{(C)} \ 3 \qquad \textbf{(D)} \ 4 \qquad \textbf{(E)} \ \text{more than 4}$

Let $d_n$ denote the number of derangements of the integers $1, 2, \ldots n$ so that no integer $i$ is in the $i^{th}$ position. It is possible to write a recurrence relation $d_{n}=f(n)d_{n-1}+g(n)d_{n-2}$; what is $f(n)+g(n)$?

Let $n$ be a positive integer. Find the number of sequences $a_0,a_1,a_2,\dots,a_{2n}$ of integers in the range $[0,n]$ such that for all integers $0\leq k\leq n$ and all nonnegative integers $m$, there exists an integer $k\leq i\leq 2k$ such that $\lfloor k/2^m\rfloor=a_i.$ [i]Andrew Carratu[/i]

Let $a$ be a positive integer and let $\{a_n\}$ be defined by $a_0 = 0$ and \[a_{n+1 }= (a_n + 1)a + (a + 1)a_n + 2 \sqrt{a(a + 1)a_n(a_n + 1)} \qquad (n = 1, 2 ,\dots ).\] Show that for each positive integer $n$, $a_n$ is a positive integer.

The increasing sequence $2,3,5,6,7,10,11,\ldots$ consists of all positive integers that are neither the square nor the cube of a positive integer. Find the 500th term of this sequence.

[b]6.[/b] Let $f(x)$ be an arbitrary function, differentiable infinitely many times. Then the $n$th derivative of $f(e^{x})$ has the form $\frac{d^{n}}{dx^{n}}f(e^{x})= \sum_{k=0}^{n} a_{kn}e^{kx}f^{(k)}(e^{x})$ ($n=0,1,2,\dots$). From the coefficients $a_{kn}$ compose the sequence of polynomials $P_{n}(x)= \sum_{k=0}^{n} a_{kn}x^{k}$ ($n=0,1,2,\dots$) and find a closed form for the function $F(t,x) = \sum_{n=0}^{\infty} \frac{P_{n}(x)}{n!}t^{n}.$ [b](S. 22)[/b]

Find, with proof, the smallest real number $C$ with the following property: For every infinite sequence $\{x_i\}$ of positive real numbers such that $x_1 + x_2 +\cdots + x_n \leq x_{n+1}$ for $n = 1, 2, 3, \cdots$, we have \[\sqrt{x_1}+\sqrt{x_2}+\cdots+\sqrt{x_n} \leq C \sqrt{x_1+x_2+\cdots+x_n} \qquad \forall n \in \mathbb N.\]