Choose terms of the harmonic series so that the sum of the chosen terms be finite. Prove that the sequence of these terms is of density zero in the sequence $ 1,\frac12,\frac13,\dots,\frac1n,\dots$

Let $\{x_n\}$ and $\{y_n\}$ be two sequences of natural numbers defined as follow: $x_1 = 1, \,\,\, x_2 = 1, \,\,\, x_{n+2} = x_{n+1} + 2x_n$ for $n = 1, 2, 3, ...$ $y_1 = 1, \,\,\, y_2 = 7, \,\,\, y_{n+2} = 2y_{n+1} + 3y_n$ for $n = 1, 2, 3, ...$ Prove that, except for the case $x_1 = y_1 = 1$, there is no natural value that occurs in the two sequences.

An arithmetic sequence is a sequence of numbers for which the difference between two consecutive numbers applies terms is constant. So this is an arithmetic sequence with difference $\frac56$: $$\frac13,\frac76, 2,\frac{17}{6},\frac{11}{3},\frac92.$$ The sequence of seven natural numbers $60$, $70$, $84$, $105$, $140$, $210$, $420$ has the property that the sequence inverted numbers (i.e. the row $\frac{1}{60}$, $\frac{1}{70}$, $\frac{1}{84}$, $\frac{1}{105}$, $\frac{1}{140}$, $\frac{1}{210}$,$\frac{1}{420}$ ) is an arithmetic sequence. (a) Is there a sequence of eight different natural numbers whose inverse numbers are one form an arithmetic sequence? (b) Is there an infinite sequence of distinct natural numbers whose inverses are form an arithmetic sequence?

Consider $f (n, m)$ the number of finite sequences of $ 1$'s and $0$'s such that each sequence that starts at $0$, has exactly n $0$'s and $m$ $ 1$'s, and there are not three consecutive $0$'s or three $ 1$'s. Show that if $m, n> 1$, then $$f (n, m) = f (n-1, m-1) + f (n-1, m-2) + f (n-2, m-1) + f (n-2, m-2)$$

The sequence $(a_n)$ is defined with the recursion $a_{n + 1} = 5a^6_n + 3a^3_{n-1} + a^2_{n-2}$ for $n\ge 2$ and the set of initial values $\{a_0, a_1, a_2\} = \{2013, 2014, 2015\}$. (That is, the initial values are these three numbers in any order.) Show that the sequence contains no sixth power of a natural number.

The $n^\text{th}$ term of a sequence is $a_n=(-1)^n(4n+3)$. Compute the sum \[a_1+a_2+a_3+\cdots+a_{2008}.\]

$\{a_n\}$ is a positive integer sequence such that $ a_{i+2} = a_{i+1} + a_{i} (i \ge 1) $. For positive integer $n$, define $\{b_n\}$ as \[ b_n = \frac{1}{a_{2n+1}} \sum_{i=1}^{4n-2} { a_i } \] Prove that $b_n$ is positive integer, and find the general form of $b_n$.

A sequence with first two terms equal $1$ and $24$ respectively is defined by the following rule: each subsequent term is equal to the smallest positive integer which has not yet occurred in the sequence and is not coprime with the previous term. Prove that all positive integers occur in this sequence.

Compute the number of geometric sequences of length $3$ where each number is a positive integer no larger than $10$.

Define the sequence of positive integers $f_n$ by $f_0 = 1, f_1 = 1, f_{n+2} = f_{n+1} + f_n$. Show that $f_n =\frac{ (a^{n+1} - b^{n+1})}{\sqrt5}$, where $a, b$ are real numbers such that $a + b = 1, ab = -1$ and $a > b$.

Let $B$ be a set of $k$ sequences each having $n$ terms equal to $1$ or $-1$. The product of two such sequences $(a_1, a_2, \ldots , a_n)$ and $(b_1, b_2, \ldots , b_n)$ is defined as $(a_1b_1, a_2b_2, \ldots , a_nb_n)$. Prove that there exists a sequence $(c_1, c_2, \ldots , c_n)$ such that the intersection of $B$ and the set containing all sequences from $B$ multiplied by $(c_1, c_2, \ldots , c_n)$ contains at most $\frac{k^2}{2^n}$ sequences.

Let $ a>1$ be a positive integer. Prove that every non-zero positive integer $ N$ has a multiple in the sequence $ (a_n)_{n\ge1}$, $ a_n\equal{}\left\lfloor\frac{a^n}n\right\rfloor$.

For a sequence $u_1,u_2\dots,$ define $\Delta^1(u_n)=u_{n+1}-u_n$ and, for all integer $k>1$, $\Delta^k(u_n)=\Delta^1(\Delta^{k-1}(u_n))$. If $u_n=n^3+n$, then $\Delta^k(u_n)=0$ for all $n$ $\textbf{(A) }\text{if }k=1\qquad$ $\textbf{(B) }\text{if }k=2,\text{ but not if }k=1\qquad$ $\textbf{(C) }\text{if }k=3,\text{ but not if }k=2\qquad$ $\textbf{(D) }\text{if }k=4,\text{ but not if }k=3\qquad$ $\textbf{(E) }\text{for no value of }k$

We’re playing a game with a sequence of $2008$ non-negative integers. A move consists of picking a integer $b$ from that sequence, of which the neighbours $a$ and $c$ are positive. We then replace $a, b$ and $c$ by $a - 1, b + 7$ and $c - 1$ respectively. It is not allowed to pick the first or the last integer in the sequence, since they only have one neighbour. If there is no integer left such that both of its neighbours are positive, then there is no move left, and the game ends. Prove that the game always ends, regardless of the sequence of integers we begin with, and regardless of the moves we make.

Define the sequence $(a_n)_{n\geq 1}$ by $a_1=1$, $a_2=p$ and \[a_{n+1}=pa_n-a_{n-1} \textrm { for all } n>1.\] Prove that for $n>1$ the polynomial $x^n-a_nx+a_{n-1}$ is divisible by $x^2-px+1$. Using this result, solve the equation \[x^4-56x+15=0.\]