Determine all $n \in \mathbb{Z}^+$ such that a regular hexagon (i.e. all sides equal length, all interior angles same size) can be partitioned in finitely many $n-$gons such that they can be composed into $n$ congruent regular hexagons in a non-overlapping way upon certain rotations and translations.

[asy] size(200); dotfactor=3; pair A=(0,0),B=(1,0),C=(2,0),D=(3,0),X=(1.2,0.7); draw(A--D); dot(A);dot(B);dot(C);dot(D); draw(arc((0.4,0.4),0.4,180,110),arrow = Arrow(TeXHead)); draw(arc((2.6,0.4),0.4,0,70),arrow = Arrow(TeXHead)); draw(B--X,dotted); draw(C--X,dotted); label("$A$",A,SW); label("$B$",B,S); label("$C$",C,S); label("$D$",D,S); label("x",X,fontsize(5pt)); //Credit to TheMaskedMagician for the diagram [/asy] Points $A , B, C$, and $D$ are distinct and lie, in the given order, on a straight line. Line segments $AB, AC$, and $AD$ have lengths $x, y$, and $z$ , respectively. If line segments $AB$ and $CD$ may be rotated about points $B$ and $C$, respectively, so that points $A$ and $D$ coincide, to form a triangle with positive area, then which of the following three inequalities must be satisfied? $\textbf{I. }x<\frac{z}{2}\qquad\textbf{II. }y<x+\frac{z}{2}\qquad\textbf{III. }y<\frac{z}{2}$ $\textbf{(A) }\textbf{I. }\text{only}\qquad\textbf{(B) }\textbf{II. }\text{only}\qquad$ $\textbf{(C) }\textbf{I. }\text{and }\textbf{II. }\text{only}\qquad\textbf{(D) }\textbf{II. }\text{and }\textbf{III. }\text{only}\qquad\textbf{(E) }\textbf{I. },\textbf{II. },\text{and }\textbf{III. }$

Consider a sphere and a plane $\pi$. For a variable point $M \in \pi$, exterior to the sphere, one considers the circular cone with vertex in $M$ and tangent to the sphere. Find the locus of the centers of all circles which appear as tangent points between the sphere and the cone. [i]Octavian Stanasila[/i]

A square $ R$ of sidelength $ 250$ lies inside a square $ Q$ of sidelength $ 500$. Prove that: One can always find two points $ A$ and $ B$ on the perimeter of $ Q$ such that the segment $ AB$ has no common point with the square $ R$, and the length of this segment $ AB$ is greater than $ 521$.

A country has $n$ cities, labelled $1,2,3,\dots,n$. It wants to build exactly $n-1$ roads between certain pairs of cities so that every city is reachable from every other city via some sequence of roads. However, it is not permitted to put roads between pairs of cities that have labels differing by exactly $1$, and it is also not permitted to put a road between cities $1$ and $n$. Let $T_n$ be the total number of possible ways to build these roads. (a) For all odd $n$, prove that $T_n$ is divisible by $n$. (b) For all even $n$, prove that $T_n$ is divisible by $n/2$.

Several figures can be made by attaching two equilateral triangles to the regular pentagon $ ABCDE$ in two of the five positions shown. How many non-congruent figures can be constructed in this way? [asy]unitsize(2cm); pair A=dir(306); pair B=dir(234); pair C=dir(162); pair D=dir(90); pair E=dir(18); draw(A--B--C--D--E--cycle,linewidth(.8pt)); draw(E--rotate(60,D)*E--D--rotate(60,C)*D--C--rotate(60,B)*C--B--rotate(60,A)*B--A--rotate(60,E)*A--cycle,linetype("4 4")); label("$A$",A,SE); label("$B$",B,SW); label("$C$",C,WNW); label("$D$",D,N); label("$E$",E,ENE);[/asy]$ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Let $ABCD$ be a parallelogram. Construct the equilateral triangle $DCE$ on the side $DC$ and outside of parallelogram. Let $P$ be an arbitrary point in plane of $ABCD$. Show that \[PA+PB+AD \geq PE.\]

Two circles of different radii are cut out of cardboard. Each circle is subdivided into $200$ equal sectors. On each circle $100$ sectors are painted white and the other $100$ are painted black. The smaller circle is then placed on top of the larger circle, so that their centers coincide. Show that one can rotate the small circle so that the sectors on the two circles line up and at least $100$ sectors on the small circle lie over sectors of the same color on the big circle.

Ten distinct points are placed on a circle. All ten of the points are paired so that the line segments connecting the pairs do not intersect. In how many different ways can this pairing be done? [asy] import graph; size(12cm); real labelscalefactor = 0.5; pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); pen dotstyle = black; draw((2.46,0.12)--(3.05,-0.69)); draw((2.46,1.12)--(4,-1)); draw((5.54,0.12)--(4.95,-0.69)); draw((3.05,1.93)--(5.54,1.12)); draw((4.95,1.93)--(4,2.24)); draw((8.05,1.93)--(7.46,1.12)); draw((7.46,0.12)--(8.05,-0.69)); draw((9,2.24)--(9,-1)); draw((9.95,-0.69)--(9.95,1.93)); draw((10.54,1.12)--(10.54,0.12)); draw((15.54,1.12)--(15.54,0.12)); draw((14.95,-0.69)--(12.46,0.12)); draw((13.05,-0.69)--(14,-1)); draw((12.46,1.12)--(14.95,1.93)); draw((14,2.24)--(13.05,1.93)); label("1",(-1.08,2.03),SE*labelscalefactor); label("2",(-0.3,1.7),SE*labelscalefactor); label("3",(0.05,1.15),SE*labelscalefactor); label("4",(0.00,0.38),SE*labelscalefactor); label("5",(-0.33,-0.12),SE*labelscalefactor); label("6",(-1.08,-0.4),SE*labelscalefactor); label("7",(-1.83,-0.19),SE*labelscalefactor); label("8",(-2.32,0.48),SE*labelscalefactor); label("9",(-2.3,1.21),SE*labelscalefactor); label("10",(-1.86,1.75),SE*labelscalefactor); dot((-1,-1),dotstyle); dot((-0.05,-0.69),dotstyle); dot((0.54,0.12),dotstyle); dot((0.54,1.12),dotstyle); dot((-0.05,1.93),dotstyle); dot((-1,2.24),dotstyle); dot((-1.95,1.93),dotstyle); dot((-2.54,1.12),dotstyle); dot((-2.54,0.12),dotstyle); dot((-1.95,-0.69),dotstyle); dot((4,-1),dotstyle); dot((4.95,-0.69),dotstyle); dot((5.54,0.12),dotstyle); dot((5.54,1.12),dotstyle); dot((4.95,1.93),dotstyle); dot((4,2.24),dotstyle); dot((3.05,1.93),dotstyle); dot((2.46,1.12),dotstyle); dot((2.46,0.12),dotstyle); dot((3.05,-0.69),dotstyle); dot((9,-1),dotstyle); dot((9.95,-0.69),dotstyle); dot((10.54,0.12),dotstyle); dot((10.54,1.12),dotstyle); dot((9.95,1.93),dotstyle); dot((9,2.24),dotstyle); dot((8.05,1.93),dotstyle); dot((7.46,1.12),dotstyle); dot((7.46,0.12),dotstyle); dot((8.05,-0.69),dotstyle); dot((14,-1),dotstyle); dot((14.95,-0.69),dotstyle); dot((15.54,0.12),dotstyle); dot((15.54,1.12),dotstyle); dot((14.95,1.93),dotstyle); dot((14,2.24),dotstyle); dot((13.05,1.93),dotstyle); dot((12.46,1.12),dotstyle); dot((12.46,0.12),dotstyle); dot((13.05,-0.69),dotstyle);[/asy]

An $n$-stick is a connected figure consisting of $n$ matches of length $1$ which are placed horizontally or vertically and no two touch each other at points other than their ends. Two shapes that can be transformed into each other by moving, rotating or flipping are considered the same. An $n$-mino is a shape which is built by connecting $n$ squares of side length 1 on their sides such that there's a path on the squares between each two squares of the $n$-mino. Let $S_n$ be the number of $n$-sticks and $M_n$ the number of $n$-minos, e.g. $S_3=5$ And $M_3=2$. (a) Prove that for any natural $n$, $S_n \geq M_{n+1}$. (b) Prove that for large enough $n$ we have $(2.4)^n \leq S_n \leq (16)^n$. A [b]grid segment[/b] is a segment on the plane of length 1 which it's both ends are integer points. A polystick is called [b]wise[/b] if using it and it's rotations or flips we can cover all grid segments without overlapping, otherwise it's called [b]unwise[/b]. (c) Prove that there are at least $2^{n-6}$ different unwise $n$-sticks. (d) Prove that any polystick which is in form of a path only going up and right is wise. (e) Extra points: Prove that for large enough $n$ we have $3^n \leq S_n \leq 12^n$ Time allowed for this exam was 2 hours.

Adam, Benin, Chiang, Deshawn, Esther, and Fiona have internet accounts. Some, but not all, of them are internet friends with each other, and none of them has an internet friend outside this group. Each of them has the same number of internet friends. In how many different ways can this happen? $ \textbf{(A)}\ 60 \qquad\textbf{(B)}\ 170 \qquad\textbf{(C)}\ 290 \qquad\textbf{(D)}\ 320 \qquad\textbf{(E)}\ 660 $

Given triangle $ ABC$. Points $ D,E,F$ outside triangle $ ABC$ are chosen such that triangles $ ABD$, $ BCE$, and $ CAF$ are equilateral triangles. Prove that cicumcircles of these three triangles are concurrent.

Let $n \geq 6$ and $3 \leq p < n - p$ be two integers. The vertices of a regular $n$-gon are colored so that $p$ vertices are red and the others are black. Prove that there exist two congruent polygons with at least $[p/2] + 1$ vertices, one with all the vertices red and the other with all the vertices black.

In the coordinate space, define a square $S$, defined by the inequality $|x|\leq 1,\ |y|\leq 1$ on the $xy$-plane, with four vertices $A(-1,\ 1,\ 0),\ B(1,\ 1,\ 0),\ C(1,-1,\ 0), D(-1,-1,\ 0)$. Let $V_1$ be the solid by a rotation of the square $S$ about the line $BD$ as the axis of rotation, and let $V_2$ be the solid by a rotation of the square $S$ about the line $AC$ as the axis of rotation. (1) For a real number $t$ such that $0\leq t<1$, find the area of cross section of $V_1$ cut by the plane $x=t$. (2) Find the volume of the common part of $V_1$ and $V_2$.

Let $z$ be a complex number with $|z| = 2014$. Let $P$ be the polygon in the complex plane whose vertices are $z$ and every $w$ such that $\tfrac{1}{z+w} = \tfrac{1}{z} + \tfrac{1}{w}$. Then the area enclosed by $P$ can be written in the form $n\sqrt{3},$ where $n$ is an integer. Find the remainder when $n$ is divided by $1000$.

In a plane, there are $n \geq 3$ circular beer mats $B_{1}, B_{2}, ..., B_{n}$ of equal size. $B_{k}$ touches $B_{k+1}$ ($k=1,2,...,n$); $B_{n+1}=B_{1}$. The beer mats are placed such that another beer mat $B$ of equal size touches all of them in the given order if rolling along the outside of the chain of beer mats. How many rotations $B$ makes untill it returns to it's starting position¿

Square $ABCD$ is rotated $20^\circ$ clockwise about its center to obtain square $EFGH$, as shown below. What is the degree measure of $\angle EAB$? [asy] size(170); defaultpen(linewidth(0.6)); real r = 25; draw(dir(135)--dir(45)--dir(315)--dir(225)--cycle); draw(dir(135-r)--dir(45-r)--dir(315-r)--dir(225-r)--cycle); label("$A$",dir(135),NW); label("$B$",dir(45),NE); label("$C$",dir(315),SE); label("$D$",dir(225),SW); label("$E$",dir(135-r),N); label("$F$",dir(45-r),E); label("$G$",dir(315-r),S); label("$H$",dir(225-r),W); [/asy] $\textbf{(A) }20^\circ\qquad\textbf{(B) }30^\circ\qquad\textbf{(C) }32^\circ\qquad\textbf{(D) }35^\circ\qquad\textbf{(E) }45^\circ$

Let $r$ be a rational number in the interval $[-1,1]$ and let $\theta = \cos^{-1} r$. Call a subset $S$ of the plane [i]good[/i] if $S$ is unchanged upon rotation by $\theta$ around any point of $S$ (in both clockwise and counterclockwise directions). Determine all values of $r$ satisfying the following property: The midpoint of any two points in a good set also lies in the set.

Let $ C$ be the parameterized curve for a given positive number $ r$ and $ 0\leq t\leq \pi$, $ C: \left\{\begin{array}{ll} x \equal{} 2r(t \minus{} \sin t\cos t) & \quad \\ y \equal{} 2r\sin ^ 2 t & \quad \end{array} \right.$ When the point $ P$ moves on the curve $ C$, (1) Find the magnitude of acceleralation of the point $ P$ at time $ t$. (2) Find the length of the locus by which the point $ P$ sweeps for $ 0\leq t\leq \pi$. (3) Find the volume of the solid by rotation of the region bounded by the curve $ C$ and the $ x$-axis about the $ x$-axis. Edited.

Let $T$ be the triangle in the coordinate plane with vertices $\left(0,0\right)$, $\left(4,0\right)$, and $\left(0,3\right)$. Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}$, $180^{\circ}$, and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$-axis, and reflection across the $y$-axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by a reflection across the $y$-axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by another reflection across the $x$-axis will not return $T$ to its original position.) $\textbf{(A) } 12\qquad\textbf{(B) } 15\qquad\textbf{(C) }17 \qquad\textbf{(D) }20 \qquad\textbf{(E) }25$

Eight congruent equilateral triangles, each of a different color, are used to construct a regular octahedron. How many distinguishable ways are there to construct the octahedron? (Two colored octahedrons are distinguishable if neither can be rotated to look just like the other.) [asy]import three; import math; size(180); defaultpen(linewidth(.8pt)); currentprojection=orthographic(2,0.2,1); triple A=(0,0,1); triple B=(sqrt(2)/2,sqrt(2)/2,0); triple C=(sqrt(2)/2,-sqrt(2)/2,0); triple D=(-sqrt(2)/2,-sqrt(2)/2,0); triple E=(-sqrt(2)/2,sqrt(2)/2,0); triple F=(0,0,-1); draw(A--B--E--cycle); draw(A--C--D--cycle); draw(F--C--B--cycle); draw(F--D--E--cycle,dotted+linewidth(0.7));[/asy]$ \textbf{(A)}\ 210 \qquad \textbf{(B)}\ 560 \qquad \textbf{(C)}\ 840 \qquad \textbf{(D)}\ 1260 \qquad \textbf{(E)}\ 1680$

Let $ABC$ be an equilateral triangle with side length $1$. This triangle is rotated by some angle about its center to form triangle $DEF.$ The intersection of $ABC$ and $DEF$ is an equilateral hexagon with an area that is $\frac{4} {5}$ the area of $ABC.$ The side length of this hexagon can be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. What is $m+n$? [i]Author: Ray Li[/i]

We want to paint some identically-sized cubes so that each face of each cube is painted a solid color and each cube is painted with six different colors. If we have seven different colors to choose from, how many distinguishable cubes can we produce?

As illustrated below, we can dissect every triangle $ABC$ into four pieces so that piece 1 is a triangle similar to the original triangle, while the other three pieces can be assembled into a triangle also similar to the original triangle. Determine the ratios of the sizes of the three triangles and verify that the construction works. [asy] import olympiad;size(350);defaultpen(linewidth(0.7)+fontsize(10)); path p=origin--(13,0)--(9,8)--cycle; path p2=rotate(180)*p, p3=shift(-26,0)*scale(2)*p, p4=shift(-27,-24)*scale(3)*p, p1=shift(-53,-24)*scale(4)*p; pair A=(-53,-24), B=(-8,16), C=(12,-24), D=(-17,8), E=(-1,-24), F=origin, G=(-13,0), H=(-9,-8); label("1", centroid(A,D,E)); label("2", centroid(F,G,H)); label("3", (-10,6)); label("4", (0,-15)); draw(p2^^p3^^p4); filldraw(p1, white, black); pair point = centroid(F,G,H); label("$\mathbf{A}$", A, dir(point--A)); label("$\mathbf{B}$", B, dir(point--B)); label("$\mathbf{C}$", C, dir(point--C)); label("$\mathbf{D}$", D, dir(point--D)); label("$\mathbf{E}$", E, dir(point--E)); label("$\mathbf{F}$", F, dir(point--F)); label("$\mathbf{G}$", G, dir(point--G)); label("$\mathbf{H}$", H, dir(point--H)); real x=90; draw(shift(x)*p1); label("1", centroid(shift(x)*A,shift(x)*D,shift(x)*E)); draw(shift(130,0)*p4); draw(shift(130,0)*shift(-27,-24)*p); draw(shift(130,0)*shift(-1,-24)*p3); label("2", shift(130,0)*shift(-27,-24)*centroid(F,(9,8),(13,0))); label("3", shift(130,0)*shift(-1,-24)*(-10,6)); label("4", shift(130,0)*(0,-15)); label("Piece 2 rotated $180^\circ$", (130,10));[/asy]

Chitoge is painting a cube; she can paint each face either black or white, but she wants no vertex of the cube to be touching three faces of the same color. In how many ways can Chitoge paint the cube? Two paintings of a cube are considered to be the same if you can rotate one cube so that it looks like the other cube.