A container is shaped like a right circular cone open at the top surmounted by a frustum which is open at the top and bottom as shown below. The lower cone has a base with radius 2 centimeters and height 6 centimeters while the frustum has bases with radii 2 and 8 centimeters and height 6 centimeters. If there is a rainfall measuring 2 centimeter of rain, the rain falling into the container will fill the container to a height of $m + 3\sqrt{n}$ cm, where m and n are positive integers. Find m + n.

If $ a$ and $ b$ are positive numbers such that $ a^b \equal{} b^a$ and $ b \equal{} 9a$, then the value of $ a$ is: $ \textbf{(A)}\ 9\qquad \textbf{(B)}\ \frac {1}{9}\qquad \textbf{(C)}\ \sqrt [9] {9}\qquad \textbf{(D)}\ \sqrt [3] {9}\qquad \textbf{(E)}\ \sqrt [4] {3}$

$ABCD$ and $A'B'C'D'$ are square maps of the same region, drawn to different scales and superimposed as shown in the figure. Prove that there is only one point $O$ on the small map that lies directly over point $O'$ of the large map such that $O$ and $O'$ each represent the same place of the country. Also, give a Euclidean construction (straight edge and compass) for $O$. [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); real theta = -100, r = 0.3; pair D2 = (0.3,0.76); string[] lbl = {'A', 'B', 'C', 'D'}; draw(unitsquare); draw(shift(D2)*rotate(theta)*scale(r)*unitsquare); for(int i = 0; i < lbl.length; ++i) { pair Q = dir(135-90*i), P = (.5,.5)+Q/2^.5; label("$"+lbl[i]+"'$", P, Q); label("$"+lbl[i]+"$",D2+rotate(theta)*(r*P), rotate(theta)*Q); }[/asy]

The product of two positive numbers is $9$. The reciprocal of one of these numbers is $4$ times the reciprocal of the other number. What is the sum of the two numbers? $ \textbf{(A)}\ \dfrac{10}{3} \qquad\textbf{(B)}\ \dfrac{20}{3} \qquad\textbf{(C)}\ 7 \qquad\textbf{(D)}\ \dfrac{15}{2} \qquad\textbf{(E)}\ 8 $

Let $n$ be a positive integer greater than 4 such that the decimal representation of $n!$ ends in $k$ zeros and the decimal representation of $(2n)!$ ends in $3k$ zeros. Let $s$ denote the sum of the four least possible values of $n$. What is the sum of the digits of $s$? $ \textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11 $

In what case does the system of equations $\begin{matrix} x + y + mz = a \\ x + my + z = b \\ mx + y + z = c \end{matrix}$ have a solution? Find conditions under which the unique solution of the above system is an arithmetic progression.

\[\int_0^{\pi/2} \frac{\sin(x)}{2-\sin(x)\cos(x)}\,\mathrm dx\] [i]Proposed by Connor Gordon[/i]

Let $x, y, z$ be positive numbers such that $\frac{1}{x} + \frac{1}{y} + \frac{1}{z} = 1$. Prove that $$\sqrt{x + yz} +\sqrt{y + zx} +\sqrt{z + xy} \ge\sqrt{xyz}+\sqrt{x }+\sqrt{y} +\sqrt{z}$$

For which positive $x$ does the expression $x^{1000}+x^{900}+x^{90}+x^6+\frac{1996}{x}$ attain the smallest value?

Find two three-digit numbers $x$ and $y$ such that the sum of all other three digit numbers is equal to $600x$.

Inside the parallelogram $ABCD$, point $M$ is chosen, and inside the triangle $AMD$, point $N$ is chosen in such a way that $$\angle MNA + \angle MCB =\angle MND + \angle MBC = 180^o.$$ Prove that lines $MN$ and $AB$ are parallel.

Let $p\ge 17$ be a prime. Prove that $t=3$ is the largest positive integer which satisfies the following condition: For any integers $a,b,c,d$ such that $abc$ is not divisible by $p$ and $(a+b+c)$ is divisible by $p$, there exists integers $x,y,z$ belonging to the set $\{0,1,2,\ldots , \left\lfloor \frac{p}{t} \right\rfloor - 1\}$ such that $ax+by+cz+d$ is divisible by $p$.

Let $ABCD$ be a quadrilateral with $\angle BAD = \angle ABC = 90^{\circ}$, and suppose $AB=BC=1$, $AD=2$. The circumcircle of $ABC$ meets $\overline{AD}$ and $\overline{BD}$ at point $E$ and $F$, respectively. If lines $AF$ and $CD$ meet at $K$, compute $EK$.

A segment $AB$ is given. We erect the equilateral triangles $ABC$ and $ADB$ above and below $AB$. We denote the midpoints of $AC$ and $BC$ by $E$ and $F$ respectively. Prove that the straight lines $DE$ and $DF$ divide the segment $AB$ into three parts of equal length .

Prove that the sum of the distances of the vertices of a regular tetrahedron from the center of its circumscribed sphere is less than the sum of the distances of these vertices from any other point in space.

Let $ a,b,c,d$ be four distinct positive integers in arithmetic progression. Prove that $ abcd$ is not a perfect square.

Given integer $d>1,m$,prove that there exists integer $k>l>0$, such that $$(2^{2^k}+d,2^{2^l}+d)>m.$$

Find all functions $ f: \mathbb{N^{*}}\to \mathbb{N^{*}}$ satisfying \[ \left(f^{2}\left(m\right)+f\left(n\right)\right) \mid \left(m^{2}+n\right)^{2}\] for any two positive integers $ m$ and $ n$. [i]Remark.[/i] The abbreviation $ \mathbb{N^{*}}$ stands for the set of all positive integers: $ \mathbb{N^{*}}=\left\{1,2,3,...\right\}$. By $ f^{2}\left(m\right)$, we mean $ \left(f\left(m\right)\right)^{2}$ (and not $ f\left(f\left(m\right)\right)$). [i]Proposed by Mohsen Jamali, Iran[/i]

Let $P, Q,R$ be three polynomials with real coefficients such that \[P(Q(x)) + P(R(x))=\text{constant}\] for all $x$. Prove that $P(x)=\text{constant}$ or $Q(x)+R(x)=\text{constant}$ for all $x$.

Two players play the following game: alternatively they write numbers $1$ or $0$ in the vertices of an $n$-gon. First player starts the game and wins if after any of his moves there exists a triangle, whose vertices are three consecutive vertices of the $n$-gon, such that the sum of numbers in it's vertices is divisible by $3$. Second player wins if he prevents this. Determine which player has a winning strategy if: a) $n=2019$ b) $n=2020$ c) $n=2021$

A uniform disk, a thin hoop, and a uniform sphere, all with the same mass and same outer radius, are each free to rotate about a fixed axis through its center. Assume the hoop is connected to the rotation axis by light spokes. With the objects starting from rest, identical forces are simultaneously applied to the rims, as shown. Rank the objects according to their kinetic energies after a given time $t$, from least to greatest. [asy] size(225); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); filldraw(circle((0,0),1),gray(.7)); draw((0,-1)--(2,-1),EndArrow); label("$\vec{F}$",(1, -1),S); label("Disk",(-1,0),W); filldraw(circle((5,0),1),gray(.7)); filldraw(circle((5,0),0.75),white); draw((5,-1)--(7,-1),EndArrow); label("$\vec{F}$",(6, -1),S); label("Hoop",(6,0),E); filldraw(circle((10,0),1),gray(.5)); draw((10,-1)--(12,-1),EndArrow); label("$\vec{F}$",(11, -1),S); label("Sphere",(11,0),E); [/asy] $ \textbf{(A)} \ \text{disk, hoop, sphere}$ $\textbf{(B)}\ \text{sphere, disk, hoop}$ $\textbf{(C)}\ \text{hoop, sphere, disk}$ $\textbf{(D)}\ \text{disk, sphere, hoop}$ $\textbf{(E)}\ \text{hoop, disk, sphere} $

In triangle $ABC$, $F$ is on segment $AB$ such that $CF$ bisects $\angle ACB$. Points $D$ and $E$ are on line $CF$ such that lines $AD,BE$ are perpendicular to $CF$. $M$ is the midpoint of $AB$. If $ME=13$, $AD=15$, and $BE=25$, find $AC+CB$. [i]Ray Li[/i]

How many $0$'s are there in the sequence $x_1, x_2,..., x_{2014}$ where $x_n =\big[ \frac{n + 1}{\sqrt{2015}}\big] -\big[ \frac{n }{\sqrt{2015}}\big]$ , $n = 1, 2,...,2014$ ? (A): $1128$, (B): $1129$, (C): $1130$, (D): $1131$, (E) None of the above.

The diagram below shows four regular hexagons each with side length $1$ meter attached to the sides of a square. This figure is drawn onto a thin sheet of metal and cut out. The hexagons are then bent upward along the sides of the square so that $A_1$ meets $A_2$, $B_1$ meets $B_2$, $C_1$ meets $C_2$, and $D_1$ meets $D_2$. If the resulting dish is filled with water, the water will rise to the height of the corner where the $A_1$ and $A_2$ meet. there are relatively prime positive integers $m$ and $n$ so that the number of cubic meters of water the dish will hold is $\sqrt{\frac{m}{n}}$. Find $m+n$. [asy] /* File unicodetex not found. */ /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki, go to User:Azjps/geogebra */ import graph; size(7cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -4.3, xmax = 14.52, ymin = -8.3, ymax = 6.3; /* image dimensions */ draw((0,1)--(0,0)--(1,0)--(1,1)--cycle); draw((1,1)--(1,0)--(1.87,-0.5)--(2.73,0)--(2.73,1)--(1.87,1.5)--cycle); draw((0,1)--(1,1)--(1.5,1.87)--(1,2.73)--(0,2.73)--(-0.5,1.87)--cycle); draw((0,0)--(1,0)--(1.5,-0.87)--(1,-1.73)--(0,-1.73)--(-0.5,-0.87)--cycle); draw((0,1)--(0,0)--(-0.87,-0.5)--(-1.73,0)--(-1.73,1)--(-0.87,1.5)--cycle); /* draw figures */ draw((0,1)--(0,0)); draw((0,0)--(1,0)); draw((1,0)--(1,1)); draw((1,1)--(0,1)); draw((1,1)--(1,0)); draw((1,0)--(1.87,-0.5)); draw((1.87,-0.5)--(2.73,0)); draw((2.73,0)--(2.73,1)); draw((2.73,1)--(1.87,1.5)); draw((1.87,1.5)--(1,1)); draw((0,1)--(1,1)); draw((1,1)--(1.5,1.87)); draw((1.5,1.87)--(1,2.73)); draw((1,2.73)--(0,2.73)); draw((0,2.73)--(-0.5,1.87)); draw((-0.5,1.87)--(0,1)); /* dots and labels */ dot((1.87,-0.5),dotstyle); label("$C_1$", (1.72,-0.1), NE * labelscalefactor); dot((1.87,1.5),dotstyle); label("$B_2$", (1.76,1.04), NE * labelscalefactor); dot((1.5,1.87),dotstyle); label("$B_1$", (0.96,1.8), NE * labelscalefactor); dot((-0.5,1.87),dotstyle); label("$A_2$", (-0.26,1.78), NE * labelscalefactor); dot((-0.87,1.5),dotstyle); label("$A_1$", (-0.96,1.08), NE * labelscalefactor); dot((-0.87,-0.5),dotstyle); label("$D_2$", (-1.02,-0.18), NE * labelscalefactor); dot((-0.5,-0.87),dotstyle); label("$D_1$", (-0.22,-0.96), NE * labelscalefactor); dot((1.5,-0.87),dotstyle); label("$C_2$", (0.9,-0.94), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy]

We say that a finite set $\mathcal{S}$ of points in the plane is [i]balanced[/i] if, for any two different points $A$ and $B$ in $\mathcal{S}$, there is a point $C$ in $\mathcal{S}$ such that $AC=BC$. We say that $\mathcal{S}$ is [i]centre-free[/i] if for any three different points $A$, $B$ and $C$ in $\mathcal{S}$, there is no points $P$ in $\mathcal{S}$ such that $PA=PB=PC$. (a) Show that for all integers $n\ge 3$, there exists a balanced set consisting of $n$ points. (b) Determine all integers $n\ge 3$ for which there exists a balanced centre-free set consisting of $n$ points. Proposed by Netherlands