Consider real numbers $A$, $B$, \dots, $Z$ such that \[ EVIL = \frac{5}{31}, \; LOVE = \frac{6}{29}, \text{ and } IMO = \frac{7}{3}. \] If $OMO = \tfrac mn$ for relatively prime positive integers $m$ and $n$, find the value of $m+n$. [i]Proposed by Evan Chen[/i]

For each positive integer $n$, write the sum $\sum_{m=1}^n 1/m$ in the form $p_n/q_n$, where $p_n$ and $q_n$ are relatively prime positive integers. Determine all $n$ such that 5 does not divide $q_n$.

Let $k$ be a fixed integer greater than 1, and let ${m=4k^2-5}$. Show that there exist positive integers $a$ and $b$ such that the sequence $(x_n)$ defined by \[x_0=a,\quad x_1=b,\quad x_{n+2}=x_{n+1}+x_n\quad\text{for}\quad n=0,1,2,\dots,\] has all of its terms relatively prime to $m$. [i]Proposed by Jaroslaw Wroblewski, Poland[/i]

A sequence of integers is defined as follows: $a_1=1,a_2=2,a_3=3$ and for $n>3$, $$a_n=\textsf{The smallest integer not occurring earlier, which is relatively prime to }a_{n-1}\textsf{ but not relatively prime to }a_{n-2}.$$Prove that every natural number occurs exactly once in this sequence. [i]M. Ivanov[/i]

Find all natural numbers $n$, such that there exist relatively prime integers $x$ and $y$ and an integer $k > 1$ satisfying the equation $3^n =x^k + y^k$. [i]A. Kovaldji, V. Senderov[/i]

A [i]triangulation[/i] of a polygon is a subdivision of the polygon into triangles meeting edge to edge, with the property that the set of triangle vertices coincides with the set of vertices of the polygon. Adam randomly selects a triangulation of a regular $180$-gon. Then, Bob selects one of the $178$ triangles in this triangulation. The expected number of $1^\circ$ angles in this triangle can be expressed as $\frac{a}{b}$, where $a$ and $b$ are relatively prime positive integers. Compute $100a + b$. [i]Proposed by Lewis Chen[/i]

Find a pair of relatively prime four digit natural numbers $A$ and $B$ such that for all natural numbers $m$ and $n$, $\vert A^m -B^n \vert \ge 400$.

For each integer $n$ ($n \ge 2$), let $f(n)$ denote the sum of all positive integers that are at most $n$ and not relatively prime to $n$. Prove that $f(n+p) \neq f(n)$ for each such $n$ and every prime $p$.

A paper cup has a base that is a circle with radius $r$, a top that is a circle with radius $2r$, and sides that connect the two circles with straight line segments as shown below. This cup has height $h$ and volume $V$. A second cup that is exactly the same shape as the first is held upright inside the first cup so that its base is a distance of $\tfrac{h}2$ from the base of the first cup. The volume of liquid that will t inside the first cup and outside the second cup can be written $\tfrac{m}{n}\cdot V$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [asy] pair s = (10,1); draw(ellipse((0,0),4,1)^^ellipse((0,-6),2,.5)); fill((3,-6)--(-3,-6)--(0,-2.1)--cycle,white); draw((4,0)--(2,-6)^^(-4,0)--(-2,-6)); draw(shift(s)*ellipse((0,0),4,1)^^shift(s)*ellipse((0,-6),2,.5)); fill(shift(s)*(3,-6)--shift(s)*(-3,-6)--shift(s)*(0,-2.1)--cycle,white); draw(shift(s)*(4,0)--shift(s)*(2,-6)^^shift(s)*(-4,0)--shift(s)*(-2,-6)); pair s = (10,-2); draw(shift(s)*ellipse((0,0),4,1)^^shift(s)*ellipse((0,-6),2,.5)); fill(shift(s)*(3,-6)--shift(s)*(-3,-6)--shift(s)*(0,-4.1)--cycle,white); draw(shift(s)*(4,0)--shift(s)*(2,-6)^^shift(s)*(-4,0)--shift(s)*(-2,-6)); //darn :([/asy]

How many positive integers $n$ are there such that there are exactly $20$ positive odd integers that are less than $n$ and relatively prime with $n$? $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 2 \qquad\textbf{(E)}\ \text{None of above} $

Given three positive integers $a,b,$ and $c$. Their greatest common divisor is $D$; their least common multiple is $m$. Then, which two of the following statements are true? $ \text{(1)}\ \text{the product MD cannot be less than abc} \qquad$ $\text{(2)}\ \text{the product MD cannot be greater than abc}\qquad$ $\text{(3)}\ \text{MD equals abc if and only if a,b,c are each prime}\qquad$ $\text{(4)}\ \text{MD equals abc if and only if a,b,c are each relatively prime in pairs}$ $\text{ (This means: no two have a common factor greater than 1.)}$ $ \textbf{(A)}\ 1,2 \qquad\textbf{(B)}\ 1,3\qquad\textbf{(C)}\ 1,4\qquad\textbf{(D)}\ 2,3\qquad\textbf{(E)}\ 2,4 $

Steve needed to address a letter to $2743$ Becker Road. He remembered the digits of the address, but he forgot the correct order of the digits, so he wrote them down in random order. The probability that Steve got exactly two of the four digits in their correct positions is $\tfrac m n$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

The diagram below shows equilateral $\triangle ABC$ with side length $2$. Point $D$ lies on ray $\overrightarrow{BC}$ so that $CD = 4$. Points $E$ and $F$ lie on $\overline{AB}$ and $\overline{AC}$, respectively, so that $E$, $F$, and $D$ are collinear, and the area of $\triangle AEF$ is half of the area of $\triangle ABC$. Then $\tfrac{AE}{AF}=\tfrac m n$, where $m$ and $n$ are relatively prime positive integers. Find $m + 2n$. [asy] import math; size(7cm); pen dps = fontsize(10); defaultpen(dps); dotfactor=4; pair A,B,C,D,E,F; B=origin; C=(2,0); D=(6,0); A=(1,sqrt(3)); E=(1/3,sqrt(3)/3); F=extension(A,C,E,D); draw(C--A--B--D,linewidth(1.1)); draw(E--D,linewidth(.7)); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); label("$A$",A,N); label("$B$",B,S); label("$C$",C,S); label("$D$",D,S); label("$E$",E,NW); label("$F$",F,NE); [/asy]

Beyond the Point of No Return is a large lake containing 2013 islands arranged at the vertices of a regular $2013$-gon. Adjacent islands are joined with exactly two bridges. Christine starts on one of the islands with the intention of burning all the bridges. Each minute, if the island she is on has at least one bridge still joined to it, she randomly selects one such bridge, crosses it, and immediately burns it. Otherwise, she stops. If the probability Christine burns all the bridges before she stops can be written as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, find the remainder when $m+n$ is divided by $1000$. [i]Evan Chen[/i]

An integer-sided triangle has angles $ p\theta$ and $ q\theta$, where $ p$ and $ q$ are relatively prime integers. Prove that $ \cos\theta$ is irrational.