In a group of nine people each person shakes hands with exactly two of the other people from the group. Let N be the number of ways this handshaking can occur. Consider two handshaking arrangements different if and only if at least two people who shake hands under one arrangement do not shake hands under the other arrangement. Find the remainder when N is divided by 1000.

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

An isosceles trapezoid $ABCD$ with bases $AB$ and $CD$ has $AB=13$, $CD=17$, and height $3$. Let $E$ be the intersection of $AC$ and $BD$. Circles $\Omega$ and $\omega$ are circumscribed about triangles $ABE$ and $CDE$. Compute the sum of the radii of $\Omega$ and $\omega$.

Let $n$ be a fixed positive integer, and choose $n$ positive integers $a_1, \ldots , a_n$. Given a permutation $\pi$ on the first $n$ positive integers, let $S_{\pi}=\{i\mid \frac{a_i}{\pi(i)} \text{ is an integer}\}$. Let $N$ denote the number of distinct sets $S_{\pi}$ as $\pi$ ranges over all such permutations. Determine, in terms of $n$, the maximum value of $N$ over all possible values of $a_1, \ldots , a_n$. [i]Proposed by James Lin.[/i]

Your math friend Steven rolls five fair icosahedral dice (each of which is labelled $1,2, \dots,20$ on its sides). He conceals the results but tells you that at least half the rolls are $20$. Suspicious, you examine the first two dice and find that they show $20$ and $19$ in that order. Assuming that Steven is truthful, what is the probability that all three remaining concealed dice show $20$?

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

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.

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]

Can the set of lattice points $\{(x, y) \mid x, y \in \mathbb{Z}, 1 \le x, y \le 252, x \neq y\}$ be colored using 10 distinct colors such that for all $a \neq b$, $b \neq c$, the colors of $(a, b)$ and $(b, c)$ are distinct?

Find all ordered triples $(a,b,c)$ of positive reals that satisfy: $\lfloor a\rfloor bc=3,a\lfloor b\rfloor c=4$, and $ab\lfloor c\rfloor=5$, where $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$.

The three points $A, B, C$ form a triangle. $AB=4, BC=5, AC=6$. Let the angle bisector of $\angle A$ intersect side $BC$ at $D$. Let the foot of the perpendicular from $B$ to the angle bisector of $\angle A$ be $E$. Let the line through $E$ parallel to $AC$ meet $BC$ at $F$. Compute $DF$.

Nathaniel and Obediah play a game in which they take turns rolling a fair six-sided die and keep a running tally of the sum of the results of all rolls made. A player wins if, after he rolls, the number on the running tally is a multiple of 7. Play continues until either player wins, or else indenitely. If Nathaniel goes first, determine the probability that he ends up winning.

25. Chris and Paul each rent a different room of a hotel from rooms $1 - 60$. However, the hotel manager mistakes them for one person and gives ”Chris Paul” a room with Chris’s and Paul’s room concatenated. For example, if Chris had $15$ and Paul had $9$, ”Chris Paul” has $159$. If there are $360$ rooms in the hotel, what is the probability that ”Chris Paul” has a valid room? 26. Find the number of ways to choose two nonempty subsets $X$ and $Y$ of $\{1, 2, \ldots , 2001\}$, such that $|Y| = 1001$ and the smallest element of $Y$ is equal to the largest element of $X$. 27. Let $r_1, r_2, r_3, r_4$ be the four roots of the polynomial $x^4 - 4x^3 + 8x^2 - 7x + 3$. Find the value of $$\frac{r_1^2}{r_2^2+r_3^2+r_4^2}+\frac{r_2^2}{r_1^2+r_3^2+r_4^2}+\frac{r_3^2}{r_1^2+r_2^2+r_4^2}+\frac{r_4^2}{r_1^2+r_2^2+r_3^2}$$

Let $f(x) = x^2 + 6x + 7$. Determine the smallest possible value of $f(f(f(f(x))))$ over all real numbers $x.$

Denote by $\mathbb{N}$ the positive integers. Let $f:\mathbb{N} \rightarrow \mathbb{N}$ be a function such that, for any $w,x,y,z \in \mathbb{N}$, \[ f(f(f(z)))f(wxf(yf(z)))=z^{2}f(xf(y))f(w). \] Show that $f(n!) \ge n!$ for every positive integer $n$. [i]Pakawut Jiradilok[/i]

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