Find all increasing sequences $a_1,a_2,a_3,...$ of natural numbers such that for each $i,j\in \mathbb N$, number of the divisors of $i+j$ and $a_i+a_j$ is equal. (an increasing sequence is a sequence that if $i\le j$, then $a_i\le a_j$.)

A sequence of polynomial $f_n(x)\ (n=0,1,2,\cdots)$ satisfies $f_0(x)=2,f_1(x)=x$, \[f_n(x)=xf_{n-1}(x)-f_{n-2}(x),\ (n=2,3,4,\cdots)\] Let $x_n\ (n\geqq 2)$ be the maximum real root of the equation $f_n(x)=0\ (|x|\leqq 2)$ Evaluate \[\lim_{n\to\infty} n^2 \int_{x_n}^2 f_n(x)dx\]

Let $ n > 1$ be an integer. Find all sequences $ a_1, a_2, \ldots a_{n^2 \plus{} n}$ satisfying the following conditions: \[ \text{ (a) } a_i \in \left\{0,1\right\} \text{ for all } 1 \leq i \leq n^2 \plus{} n; \] \[ \text{ (b) } a_{i \plus{} 1} \plus{} a_{i \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} n} < a_{i \plus{} n \plus{} 1} \plus{} a_{i \plus{} n \plus{} 2} \plus{} \ldots \plus{} a_{i \plus{} 2n} \text{ for all } 0 \leq i \leq n^2 \minus{} n. \] [i]Author: Dusan Dukic, Serbia[/i]

The first four terms in an arithmetic sequence are $ x \plus{} y$, $ x \minus{} y$, $ xy$, and $ x/y$, in that order. What is the fifth term? $ \textbf{(A)}\ \minus{}\frac{15}{8} \qquad \textbf{(B)}\ \minus{}\frac{6}{5} \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ \frac{27}{20} \qquad \textbf{(E)}\ \frac{123}{40}$

Let $p$ be a prime number, $p \ge 5$, and $k$ be a digit in the $p$-adic representation of positive integers. Find the maximal length of a non constant arithmetic progression whose terms do not contain the digit $k$ in their $p$-adic representation.

Consider a sequence $\{a_n\}_{n\geq 0}$ such that $a_{n+1}=a_n-\lfloor{\sqrt{a_n}}\rfloor\ (n\geq 0),\ a_0\geq 0$. (1) If $a_0=24$, then find the smallest $n$ such that $a_n=0$. (2) If $a_0=m^2\ (m=2,\ 3,\ \cdots)$, then for $j$ with $1\leq j\leq m$, express $a_{2j-1},\ a_{2j}$ in terms of $j,\ m$. (3) Let $m\geq 2$ be integer and for integer $p$ with $1\leq p\leq m-1$, let $a\0=m^2-p$. Find $k$ such that $a_k=(m-p)^2$, then find the smallest $n$ such that $a_n=0$.

Let $n\ge 2$ be an integer. Elwyn is given an $n\times n$ table filled with real numbers (each cell of the table contains exactly one number). We define a [i]rook set[/i] as a set of $n$ cells of the table situated in $n$ distinct rows as well as in n distinct columns. Assume that, for every rook set, the sum of $n$ numbers in the cells forming the set is nonnegative.\\ \\ By a move, Elwyn chooses a row, a column, and a real number $a,$ and then he adds $a$ to each number in the chosen row, and subtracts $a$ from each number in the chosen column (thus, the number at the intersection of the chosen row and column does not change). Prove that Elwyn can perform a sequence of moves so that all numbers in the table become nonnegative.

Let $a_0$ be a positive real number and consider the general term sequence $a_n$ defined by $$a_n =a_{n-1} + \frac{1}{a_{n-1}} \,\,\, n=1,2,3,...$$ Prove that $a_{1998} > 63$.

If $f(x)$ is the generating function of the sequence $a_1,a_2,\ldots$ and if $f(x)=\frac{r(x)}{s(x)}$ holds such that $r(x)$ and $s(x)$ are polynomials show that $a_n$ has a homogenous recurrence.

Show that there exists a sequence $x_1,x_2,...$ of natural numbers in which every natural number occurs exactly once, such that the sums $\sum_{i=1}^n \frac{1}{x_i}$, $n = 1,2,3,...$, include all natural numbers.

Given a real number $a$ and a sequence $(x_n)_{n=1}^\infty$ defined by: $$\left\{\begin{matrix} x_1=1 \\ x_2=0 \\ x_{n+2}=\frac{x_n^2+x_{n+1}^2}{4}+a\end{matrix}\right.$$ for all positive integers $n$. 1. For $a=0$, prove that $(x_n)$ converges. 2. Determine the largest possible value of $a$ such that $(x_n)$ converges.

Consider a regular $n$-gon with $n$ odd. Given two adjacent vertices $A_{1}$ and $A_{2},$ define the sequence $(A_{k})$ of vertices of the $n$-gon as follows: For $k\ge 3,\, A_{k}$ is the vertex lying on the perpendicular bisector of $A_{k-2}A_{k-1}.$ Find all $n$ for which each vertex of the $n$-gon occurs in this sequence.

Given an integer $a>1$. Prove that there exists a sequence of positive integers \[ n_1, n_2, n_3, \ldots \] Such that \[ \gcd(a^{n_i+1} + a^{n_i} - 1, \ a^{n_j + 1} + a^{n_j} - 1) =1 \] For every $i \neq j$.

Consider the set $A = \{0, 1, 2, . . . , 2^{2n} - 1\}$. The function $f : A \rightarrow A$ is given by: $f(x_0 + 2x_1 + 2^2x_2 + ... + 2^{2n-1}x_{2n-1})=$$(1 - x_0) + 2x_1 + 2^2(1 - x_2) + 2^3x_3 + ... + 2^{2n-1}x_{2n-1}$ for every $0-1$ sequence $(x_0, x_1, . . . , x_{2n-1})$. Show that if $a_1, a_2, . . . , a_9$ are consecutive terms of an arithmetic progression, then the sequence $f(a_1), f(a_2), . . . , f(a_9)$ is not increasing.

Let $c_0,\,c_1,\,c_2,\,\ldots$ be a sequence defined so that \[ \frac{1-3x-\sqrt{1-14x+9x^2}}{4}=\sum_{k=0}^\infty c_kx^k \] for sufficiently small $x$. For a positive integer $n$, let $A$ be the $n$-by-$n$ matrix with $i,j$-entry $c_{i+j-1}$ for $i$ and $j$ in $\{1,\,\ldots,\,n\}$. Find the determinant of $A$.