Let $H$ be a regular hexagon of side length $x$. Call a hexagon in the same plane a "distortion" of $H$ if and only if it can be obtained from $H$ by translating each vertex of $H$ by a distance strictly less than $1$. Determine the smallest value of $x$ for which every distortion of $H$ is necessarily convex.

Find all positive integers $n$ for which there do not exist $n$ consecutive composite positive integers less than $n!$.

For an even positive integer $n$ Kevin has a tape of length $4n$ with marks at $-2n,-2n+1,\ldots,2n-1,2n$. He then randomly picks $n$ points in the set $-n,-n+1,-n+2,\ldots,n-1,n$ and places a stone on each of these points. We call a stone 'stuck' if it is on $2n$ or $-2n$, or either all the points to the right, or all the points to the left, all contain stones. Then, every minute, Kevin shifts the unstruck stones in the following manner: [list] [*]He picks an unstuck stone uniformly at random and then flips a fair coin. [*]If the coin came up heads, he then moves that stone and every stone in the largest contiguous set containing that stone one point to the left. If the coin came up tails, he moves every stone in that set one point right instead. [*]He repeats until all the stones are stuck.[/list] Let $p_n$ be the probability that at the end of the process there are exactly $k$ stones in the right half. Evaluate \[\dfrac{p_{n-1}-p_{n-2}+p_{n-3}+\ldots+p_3-p_2+p_1}{p_{n-1}+p_{n-2}+p_{n-3}+\ldots+p_3+p_2+p_1}\] in terms of $n$.

A [i]root of unity[/i] is a complex number that is a solution to $ z^n \equal{} 1$ for some positive integer $ n$. Determine the number of roots of unity that are also roots of $ z^2 \plus{} az \plus{} b \equal{} 0$ for some integers $ a$ and $ b$.

Point $P_1$ is located $600$ miles West of point $P_2$. At $7:00\text{AM}$ a car departs from $P_1$ and drives East at a speed of $50$mph. At $8:00\text{AM}$ another car departs from $P_2$ and drives West at a constant speed of $x$ miles per hour. If the cars meet each other exactly halfway between $P_1$ and $P_2$, what is the value of $x$?

Each person in Cambridge drinks a (possibly different) $12$ ounce mixture of water and apple juice, where each drink has a positive amount of both liquids. Marc McGovern, the mayor of Cambridge, drinks $\frac{1}{6}$ of the total amount of water drunk and $\frac{1}{8}$ of the total amount of apple juice drunk. How many people are in Cambridge?

The polynomial $f(x)=x^3-3x^2-4x+4$ has three real roots $r_1$, $r_2$, and $r_3$. Let $g(x)=x^3+ax^2+bx+c$ be the polynomial which has roots $s_1$, $s_2$, and $s_3$, where $s_1=r_1+r_2z+r_3z^2$, $s_2=r_1z+r_2z^2+r_3$, $s_3=r_1z^2+r_2+r_3z$, and $z=\frac{-1+i\sqrt3}2$. Find the real part of the sum of the coefficients of $g(x)$.

Let $b$ and $c$ be real numbers and define the polynomial $P(x)=x^2+bx+c$. Suppose that $P(P(1))=P(P(2))=0$, and that $P(1) \neq P(2)$. Find $P(0)$.

For how many unordered sets $\{a,b,c,d\}$ of positive integers, none of which exceed $168$, do there exist integers $w,x,y,z$ such that $(-1)^wa+(-1)^xb+(-1)^yc+(-1)^zd=168$? If your answer is $A$ and the correct answer is $C$, then your score on this problem will be $\left\lfloor25e^{-3\frac{|C-A|}C}\right\rfloor$.

Find the number of positive integers $j\leq 3^{2013}$ such that \[j=\sum_{k=0}^m\left((-1)^k\cdot 3^{a_k}\right)\] for some strictly increasing sequence of nonnegative integers $\{a_k\}$. For example, we may write $3=3^1$ and $55=3^0-3^3+3^4$, but $4$ cannot be written in this form.

Contessa is taking a random lattice walk in the plane, starting at $(1,1)$. (In a random lattice walk, one moves up, down, left, or right $1$ unit with equal probability at each step.) If she lands on a point of the form $(6m,6n)$ for $m,n \in \mathbb{Z}$, she ascends to heaven, but if she lands on a point of the form $(6m+3,6n+3)$ for $m,n \in \mathbb{Z}$, she descends to hell. What is the probability she ascends to heaven?

Call a polygon [i]normal[/i] if it can be inscribed in a unit circle. How many non-congruent normal polygons are there such that the square of each side length is a positive integer?

For any positive integer $n$, $S_{n}$ be the set of all permutations of $\{1,2,3,\dots,n\}$. For each permutation $\pi \in S_n$, let $f(\pi)$ be the number of ordered pairs $(j,k)$ for which $\pi(j)>\pi(k)$ and $1\leq j<k \leq n$. Further define $g(\pi)$ to be the number of positive integers $k \leq n$ such that $\pi(k)\equiv k \pm 1 \pmod{n}$. Compute \[ \sum_{\pi \in S_{999}} (-1)^{f(\pi)+g(\pi)}. \]

Let $a_1, a_2, \dots$ be an arithmetic sequence and $b_1, b_2, \dots$ be a geometric sequence. Suppose that $a_1 b_1 = 20$, $a_2 b_2 = 19$, and $a_3 b_3 = 14$. Find the greatest possible value of $a_4 b_4$.

Let the sequence $a_i$ be defined as $a_{i+1} = 2^{a_i}$. Find the number of integers $1 \le n \le 1000$ such that if $a_0 = n$, then $100$ divides $a_{1000} - a_1$.

Let $ABCD$ be a cyclic quadrilateral, and suppose that $BC = CD = 2$. Let $I$ be the incenter of triangle $ABD$. If $AI = 2$ as well, find the minimum value of the length of diagonal $BD$.