Let $p_1, p_2, \ldots$ be a sequence of primes such that $p_1 =2$ and for $n\geq 1, p_{n+1}$ is the largest prime factor of $p_1 p_2 \ldots p_n +1$ . Prove that $p_n \not= 5$ for any $n$.

The number $\frac{1}{2}$ is written on a blackboard. For a real number $c$ with $0 < c < 1$, a [i]$c$-splay[/i] is an operation in which every number $x$ on the board is erased and replaced by the two numbers $cx$ and $1-c(1-x)$. A [i]splay-sequence[/i] $C = (c_1,c_2,c_3,c_4)$ is an application of a $c_i$-splay for $i=1,2,3,4$ in that order, and its [i]power[/i] is defined by $P(C) = c_1c_2c_3c_4$. Let $S$ be the set of splay-sequences which yield the numbers $\frac{1}{17}, \frac{2}{17}, \dots, \frac{16}{17}$ on the blackboard in some order. If $\sum_{C \in S} P(C) = \tfrac mn$ for relatively prime positive integers $m$ and $n$, compute $100m+n$. [i]Proposed by Lewis Chen[/i]

Let $a$, $b$, and $c$ be non-zero real number such that $\tfrac{ab}{a+b}=3$, $\tfrac{bc}{b+c}=4$, and $\tfrac{ca}{c+a}=5$. There are relatively prime positive integers $m$ and $n$ so that $\tfrac{abc}{ab+bc+ca}=\tfrac{m}{n}$. Find $m+n$.

Let $ n > 1$ be an integer, and $ n$ can divide $ 2^{\phi(n)} \plus{} 3^{\phi(n)} \plus{} \cdots \plus{} n^{\phi(n)},$ let $ p_{1},p_{2},\cdots,p_{k}$ be all distinct prime divisors of $ n$. Show that $ \frac {1}{p_{1}} \plus{} \frac {1}{p_{2}} \plus{} \cdots \plus{} \frac {1}{p_{k}} \plus{} \frac {1}{p_{1}p_{2}\cdots p_{k}}$ is an integer. ( where $ \phi(n)$ is defined as the number of positive integers $ \leq n$ that are relatively prime to $ n$.)

Let $a$ be a positive integer such that $\gcd(an+1, 2n+1) = 1$ for all integer $n$. a) Prove that $\gcd(a-2, 2n+1) = 1$ for all integer $n$. b) Find all possible $a$.

Let $a$ and $b$ be positive integers with $\gcd(a, b)=1$. Show that every integer greater than $ab-a-b$ can be expressed in the form $ax+by$, where $x, y \in \mathbb{N}_{0}$.

The diagram below shows twelve $30-60-90$ triangles placed in a circle so that the hypotenuse of each triangle coincides with the longer leg of the next triangle. The fourth and last triangle in this diagram are shaded. The ratio of the perimeters of these two triangles can be written as $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [asy] size(200); defaultpen(linewidth(0.8)); pair point=(-sqrt(3),0); pair past,unit; path line; for(int i=0;i<=12;++i) { past = point; line=past--origin; unit=waypoint(line,1/200); point=extension(past,rotate(90,past)*unit,origin,dir(180-30*i)); if (i == 4) { filldraw(origin--past--point--cycle,gray(0.7)); } else if (i==12) { filldraw(origin--past--point--cycle,gray(0.7)); } else { draw(origin--past--point); } } draw(origin--point); [/asy]

Given $a_0 > 1$, the sequence $a_0, a_1, a_2, ...$ is such that for all $k > 0$, $a_k$ is the smallest integer greater than $a_{k-1}$ which is relatively prime to all the earlier terms in the sequence. Find all $a_0$ for which all terms of the sequence are primes or prime powers.

There are $n$ mathematicians seated around a circular table with $n$ seats numbered $1,2,3,\cdots,n$ in clockwise order. After a break they again sit around the table. The mathematicians note that there is a positive integer $a$ such that (1) for each $k$, the mathematician who was seated in seat $k$ before the break is seated in seat $ka$ after the break (where seat $i+n$ is seat $i$); (2) for every pair of mathematicians, the number of mathematicians sitting between them after the break, counting in both the clockwise and the counterclockwise directions, is different from either of the number of mathematicians sitting between them before the break. Find the number of possible values of $n$ with $1<n<1000$.

Let $ABCDE$ be a pentagon inscribed in a circle such that $AB=CD=3$, $BC=DE=10$, and $AE=14$. The sum of the lengths of all diagonals of $ABCDE$ is equal to $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$? $\textbf{(A) }129\qquad \textbf{(B) }247\qquad \textbf{(C) }353\qquad \textbf{(D) }391\qquad \textbf{(E) }421\qquad$

Five men and seven women stand in a line in random order. Let m and n be relatively prime positive integers so that $\tfrac{m}{n}$ is the probability that each man stands next to at least one woman. Find $m + n.$

Determine all positive integers $n \ge 2$ that satisfy the following condition; For all integers $a, b$ relatively prime to $n$, \[a \equiv b \; \pmod{n}\Longleftrightarrow ab \equiv 1 \; \pmod{n}.\]

Find all odd positive integers $ n > 1$ such that if $ a$ and $ b$ are relatively prime divisors of $ n$, then $ a\plus{}b\minus{}1$ divides $ n$.

Let $ k > 1$ be an integer, and consider the infinite array given by the integer lattice in the first quadrant of the plane, filled with real numbers. The array is said to be constant if all its elements are equal in value. The array is said to be $ k$-balanced if it is non-constant, and the sums of the elements of any $ k\times k$ sub-square have a constant value $ v_k$. An array which is both $ p$-balanced and $ q$-balanced will be said to be $ (p, q)$-balanced, or just doubly-balanced, if there is no confusion as to which $ p$ and $ q$ are meant. If $p, q$ are relatively prime, the array is said to be co-prime. We will call $ (M\times N)$-seed a $ M \times N$ array, anchored with its lower left corner in the origin of the plane, which extended through periodicity in both dimensions in the plane results into a $ (p, q)$-balanced array; more precisely, if we denote the numbers in the array by $ a_{ij}$ , where $ i, j$ are the coordinates of the lower left corner of the unit square they lie in, we have, for all non-negative integers $ i, j$ \[ a_{i \plus{} M,j} \equal{} a_{i,j} \equal{} a_{i,j \plus{} N}\] (a) Prove that $ q^2v_p \equal{} p^2v_q$ for a $ (p, q)$-balanced array. (b) Prove that more than two different values are used in a co-prime $ (p,q)$-balanced array. Show that this is no longer true if $ (p, q) > 1$. (c) Prove that any co-prime $ (p, q)$-balanced array originates from a seed. (d) Show there exist $ (p, q)$-balanced arrays (using only three different values) for arbitrary values $ p, q$. (e) Show that neither a $ k$-balanced array, nor a $ (p, q)$-balanced array if $ (p, q) > 1$, need originate from a seed. (f) Determine the minimal possible value $ T$ for a square $ (T\times T)$-seed resulting in a co-prime $ (p, q)$-balanced array, when $p,q$ are both prime. (g) Show that for any relatively prime $ p, q$ there must exist a co-prime $ (p, q)$-balanced array originating from a square $ (T\times T)$-seed, with no lesser $ (M\times N)$-seed available ($ M\leq T, N\leq T$ and $MN< T^2$). [i]Dan Schwarz[/i]

Find all positive integer $ m$ if there exists prime number $ p$ such that $ n^m\minus{}m$ can not be divided by $ p$ for any integer $ n$.

Qing initially writes the ordered pair $(1,0)$ on a blackboard. Each minute, if the pair $(a,b)$ is on the board, she erases it and replaces it with one of the pairs $(2a-b,a)$, $(2a+b+2,a)$ or $(a+2b+2,b)$. Eventually, the board reads $(2014,k)$ for some nonnegative integer $k$. How many possible values of $k$ are there? [i]Proposed by Evan Chen[/i]

The polynomial \[P(x)=(1+x+x^2+\cdots+x^{17})^2-x^{17}\] has 34 complex roots of the form $z_k=r_k[\cos(2\pi a_k)+i\sin(2\pi a_k)], k=1, 2, 3,\ldots, 34$, with $0<a_1\le a_2\le a_3\le\cdots\le a_{34}<1$ and $r_k>0$. Given that $a_1+a_2+a_3+a_4+a_5=m/n$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Does there exist an infinite sequence of positive integers $a_1, a_2, a_3, . . .$ such that $a_m$ and $a_n$ are coprime if and only if $|m - n| = 1$?

On triangle $ABC$ let $D$ be the point on $AB$ so that $CD$ is an altitude of the triangle, and $E$ be the point on $BC$ so that $AE$ bisects angle $BAC.$ Let $G$ be the intersection of $AE$ and $CD,$ and let point $F$ be the intersection of side $AC$ and the ray $BG.$ If $AB$ has length $28,$ $AC$ has length $14,$ and $CD$ has length $10,$ then the length of $CF$ can be written as $\tfrac{k-m\sqrt{p}}{n}$ where $k, m, n,$ and $p$ are positive integers, $k$ and $n$ are relatively prime, and $p$ is not divisible by the square of any prime. Find $k - m + n + p.$

Let $S_n$ be the sum of the reciprocals of the non-zero digits of the integers from 1 to $10^n$ inclusive. Find the smallest positive integer $n$ for which $S_n$ is an integer.

Do there exist any three relatively prime natural numbers so that the square of each of them is divisible by the sum of the two remaining numbers?

Let $k,n\ge 1$ be relatively prime integers. All positive integers not greater than $k+n$ are written in some order on the blackboard. We can swap two numbers that differ by $k$ or $n$ as many times as we want. Prove that it is possible to obtain the order $1,2,\dots,k+n-1, k+n$.

Consider a nonconstant arithmetic progression $a_1, a_2,\cdots, a_n,\cdots$. Suppose there exist relatively prime positive integers $p>1$ and $q>1$ such that $a_1^2, a_{p+1}^2$ and $a_{q+1}^2$ are also the terms of the same arithmetic progression. Prove that the terms of the arithmetic progression are all integers.

Let $m$ and $n$ be natural numbers such that \[A=\frac{(m+3)^{n}+1}{3m}\] is an integer. Prove that $A$ is odd.

The following sequence lists all the positive rational numbers that do not exceed $\frac12$ by first listing the fraction with denominator 2, followed by the one with denominator 3, followed by the two fractions with denominator 4 in increasing order, and so forth so that the sequence is \[ \frac12,\frac13,\frac14,\frac24,\frac15,\frac25,\frac16,\frac26,\frac36,\frac17,\frac27,\frac37,\cdots. \] Let $m$ and $n$ be relatively prime positive integers so that the $2012^{\text{th}}$ fraction in the list is equal to $\frac{m}{n}$. Find $m+n$.