The parabolas $y=ax^2-2$ and $y=4-bx^2$ intersect the coordinate axes in exactly four points, and these four points are the vertices of a kite of area $12$. What is $a+b$? $\textbf{(A) }1\qquad\textbf{(B) }1.5\qquad\textbf{(C) }2\qquad\textbf{(D) }2.5\qquad\textbf{(E) }3$

A triangle with sides of $ 5$, $ 12$, and $ 13$ has both an inscibed and a circumscribed circle. What is the distance between the centers of those circles? $ \textbf{(A)}\ \frac{3\sqrt{5}}{2}\qquad \textbf{(B)}\ \frac{7}{2}\qquad \textbf{(C)}\ \sqrt{15}\qquad \textbf{(D)}\ \frac{\sqrt{65}}{2}\qquad \textbf{(E)}\ \frac{9}{2}$

A token starts at the point $(0,0)$ of an $xy$-coordinate grid and them makes a sequence of six moves. Each move is $1$ unit in a direction parallel to one of the coordinate axes. Each move is selected randomly from the four possible directions and independently of the other moves. The probability the token ends at a point on the graph of $|y|=|x|$ is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

A line passes through the points $\left(-1,3\right)$ and $\left(7,-2\right)$. At what value of $x$ does this line intercept the $x$-axis? $\text{(A) }\frac{7}{5}\qquad\text{(B) }\frac{19}{8}\qquad\text{(C) }\frac{19}{5}\qquad\text{(D) }\frac{27}{5}\qquad\text{(E) }\frac{23}{4}$

Each grid point of a cartesian plane is colored with one of three colors, whereby all three colors are used. Show that one can always find a right-angled triangle, whose three vertices have pairwise different colors.

Let positive integers $a,\ b,\ c$ be pairwise coprime. Denote by $g(a, b, c)$ the maximum integer not representable in the form $xa+yb+zc$ with positive integral $x,\ y,\ z$. Prove that \[ g(a, b, c)\ge \sqrt{2abc}\] [i](M. Ivanov)[/i] [hide="Remarks (containing spoilers!)"] 1. It can be proven that $g(a,b,c)\ge \sqrt{3abc}$. 2. The constant $3$ is the best possible, as proved by the equation $g(3,3k+1,3k+2)=9k+5$. [/hide]

Prove that pentagon $ ABCDE$ is cyclic if and only if \[\mathrm{d(}E,AB\mathrm{)}\cdot \mathrm{d(}E,CD\mathrm{)} \equal{} \mathrm{d(}E,AC\mathrm{)}\cdot \mathrm{d(}E,BD\mathrm{)} \equal{} \mathrm{d(}E,AD\mathrm{)}\cdot \mathrm{d(}E,BC\mathrm{)}\] where $ \mathrm{d(}X,YZ\mathrm{)}$ denotes the distance from point $ X$ ot the line $ YZ$.

For every pair of reals $0 < a < b < 1$, we define sequences $\{x_n\}_{n \ge 0}$ and $\{y_n\}_{n \ge 0}$ by $x_0 = 0$, $y_0 = 1$, and for each integer $n \ge 1$: \begin{align*} x_n & = (1 - a) x_{n - 1} + a y_{n - 1}, \\ y_n & = (1 - b) x_{n - 1} + b y_{n - 1}. \end{align*} The [i]supermean[/i] of $a$ and $b$ is the limit of $\{x_n\}$ as $n$ approaches infinity. Over all pairs of real numbers $(p, q)$ satisfying $\left (p - \textstyle\frac{1}{2} \right)^2 + \left (q - \textstyle\frac{1}{2} \right)^2 \le \left(\textstyle\frac{1}{10}\right)^2$, the minimum possible value of the supermean of $p$ and $q$ can be expressed as $\textstyle\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $100m + n$. [i]Proposed by Lewis Chen[/i]

Let $\mathbb{Q}$ be the set of rational numbers, $\mathbb{Z}$ be the set of integers. On the coordinate plane, given positive integer $m$, define $$A_m = \left\{ (x,y)\mid x,y\in\mathbb{Q}, xy\neq 0, \frac{xy}{m}\in \mathbb{Z}\right\}.$$ For segment $MN$, define $f_m(MN)$ as the number of points on segment $MN$ belonging to set $A_m$. Find the smallest real number $\lambda$, such that for any line $l$ on the coordinate plane, there exists a constant $\beta (l)$ related to $l$, satisfying: for any two points $M,N$ on $l$, $$f_{2016}(MN)\le \lambda f_{2015}(MN)+\beta (l)$$

Let $A_1A_2 \dots A_n$ be a polygon (not necessarily regular) with $n$ sides. Suppose there is a translation that maps each point $A_i$ to a point $B_i$ in the same plane. For convenience, define $A_0 = A_n$ and $B_0 = B_n$. Prove that \[ \sum_{i=1}^{n} (A_{i-1} B_{i})^2 = \sum_{i=1}^{n} (B_{i-1} A_{i})^2 \, . \]

A $10 \times 10 \times 10$ cube is made up up from $500$ white unit cubes and $500$ black unit cubes, arranged in such a way that every two unit cubes that shares a face are in different colors. A line is a $1 \times 1 \times 10$ portion of the cube that is parallel to one of cube’s edges. From the initial cube have been removed $100$ unit cubes such that $300$ lines of the cube has exactly one missing cube. Determine if it is possible that the number of removed black unit cubes is divisible by $4$.

In $ xy$ plane, find the minimum volume of the solid by rotating the region boubded by the parabola $ y \equal{} x^2 \plus{} ax \plus{} b$ passing through the point $ (1,\ \minus{} 1)$ and the $ x$ axis about the $ x$ axis

Given a right triangular prism $A_1B_1C_1 - ABC$ with $\angle BAC = \frac{\pi}{2}$ and $AB = AC = AA_1$, let $G$, $E$ be the midpoints of $A_1B_1$, $CC_1$ respectively, and $D$, $F$ be variable points lying on segments $AC$, $AB$ (not including endpoints) respectively. If $GD \bot EF$, the range of the length of $DF$ is ${ \textbf{(A)}\ [\frac{1}{\sqrt{5}}, 1)\qquad\textbf{(B)}\ [\frac{1}{5}, 2)\qquad\textbf{(C)}\ [1, \sqrt{2})\qquad\textbf{(D)}} [\frac{1}{\sqrt{2}}, \sqrt{2})\qquad $

Let $n\ge2$ be a positive integer. The numbers $1,2,..., n^2$ are consecutively placed into squares of an $n\times n$, so the first row contains $1,2,...,n$ from left to right, the second row contains $n+1,n+2,...,2n$ from left to right, and so on. The [i]magic square value[/i] of a grid is defined to be the number of rows, columns, and main diagonals whose elements have an average value of $\frac{n^2 + 1}{2}$. Show that the magic-square value of the grid stays constant under the following two operations: (1) a permutation of the rows; and (2) a permutation of the columns. (The operations can be used multiple times, and in any order.) [i]Proposed by Ray Li[/i]

Let $ABC$ be a triangle. Let $D$ be the midpoint of $\overline{BC}$, let $E$ be the midpoint of $\overline{AD}$, and let $F$ be the midpoint of $\overline{BE}$. Let $G$ be the point where the lines $AB$ and $CF$ intersect. What is the value of $\frac{AG}{AB}$?

A convex quadrilateral $ABCD$ Is placed on the Cartesian plane. Its vertices $A$ and $D$ belong to the negative branch of the graph of the hyperbola $y= 1/x$, the vertices $B$ and $C$ belong to the positive branch of the graph and point $B$ lies at the left of $C$, the segment $AC$ passes through the origin $(0,0)$. Prove that $\angle BAD = \angle BCD$. (I, Voronovich)

Prove that there exists some positive real number $\lambda$ such that for any $D_{>1}\in\mathbb{R}$, one can always find an acute triangle $\triangle ABC$ in the Cartesian plane such that [list] [*] $A, B, C$ lie on lattice points; [*] $AB, BC, CA>D$; [*] $S_{\triangle ABC}<\frac{\sqrt 3}{4}D^2+\lambda\cdot D^{4/5}$.

Consider the paper triangle whose vertices are $(0,0), (34,0),$ and $(16,24).$ The vertices of its midpoint triangle are the midpoints of its sides. A triangular pyramid is formed by folding the triangle along the sides of its midpoint triangle. What is the volume of this pyramid?

Given a scalene acute triangle $ ABC$ with $ AC>BC$ let $ F$ be the foot of the altitude from $ C$. Let $ P$ be a point on $ AB$, different from $ A$ so that $ AF\equal{}PF$. Let $ H,O,M$ be the orthocenter, circumcenter and midpoint of $ [AC]$. Let $ X$ be the intersection point of $ BC$ and $ HP$. Let $ Y$ be the intersection point of $ OM$ and $ FX$ and let $ OF$ intersect $ AC$ at $ Z$. Prove that $ F,M,Y,Z$ are concyclic.

The value of $x^2-6x+13$ can never be less than: $ \textbf{(A)}\ 4 \qquad\textbf{(B)}\ 4.5 \qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 7\qquad\textbf{(E)}\ 13 $

In a planar coordinate system, the points have non-negative integer coordinates numbered according to the figure. E.g. the point $(3,1)$ has the number $12$. [img]https://cdn.artofproblemsolving.com/attachments/a/a/28725d75f281ac4618129067037d751c8d8f83.png[/img] What is the number of the point$(x,y)$?

Triangle $ABC$ has side lengths $AB=231$, $BC=160$, and $AC=281$. Point $D$ is constructed on the opposite side of line $AC$ as point $B$ such that $AD=178$ and $CD=153$. Compute the distance from $B$ to the midpoint of segment $AD$.

How many triangles have area $ 10$ and vertices at $ (\minus{}5,0)$, $ (5,0)$, and $ (5\cos \theta, 5\sin \theta)$ for some angle $ \theta$? $ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 2\qquad \textbf{(C)}\ 4\qquad \textbf{(D)}\ 6\qquad \textbf{(E)}\ 8$

Find the folllowing limit. \[ \lim_{n\to\infty} \frac{(2n\plus{}1)\int_0^1 x^{n\minus{}1}\sin \left(\frac{\pi}{2}x\right)dx}{(n\plus{}1)^2\int_0^1 x^{n\minus{}1}\cos \left(\frac{\pi}{2}x\right)dx}\ \ (n\equal{}1,\ 2,\ \cdots).\]

In a rectangular array of points, with 5 rows and $N$ columns, the points are numbered consecutively from left to right beginning with the top row. Thus the top row is numbered 1 through $N,$ the second row is numbered $N+1$ through $2N,$ and so forth. Five points, $P_1, P_2, P_3, P_4,$ and $P_5,$ are selected so that each $P_i$ is in row $i.$ Let $x_i$ be the number associated with $P_i.$ Now renumber the array consecutively from top to bottom, beginning with the first column. Let $y_i$ be the number associated with $P_i$ after the renumbering. It is found that $x_1=y_2,$ $x_2=y_1,$ $x_3=y_4,$ $x_4=y_5,$ and $x_5=y_3.$ Find the smallest possible value of $N.$