Let $T_1$ be a triangle with sides $2011, 2012,$ and $2013$. For $n \ge 1$, if $T_n=\triangle ABC$ and $D,E,$ and $F$ are the points of tangency of the incircle of $\triangle ABC$ to the sides $AB,BC$ and $AC$, respectively, then $T_{n+1}$ is a triangle with side lengths $AD,BE,$ and $CF$, if it exists. What is the perimeter of the last triangle in the sequence $(T_n)$? $ \textbf{(A)}\ \frac{1509}{8} \qquad \textbf{(B)}\ \frac{1509}{32} \qquad \textbf{(C)}\ \frac{1509}{64} \qquad \textbf{(D)}\ \frac{1509}{128} \qquad \textbf{(E)}\ \frac{1509}{256} $

Let $ a\plus{}ar_1\plus{}ar_1^2\plus{}ar_1^3\plus{}\cdots$ and $ a\plus{}ar_2\plus{}ar_2^2\plus{}ar_2^3\plus{}\cdots$ be two different infinite geometric series of positive numbers with the same first term. The sum of the first series is $ r_1$, and the sum of the second series is $ r_2$. What is $ r_1\plus{}r_2$? $ \textbf{(A)}\ 0\qquad \textbf{(B)}\ \frac{1}{2}\qquad \textbf{(C)}\ 1\qquad \textbf{(D)}\ \frac{1\plus{}\sqrt{5}}{2}\qquad \textbf{(E)}\ 2$

Fix two positive integers $a,k\ge2$, and let $f\in\mathbb{Z}[x]$ be a nonconstant polynomial. Suppose that for all sufficiently large positive integers $n$, there exists a rational number $x$ satisfying $f(x)=f(a^n)^k$. Prove that there exists a polynomial $g\in\mathbb{Q}[x]$ such that $f(g(x))=f(x)^k$ for all real $x$. [i]Victor Wang.[/i]

The number $2.5081081081081 \ldots$ can be written as $m/n$ where $m$ and $n$ are natural numbers with no common factors. Find $m + n$.

Points $B$,$D$ , and $J$ are midpoints of the sides of right triangle $ACG$ . Points $K$, $E$, $I$ are midpoints of the sides of triangle , etc. If the dividing and shading process is done 100 times (the first three are shown) and $ AC=CG=6 $, then the total area of the shaded triangles is nearest [asy] draw((0,0)--(6,0)--(6,6)--cycle); draw((3,0)--(3,3)--(6,3)); draw((4.5,3)--(4.5,4.5)--(6,4.5)); draw((5.25,4.5)--(5.25,5.25)--(6,5.25)); fill((3,0)--(6,0)--(6,3)--cycle,black); fill((4.5,3)--(6,3)--(6,4.5)--cycle,black); fill((5.25,4.5)--(6,4.5)--(6,5.25)--cycle,black); label("$A$",(0,0),SW); label("$B$",(3,0),S); label("$C$",(6,0),SE); label("$D$",(6,3),E); label("$E$",(6,4.5),E); label("$F$",(6,5.25),E); label("$G$",(6,6),NE); label("$H$",(5.25,5.25),NW); label("$I$",(4.5,4.5),NW); label("$J$",(3,3),NW); label("$K$",(4.5,3),S); label("$L$",(5.25,4.5),S);[/asy] $ \text{(A)}\ 6\qquad\text{(B)}\ 7\qquad\text{(C)}\ 8\qquad\text{(D)}\ 9\qquad\text{(E)}\ 10 $

Let $1,2,3,4,5,6,7,8,9,11,12,\cdots$ be the sequence of all positive integers which do not contain the digit zero. Write $\{a_n\}$ for this sequence. By comparing with a geometric series, show that $\sum_{k=1}^n \frac{1}{a_k} < 90$.

Consider infinite sequences $\{x_n\}$ of positive reals such that $x_0=1$ and $x_0\ge x_1\ge x_2\ge\ldots$. [b]a)[/b] Prove that for every such sequence there is an $n\ge1$ such that: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999. \] [b]b)[/b] Find such a sequence such that for all $n$: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4. \]

Let $\sigma(n)$ be the number of positive divisors of $n$, and let $\operatorname{rad} n$ be the product of the distinct prime divisors of $n$. By convention, $\operatorname{rad} 1 = 1$. Find the greatest integer not exceeding \[ 100\left(\sum_{n=1}^{\infty}\frac{\sigma(n)\sigma(n \operatorname{rad} n)}{n^2\sigma(\operatorname{rad} n)}\right)^{\frac{1}{3}}. \][i]Proposed by Michael Kural[/i]

What is the value of the expression \[ \frac {1}{\log_2 100!} \plus{} \frac {1}{\log_3 100!} \plus{} \frac {1}{\log_4 100!} \plus{} \cdots \plus{} \frac {1}{\log_{100} 100!}? \]$ \textbf{(A)}\ 0.01 \qquad \textbf{(B)}\ 0.1 \qquad \textbf{(C)}\ 1 \qquad \textbf{(D)}\ 2 \qquad \textbf{(E)}\ 10$

Consider infinite sequences $\{x_n\}$ of positive reals such that $x_0=1$ and $x_0\ge x_1\ge x_2\ge\ldots$. [b]a)[/b] Prove that for every such sequence there is an $n\ge1$ such that: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}\ge3.999. \] [b]b)[/b] Find such a sequence such that for all $n$: \[ {x_0^2\over x_1}+{x_1^2\over x_2}+\ldots+{x_{n-1}^2\over x_n}<4. \]

Suppose that \[\sum_{i=1}^{982} 7^{i^2}\] can be expressed in the form $983q + r$, where $q$ and $r$ are integers and $0 \leq r \leq 492$. Find $r$. [i]Author: Alex Zhu[/i]

Find the value of $$\sum_{1\le a<b<c} \frac{1}{2^a3^b5^c}$$ (i.e. the sum of $\frac{1}{2^a3^b5^c}$ over all triples of positive integers $(a, b, c)$ satisfying $a<b<c$)

Let $F=.48181\cdots$ be an infinite repeating decimal with the digits $8$ and $1$ repeating. When $F$ is written as a fraction in lowest terms, the denominator exceeds the numerator by $\textbf{(A) }13\qquad\textbf{(B) }14\qquad\textbf{(C) }29\qquad\textbf{(D) }57\qquad \textbf{(E) }126$

If $X=1+x+x^2+x^3+\cdots$ and $Y=1+y+y^2+y^3+\cdots$, what is $1+xy+x^2y^2+x^3y^3+\cdots$ in terms of $X$ and $Y$ only?

Points $A$, $B$, and $O$ lie in the plane such that $\measuredangle AOB = 120^\circ$. Circle $\omega_0$ with radius $6$ is constructed tangent to both $\overrightarrow{OA}$ and $\overrightarrow{OB}$. For all $i \ge 1$, circle $\omega_i$ with radius $r_i$ is constructed such that $r_i < r_{i - 1}$ and $\omega_i$ is tangent to $\overrightarrow{OA}$, $\overrightarrow{OB}$, and $\omega_{i - 1}$. If \[ S = \sum_{i = 1}^\infty r_i, \] then $S$ can be expressed as $a\sqrt{b} + c$, where $a, b, c$ are integers and $b$ is not divisible by the square of any prime. Compute $100a + 10b + c$. [i]Proposed by Aaron Lin[/i]

Prove that the intersection of all maximal left ideals of a ring is a (two-sided) ideal.

For $\pi\leq\theta<2\pi$, let \[ P=\dfrac12\cos\theta-\dfrac14\sin2\theta-\dfrac18\cos3\theta+\dfrac1{16}\sin4\theta+\dfrac1{32}\cos5\theta-\dfrac1{64}\sin6\theta-\dfrac1{128}\cos7\theta+\ldots \] and \[ Q=1-\dfrac12\sin\theta-\dfrac14\cos2\theta+\dfrac1{8}\sin3\theta+\dfrac1{16}\cos4\theta-\dfrac1{32}\sin5\theta-\dfrac1{64}\cos6\theta+\dfrac1{128}\sin7\theta +\ldots \] so that $\tfrac PQ = \tfrac{2\sqrt2}7$. Then $\sin\theta = -\tfrac mn$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $M$ be a matrix with $r$ rows and $c$ columns. Each entry of $M$ is a nonnegative integer. Let $a$ be the average of all $rc$ entries of $M$. If $r > {(10 a + 10)}^c$, prove that $M$ has two identical rows.

In a class, there are $n \geqslant 3$ students and a teacher with $M$ marbles. The teacher then play a [i]Marble distribution[/i] according to the following rules. At the start, the teacher distributed all her marbles to students, so that each student receives at least $1$ marbles from the teacher. Then, the teacher chooses a student , who has never been chosen before, such that the number of marbles that he owns in a multiple of $2(n-1)$. That chosen student then equally distribute half of his marbles to $n-1$ other students. The same goes on until the teacher is not able to choose anymore student. Find all integer $M$, such that for some initial numbers of marbles that the students receive, the teacher can choose all the student(according to the rule above), so that each student receiving equal amount of marbles at the end.

A straight line connects City A at $(0, 0)$ to City B, 300 meters away at $(300, 0)$. At time $t=0$, a bullet train instantaneously sets out from City A to City B while another bullet train simultaneously leaves from City B to City A going on the same train track. Both trains are traveling at a constant speed of $50$ meters/second. Also, at $t=0$, a super y stationed at $(150, 0)$ and restricted to move only on the train tracks travels towards City B. The y always travels at 60 meters/second, and any time it hits a train, it instantaneously reverses its direction and travels at the same speed. At the moment the trains collide, what is the total distance that the y will have traveled? Assume each train is a point and that the trains travel at their same respective velocities before and after collisions with the y

The expression $\sin2^\circ\sin4^\circ\sin6^\circ\cdots\sin90^\circ$ is equal to $p\sqrt{5}/2^{50}$, where $p$ is an integer. Find $p$.

Find $100m+n$ if $m$ and $n$ are relatively prime positive integers such that \[ \sum_{\substack{i,j \ge 0 \\ i+j \text{ odd}}} \frac{1}{2^i3^j} = \frac{m}{n}. \][i]Proposed by Aaron Lin[/i]

Compute \[\sum_{k=1}^{1007}\left(\cos\left(\dfrac{\pi k}{1007}\right)\right)^{2014}.\]

How many of the numbers \[ a_1\cdot 5^1+a_2\cdot 5^2+a_3\cdot 5^3+a_4\cdot 5^4+a_5\cdot 5^5+a_6\cdot 5^6 \] are negative if $a_1,a_2,a_3,a_4,a_5,a_6 \in \{-1,0,1 \}$? $ \textbf{(A)}\ 121 \qquad\textbf{(B)}\ 224 \qquad\textbf{(C)}\ 275 \qquad\textbf{(D)}\ 364 \qquad\textbf{(E)}\ 375 $

Let $T$ be a period of a function $f(x)=|\cos x|\sin x\ (-\infty,\ \infty).$ Find $\lim_{n\to\infty} \int_0^{nT} e^{-x}f(x)\ dx.$