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]

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$

If the first term of an infinite geometric series is a positive integer, the common ratio is the reciprocal of a positive integer, and the sum of the series is 3, then the sum of the first two terms of the series is $ \textbf{(A)}\ 1/3 \qquad \textbf{(B)}\ 2/3 \qquad \textbf{(C)}\ 8/3 \qquad \textbf{(D)}\ 2 \qquad \textbf{(E)}\ 9/2$

A geometrical progression consists of $37$ positive integers. The first and the last terms are relatively prime numbers. Prove that the $19^{th}$ term of the progression is the $18^{th}$ power of some positive integer. [i]($3$ points)[/i]

Nathaniel and Obediah play a game in which they take turns rolling a fair six-sided die and keep a running tally of the sum of the results of all rolls made. A player wins if, after he rolls, the number on the running tally is a multiple of 7. Play continues until either player wins, or else indenitely. If Nathaniel goes first, determine the probability that he ends up winning.

Square ABCD has side length 7. Let $A_1$, $B_1$, $C_1$, and $D_1$ be points on rays $\overrightarrow{AB}$, $\overrightarrow{BC}$, $\overrightarrow{CD}$, and $\overrightarrow{DA}$, respectively, where each point is $3$ units from the end of the ray so that $A_1B_1C_1D_1$ forms a second square as shown. SImilarly, let $A_2$, $B_2$, $C_2$, and $D_2$ be points on segments $A_1B_1$, $B_1C_1$, $C_1D_1$, and $D_1A_1$, respectively, forming another square where $A_2$ divides segment $A_1B_1$ into two pieces whose lengths are in the same ratio as $AA_1$ is to $A_1B$. Continue this process to construct square $A_nB_nC_nD_n$ for each positive integer $n$. Find the total of all the perimeters of all the squares. [asy] size(180); pair[] A={(-1,-1),(-1,1),(1,1),(1,-1),(-1,-1)}; string[] X={"A","B","C","D"}; for(int k=0;k<10;++k) { for(int m=0;m<4;++m) { if(k==0) label("$"+X[m]+"$",A[m],A[m]); if(k==1) label("$"+X[m]+"_1$",A[m],A[m]); draw(A[m]--A[m+1]); A[m]+=3/7*(A[m+1]-A[m]); } A[4]=A[0]; }[/asy]

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 $a$ and $b$ be real numbers satisfying $a>b>0$. Evaluate \[\int_0^{2\pi}\dfrac{1}{a+b\cos(\theta)}d\theta.\] Express your answer in terms of $a$ and $b$.

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 $

Evaluate $$ \lim_{x\to \infty} \left( \frac{a^x -1}{x(a-1)} \right)^{1\slash x},$$ where $a>0$ and $a\ne 1.$

Two distinct, real, infinite geometric series each have a sum of $1$ and have the same second term. The third term of one of the series is $1/8,$ and the second term of both series can be written in the form $\frac{\sqrt{m}-n}{p},$ where $m,$ $n,$ and $p$ are positive integers and $m$ is not divisible by the square of any prime. Find $100m+10n+p.$

Let $c_i$ denote the $i$th composite integer so that $\{c_i\}=4,6,8,9,...$ Compute \[\prod_{i=1}^{\infty} \dfrac{c^{2}_{i}}{c_{i}^{2}-1}\] (Hint: $\textstyle\sum^\infty_{n=1} \tfrac{1}{n^2}=\tfrac{\pi^2}{6}$)

The infinite geometric series of positive reals $a_1, a_2, \dots$ satisfies \[ 1 = \sum_{n=1}^\infty a_n = -\frac{1}{2013} + \sum_{n=1}^{\infty} \text{GM}(a_1, a_2, \dots, a_n) = \frac{1}{N} + a_1 \] where $\text{GM}(x_1, x_2, \dots, x_k) = \sqrt[k]{x_1x_2\cdots x_k}$ denotes the geometric mean. Compute $N$. [i]Proposed by Aaron Lin[/i]

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]

If $P$ is the product of $n$ quantities in Geometric Progression, $S$ their sum, and $S'$ the sum of their reciprocals, then $P$ in terms of $S$, $S'$, and $n$ is $\textbf{(A) }(SS')^{\frac{1}{2}n}\qquad\textbf{(B) }(S/S')^{\frac{1}{2}n}\qquad\textbf{(C) }(SS')^{n-2}\qquad\textbf{(D) }(S/S')^n\qquad \textbf{(E) }(S/S')^{\frac{1}{2}(n-1)}$

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