Let $t_n=\dfrac{n(n+1)}2$ be the $n$th triangular number. Find \[\dfrac1{t_1}+\dfrac1{t_2}+\dfrac1{t_3}+\cdots+\dfrac1{t_{2002}}.\] $\textbf{(A) }\dfrac{4003}{2003}\qquad\textbf{(B) }\dfrac{2001}{1001}\qquad\textbf{(C) }\dfrac{4004}{2003}\qquad\textbf{(D) }\dfrac{4001}{2001}\qquad\textbf{(E) }2$

The infinite sequence $a_0,a_1,\ldots$ is given by $a_1=\frac12$, $a_{n+1} = \sqrt{\frac{1+a_n}{2}}$. Determine the infinite product $a_1a_2a_3\cdots$.

Each of 2010 boxes in a line contains a single red marble, and for $ 1 \le k \le 2010$, the box in the $ kth$ position also contains $ k$ white marbles. Isabella begins at the first box and successively draws a single marble at random from each box, in order. She stops when she first draws a red marble. Let $ P(n)$ be the probability that Isabella stops after drawing exactly $ n$ marbles. What is the smallest value of $ n$ for which $ P(n) < \frac {1}{2010}$? $ \textbf{(A)}\ 45 \qquad \textbf{(B)}\ 63 \qquad \textbf{(C)}\ 64 \qquad \textbf{(D)}\ 201 \qquad \textbf{(E)}\ 1005$

Let $m_1, m_2, \ldots, m_n$ be a collection of $n$ positive integers, not necessarily distinct. For any sequence of integers $A = (a_1, \ldots, a_n)$ and any permutation $w = w_1, \ldots, w_n$ of $m_1, \ldots, m_n$, define an [i]$A$-inversion[/i] of $w$ to be a pair of entries $w_i, w_j$ with $i < j$ for which one of the following conditions holds: [list] [*]$a_i \ge w_i > w_j$ [*]$w_j > a_i \ge w_i$, or [*]$w_i > w_j > a_i$. [/list] Show that, for any two sequences of integers $A = (a_1, \ldots, a_n)$ and $B = (b_1, \ldots, b_n)$, and for any positive integer $k$, the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $A$-inversions is equal to the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $B$-inversions.

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Let $k \geq 2, 1 < n_1 < n_2 < \ldots < n_k$ are positive integers, $a,b \in \mathbb{Z}^+$ satisfy \[ \prod^k_{i=1} \left( 1 - \frac{1}{n_i} \right) \leq \frac{a}{b} < \prod^{k-1}_{i=1} \left( 1 - \frac{1}{n_i} \right) \] Prove that: \[ \prod^k_{i=1} n_i \geq (4 \cdot a)^{2^k - 1}. \]

Let $ a_1,a_2,\dots$ be sequence of real numbers such that $ a_1\equal{}1$, $ a_2\equal{}\dfrac{4}{3}$, and \[ a_{n\plus{}1}\equal{}\sqrt{1\plus{}a_na_{n\minus{}1}}, \quad \forall n \ge 2.\] Prove that for all $ n \ge 2$, \[ a_n^2>a_{n\minus{}1}^2\plus{}\dfrac{1}{2}\] and \[ 1\plus{}\dfrac{1}{a_1}\plus{}\dfrac{1}{a_2}\plus{}\dots\plus{}\dfrac{1}{a_n}>2a_n.\] [i]Fajar Yuliawan, Bandung[/i]

Let $n$ be a positive integer. Find all real solutions $(a_1, a_2, \dots, a_n)$ to the system: \[a_1^2 + a_1 - 1 = a_2\] \[ a_2^2 + a_2 - 1 = a_3\] \[\hspace*{3.3em} \vdots \] \[a_{n}^2 + a_n - 1 = a_1\]

Suppose two functions $f(x)$ and $g(x)$ are defined for all $x$ with $2<x<4$ and satisfy: $2<f(x)<4,2<g(x)<4,f(g(x))=g(f(x))=x,f(x)\cdot g(x)=x^2$ for all $2<x<4$. Prove that $f(3)=g(3)$.

The expressions $A=1\times2+3\times4+5\times6+\cdots+37\times38+39$ and $B=1+2\times3+4\times5+\cdots+36\times37+38\times39$ are obtained by writing multiplication and addition operators in an alternating pattern between successive integers. Find the positive difference between integers $A$ and $B$.

Let $T_k = \frac{k(k+1)}{2}$ be the $k$-th triangular number. The infinite series $$\sum_{k=4}^{\infty}\frac{1}{(T_{k-1} - 1)(Tk - 1)(T_{k+1} - 1)}$$ has the value $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

The sequence of positive integers $a_0, a_1, a_2, . . .$ is defined by $a_0 = 3$ and $$a_{n+1} - a_n = n(a_n - 1)$$ for all $n \ge 0$. Determine all integers $m \ge 2$ for which $gcd (m, a_n) = 1$ for all $n \ge 0$.

Define the numbers $a_0, a_1, \ldots, a_n$ in the following way: \[ a_0 = \frac{1}{2}, \quad a_{k+1} = a_k + \frac{a^2_k}{n} \quad (n > 1, k = 0,1, \ldots, n-1). \] Prove that \[ 1 - \frac{1}{n} < a_n < 1.\]

Let $a_0>0$ be a real number, and let $$a_n=\frac{a_{n-1}}{\sqrt{1+2020\cdot a_{n-1}^2}}, \quad \textrm{for } n=1,2,\ldots ,2020.$$ Show that $a_{2020}<\frac1{2020}$.

Let $ \left( s_n \right)_{n\ge 1 } $ be a sequence with $ s_1 $ and defined recursively as $ s_{n+1}=s_n^2-s_n+1. $ Prove that any two terms of this sequence are coprime. [i]Dan Nedeianu[/i]