My frisbee group often calls "best of five" to finish our games when it's getting dark, since we don't keep score. The game ends after one of the two teams scores three points (total, not necessarily consecutive). If every possible sequence of scores is equally likely, what is the expected score of the losing team? $\textbf{(A) }2/3\hspace{14em}\textbf{(B) }1\hspace{14.8em}\textbf{(C) }3/2$ $\textbf{(D) }8/5\hspace{14em}\textbf{(E) }5/8\hspace{14em}\textbf{(F) }2$ $\textbf{(G) }0\hspace{14.9em}\textbf{(H) }5/2\hspace{14em}\textbf{(I) }2/5$ $\textbf{(J) }3/4\hspace{14em}\,\textbf{(K) }4/3\hspace{13.9em}\textbf{(L) }2007$

Find all pairs $(x, y)$ of positive integers such that $(x + y)(x^2 + 9y)$ is the cube of a prime number.

Solve the equation $x^2- 10[x] + 9 = 0$. ($[x]$ is the integer part of $x$, $[x]$ is equal to the largest integer not exceeding $x$. For example, $[3,33] = 3$, $[2] = 2$, $[- 3.01] = -4$).

Let $N>s$ be positive integers. Electricity park has a number of buildings; exactly $N$ of them are power plants, and another one of them is the headquarter. Some pairs of buildings have one-way power cables between them, satisfying: (i) The cables connected to a power plant will only send the power out of the plant. (ii) For each non-headquarter building, there is a unique sequence of cables that can transport the power from that building to the headquarter. A building is [b]$s$-electrifed[/b] if, after removing any one cable from the park, the building can still receive power from at least $s$ different power plants. Find the maximum possible number of $s$-electrifed buildings. [i]Note: There seems to be confusion about whether a power plant is $1$-electrified. For the sake of simplicity let's say that any power plant is not $s$-electrified for any $s\geq 1$.[/i] [i]Proposed by usjl[/i]

Let $S$ be a set of $n$ points in the coordinate plane. Say that a pair of points is [i]aligned[/i] if the two points have the same $x$-coordinate or $y$-coordinate. Prove that $S$ can be partitioned into disjoint subsets such that (a) each of these subsets is a collinear set of points, and (b) at most $n^{3/2}$ unordered pairs of distinct points in $S$ are aligned but not in the same subset.

Consider the iterated sequence (1) $ x_0,x_1 \equal{} f(x_0),\dots,x_{n \plus{} 1} \equal{} f(x_n),\dots$, where $ f(x) \equal{} 4x \minus{} x^2$. Determine the points $ x_0$ of $ [0,1]$ for which (1) converges and find the limit of (1).

The greatest common divisor of $n$ and $180$ is $12$. The least common multiple of $n$ and $180$ is $720$. Find $n$.

Let $a$ and $b$ be positive real numbers satisfying $$a -12b = 11 -\frac{100}{a} \,\,\,\,and \,\,\,\, a -\frac{12}{b}= 4 -\frac{100}{a}.$$ Then $a + b = \frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Find all ordered triples of non-negative integers $(a,b,c)$ such that $a^2+2b+c$, $b^2+2c+a$, and $c^2+2a+b$ are all perfect squares. [i]Proposed by Matthew Babbitt[/i]

Find the number of pairs of positive integers $(m; n)$, with $m \le n$, such that the ‘least common multiple’ (LCM) of $m$ and $n$ equals $600$.

Let $a, b, c$ be positive reals such that $a + b + c = 1$ and $P(x) = 3^{2005}x^{2007 }- 3^{2005}x^{2006} - x^2$. Prove that $P(a) + P(b) + P(c) \le -1$.

A staircase has $100$ steps. Kolya wishes to descend the staircase by alternately jumping down some steps and then up some. The possible jumps he can do are through $6$ (i.e. over $5$ and landing on the $6$th) , $7$ or $8$ steps . He also does not wish to land twice on the same step . Can he descend the staircase in this way? ( S . Fomin, Leningrad)

In which pair of substances do the nitrogen atoms have the same oxidation state? $ \textbf{(A)}\ \ce{HNO3} \text{ and } \ce{ N2O5} \qquad\textbf{(B)}\ \ce{NO} \text{ and } \ce{HNO2} \qquad$ ${\textbf{(C)}\ \ce{N2} \text{ and } \ce{N2O} \qquad\textbf{(D)}}\ \ce{HNO2} \text{ and } \ce{HNO3} \qquad $

Akello divides a square up into finitely many white and red rectangles, each (rectangle) with sides parallel to the sides of the parent square. Within each white rectangle, she writes down the value of its width divided by its height, while within each red rectangle, she writes down the value of its height divided by its width. Finally, she calculates $x$, the sum of these numbers. If the total area of the white rectangles equals the total area of the red rectangles, what is the least possible value of $x$ she can get?

In order to complete a large job, 1000 workers were hired, just enough to complete the job on schedule. All the workers stayed on the job while the first quarter of the work was done, so the first quarter of the work was completed on schedule. Then 100 workers were laid off, so the second quarter of the work was completed behind schedule. Then an additional 100 workers were laid off, so the third quarter of the work was completed still further behind schedule. Given that all workers work at the same rate, what is the minimum number of additional workers, beyond the 800 workers still on the job at the end of the third quarter, that must be hired after three-quarters of the work has been completed so that the entire project can be completed on schedule or before?

Show that triangle $ABC$ is right-angled if its angles satisfy the ratio $\cos^2A + \cos ^2B +\ cos ^2C=1$.

Find all triplets of integers $(a,b,c)$ such that the number $$N = \frac{(a-b)(b-c)(c-a)}{2} + 2$$ is a power of $2016$. (A power of $2016$ is an integer of form $2016^n$,where n is a non-negative integer.)

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$.

Numbers 1 and −1 are written in the cells of a board 2000×2000. It is known that the sum of all the numbers in the board is positive. Show that one can select 1000 rows and 1000 columns such that the sum of numbers written in their intersection cells is at least 1000. [i]D. Karpov[/i]

Given $4$ vectors $a,b,c,d$ in the plane, such that $a+b+c+d=0$. Prove the following inequality: $$|a|+|b|+|c|+|d| \ge |a+d|+|b+d|+|c+d|$$

In a triangle $ABC$, the external bisector of $\angle BAC$ intersects the ray $BC$ at $D$. The feet of the perpendiculars from $B$ and $C$ to line $AD$ are $E$ and $F$, respectively and the foot of the perpendicular from $D$ to $AC$ is $G$. Show that $\angle DGE + \angle DGF = 180^{\circ}$.

Given are two sets of positive numbers with the same sum. The first set has $m$ numbers and the second $n$. Prove that you can find a set of less than $m+n$ positive numbers which can be arranged to part fill an $m \times n$ array, so that the row and column sums are the two given sets.

An ant crawls on the outer surface of the box in a shape of rectangular parallelepiped. From ant’s point of view, the distance between two points on a surface is defined by the length of the shortest path ant need to crawl to reach one point from the other. Is it true that if ant is at vertex then from ant’s point of view the opposite vertex be the most distant point on the surface?

How many colorings of an $n$-gon in $p \ge 2$ colors are there such that no two neighboring vertices have the same color?

Find all the pairs of positive integers $ (a,b)$ such that $ a^2 \plus{} b \minus{} 1$ is a power of prime number $ ; a^2 \plus{} b \plus{} 1$ can divide $ b^2 \minus{} a^3 \minus{} 1,$ but it can't divide $ (a \plus{} b \minus{} 1)^2.$