What is the largest number of acute angles that a convex hexagon can have? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4\qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$

A $1\times 2$ rectangle is inscribed in a semicircle with longer side on the diameter. What is the area of the semicircle? $\textbf{(A)}\ \frac\pi2 \qquad \textbf{(B)}\ \frac{2\pi}3 \qquad \textbf{(C)}\ \pi \qquad \textbf{(D)}\ \frac{4\pi}3 \qquad \textbf{(E)}\ \frac{5\pi}3$

An acute angle $XAY$ and a point $P$ inside the angle are given. Construct (using a ruler and a compass) a line that passes through $P$ and intersects the rays $AX$ and $AY$ at $B$ and $C$ such that the area of the triangle $ABC$ equals $AP^2$. [i]Greece[/i]

Do there exist 12 rectangular parallelepipeds $P_1,\,P_2,\ldots,P_{12}$ with edges parallel to coordinate axes $OX,\,OY,\,OZ$ such that $P_i$ and $P_j$ have a common point iff $i\ne j\pm 1$ modulo 12?

The vertices of a triangle have coordinates $(x_1,y_1)$, $(x_2,y_2)$ and $(x_3,y_3)$. For any integers $h$ and $k$, not both 0, both triangles whose vertices have coordinates $(x_1+h,y_1+k),(x_2+h,y_2+k)$ and $(x_3+h,y_3+k)$ has no common interior points with the original triangle. (a) Is it possible for the area of this triangle to be greater than $\tfrac{1}{2}$? (b) What is the maximum area of this triangle?

A knight is placed at the origin of the Cartesian plane. Each turn, the knight moves in an chess $\text{L}$-shape ($2$ units parallel to one axis and $1$ unit parallel to the other) to one of eight possible location, chosen at random. After $2016$ such turns, what is the expected value of the square of the distance of the knight from the origin?

In acute triangle $ABC$, $AB > AC$. $D$ and $E$ are the midpoints of $AB$, $AC$ respectively. The circumcircle of $ADE$ intersects the circumcircle of $BCE$ again at $P$. The circumcircle of $ADE$ intersects the circumcircle $BCD$ again at $Q$. Prove that $AP = AQ$.

Select $ n$ points on a circle independently with uniform distribution. Let $ P_n$ be the probability that the center of the circle is in the interior of the convex hull of these $ n$ points. Calculate the probabilities $ P_3$ and $ P_4$. [A. Renyi]

Let $k$ be a positive integer larger than $1$. Build an infinite set $\mathcal{A}$ of subsets of $\mathbb{N}$ having the following properties: [b](a)[/b] any $k$ distinct sets of $\mathcal{A}$ have exactly one common element; [b](b)[/b] any $k+1$ distinct sets of $\mathcal{A}$ have void intersection.

Let $P_{n}$ denote the number of paths in the coordinate plane traveling from $(0, 0)$ to $(n, 0)$ with three kinds of moves: [i]upstep[/i] $u = [1, 1]$, [i]downstep[/i] $d = [1,-1]$, and [i]flatstep[/i] $f = [1, 0]$ with the path always staying above the line $y = 0.$ Let $C_{n}= \frac{1}{n+1}\binom{2n}{n}$ be the $n^{th}$ Catalan number. Prove that $P_{n}= \sum_{i = 0}^\infty \binom{n}{2i}C_{i}$ and $C_{n}= \sum_{i = 0}^{2n}(-1)^{i}\binom{2n}{i}P_{2n-i}.$ [hide="Solution to Part 1"] Let a path string, $S_{k}$, denote a string of $u, d, f$ corresponding to upsteps, downsteps, and flatsteps of length $k$ which successfully travels from $(0, 0)$ to $(n, 0)$ without passing below $y = 0.$ Also, let each entry of a path string be a slot. Lastly, denote $u_{k}, d_{k}, f_{k}$ to be the number of upsteps, downsteps, and flatsteps, respectively, in $S_{k}.$ Note that in our situation, all such path strings are in the form $S_{n},$ so all our path strings have $n$ slots. Since the starting and ending $y$ values are the same, the number of upsteps must equal the number of downsteps. Let us observe the case when there are $2k$ downsteps and upsteps totally. Thus, there are $\binom{n}{2k}$ ways to choose the slots in which the upsteps and the downsteps appear. Now, we must arrange the downsteps and upsteps in such a way that $d_{n}= u_{n}$ and a greater number of upsteps preceed downsteps, as the path is always above $y = 0$. Note that a bijection exists between this and the number of ways to binary bracket $k$ letters. The number of binary brackets of $k$ letters is just the $k^{th}$ Catalan number. We then place the flatsteps in the rest of the slots. Thus, there are a total of $\sum_{k = 0}^\infty \binom{n}{2k}C_{k}$ ways to get an $S_{n}.$ [/hide]

Jack wants to bike from his house to Jill's house, which is located three blocks east and two blocks north of Jack's house. After biking each block, Jack can continue either east or north, but he needs to avoid a dangerous intersection one block east and one block north of his house. In how many ways can he reach Jill's house by biking a total of five blocks? $\textbf{(A) }4\qquad\textbf{(B) }5\qquad\textbf{(C) }6\qquad\textbf{(D) }8\qquad \textbf{(E) }10$

The vertices of $\triangle ABC$ are $A = (0,0)$, $B = (0,420)$, and $C = (560,0)$. The six faces of a die are labeled with two $A$'s, two $B$'s, and two $C$'s. Point $P_1 = (k,m)$ is chosen in the interior of $\triangle ABC$, and points $P_2$, $P_3$, $P_4, \dots$ are generated by rolling the die repeatedly and applying the rule: If the die shows label $L$, where $L \in \{A, B, C\}$, and $P_n$ is the most recently obtained point, then $P_{n + 1}$ is the midpoint of $\overline{P_n L}$. Given that $P_7 = (14,92)$, what is $k + m$?

Let $S$ be the set of points whose coordinates $x,$ $y,$ and $z$ are integers that satisfy $0\le x\le2,$ $0\le y\le3,$ and $0\le z\le4.$ Two distinct points are randomly chosen from $S.$ The probability that the midpoint of the segment they determine also belongs to $S$ is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Given six real numbers $a$, $b$, $c$, $x$, $y$, $z$ such that $0 < b-c < a < b+c$ and $ax + by + cz = 0$. What is the sign of the sum $ayz + bzx + cxy$ ?

What is the area of the polygon whose vertices are the points of intersection of the curves $x^2+y^2=25$ and $(x-4)^2+9y^2=81$? ${{ \textbf{(A)}\ 24\qquad\textbf{(B)}\ 27\qquad\textbf{(C)}\ 36\qquad\textbf{(D)}\ 37.5}\qquad\textbf{(E)}\ 42} $

The points $S(i, j)$ with integer Cartesian coordinates $0 < i \leq n, 0 < j \leq m, m \leq n$, form a lattice. Find the number of: [b](a)[/b] rectangles with vertices on the lattice and sides parallel to the coordinate axes; [b](b)[/b] squares with vertices on the lattice and sides parallel to the coordinate axes; [b](c)[/b] squares in total, with vertices on the lattice.

At a dance, Abhinav starts from point $(a, 0)$ and moves along the negative $x$ direction with speed $v_a$, while Pei-Hsin starts from $(0,6)$ and glides in the negative $y$-direction with speed $v_b$. What is the distance of closest approach between the two?

In the coordinate plane, denote by $ S(a)$ the area of the region bounded by the line passing through the point $ (1,\ 2)$ with the slope $ a$ and the parabola $ y\equal{}x^2$. When $ a$ varies in the range of $ 0\leq a\leq 6$, find the value of $ a$ such that $ S(a)$ is minimized.

Let $p$ be an odd prime and let $Z_{p}$ denote (the field of) integers modulo $p$. How many elements are in the set \[\{x^{2}: x \in Z_{p}\}\cap \{y^{2}+1: y \in Z_{p}\}?\]

In the figure, $ ABCD$ is a $ 2\times 2$ square, $ E$ is the midpoint of $ \overline{AD}$, and $ F$ is on $ \overline{BE}$. If $ \overline{CF}$ is perpendicular to $ \overline{BE}$, then the area of quadrilateral $ CDEF$ is [asy]defaultpen(linewidth(.8pt)); dotfactor=4; pair A = (0,2); pair B = origin; pair C = (2,0); pair D = (2,2); pair E = midpoint(A--D); pair F = foot(C,B,E); dot(A);dot(B);dot(C);dot(D);dot(E);dot(F); label("$A$",A,N);label("$B$",B,S);label("$C$",C,S);label("$D$",D,N);label("$E$",E,N);label("$F$",F,NW); draw(A--B--C--D--cycle); draw(B--E); draw(C--F); draw(rightanglemark(B,F,C,4));[/asy]$ \textbf{(A)}\ 2\qquad \textbf{(B)}\ 3 \minus{} \frac {\sqrt {3}}{2}\qquad \textbf{(C)}\ \frac {11}{5}\qquad \textbf{(D)}\ \sqrt {5}\qquad \textbf{(E)}\ \frac {9}{4}$

Let $n\geq 2$ be an integer and let $f$ be a $4n$-variable polynomial with real coefficients. Assume that, for any $2n$ points $(x_1,y_1),\dots,(x_{2n},y_{2n})$ in the Cartesian plane, $f(x_1,y_1,\dots,x_{2n},y_{2n})=0$ if and only if the points form the vertices of a regular $2n$-gon in some order, or are all equal. Determine the smallest possible degree of $f$. (Note, for example, that the degree of the polynomial $$g(x,y)=4x^3y^4+yx+x-2$$ is $7$ because $7=3+4$.) [i]Ankan Bhattacharya[/i]

Let $ABC$ be an acute triangle with altitudes $AD$, $BE$, and $CF$, and let $O$ be the center of its circumcircle. Show that the segments $OA$, $OF$, $OB$, $OD$, $OC$, $OE$ dissect the triangle $ABC$ into three pairs of triangles that have equal areas.

Let $ f: \mathbb R \to \mathbb R$ be a function, two times derivable on $ \mathbb R$ for which there exist $ c\in\mathbb R$ such that \[ \frac { f(b)\minus{}f(a) }{b\minus{}a} \neq f'(c) ,\] for all $ a\neq b \in \mathbb R$. Prove that $ f''(c)\equal{}0$.

A triangle $ABC$ is given on the plane, such that all its vertices have integer coordinates. Does there necessarily exist a straight line which intersects the straight lines $AB,$ $BC,$ and $AC$ at three distinct points with integer coordinates?

In a coordinate system there are drawn the graphs of the functions $y=ax+b$ and $y=bx+a, (a\neq b)$. Their intersection is marked with red and their intersections with the $Oy$ axis are marked with blue. Everything is erased except the marked points. Using only a ruler and a compass, find the origin of the coordinate system.