Joseph chooses a permutation of the numbers $1, 2, 3, 4, 5, 6$ uniformly at random. Then, he goes through his permutation, and deletes the numbers which are not the maximum among each of the preceding numbers. For example, if he chooses the permutation $3, 2, 4, 5, 1, 6,$ then he deletes $2$ and $1,$ leaving him with $3, 4, 5, 6.$ The expected number of numbers remaining can be expressed as $m/n$ for relatively prime positive integers $m$ and $n.$ Find $m + n.$

In a triangle $ABC$, the perpendicular bisectors of sides $AB$ and $AC$ intersect $BC$ at $X$ and $Y$. Prove that $BC = XY$ if and only if $\tan B\tan C = 3$ or $\tan B\tan C = -1$.

Given a circle $\tau$, let $P$ be a point in its interior, and let $l$ be a line through $P$. Construct with proof using ruler and compass, all circles which pass through $P$, are tangent to $\tau$ and whose center lies on line $l$.

Find all pairs of positive integers $(m, n)$ such that $m^2-mn+n^2+1$ divides both numbers $3^{m+n}+(m+n)!$ and $3^{m^3+n^3}+m+n$. [i]Proposed by Dorlir Ahmeti[/i]

Find the number of $n$-movement on the following graph, starting from $S$. [img]https://cdn.artofproblemsolving.com/attachments/2/0/4a23c83c7f5405575acbe6d09f202d87341337.png[/img]

Consider a cone of revolution with an inscribed sphere tangent to the base of the cone. A cylinder is circumscribed about this sphere so that one of its bases lies in the base of the cone. let $V_1$ be the volume of the cone and $V_2$ be the volume of the cylinder. a) Prove that $V_1 \neq V_2$; b) Find the smallest number $k$ for which $V_1=kV_2$; for this case, construct the angle subtended by a diamter of the base of the cone at the vertex of the cone.

Given an $m\times n$ grid with unit squares coloured either black or white, a black square in the grid is [i]stranded [/i]if there is some square to its left in the same row that is white and there is some square above it in the same column that is white. Find a closed formula for the number of $2\times n$ grids with no stranded black square. Note that $n$ is any natural number and the formula must be in terms of $n$ with no other variables.

Let $a, b, c $and $d$ be integers such that for all integers m and n, there exist integers $x$ and $y$ such that $ax + by = m$, and $cx + dy = n$. Prove that $ad - bc = \pm 1$.

19) Each cell of a $2$ × $5$ grid of unit squares is to be colored white or black. Compute the number of such colorings for which no $2$ × $2$ square is a single color. 20) Let $n$ be a three-digit integer with nonzero digits, not all of which are the same. Define $f(n)$ to be the greatest common divisor of the six integers formed by any permutation of $n$s digits. For example, $f(123) = 3$, because $gcd(123, 132, 213, 231, 312, 321) = 3$. Let the maximum possible value of $f(n)$ be $k$. Find the sum of all $n$ for which $f(n) = k$. 21) Consider a $2$ × $2$ grid of squares. Each of the squares will be colored with one of $10$ colors, and two colorings are considered equivalent if one can be rotated to form the other. How many distinct colorings are there? 22) Find all the roots of the polynomial $x^5 - 5x^4 + 11x^3 -13x^2+9x-3$ 23) Compute the smallest positive integer $n$ for which $0 < \sqrt[4]{n} - \left \lfloor{\sqrt[4]{n}}\right \rfloor < \dfrac{1}{2015}$. 24) Three ants begin on three different vertices of a tetrahedron. Every second, they choose one of the three edges connecting to the vertex they are on with equal probability and travel to the other vertex on that edge. They all stop when any two ants reach the same vertex at the same time. What is the probability that all three ants are at the same vertex when they stop? 25) Let $ABC$ be a triangle that satisfies $AB = 13$, $BC = 14$, $AC = 15$. Given a point $P$ in the plane, let $PA$, $PB$, $PC$ be the reflections of $A$, $B$, $C$ across $P$. Call $P$ [i]good[/i] if the circumcircle of $P_A P_B P_C$ intersects the circumcircle of $ABC$ at exactly 1 point. The locus of good points $P$ encloses a region $S$. Find the area of $S$. 26. Let $f : \mathbb{R}^+ \rightarrow \mathbb{R}$ be a continuous function satisfying $f(xy) = f(x) + f(y) + 1$ for all positive reals ${x,y}$. If $f(2) = 0$, compute $f(2015)$. 27) Let $ABCD$ be a quadrilateral with $A = (3,4)$, $B=(9,-40)$, $C = (-5,-12)$, $D = (-7,24)$. Let $P$ be a point in the plane (not necessarily inside the quadrilateral). Find the minimum possible value of $\overline{AP} + \overline{BP} + \overline{CP} + \overline{DP}$.

Consider those functions $ f: \mathbb{N} \mapsto \mathbb{N}$ which satisfy the condition \[ f(m \plus{} n) \geq f(m) \plus{} f(f(n)) \minus{} 1 \] for all $ m,n \in \mathbb{N}.$ Find all possible values of $ f(2007).$ [i]Author: Nikolai Nikolov, Bulgaria[/i]

Prove that all numbers of the sequence \[ \frac{107811}{3}, \quad \frac{110778111}{3}, \frac{111077781111}{3}, \quad \ldots \] are exact cubes.

Let $S$ be a nonempty set of positive integers. We say that a positive integer $n$ is [i]clean[/i] if it has a unique representation as a sum of an odd number of distinct elements from $S$. Prove that there exist infinitely many positive integers that are not clean.

Consider an equilateral triangle $\vartriangle ABC$ of side length $4$. In the zeroth iteration, draw a circle $\Omega_0$ tangent to all three sides of the triangle. In the first iteration, draw circles $\Omega_{1A}$,$ \Omega_{1B}$, $\Omega_{1C}$ such that circle $\Omega_{1v}$ is externally tangent to $\Omega_0$ and tangent to the two sides that meet at vertex $v$ (for example, $\Omega_{1A}$ would be tangent to $\Omega_0$ and sides $AB$, $AC$). In the nth iteration, draw circle $\Omega_{n,v}$ externally tangent to $\Omega_{n-1,v}$ and the two sides that meet at vertex $v$. Compute the total area of all the drawn circles as the number of iterations approaches infinity.

Three fourths of a pitcher is filled with pineapple juice. The pitcher is emptied by pouring an equal amount of juice into each of $5$ cups. What percent of the total capacity of the pitcher did each cup receive? $\textbf{(A) }5 \qquad \textbf{(B) }10 \qquad \textbf{(C) }15 \qquad \textbf{(D) }20 \qquad \textbf{(E) }25$

[b]E[/b]ach of the integers $1,2,...,729$ is written in its base-$3$ representation without leading zeroes. The numbers are then joined together in that order to form a continuous string of digits: $12101112202122...$ How many times in this string does the substring $012$ appear?