There are 15 cities, and there is a train line between each pair operated by either the Carnegie Rail Corporation or the Mellon Transportation Company. A tourist wants to visit exactly three cities by travelling in a loop, all by travelling on one line. What is the minimum number of such 3-city loops?

Let $ABCD$ be a unit square. For any interior points $M,N$ such that the line $MN$ does not contain a vertex of the square, we denote by $s(M,N)$ the least area of the triangles having their vertices in the set of points $\{ A,B,C,D,M,N\}$. Find the least number $k$ such that $s(M,N)\le k$, for all points $M,N$. [i]Dinu Șerbănescu[/i]

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Let $n$ points lie on the circle. Exactly half of triangles formed by these points are acute-angled. Find all possible $n$. (B.Frenkin)

A square is contained in a cube when all of its points are in the faces or in the interior of the cube. Determine the biggest $\ell > 0$ such that there exists a square of side $\ell$ contained in a cube with edge $1$.

Find all real solutions of $$ \begin{matrix} \sqrt{9+x_1}+ \sqrt{9+x_2}+...+ \sqrt{9+x_{100}}=100\sqrt{10}\\ \sqrt{16-x_1}+ \sqrt{16-x_2}+...+ \sqrt{16-x_{100}}=100\sqrt{15} \end{matrix}$$

Find the smallest real number $M$ such that $$\sum_{k = 1}^{99}\frac{a_{k+1}}{a_k+a_{k+1}+a_{k+2}} < M$$ for all positive real numbers $a_1, a_2, \dots, a_{99}$. ($a_{100} = a_1, a_{101} = a_2$)

Let $\pi$ be a randomly chosen permutation of the numbers from $1$ through $2012$. Find the probability that$$ \pi (\pi(2012)) = 2012.$$

Prove the following identity for determinants: $ |c_{ik} \plus{} a_i \plus{} b_k \plus{} 1|_{i,k \equal{} 1,...,n} \plus{} |c_{ik}|_{i,k \equal{} 1,...,n} \equal{} |c_{ik} \plus{} a_i \plus{} b_k|_{i,k \equal{} 1,...,n} \plus{} |c_{ik} \plus{} 1|_{i,k \equal{} 1,...,n}$

There are $85$ soldiers with different heigth and age. Every day commander chooses random soldier and send him and also all soldiers that are taller and older than this soldier, or all soldiers that are lower and younger than this soldier to color grass. Prove that after $10$ days we can find two soldiers, that color grass at same days.

Pablo buys popsicles for his friends. The store sells single popsicles for $\$1$ each, 3-popsicle boxes for $\$2$, and 5-popsicle boxes for $\$3$. What is the greatest number of popsicles that Pablo can buy with $\$8$? $\textbf{(A)}\ 8\qquad\textbf{(B)}\ 11\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 13\qquad\textbf{(E)}\ 15$

Vaysha has a board with $999$ consecutive numbers written and $999$ labels of the form [i]"This number is [b]not [/b]divisible by $i$"[/i], for $i \in \{ 2,3, \dots ,1000 \} $. She places each label next to a number on the board, so that each number has exactly one label. For each true statement on the stickers, Vaysha gets a piece of candy. How many pieces of candy can Vaysha guarantee to win, regardless of the numbers written on the board, if she plays optimally?

Find all positive integers $n$ with the following property: the $k$ positive divisors of $n$ have a permutation $(d_1,d_2,\ldots,d_k)$ such that for $i=1,2,\ldots,k$, the number $d_1+d_2+\cdots+d_i$ is a perfect square.

In a quadrilateral, the two segments connecting the midpoints of its opposite sides are equal in length. Prove that the diagonals of the quadrilateral are perpendicular. (In other words, let $M,N,P,$ and $Q$ be the midpoints of sides $AB,BC,CD,$ and $DA$ in quadrilateral $ABCD$. It is known that segments $MP$ and $NQ$ are equal in length. Prove that $AC$ and $BD$ are perpendicular.)

For $n$ a positive integer, let $R(n)$ be the sum of the remainders when $n$ is divided by $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, and $10$. For example, $R(15) = 1+0+3+0+3+1+7+6+5=26$. How many two-digit positive integers $n$ satisfy $R(n) = R(n+1)\,?$ $\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }4$

Let $n$ be a positive integer, and let $a_1,a_2,..,a_n$ be pairwise distinct positive integers. Show that $$\sum_{k=1}^{n}{\frac{1}{[a_1,a_2,…,a_k]}} <4,$$ where $[a_1,a_2,…,a_k]$ is the least common multiple of the integers $a_1,a_2,…,a_k$.