Minneapolis-St. Paul International Airport is $ 8$ miles southwest of downtown St. Paul and $ 10$ miles southeast of downtown Minneapolis. Which of the following is closest to the number of miles between downtown St. Paul and downtown Minneapolis? $ \textbf{(A)}\ 13\qquad \textbf{(B)}\ 14\qquad \textbf{(C)}\ 15\qquad \textbf{(D)}\ 16\qquad \textbf{(E)}\ 17$

Let $ ABCD$ be a chordal/cyclic quadrilateral. Consider points $ P,Q$ on $ AB$ and $ R,S$ on $ CD$ with \[ \overline{AP}: \overline{PB} \equal{} \overline{CS}: \overline{SD}, \quad \overline{AQ}: \overline{QB} \equal{} \overline{CR}: \overline{RD}.\] How to choose $ P,Q,R,S$ such that $ \overline{PR} \cdot \overline{AB} \plus{} \overline{QS} \cdot \overline{CD}$ is minimal?

Find all real-valued functions $f$ defined on pairs of real numbers, having the following property: for all real numbers $a, b, c$, the median of $f(a,b), f(b,c), f(c,a)$ equals the median of $a, b, c$. (The [i]median[/i] of three real numbers, not necessarily distinct, is the number that is in the middle when the three numbers are arranged in nondecreasing order.)

What is the smallest number $n$ such that you can choose $n$ distinct odd integers $a_1, a_2,..., a_n$, none of them $1$, with $\frac{1}{a_1}+ \frac{1}{a_2}+ ...+ \frac{1}{a_n}= 1$?

A finite set of [i]axis parallel [/i]cubes in space has the property of each point of the room is located in a maximum of M different cubes. Show that you can divide the amount of cubes in $8 (M - 1) + 1$ subsets (or less) with the property that the cubes in each subset lacks common points. (An axis parallel cube is a cube whose edges are parallel to the coordinate axes.)

Find all continuous functions $f:[0,1]\to [0,1]$ for which there exists a positive integer $n$ such that $f^{n}(x)=x$ for $x \in [0,1]$ where $f^{0} (x)=x$ and $f^{k+1}=f(f^{k}(x))$ for every positive integer $k$.

Find all the integral solutions of the equation $\left( 1+\frac{1}{x}\right)^{x+1}=\left( 1+\frac{1}{1999}\right)^{1999}$

([b]4[/b]) Let $ f(x) \equal{} \sin^6\left(\frac {x}{4}\right) \plus{} \cos^6\left(\frac {x}{4}\right)$ for all real numbers $ x$. Determine $ f^{(2008)}(0)$ (i.e., $ f$ differentiated $ 2008$ times and then evaluated at $ x \equal{} 0$).

Let $a$ and $b$ be integers such that the remainder of dividing $a$ by $17$ is equal to the remainder of dividing $b$ by $19$, and the remainder of dividing $a$ by $19$ is equal to the remainder of dividing $b$ by $17$. Determine the possible values of the remainder of $a + b$ when divided by $323$.

A cyclic quadrilateral $ABCD$ is given. Point $K_1, K_2$ lie on the segment $AB$, points $L_1, L_2$ on the segment $BC$, points $M_1, M_2$ on the segment $CD$ and points $N_1, N_2$ on the segment $DA$. Moreover, points $K_1, K_2, L_1, L_2, M_1, M_2, N_1, N_2$ lie on a circle $\omega$ in that order. Denote by $a, b, c, d$ the lengths of the arcs $N_2K_1, K_2L_1, L_2M_1, M _2N_1$ of the circle $\omega$ not containing points $K_2, L_2, M_2, N_2$, respectively. Prove that \begin{align*} a+c=b+d. \end{align*}

For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.

Let $n$ be a positive integer. Prove that \[\frac{1}{3}+\cdots+\frac{1}{2n+1}\] is not an integer.

Let $ABCD$ be an isosceles trapezoid with $\overline{BC}\parallel \overline{AD}$ and $AB=CD$. Points $X$ and $Y$ lie on diagonal $\overline{AC}$ with $X$ between $A$ and $Y$, as shown in the figure. Suppose $\angle AXD = \angle BYC = 90^\circ$, $AX = 3$, $XY = 1$, and $YC = 2$. What is the area of $ABCD?$ [asy] size(6cm); usepackage("mathptmx"); import geometry; void perp(picture pic=currentpicture, pair O, pair M, pair B, real size=5, pen p=currentpen, filltype filltype = NoFill){ perpendicularmark(pic, M,unit(unit(O-M)+unit(B-M)),size,p,filltype); } pen p=black+linewidth(1),q=black+linewidth(5); pair C=(0,0),Y=(2,0),X=(3,0),A=(6,0),B=(2,sqrt(5.6)),D=(3,-sqrt(12.6)); draw(A--B--C--D--cycle,p); draw(A--C,p); draw(B--Y,p); draw(D--X,p); dot(A,q); dot(B,q); dot(C,q); dot(D,q); dot(X,q); dot(Y,q); label("2",C--Y,S); label("1",Y--X,S); label("3",X--A,S); label("$A$",A,E); label("$B$",B,N); label("$C$",C,W); label("$D$",D,S); label("$Y$",Y,sqrt(2)*NE); label("$X$",X,N); perp(B,Y,C,8,p); perp(A,X,D,8,p); [/asy] $\textbf{(A)}\: 15\qquad\textbf{(B)} \: 5\sqrt{11}\qquad\textbf{(C)} \: 3\sqrt{35}\qquad\textbf{(D)} \: 18\qquad\textbf{(E)} \: 7\sqrt{7}$

A positive integer is called special if its digits can be arranged to form an integer divisible by $4$. How many of the integers from $1$ to $2018$ are special?

Find all triples of natural $ (x,y,n)$ satisfying the condition: \[ \frac {x! \plus{} y!}{n!} \equal{} 3^n \] Define $ 0! \equal{} 1$

Let $ ABCDEF$ be a convex hexagon with $ AB \equal{} BC \equal{} CD$ and $ DE \equal{} EF \equal{} FA$, such that $ \angle BCD \equal{} \angle EFA \equal{} \frac {\pi}{3}$. Suppose $ G$ and $ H$ are points in the interior of the hexagon such that $ \angle AGB \equal{} \angle DHE \equal{} \frac {2\pi}{3}$. Prove that $ AG \plus{} GB \plus{} GH \plus{} DH \plus{} HE \geq CF$.