Let $n$ be a positive integer. Let $s: \mathbb N \to \{1, \ldots, n\}$ be a function such that $n$ divides $m-s(m)$ for all positive integers $m$. Let $a_0, a_1, a_2, \ldots$ be a sequence such that $a_0=0$ and \[a_{k}=a_{k-1}+s(k) \text{ for all }k\ge 1.\] Find all $n$ for which this sequence contains all the residues modulo $(n+1)^2$. [i]Proposed by N.V. Tejaswi[/i]

Prove that for each positive integer $ n$ there exist $ n$ consecutive positive integers none of which is an integral power of a prime number.

The sequence $a_1, a_2, \ldots$ is geometric with $a_1=a$ and common ratio $r$, where $a$ and $r$ are positive integers. Given that $\log_8 a_1+\log_8 a_2+\cdots+\log_8 a_{12} = 2006,$ find the number of possible ordered pairs $(a,r)$.

A geometric sequence $ (a_n)$ has $ a_1\equal{}\sin{x}, a_2\equal{}\cos{x},$ and $ a_3\equal{}\tan{x}$ for some real number $ x$. For what value of $ n$ does $ a_n\equal{}1\plus{}\cos{x}$? $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 7 \qquad \textbf{(E)}\ 8$

Find the number of sequences of $2005$ terms with the following properties: (i) No three consecutive terms of the sequence are equal, (ii) Every term equals either $1$ or $-1$, (iii) The sum of all terms of the sequence is at least $666$.

Find all positive real numbers $\lambda$ such that every sequence $a_1, a_2, \ldots$ of positive real numbers satisfying \[ a_{n+1}=\lambda\cdot\frac{a_1+a_2+\ldots+a_n}{n} \] for all $n\geq 2024^{2024}$ is bounded. [i]Remark:[/i] A sequence $a_1,a_2,\ldots$ of positive real numbers is \emph{bounded} if there exists a real number $M$ such that $a_i<M$ for all $i=1,2,\ldots$

Let $ \{a_k\}$ be a sequence of integers such that $ a_1 \equal{} 1$ and $ a_{m \plus{} n} \equal{} a_m \plus{} a_n \plus{} mn$, for all positive integers $ m$ and $ n$. Then $ a_{12}$ is $ \textbf{(A)}\ 45 \qquad \textbf{(B)}\ 56 \qquad \textbf{(C)}\ 67 \qquad \textbf{(D)}\ 78 \qquad \textbf{(E)}\ 89$

Sequence $a_n$ is defined by $a_1=\frac{1}{2}$, $a_m=\frac{a_{m-1}}{2m \cdot a_{m-1} + 1}$ for $m>1$. Determine value of $a_1+a_2+...+a_k$ in terms of $k$, where $k$ is positive integer.

A frog is placed at the origin on a number line, and moves according to the following rule: in a given move, the frog advanced to either the closest integer point with a greater integer coordinate that is a multiple of 3, or to the closest integer point with a greater integer coordinate that is a multiple of 13. A [i]move sequence[/i] is a sequence of coordinates which correspond to valid moves, beginning with 0, and ending with 39. For example, 0, 3, 6, 13, 15, 26, 39 is a move sequence. How many move sequences are possible for the frog?

In the sequence $00, 01, 02, 03,\ldots , 99$ the terms are rearranged so that each term is obtained from the previous one by increasing or decreasing one of its digits by $1$ (for example, $29$ can be followed by $19, 39$, or $28$, but not by $30$ or $20$). What is the maximal number of terms that could remain on their places?

Aaron is trying to write a program to compute the terms of the sequence defined recursively by $a_0=0$, $a_1=1$, and \[a_n=\begin{cases}a_{n-1}-a_{n-2}&n\equiv0\pmod2\\2a_{n-1}-a_{n-2}&\text{else}\end{cases}\] However, Aaron makes a typo, accidentally computing the recurrence by \[a_n=\begin{cases}a_{n-1}-a_{n-2}&n\equiv0\pmod3\\2a_{n-1}-a_{n-2}&\text{else}\end{cases}\] For how many $0\le k\le2016$ did Aaron coincidentally compute the correct value of $a_k$?

Let $(a_n)_1^{\infty}$ be a sequence such that $a_n \le a_{n+m} \le a_n + a_m$ for all positive integers $n$ and $m$. Prove that $\frac{a_n}{n}$ has a limit as $n$ approaches infinity.

[b]p1.[/b] Let $A\% B = BA - B - A + 1$. How many digits are in the number $1\%(3\%(3\%7))$ ? [b]p2. [/b]Three circles, of radii $1, 2$, and $3$ are all externally tangent to each other. A fourth circle is drawn which passes through the centers of those three circles. What is the radius of this larger circle? [b]p3.[/b] Express $\frac13$ in base $2$ as a binary number. (Which, similar to how demical numbers have a decimal point, has a “binary point”.) [b]p4. [/b] Isosceles trapezoid $ABCD$ with $AB$ parallel to $CD$ is constructed such that $DB = DC$. If $AD = 20$, $AB = 14$, and $P$ is the point on $AD$ such that $BP + CP$ is minimized, what is $AP/DP$? [b]p5.[/b] Let $f(x) = \frac{5x-6}{x-2}$ . Define an infinite sequence of numbers $a_0, a_1, a_2,....$ such that $a_{i+1} = f(a_i)$ and $a_i$ is always an integer. What are all the possible values for $a_{2014}$ ? [b]p6.[/b] $MATH$ and $TEAM$ are two parallelograms. If the lengths of $MH$ and $AE$ are $13$ and $15$, and distance from $AM$ to $T$ is $12$, find the perimeter of $AMHE$. [b]p7.[/b] How many integers less than $1000$ are there such that $n^n + n$ is divisible by $5$ ? [b]p8.[/b] $10$ coins with probabilities of $1, 1/2, 1/3 ,..., 1/10$ of coming up heads are flipped. What is the probability that an odd number of them come up heads? [b]p9.[/b] An infinite number of coins with probabilities of $1/4, 1/9, 1/16, ...$ of coming up heads are all flipped. What is the probability that exactly $ 1$ of them comes up heads? [b]p10.[/b] Quadrilateral $ABCD$ has side lengths $AB = 10$, $BC = 11$, and $CD = 13$. Circles $O_1$ and $O_2$ are inscribed in triangles $ABD$ and $BDC$. If they are both tangent to $BD$ at the same point $E$, what is the length of $DA$ ? PS. You had better use hide for answers.

[b]7.[/b] Prove that any real number x satysfying the inequalities $0<x\leq 1$ can be represented in the form $x= \sum_{k=1}^{\infty}\frac{1}{n_k}$ where $(n_k)_{k=1}^{\infty}$ is a sequence of positive integers such that $\frac{n_{k+1}}{n_k}$ assumes, for each $k$, one of the three values $2,3$ or $4$. [b](N. 14)[/b]

Find the smallest integer $k$ for which the conditions $(1)$ $a_1, a_2, a_3, \ldots$ is a nondecreasing sequence of positive integers $(2)$ $a_n=a_{n-1}+a_{n-2}$ for all $n>2$ $(3)$ $a_9=k$ are satisfied by more than one sequence.