Find the smallest positive integer $n$ such that $\dfrac{5^{n+1}+2^{n+1}}{5^n+2^n}>4.99$.

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.

The lines $y=x$, $y=2x$, and $y=3x$ are the three medians of a triangle with perimeter $1$. Find the length of the longest side of the triangle.

Let $ABC$ be a triangle with $AB = 13$, $BC = 14$, $CA = 15$. Let $H$ be the orthocenter of $ABC$. Find the radius of the circle with nonzero radius tangent to the circumcircles of $AHB$, $BHC$, $CHA$.

4. A square can be divided into four congruent figures as shown: [asy] size(2cm); draw((0,0)--(2,0)--(2,2)--(0,2)--cycle); draw((1,0)--(1,2)); draw((0,1)--(2,1)); [/asy] For how many $n$ with $1 \le n \le 100$ can a unit square be divided into $n$ congruent figures? 5. If $x + 2y - 3z = 7$ and $2x - y + 2z = 6$, determine $8x + y$. 6. Let $ABCD$ be a rectangle, and let $E$ and $F$ be points on segment $AB$ such that $AE = EF = FB$. If $CE$ intersects the line $AD$ at $P$, and $PF$ intersects $BC$ at $Q$, determine the ratio of $BQ$ to $CQ$.

Steph Curry is playing the following game and he wins if he has exactly $5$ points at some time. Flip a fair coin. If heads, shoot a $3$-point shot which is worth $3$ points. If tails, shoot a free throw which is worth $1$ point. He makes $\frac12$ of his $3$-point shots and all of his free throws. Find the probability he will win the game. (Note he keeps flipping the coin until he has exactly $5$ or goes over $5$ points)

Let $A = \{1,2,\ldots,2011\}$. Find the number of functions $f$ from $A$ to $A$ that satisfy $f(n) \le n$ for all $n$ in $A$ and attain exactly $2010$ distinct values.

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

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

Compute the value of $1^{25}+2^{24}+3^{23}+\ldots+24^2+25^1$. If your answer is $A$ and the correct answer is $C$, then your score on this problem will be $\left\lfloor25\min\left(\left(\frac AC\right)^2,\left(\frac CA\right)^2\right)\right\rfloor$.

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$?

Let \[ A = \frac{1}{6}((\log_2(3))^3-(\log_2(6))^3-(\log_2(12))^3+(\log_2(24))^3) \]. Compute $2^A$.

In a rectangular box $ABCDEFGH$ with edge lengths $AB = AD = 6$ and $AE = 49$, a plane slices through point $A$ and intersects edges $BF$, $FG$, $GH$, $HD$ at points $P$, $Q$, $R$, $S$ respectively. Given that $AP = AS$ and $PQ = QR = RS$, find the area of pentagon $APQRS$.

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.

Circles $C_1$, $C_2$, $C_3$ have radius $ 1$ and centers $O, P, Q$ respectively. $C_1$ and $C_2$ intersect at $A$, $C_2$ and $C_3$ intersect at $B$, $C_3$ and $C_1$ intersect at $C$, in such a way that $\angle APB = 60^o$ , $\angle BQC = 36^o$ , and $\angle COA = 72^o$ . Find angle $\angle ABC$ (degrees).

Let $p > 2$ be a prime number. $\mathbb{F}_p[x]$ is defined as the set of polynomials in $x$ with coefficients in $\mathbb{F}_p$ (the integers modulo $p$ with usual addition and subtraction), so that two polynomials are equal if and only if the coefficients of $x^k$ are equal in $\mathbb{F}_p$ for each nonnegative integer $k$. For example, $(x+2)(2x+3) = 2x^2 + 2x + 1$ in $\mathbb{F}_5[x]$ because the corresponding coefficients are equal modulo 5. Let $f, g \in \mathbb{F}_p[x]$. The pair $(f, g)$ is called [i]compositional[/i] if \[f(g(x)) \equiv x^{p^2} - x\] in $\mathbb{F}_p[x]$. Find, with proof, the number of compositional pairs.

Each cell of a $3 $ × $3$ grid is labeled with a digit in the set {$1, 2, 3, 4, 5$} Then, the maximum entry in each row and each column is recorded. Compute the number of labelings for which every digit from $1$ to $5$ is recorded at least once.

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?

Given points $a$ and $b$ in the plane, let $a\oplus b$ be the unique point $c$ such that $abc$ is an equilateral triangle with $a,b,c$ in the clockwise orientation. Solve $(x\oplus (0,0))\oplus(1,1)=(1,-1)$ for $x$.

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.

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.

Let $S$ be the sum of all the real coefficients of the expansion of $(1+ix)^{2009}$. What is $\log_2(S)$?

Let $R$ be the region in the Cartesian plane of points $(x,y)$ satisfying $x\geq 0$, $y\geq 0$, and $x+y+\lfloor x\rfloor+\lfloor y\rfloor\leq 5$. Determine the area of $R$.

Compute \[\sum_{a_1=0}^\infty\sum_{a_2=0}^\infty\cdots\sum_{a_7=0}^\infty\dfrac{a_1+a_2+\cdots+a_7}{3^{a_1+a_2+\cdots+a_7}}.\]

28. The numbers $1-10$ are written in a circle randomly. Find the expected number of numbers which are at least $2$ larger than an adjacent number. 29. We want to design a new chess piece, the American, with the property that (i) the American can never attack itself, and (ii) if an American $A_1$ attacks another American $A_2$, then $A_2$ also attacks $A_1$. Let $m$ be the number of squares that an American attacks when placed in the top left corner of an 8 by 8 chessboard. Let $n$ be the maximal number of Americans that can be placed on the $8$ by $8$ chessboard such that no Americans attack each other, if one American must be in the top left corner. Find the largest possible value of $mn$. 30. On the blackboard, Amy writes $2017$ in base-$a$ to get $133201_a$. Betsy notices she can erase a digit from Amy’s number and change the base to base-$b$ such that the value of the the number remains the same. Catherine then notices she can erase a digit from Betsy’s number and change the base to base-$c$ such that the value still remains the same. Compute, in decimal, $a + b + c$.