The nine horizontal and nine vertical lines on an $8\times8$ checkerboard form $r$ rectangles, of which $s$ are squares. The number $s/r$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Let $S$ be the set of points whose coordinates $x,$ $y,$ and $z$ are integers that satisfy $0\le x\le2,$ $0\le y\le3,$ and $0\le z\le4.$ Two distinct points are randomly chosen from $S.$ The probability that the midpoint of the segment they determine also belongs to $S$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Ralph is standing along a road which heads straight east. If you go nine miles east, make a left turn, and travel seven miles north, you will find Pamela with her mountain bike. At exactly the same time that Ralph begins running eastward along the road at 6 miles per hour, Pamela begins biking in a straight line at 10 miles per hour. Pamela’s direction is chosen so that she will reach a point on the road where Ralph is running at exactly the same time Ralph reaches that same point. Let $M$ and $N$ be relatively prime positive integers such that $\frac{M}{N}$ is the number of hours that it takes Pamela and Ralph to meet. Find $M+N$.

For all positive integers $n$, prove that there are integers $x, y$ relatively prime to $5$ such that $x^2 + y^2 = 5^n$.

a) Show that the set $ \mathbb{Q}^{ + }$ of all positive rationals can be partitioned into three disjoint subsets. $ A,B,C$ satisfying the following conditions: \[ BA = B; \& B^2 = C; \& BC = A; \] where $ HK$ stands for the set $ \{hk: h \in H, k \in K\}$ for any two subsets $ H, K$ of $ \mathbb{Q}^{ + }$ and $ H^2$ stands for $ HH.$ b) Show that all positive rational cubes are in $ A$ for such a partition of $ \mathbb{Q}^{ + }.$ c) Find such a partition $ \mathbb{Q}^{ + } = A \cup B \cup C$ with the property that for no positive integer $ n \leq 34,$ both $ n$ and $ n + 1$ are in $ A,$ that is, \[ \text{min} \{n \in \mathbb{N}: n \in A, n + 1 \in A \} > 34. \]

Suppose that $m$ and $n$ are relatively prime positive integers with $A = \tfrac mn$, where \[ A = \frac{2+4+6+\dots+2014}{1+3+5+\dots+2013} - \frac{1+3+5+\dots+2013}{2+4+6+\dots+2014}. \] Find $m$. In other words, find the numerator of $A$ when $A$ is written as a fraction in simplest form. [i]Proposed by Evan Chen[/i]

Let $n$ be an integer of the form $a^2 + b^2$, where $a$ and $b$ are relatively prime integers and such that if $p$ is a prime, $p \leq \sqrt{n}$, then $p$ divides $ab$. Determine all such $n$.

Let $x_1,x_2,\dots ,x_6$ be nonnegative real numbers such that $x_1+x_2+x_3+x_4+x_5+x_6=1$, and $x_1x_3x_5+x_2x_4x_6 \geq \frac{1}{540}$. Let $p$ and $q$ be positive relatively prime integers such that $\frac{p}{q}$ is the maximum possible value of $x_1x_2x_3+x_2x_3x_4 + x_3x_4x_5 + x_4x_5x_6 + x_5x_6x_1 + x_6x_1x_2$. Find $p+q$.

For positive integers $n$, let $s(n)$ denote the sum of the squares of the positive integers less than or equal to $n$ that are relatively prime to $n$. Find the greatest integer less than or equal to \[ \sum_{n\mid 2013} \frac{s(n)}{n^2}, \] where the summation runs over all positive integers $n$ dividing $2013$. [i]Ray Li[/i]

For a real number $x$, let $\lfloor x\rfloor$ stand for the largest integer that is less than or equal to $x$. Prove that \[ \left\lfloor{(n-1)!\over n(n+1)}\right\rfloor \] is even for every positive integer $n$.

Find all $a,b,c \in \mathbb{N}$ such that \[a^2b|a^3+b^3+c^3,\qquad b^2c|a^3+b^3+c^3, \qquad c^2a|a^3+b^3+c^3.\] [PS: The original problem was this: Find all $a,b,c \in \mathbb{N}$ such that \[a^2b|a^3+b^3+c^3,\qquad b^2c|a^3+b^3+c^3, \qquad \color{red}{c^2b}|a^3+b^3+c^3.\] But I think the author meant $c^2a|a^3+b^3+c^3$, just because of symmetry]

Let an even positive integer $2k$ be given. Find such relatively prime positive integers $x, y$ that maximize the product $xy$.

The two squares shown share the same center $O$ and have sides of length 1. The length of $\overline{AB}$ is $43/99$ and the area of octagon $ABCDEFGH$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ [asy] real alpha = 25; pair W=dir(225), X=dir(315), Y=dir(45), Z=dir(135), O=origin; pair w=dir(alpha)*W, x=dir(alpha)*X, y=dir(alpha)*Y, z=dir(alpha)*Z; draw(W--X--Y--Z--cycle^^w--x--y--z--cycle); pair A=intersectionpoint(Y--Z, y--z), C=intersectionpoint(Y--X, y--x), E=intersectionpoint(W--X, w--x), G=intersectionpoint(W--Z, w--z), B=intersectionpoint(Y--Z, y--x), D=intersectionpoint(Y--X, w--x), F=intersectionpoint(W--X, w--z), H=intersectionpoint(W--Z, y--z); dot(O); label("$O$", O, SE); label("$A$", A, dir(O--A)); label("$B$", B, dir(O--B)); label("$C$", C, dir(O--C)); label("$D$", D, dir(O--D)); label("$E$", E, dir(O--E)); label("$F$", F, dir(O--F)); label("$G$", G, dir(O--G)); label("$H$", H, dir(O--H));[/asy]

There are relatively prime positive integers $p$ and $q$ such that $\dfrac{p}{q}=\displaystyle\sum_{n=3}^{\infty} \dfrac{1}{n^5-5n^3+4n}$. Find $p+q$.

A sequence of numbers $x_{1},x_{2},x_{3},\ldots,x_{100}$ has the property that, for every integer $k$ between $1$ and $100,$ inclusive, the number $x_{k}$ is $k$ less than the sum of the other $99$ numbers. Given that $x_{50}=m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$

Let $m_1,m_2,...,m_{2013} > 1$ be 2013 pairwise relatively prime positive integers and $A_1,A_2,...,A_{2013}$ be 2013 (possibly empty) sets with $A_i\subseteq \{1,2,...,m_i-1\}$ for $i=1,2,...,2013$. Prove that there is a positive integer $N$ such that \[ N \le \left( 2\left\lvert A_1 \right\rvert + 1 \right)\left( 2\left\lvert A_2 \right\rvert + 1 \right)\cdots\left( 2\left\lvert A_{2013} \right\rvert + 1 \right) \] and for each $i = 1, 2, ..., 2013$, there does [i]not[/i] exist $a \in A_i$ such that $m_i$ divides $N-a$. [i]Proposed by Victor Wang[/i]

Show that there are infintely many pairs $(a,b)$ of relatively prime integers (not necessarily positive) such that both the equations \begin{eqnarray*} x^2 +ax +b &=& 0 \\ x^2 + 2ax + b &=& 0 \\ \end{eqnarray*} have integer roots.

For each positive integer $n$, let $\tau\left(n\right)$ be the number of positive divisors of $n$. It is well-known that if $a$ and $b$ are relatively prime positive integers then $\tau\left(ab\right)=\tau\left(a\right)\tau\left(b\right)$. Does the converse hold? That is, if $a$ and $b$ are positive integers such that $\tau\left(ab\right)=\tau\left(a\right)\tau\left(b\right)$, then is it necessarily true that $a$ and $b$ are relatively prime? Either give a proof, or find a counter-example.

A triangular array of numbers has a first row consisting of the odd integers $ 1,3,5,\ldots,99$ in increasing order. Each row below the first has one fewer entry than the row above it, and the bottom row has a single entry. Each entry in any row after the top row equals the sum of the two entries diagonally above it in the row immediately above it. How many entries in the array are multiples of $ 67$? [asy]size(200); defaultpen(fontsize(10)); label("1", origin); label("3", (2,0)); label("5", (4,0)); label("$\cdots$", (6,0)); label("97", (8,0)); label("99", (10,0)); label("4", (1,-1)); label("8", (3,-1)); label("12", (5,-1)); label("196", (9,-1)); label(rotate(90)*"$\cdots$", (6,-2));[/asy]

Each of $27$ bricks (right rectangular prisms) has dimensions $a \times b \times c$, where $a$, $b$, and $c$ are pairwise relatively prime positive integers. These bricks are arranged to form a $3 \times 3 \times 3$ block, as shown on the left below. A $28$[sup]th[/sup] brick with the same dimensions is introduced, and these bricks are reconfigured into a $2 \times 2 \times 7$ block, shown on the right. The new block is $1$ unit taller, $1$ unit wider, and $1$ unit deeper than the old one. What is $a + b + c$? [img]https://cdn.artofproblemsolving.com/attachments/2/d/b18d3d0a9e5005c889b34e79c6dab3aaefeffd.png[/img] $ \textbf{(A) }88 \qquad \textbf{(B) }89 \qquad \textbf{(C) }90 \qquad \textbf{(D) }91 \qquad \textbf{(E) }92 \qquad $

Let $p>2$ be a prime number and $n$ a positive integer. Prove that $pn^2$ has at most one positive divisor $d$ for which $n^2+d$ is a square number.

Let $\, a,b \,$ be odd positive integers. Define the sequence $\, (f_n ) \,$ by putting $\, f_1 = a,$ $f_2 = b, \,$ and by letting $\, f_n \,$ for $\, n \geq 3 \,$ be the greatest odd divisor of $\, f_{n-1} + f_{n-2}$. Show that $\, f_n \,$ is constant for $\, n \,$ sufficiently large and determine the eventual value as a function of $\, a \,$ and $\, b$.

Prove that the set of all the points with both coordinates begin rational numbers can be written as a reunion of two disjoint sets $ A$ and $ B$ such that any line that that is parallel with $ Ox$, and respectively $ Oy$ intersects $ A$, and respectively $ B$ in a finite number of points.

You drop a 7 cm long piece of mechanical pencil lead on the floor. A bully takes the lead and breaks it at a random point into two pieces. A piece of lead is unusable if it is 2 cm or shorter. If the expected value of the number of usable pieces afterwards is $\frac{m}n$ for relatively prime positive integers $m$ and $n$, compute $100m + n$. [i]Proposed by Aaron Lin[/i]

A jar has 10 red candies and 10 blue candies. Terry picks two candies at random, then Mary picks two of the remaining candies at random. Given that the probability that they get the same color combination, irrespective of order, is $m/n$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.