Find the integer closest to \[\frac{1}{\sqrt[4]{5^4+1}-\sqrt[4]{5^4-1}}\]

Let $W$ be the hypercube $\{(x_1,x_2,x_3,x_4)\,|\,0\leq x_1,x_2,x_3,x_4\leq 1\}$. The intersection of $W$ and a hyperplane parallel to $x_1+x_2+x_3+x_4=0$ is a non-degenerate $3$-dimensional polyhedron. What is the maximum number of faces of this polyhedron?

Let $ABCD$ be a square of side length $13$. Let $E$ and $F$ be points on rays $AB$ and $AD$ respectively, so that the area of square $ABCD$ equals the area of triangle $AEF$. If $EF$ intersects $BC$ at $X$ and $BX = 6$, determine $DF$.

For a positive integer $N$, we color the positive divisors of $N$ (including 1 and $N$) with four colors. A coloring is called [i]multichromatic[/i] if whenever $a$, $b$ and $\gcd(a, b)$ are pairwise distinct divisors of $N$, then they have pairwise distinct colors. What is the maximum possible number of multichromatic colorings a positive integer can have if it is not the power of any prime?

22. Let the function $f : \mathbb{Z} \to \mathbb{Z}$ take only integer inputs and have integer outputs. For any integers $x$ and $y$, f satisfies $$f(x) + f(y) = f(x + 1) + f(y - 1)$$ If $f(2016) = 6102$ and $f(6102) = 2016$, what is $f(1)$? 23. Let $d$ be a randomly chosen divisor of $2016$. Find the expected value of $$\frac{d^2}{d^2 + 2016}$$ 24. Consider an infinite grid of equilateral triangles. Each edge (that is, each side of a small triangle) is colored one of $N$ colors. The coloring is done in such a way that any path between any two nonadjecent vertices consists of edges with at least two different colors. What is the smallest possible value of $N$?

Let $x$ and $y$ be positive real numbers. Define $a = 1 + \tfrac{x}{y}$ and $b = 1 + \tfrac{y}{x}$. If $a^2 + b^2 = 15$, compute $a^3 + b^3$.

Theseus starts at the point $(0, 0)$ in the plane. If Theseus is standing at the point $(x, y)$ in the plane, he can step one unit to the north to point $(x, y+1)$, one unit to the west to point $(x-1, y)$, one unit to the south to point $(x, y-1)$, or one unit to the east to point $(x+1, y)$. After a sequence of more than two such moves, starting with a step one unit to the south (to point $(0, -1)$), Theseus finds himself back at the point $(0, 0)$. He never visited any point other than $(0, 0)$ more than once, and never visited the point $(0, 0)$ except at the start and end of this sequence of moves. Let $X$ be the number of times that Theseus took a step one unit to the north, and then a step one unit to the west immediately afterward. Let $Y$ be the number of times that Theseus took a step one unit to the west, and then a step one unit to the north immediately afterward. Prove that $|X - Y| = 1$. [i]Mitchell Lee[/i]

Let $ABCD$ be a parallelogram with $AB=8$, $AD=11$, and $\angle BAD=60^\circ$. Let $X$ be on segment $CD$ with $CX/XD=1/3$ and $Y$ be on segment $AD$ with $AY/YD=1/2$. Let $Z$ be on segment $AB$ such that $AX$, $BY$, and $DZ$ are concurrent. Determine the area of triangle $XYZ$.

Let $P$ be an odd-degree integer-coefficient polynomial. Suppose that $xP(x)=yP(y)$ for infinitely many pairs $x,y$ of integers with $x\ne y$. Prove that the equation $P(x)=0$ has an integer root. [i]Victor Wang[/i]

Find the number of strictly increasing sequences of nonnegative integers with the following properties: • The first term is $0$ and the last term is $12$. In particular, the sequence has at least two terms. • Among any two consecutive terms, exactly one of them is even.

How many rearrangements of the letters of "$HMMTHMMT$" do not contain the substring "$HMMT$"? (For instance, one such arrangement is $HMMHMTMT$.)

Mark and William are playing a game with a stored value. On his turn, a player may either multiply the stored value by $2$ and add $1$ or he may multiply the stored value by $4$ and add $3$. The first player to make the stored value exceed $2^{100}$ wins. The stored value starts at $1$ and Mark goes first. Assuming both players play optimally, what is the maximum number of times that William can make a move? (By optimal play, we mean that on any turn the player selects the move which leads to the best possible outcome given that the opponent is also playing optimally. If both moves lead to the same outcome, the player selects one of them arbitrarily.)

Quadrilateral $ABCD$ satisfies $AB = 8, BC = 5, CD = 17, DA = 10$. Let $E$ be the intersection of $AC$ and $BD$. Suppose $BE : ED = 1 : 2$. Find the area of $ABCD$.

Let $P_1P_2 \ldots P_8$ be a convex octagon. An integer $i$ is chosen uniformly at random from $1$ to $7$, inclusive. For each vertex of the octagon, the line between that vertex and the vertex $i$ vertices to the right is painted red. What is the expected number times two red lines intersect at a point that is not one of the vertices, given that no three diagonals are concurrent?

We have $10$ points on a line $A_1,A_2\ldots A_{10}$ in that order. Initially there are $n$ chips on point $A_1$. Now we are allowed to perform two types of moves. Take two chips on $A_i$, remove them and place one chip on $A_{i+1}$, or take two chips on $A_{i+1}$, remove them, and place a chip on $A_{i+2}$ and $A_i$ . Find the minimum possible value of $n$ such that it is possible to get a chip on $A_{10}$ through a sequence of moves.

Let $N$ be a positive integer whose decimal representation contains $11235$ as a contiguous substring, and let $k$ be a positive integer such that $10^k>N$. Find the minimum possible value of \[\dfrac{10^k-1}{\gcd(N,10^k-1)}.\]

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)$.

Compute the prime factorization of $1007021035035021007001$. (You should write your answer in the form $p_1^{e_1}p_2^{e_2}\ldots p_k^{e_k}$ where $p_1,\ldots,p_k$ are distinct prime numbers and $e_1,\ldots,e_k$ are positive integers.)

In the Generic Math Tournament, $99$ people participate. One of the participants, Alfred, scores 16th in Algebra, 30th in Combinatorics, and 23rd in Geometry (and does not tie with anyone). The overall ranking is computed by adding the scores from all three tests. Given this information, let $B$ be the best ranking that Alfred could have achieved, and let $W$ be the worst ranking that he could have achieved. Compute $100B+W$. [i]Proposed by Lewis Chen[/i]

Let $z$ be a non-real complex number with $z^{23}=1$. Compute \[\sum_{k=0}^{22}\dfrac{1}{1+z^k+z^{2k}}.\]

In the game of Guess the Card, two players each have a $\frac{1}{2}$ chance of winning and there is exactly one winner. Sixteen competitors stand in a circle, numbered $1,2,\dots,16$ clockwise. They participate in an $4$-round single-elimination tournament of Guess the Card. Each round, the referee randomly chooses one of the remaining players, and the players pair off going clockwise, starting from the chosen one; each pair then plays Guess the Card and the losers leave the circle. If the probability that players $1$ and $9$ face each other in the last round is $\frac{m}{n}$ where $m,n$ are positive integers, find $100m+n$. [i]Proposed by Evan Chen[/i]

The numbers $1, 2\ldots11$ are arranged in a line from left to right in a random order. It is observed that the middle number is larger than exactly one number to its left. Find the probability that it is larger than exactly one number to its right.

Seven lattice points form a convex heptagon with all sides having distinct lengths. Find the minimum possible value of the sum of the squares of the sides of the heptagon.

I have five different pairs of socks. Every day for five days, I pick two socks at random without replacement to wear for the day. Find the probability that I wear matching socks on both the third day and the fifth day.

Let $\triangle ABC$ be a triangle with $\angle BAC>90^{\circ}$, $AB=5$ and $AC=7$. Points $D$ and $E$ lie on segment $BC$ such that $BD=DE=EC$. If $\angle BAC+\angle DAE=180^{\circ}$, compute $BC$.