Find the smallest positive integer ${k}$ with the following properties $:{}{}{}{}{}$If each positive integer is arbitrarily colored red or blue${}{}{},$ there may be ${}{}{}{}9$ distinct red positive integers $x_1,x_2,\cdots ,x_9,$ satisfying $$x_1+x_2+\cdots +x_8<x_9,$$ or there are $10{}{}{}{}{}{}$ distinct blue positive integers $y_1,y_2,\cdots ,y_{10}$ satisfiying $${y_1+y_2+\cdots +y_9<y_{10}}.$$

Two $1$ inch by $1$ inch squares are cutout from opposite corners of a $7$ inch by $5$ inch piece of paper to form an octagon. What is the distance, in inches, between the two dotted points, both of which lie on corners of the octagon? [asy] size(120); draw((0,1)--(0,5)--(6,5)); draw((1,0)--(7,0)--(7,4)); draw((0,1)--(0,0)--(1,0),dashed); draw((6,5)--(7,5)--(7,4),dashed); draw((0,1)--(1,1)--(1,0)); draw((6,5)--(6,4)--(7,4)); draw((1,1)--(6,4),dashed); dot((1,1),linewidth(5)); dot((6,4),linewidth(5)); label("$?$",(1,1)--(6,4),N); [/asy] $\textbf{(A) }5\qquad\textbf{(B) }\sqrt{34}\qquad\textbf{(C) }5\sqrt2\qquad\textbf{(D) }8\qquad\textbf{(E) }\sqrt{74}$

What is the value of $$1-(-2)-3-(-4)-5-(-6)?$$ $\textbf{(A) } -20 \qquad\textbf{(B) } -3 \qquad\textbf{(C) } 3 \qquad\textbf{(D) } 5 \qquad\textbf{(E) } 21$

Given three circles $c_1,c_2,c_3$ with $r_1,r_2,r_3$ radiuses, $r_1 > r_2, r_1 > r_3$. Each lies outside of two others. The A point -- an intersection of the outer common tangents to $c_1$ and $c_2$ -- is outside $c_3$. The $B$ point -- an intersection of the outer common tangents to $c_1$ and $c_3$ -- is outside $c_2$. Two pairs of tangents -- from $A$ to $c_3$ and from $B$ to $c_2$ -- are drawn. Prove that the quadrangle, they make, is circumscribed around some circle and find its radius.

Given an isosceles triangle $ABC$ with $AB = AC$, suppose $D$ is the midpoint of the $AC$. The circumcircle of the $DBC$ triangle intersects the altitude from $A$ at point $E$ inside the triangle $ABC$, and the circumcircle of the triangle $AEB$ cuts the side $BD$ at point $F$. If $CF$ cuts $AE$ at point $G$, prove that $AE = EG$.

A hunter and an invisible rabbit play a game on an infinite square grid. First the hunter fixes a colouring of the cells with finitely many colours. The rabbit then secretly chooses a cell to start in. Every minute, the rabbit reports the colour of its current cell to the hunter, and then secretly moves to an adjacent cell that it has not visited before (two cells are adjacent if they share an edge). The hunter wins if after some finite time either:[list][*]the rabbit cannot move; or [*]the hunter can determine the cell in which the rabbit started.[/list]Decide whether there exists a winning strategy for the hunter. [i]Proposed by Aron Thomas[/i]

Three persons $A,B,C$, are playing the following game: A $k$-element subset of the set $\{1, . . . , 1986\}$ is randomly chosen, with an equal probability of each choice, where $k$ is a fixed positive integer less than or equal to $1986$. The winner is $A,B$ or $C$, respectively, if the sum of the chosen numbers leaves a remainder of $0, 1$, or $2$ when divided by $3$. For what values of $k$ is this game a fair one? (A game is fair if the three outcomes are equally probable.)

Let $m, n$ be positive integers with $m > 1$. Anastasia partitions the integers $1, 2, \dots , 2m$ into $m$ pairs. Boris then chooses one integer from each pair and finds the sum of these chosen integers. Prove that Anastasia can select the pairs so that Boris cannot make his sum equal to $n$.

In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way. ([i]The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.[/i]) (a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than $49$. (b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is $49$.

In pentagon $ABCDE$, $BE$ intersects $AC$ and $AD$ at $F$ and $G$, respectively. Suppose that $A[\vartriangle AF G] = A[\vartriangle BCF] = A[\vartriangle DEG] = 16$, where$ A[\vartriangle AF G]$ denotes the area of $\vartriangle AF G$. Next, suppose that $BF = 4$, $F G = 5$, and $GE = 6$. Compute $A[ABCDE]$.

Let $ABC$ be an equilateral triangle of area $1998$ cm$^2$. Points $K, L, M$ divide the segments $[AB], [BC] ,[CA]$, respectively, in the ratio $3:4$ . Line $AL$ intersects the lines $CK$ and $BM$ respectively at the points $P$ and $Q$, and the line $BM$ intersects the line $CK$ at point $R$. Find the area of the triangle $PQR$.

Let $\alpha $ be an angle such that $\cos \alpha = \frac pq$, where $p$ and $q$ are two integers. Prove that the number $q^n \cos n \alpha$ is an integer.

In triangle $ABC$ let $M$ be the midpoint of $BC$. Let $\omega$ be a circle inside of $ABC$ and is tangent to $AB,AC$ at $E,F$, respectively. The tangents from $M$ to $\omega$ meet $\omega$ at $P,Q$ such that $P$ and $B$ lie on the same side of $AM$. Let $X \equiv PM \cap BF $ and $Y \equiv QM \cap CE $. If $2PM=BC$ prove that $XY$ is tangent to $\omega$. [i]Proposed by Iman Maghsoudi[/i]

The graph $G$ is not $3$-coloured. Prove that $G$ can be divided into two graphs $M$ and $N$ such that $M$ is not $2$-coloured and $N$ is not $1$-coloured. [i]V. Dolnikov[/i]

Find all functions $f: \mathbb N \to \mathbb N$ for which \[ f(n) + f(n+1) = f(n+2)f(n+3)-1996\] holds for all positive integers $n$.

Given any positive real number $\varepsilon$, prove that, for all but finitely many positive integers $v$, any graph on $v$ vertices with at least $(1+\varepsilon)v$ edges has two distinct simple cycles of equal lengths. (Recall that the notion of a simple cycle does not allow repetition of vertices in a cycle.) [i]Fedor Petrov, Russia[/i]

All natural numbers from $1$ to $N$, $ N \ge 2$ are written out in a certain order in a circle. Moreover, for any pair of neighboring numbers there is at least one digit appearing in the decimal notation of each of them. Find the smallest possible value of $N$.

Prove that there are infinitely many ordered pairs of positive integers $(m, n)$ such that $\frac{m+1}{n}+\frac{n+1}{m}$ is a positive integer.

Prove that $2014$ divides $53n^{55}- 57n^{53} + 4n$ for all integer $n$.

A regular hexagon is split into $6$ congruent equilateral triangles by drawing in the $3$ main diagonals. Each triangle is colored $1$ of $4$ distinct colors. Rotations and reflections of the figure are considered nondistinct. Find the number of possible distinct colorings.

Let $ S \equal{} \{1,2,\ldots,2008\}$. For any nonempty subset $ A\in S$, define $ m(A)$ to be the median of $ A$ (when $ A$ has an even number of elements, $ m(A)$ is the average of the middle two elements). Determine the average of $ m(A)$, when $ A$ is taken over all nonempty subsets of $ S$.

A fair die is rolled four times. The probability that each of the final three rolls is at least as large as the roll preceding it may be expressed in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Consider the set $M$ of all sequences of integers $s=(s_1,\ldots,s_k)$ such that $0\leqslant s_i\leqslant n,\; i=1,2,\ldots,k$ and let $M(s)=\max\{s_1,\ldots,s_k\}$. Show that \[\sum_{s\in A} M(s)=(n+1)^{k+1}-(1^k+2^k+\ldots +(n+1)^k).\] [i]Ioan Tomescu[/i]

The cell of a $(2m +1) \times (2n +1)$ board are painted in two colors - white and black. The unit cell of a row (column) is called [i]dominant[/i] on the row (the column) if more than half of the cells that row (column) have the same color as this cell. Prove that at least $m + n-1$ cells on the board are dominant in both their row and column.

At the beginning of the school year, Lisa’s goal was to earn an A on at least $ 80\%$ of her $ 50$ quizzes for the year. She earned an A on $ 22$ of the first $ 30$ quizzes. If she is to achieve her goal, on at most how many of the remaining quizzes can she earn a grade lower than an A? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$