Let $n > 2$ be an even number. The squares of an $n\times n$ chessboard are coloured with $\frac12 n^2$ colours in such a way that every colour is used for colouring exactly two of the squares. Prove that one can place $n$ rooks on squares of $n$ different colours such that no two of the rooks can take each other.

Problems 14, 15 and 16 involve Mrs. Reed's English assignment. A Novel Assignment The students in Mrs. Reed's English class are reading the same 760-page novel. Three friends, Alice, Bob and Chandra, are in the class. Alice reads a page in 20 seconds, Bob reads a page in 45 seconds and Chandra reads a page in 30 seconds. If Bob and Chandra both read the whole book, Bob will spend how many more seconds reading than Chandra? $ \textbf{(A)}\ 7,600 \qquad \textbf{(B)}\ 11,400 \qquad \textbf{(C)}\ 12,500 \qquad \textbf{(D)}\ 15,200 \qquad \textbf{(E)}\ 22,800$

Let $n$ be a positive integer. Show that \begin{align*}&\quad\,\,\frac{1}{\binom{n}{1}}+\frac{1}{2\binom{n}{2}}+\frac{1}{3\binom{n}{3}}+\cdots+\frac{1}{n\binom{n}{n}}\\&=\frac{1}{2^{n-1}}+\frac{1}{2\cdot2^{n-2}}+\frac{1}{3\cdot2^{n-3}}+\cdots+\frac{1}{n\cdot2^0}.\end{align*}

Let $ABC$ be an acute-angled triangle with circumcircle $\omega$. A circle $\Gamma$ is internally tangent to $\omega$ at $A$ and also tangent to $BC$ at $D$. Let $AB$ and $AC$ intersect $\Gamma$ at $P$ and $Q$ respectively. Let $M$ and $N$ be points on line $BC$ such that $B$ is the midpoint of $DM$ and $C$ is the midpoint of $DN$. Lines $MP$ and $NQ$ meet at $K$ and intersect $\Gamma$ again at $I$ and $J$ respectively. The ray $KA$ meets the circumcircle of triangle $IJK$ again at $X\neq K$. Prove that $\angle BXP = \angle CXQ$. [i]Kian Moshiri, United Kingdom[/i]

Let $I$ be the incenter of scalene triangle ABC and denote by $a,$ $b$ the circles with diameters $IC$ and $IB$, respectively. If $c,$ $d$ mirror images of $a,$ $b$ in $IC$ and $IB$ prove that the circumcenter $O$ of triangle $ABC$ lies on the radical axis of $c$ and $d$.

Let $G$ be a simple, undirected, connected graph with $100$ vertices and $2013$ edges. It is given that there exist two vertices $A$ and $B$ such that it is not possible to reach $A$ from $B$ using one or two edges. We color all edges using $n$ colors, such that for all pairs of vertices, there exists a way connecting them with a single color. Find the maximum value of $n$.

In rectangle $ ABCD$, $ AB\equal{}100$. Let $ E$ be the midpoint of $ \overline{AD}$. Given that line $ AC$ and line $ BE$ are perpendicular, find the greatest integer less than $ AD$.

In a country consisting of $2015$ cities, between any two cities there is exactly one direct round flight operated by some air company. Find the minimal possible number of air companies if direct flights between any three cities are operated by three different air companies.

The shaded region formed by the two intersecting perpendicular rectangles, in square units, is [asy] fill((0,0)--(6,0)--(6,-3.5)--(9,-3.5)--(9,0)--(10,0)--(10,2)--(9,2)--(9,4.5)--(6,4.5)--(6,2)--(0,2)--cycle,black); label("2",(0,.9),W); label("3",(7.3,4.5),N); draw((0,-3.3)--(0,-5.3),linewidth(1)); draw((0,-4.3)--(3.7,-4.3),linewidth(1)); label("10",(4.7,-3.7),S); draw((5.7,-4.3)--(10,-4.3),linewidth(1)); draw((10,-3.3)--(10,-5.3),linewidth(1)); draw((11,4.5)--(13,4.5),linewidth(1)); draw((12,4.5)--(12,2),linewidth(1)); label("8",(11.3,1),E); draw((12,0)--(12,-3.5),linewidth(1)); draw((11,-3.5)--(13,-3.5),linewidth(1));[/asy] $ \text{(A)}\ 23\qquad\text{(B)}\ 38\qquad\text{(C)}\ 44\qquad\text{(D)}\ 46\qquad\text{(E)}\ \text{unable to be determined from the information given} $

$1,000,000,000,000-777,777,777,777=$ $\text{(A)}\ 222,222,222,222 \qquad \text{(B)}\ 222,222,222,223 \qquad \text{(C)}\ 233,333,333,333 \\ \text{(D)}\ 322,222,222,223 \qquad \text{(E)}\ 333,333,333,333$

Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$. [i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]

While watching a show, Ayako, Billy, Carlos, Dahlia, Ehuang, and Frank sat in that order in a row of six chairs. During the break, they went to the kitchen for a snack. When they came back, they sat on those six chairs in such a way that if two of them sat next to each other before the break, then they did not sit next to each other after the break. Find the number of possible seating orders they could have chosen after the break.

In the 27 points of a cube: 8 vertexes, 12 midpoints of edges, 6 centers of surfaces, and the center of the cube, the number of groups of three collinear points is $\text{(A)}57\qquad\text{(B)}49\qquad\text{(C)}43\qquad\text{(D)}37$

In a triangle $ABC ~(\overline{AB} < \overline{AC})$, points $D (\neq A, B)$ and $E (\neq A, C)$ lies on side $AB$ and $AC$ respectively. Point $P$ satisfies $\overline{PB}=\overline{PD}, \overline{PC}=\overline{PE}$. $X (\neq A, C)$ is on the arc $AC$ of the circumcircle of triangle $ABC$ not including $B$. Let $Y (\neq A)$ be the intersection of circumcircle of triangle $ADE$ and line $XA$. Prove that $\overline{PX} = \overline{PY}$.

Beto plays the following game with his computer: initially the computer randomly picks $30$ integers from $1$ to $2015$, and Beto writes them on a chalkboard (there may be repeated numbers). On each turn, Beto chooses a positive integer $k$ and some if the numbers written on the chalkboard, and subtracts $k$ from each of the chosen numbers, with the condition that the resulting numbers remain non-negative. The objective of the game is to reduce all $30$ numbers to $0$, in which case the game ends. Find the minimal number $n$ such that, regardless of which numbers the computer chooses, Beto can end the game in at most $n$ turns.

Find all functions $f:\mathbb N\to\mathbb N_0$ such that for all $m,n\in\mathbb N$, \begin{align*} f(mn)&=f(m)f(n)\\ f(m+n)&=\min(f(m),f(n))\qquad\text{if }f(m)\ne f(n)\end{align*}