HMMT November 2018

What is the largest factor of 130000 that does not contain the digit 0 or 5 ?

Twenty-seven players are randomly split into three teams of nine. Given that Zack is on a different team from Mihir and Mihir is on a different team from Andrew, what is the probability that Zack and Andrew are on the same team?

A square in the $x y$-plane has area $A$, and three of its vertices have $x$-coordinates 2,0 , and 18 in some order. Find the sum of all possible values of $A$.

Find the number of eight-digit positive integers that are multiples of 9 and have all distinct digits.

Compute the smallest positive integer $n$ for which

$$\sqrt{100+\sqrt{n}}+\sqrt{100-\sqrt{n}}$$

is an integer.

Call a polygon normal 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?

Anders is solving a math problem, and he encounters the expression $\sqrt{15!}$. He attempts to simplify this radical by expressing it as $a \sqrt{b}$ where $a$ and $b$ are positive integers. The sum of all possible distinct values of $a b$ can be expressed in the form $q \cdot 15$ ! for some rational number $q$. Find $q$.

Equilateral triangle $A B C$ has circumcircle $\Omega$. Points $D$ and $E$ are chosen on minor arcs $A B$ and $A C$ of $\Omega$ respectively such that $B C=D E$. Given that triangle $A B E$ has area 3 and triangle $A C D$ has area 4 , find the area of triangle $A B C$.

20 players are playing in a Super Smash Bros. Melee tournament. They are ranked $1-20$, and player $n$ will always beat player $m$ if $n<m$. Out of all possible tournaments where each player plays 18 distinct other players exactly once, one is chosen uniformly at random. Find the expected number of pairs of players that win the same number of games.

Real numbers $x, y$, and $z$ are chosen from the interval $[-1,1]$ independently and uniformly at random. What is the probability that

$$|x|+|y|+|z|+|x+y+z|=|x+y|+|y+z|+|z+x| ?$$

Square $C A S H$ and regular pentagon $M O N E Y$ are both inscribed in a circle. Given that they do not share a vertex, how many intersections do these two polygons have?

Consider the addition problem:

	C	A	S	H
+			M	E
O	S	I	D	E

where each letter represents a base-ten digit, and $C, M, O \neq 0$. (Distinct letters are allowed to represent the same digit) How many ways are there to assign values to the letters so that the addition problem is true?

$H O W, B O W$, and $D A H$ are equilateral triangles in a plane such that $W O=7$ and $A H=2$. Given that $D, A, B$ are collinear in that order, find the length of $B A$.

I have two cents and Bill has $n$ cents. Bill wants to buy some pencils, which come in two different packages. One package of pencils costs 6 cents for 7 pencils, and the other package of pencils costs a dime for a dozen pencils (i.e. 10 cents for 12 pencils). Bill notes that he can spend all $n$ of his cents on some combination of pencil packages to get $P$ pencils. However, if I give my two cents to Bill, he then notes that he can instead spend all $n+2$ of his cents on some combination of pencil packages to get fewer than $P$ pencils. What is the smallest value of $n$ for which this is possible? Note: Both times Bill must spend all of his cents on pencil packages, i.e. have zero cents after either purchase.

Lil Wayne, the rain god, determines the weather. If Lil Wayne makes it rain on any given day, the probability that he makes it rain the next day is $75 \%$. If Lil Wayne doesn't make it rain on one day, the probability that he makes it rain the next day is $25 \%$. He decides not to make it rain today. Find the smallest positive integer $n$ such that the probability that Lil Wayne makes it rain $n$ days from today is greater than $49.9 \%$.

Farmer James invents a new currency, such that for every positive integer $n \leq 6$, there exists an $n$-coin worth $n$ ! cents. Furthermore, he has exactly $n$ copies of each $n$-coin. An integer $k$ is said to be nice if Farmer James can make $k$ cents using at least one copy of each type of coin. How many positive integers less than 2018 are nice?

Ben "One Hunna Dolla" Franklin is flying a kite KITE such that $I E$ is the perpendicular bisector of $K T$. Let $I E$ meet $K T$ at $R$. The midpoints of $K I, I T, T E, E K$ are $A, N, M, D$, respectively. Given that $[M A K E]=18, I T=10,[R A I N]=4$, find $[D I M E]$.

Note: $[X]$ denotes the area of the figure $X$.

Crisp All, a basketball player, is dropping dimes and nickels on a number line. Crisp drops a dime on every positive multiple of 10 , and a nickel on every multiple of 5 that is not a multiple of 10 . Crisp then starts at 0 . Every second, he has a $\frac{2}{3}$ chance of jumping from his current location $x$ to $x+3$, and a $\frac{1}{3}$ chance of jumping from his current location $x$ to $x+7$. When Crisp jumps on either a dime or a nickel, he stops jumping. What is the probability that Crisp stops on a dime?

Circle $\omega_{1}$ of radius 1 and circle $\omega_{2}$ of radius 2 are concentric. Godzilla inscribes square $C A S H$ in $\omega_{1}$ and regular pentagon $M O N E Y$ in $\omega_{2}$. It then writes down all 20 (not necessarily distinct) distances between a vertex of $C A S H$ and a vertex of $M O N E Y$ and multiplies them all together. What is the maximum possible value of his result?

One million bucks (i.e. one million male deer) are in different cells of a $1000 \times 1000$ grid. The left and right edges of the grid are then glued together, and the top and bottom edges of the grid are glued together, so that the grid forms a doughnut-shaped torus. Furthermore, some of the bucks are honest bucks, who always tell the truth, and the remaining bucks are dishonest bucks, who never tell the truth. Each of the million bucks claims that "at most one of my neighboring bucks is an honest buck." A pair of neighboring bucks is said to be buckaroo if exactly one of them is an honest buck. What is the minimum possible number of buckaroo pairs in the grid? Note: Two bucks are considered to be neighboring if their cells $\left(x_{1}, y_{1}\right)$ and $\left(x_{2}, y_{2}\right)$ satisfy either: $x_{1}=x_{2}$ and $y_{1}-y_{2} \equiv \pm 1(\bmod 1000)$, or $x_{1}-x_{2} \equiv \pm 1(\bmod 1000)$ and $y_{1}=y_{2}$.

Four standard six-sided dice are rolled. Find the probability that, for each pair of dice, the product of the two numbers rolled on those dice is a multiple of 4.

Alice starts with the number 0 . She can apply 100 operations on her number. In each operation, she can either add 1 to her number, or square her number. After applying all operations, her score is the minimum distance from her number to any perfect square. What is the maximum score she can attain?

For how many positive integers $n \leq 100$ is it true that $10 n$ has exactly three times as many positive divisors as $n$ has?

Let $a$ and $b$ be real numbers greater than 1 such that $a b=100$. The maximum possible value of $a^{\left(\log _{10} b\right)^{2}}$ can be written in the form $10^{x}$ for some real number $x$. Find $x$.

Find the sum of all positive integers $n$ such that $1+2+\cdots+n$ divides

$$15\left[(n+1)^{2}+(n+2)^{2}+\cdots+(2 n)^{2}\right] .$$

Triangle $\triangle P Q R$, with $P Q=P R=5$ and $Q R=6$, is inscribed in circle $\omega$. Compute the radius of the circle with center on $\overline{Q R}$ which is tangent to both $\omega$ and $\overline{P Q}$.

A $5 \times 5$ grid of squares is filled with integers. Call a rectangle corner-odd if its sides are grid lines and the sum of the integers in its four corners is an odd number. What is the maximum possible number of corner-odd rectangles within the grid? Note: A rectangle must have four distinct corners to be considered corner-odd; i.e. no $1 \times k$ rectangle can be corner-odd for any positive integer $k$.

Tessa has a unit cube, on which each vertex is labeled by a distinct integer between 1 and 8 inclusive. She also has a deck of 8 cards, 4 of which are black and 4 of which are white. At each step she draws a card from the deck, and

• if the card is black, she simultaneously replaces the number on each vertex by the sum of the three numbers on vertices that are distance 1 away from this vertex;
• if the card is white, she simultaneously replaces the number on each vertex by the sum of the three numbers on vertices that are distance $\sqrt{2}$ away from this vertex.

When Tessa finishes drawing all cards of the deck, what is the maximum possible value of a number that is on the cube?

Let $A, B, C$ be points in that order along a line, such that $A B=20$ and $B C=18$. Let $\omega$ be a circle of nonzero radius centered at $B$, and let $\ell_{1}$ and $\ell_{2}$ be tangents to $\omega$ through $A$ and $C$, respectively. Let $K$ be the intersection of $\ell_{1}$ and $\ell_{2}$. Let $X$ lie on segment $\overline{K A}$ and $Y$ lie on segment $\overline{K C}$ such that $X Y \| B C$ and $X Y$ is tangent to $\omega$. What is the largest possible integer length for $X Y$ ?

David and Evan are playing a game. Evan thinks of a positive integer $N$ between 1 and 59, inclusive, and David tries to guess it. Each time David makes a guess, Evan will tell him whether the guess is greater than, equal to, or less than $N$. David wants to devise a strategy that will guarantee that he knows $N$ in five guesses. In David's strategy, each guess will be determined only by Evan's responses to any previous guesses (the first guess will always be the same), and David will only guess a number which satisfies each of Evan's responses. How many such strategies are there? Note: David need not guess $N$ within his five guesses; he just needs to know what $N$ is after five guesses.

A positive integer is called primer if it has a prime number of distinct prime factors. Find the smallest primer number.

Pascal has a triangle. In the $n$th row, there are $n+1$ numbers $a_{n, 0}, a_{n, 1}, a_{n, 2}, \ldots, a_{n, n}$ where $a_{n, 0}=a_{n, n}=1$. For all $1 \leq k \leq n-1, a_{n, k}=a_{n-1, k}-a_{n-1, k-1}$. What is the sum of all numbers in the 2018th row?

An $n \times m$ maze is an $n \times m$ grid in which each cell is one of two things: a wall, or a blank. A maze is solvable if there exists a sequence of adjacent blank cells from the top left cell to the bottom right cell going through no walls. (In particular, the top left and bottom right cells must both be blank.) Determine the number of solvable $2 \times 2$ mazes.

Let $a, b, c, n$ be positive real numbers such that $\frac{a+b}{a}=3, \frac{b+c}{b}=4$, and $\frac{c+a}{c}=n$. Find $n$.

Jerry has ten distinguishable coins, each of which currently has heads facing up. He chooses one coin and flips it over, so it now has tails facing up. Then he picks another coin (possibly the same one as before) and flips it over. How many configurations of heads and tails are possible after these two flips?

An equilateral hexagon with side length 1 has interior angles $90^{\circ}, 120^{\circ}, 150^{\circ}, 90^{\circ}, 120^{\circ}, 150^{\circ}$ in that order. Find its area.

At Easter-Egg Academy, each student has two eyes, each of which can be eggshell, cream, or cornsilk. It is known that $30 \%$ of the students have at least one eggshell eye, $40 \%$ of the students have at least one cream eye, and $50 \%$ of the students have at least one cornsilk eye. What percentage of the students at Easter-Egg Academy have two eyes of the same color?

Pentagon $J A M E S$ is such that $A M=S J$ and the internal angles satisfy $\angle J=\angle A=\angle E=90^{\circ}$, and $\angle M=\angle S$. Given that there exists a diagonal of $J A M E S$ that bisects its area, find the ratio of the shortest side of $J A M E S$ to the longest side of $J A M E S$.

Farmer James has some strange animals. His hens have 2 heads and 8 legs, his peacocks have 3 heads and 9 legs, and his zombie hens have 6 heads and 12 legs. Farmer James counts 800 heads and 2018 legs on his farm. What is the number of animals that Farmer James has on his farm?

Abbot writes the letter $A$ on the board. Every minute, he replaces every occurrence of $A$ with $A B$ and every occurrence of $B$ with $B A$, hence creating a string that is twice as long. After 10 minutes, there are $2^{10}=1024$ letters on the board. How many adjacent pairs are the same letter?

Let $\triangle A B C$ be an acute triangle, with $M$ being the midpoint of $\overline{B C}$, such that $A M=B C$. Let $D$ and $E$ be the intersection of the internal angle bisectors of $\angle A M B$ and $\angle A M C$ with $A B$ and $A C$, respectively. Find the ratio of the area of $\triangle D M E$ to the area of $\triangle A B C$.

Consider an unusual biased coin, with probability $p$ of landing heads, probability $q \leq p$ of landing tails, and probability $\frac{1}{6}$ of landing on its side (i.e. on neither face). It is known that if this coin is flipped twice, the likelihood that both flips will have the same result is $\frac{1}{2}$. Find $p$.

Find the smallest positive integer $n$ for which

$$1!2!\cdots(n-1)!>n!^{2}$$

Call a triangle nice if the plane can be tiled using congruent copies of this triangle so that any two triangles that share an edge (or part of an edge) are reflections of each other via the shared edge. How many dissimilar nice triangles are there?

On a computer screen is the single character a. The computer has two keys: c (copy) and p (paste), which may be pressed in any sequence. Pressing $p$ increases the number of a's on screen by the number that were there the last time $c$ was pressed. c doesn't change the number of a's on screen. Determine the fewest number of keystrokes required to attain at least 2018 a's on screen. (Note: pressing p before the first press of c does nothing).

A positive integer is called primer if it has a prime number of distinct prime factors. A positive integer is called primest if it has a primer number of distinct primer factors. Find the smallest primest number.

Pascal has a triangle. In the $n$th row, there are $n+1$ numbers $a_{n, 0}, a_{n, 1}, a_{n, 2}, \ldots, a_{n, n}$ where $a_{n, 0}=a_{n, n}=1$. For all $1 \leq k \leq n-1, a_{n, k}=a_{n-1, k}-a_{n-1, k-1}$. What is the sum of the absolute values of all numbers in the 2018th row?

An $n \times m$ maze is an $n \times m$ grid in which each cell is one of two things: a wall, or a blank. A maze is solvable if there exists a sequence of adjacent blank cells from the top left cell to the bottom right cell going through no walls. (In particular, the top left and bottom right cells must both be blank.) Determine the number of solvable $2 \times 5$ mazes.

Let $A$ be the number of unordered pairs of ordered pairs of integers between 1 and 6 inclusive, and let $B$ be the number of ordered pairs of unordered pairs of integers between 1 and 6 inclusive. (Repetitions are allowed in both ordered and unordered pairs.) Find $A-B$.

Let $z$ be a complex number. In the complex plane, the distance from $z$ to 1 is 2 , and the distance from $z^{2}$ to 1 is 6 . What is the real part of $z$ ?

A function $f:\{1,2,3,4,5\} \rightarrow\{1,2,3,4,5\}$ is said to be nasty if there do not exist distinct $a, b \in\{1,2,3,4,5\}$ satisfying $f(a)=b$ and $f(b)=a$. How many nasty functions are there?

In a square of side length 4 , a point on the interior of the square is randomly chosen and a circle of radius 1 is drawn centered at the point. What is the probability that the circle intersects the square exactly twice?

Let $S$ be a subset with four elements chosen from $\{1,2, \ldots, 10\}$. Michael notes that there is a way to label the vertices of a square with elements from $S$ such that no two vertices have the same label, and the labels adjacent to any side of the square differ by at least 4 . How many possibilities are there for the subset $S$ ?

Let $A B C D$ be a convex quadrilateral so that all of its sides and diagonals have integer lengths. Given that $\angle A B C=\angle A D C=90^{\circ}, A B=B D$, and $C D=41$, find the length of $B C$.

Let $a_{0}, a_{1}, \ldots$ and $b_{0}, b_{1}, \ldots$ be geometric sequences with common ratios $r_{a}$ and $r_{b}$, respectively, such that

$$\sum_{i=0}^{\infty} a_{i}=\sum_{i=0}^{\infty} b_{i}=1 \text { and } \left(\sum_{i=0}^{\infty} a_{i}^{2}\right)\left(\sum_{i=0}^{\infty} b_{i}^{2}\right)=\sum_{i=0}^{\infty} a_{i} b_{i} .$$

Find the smallest real number $c$ such that $a_{0}<c$ must be true.

Points $E, F, G, H$ are chosen on segments $A B, B C, C D, D A$, respectively, of square $A B C D$. Given that segment $E G$ has length 7 , segment $F H$ has length 8 , and that $E G$ and $F H$ intersect inside $A B C D$ at an acute angle of $30^{\circ}$, then compute the area of square $A B C D$.

At lunch, Abby, Bart, Carl, Dana, and Evan share a pizza divided radially into 16 slices. Each one takes takes one slice of pizza uniformly at random, leaving 11 slices. The remaining slices of pizza form "sectors" broken up by the taken slices, e.g. if they take five consecutive slices then there is one sector, but if none of them take adjacent slices then there will be five sectors. What is the expected number of sectors formed?

What is the 3 -digit number formed by the $9998^{\text {th }}$ through $10000^{\text {th }}$ digits after the decimal point in the decimal expansion of $\frac{1}{998}$ ? Note: Make sure your answer has exactly three digits, so please include any leading zeroes if necessary.

An isosceles right triangle $A B C$ has area 1. Points $D, E, F$ are chosen on $B C, C A, A B$ respectively such that $D E F$ is also an isosceles right triangle. Find the smallest possible area of $D E F$.

Let $n$ be a positive integer. Let there be $P_{n}$ ways for Pretty Penny to make exactly $n$ dollars out of quarters, dimes, nickels, and pennies. Also, let there be $B_{n}$ ways for Beautiful Bill to make exactly $n$ dollars out of one dollar bills, quarters, dimes, and nickels. As $n$ goes to infinity, the sequence of fractions $\frac{P_{n}}{B_{n}}$ approaches a real number $c$. Find $c$. Note: Assume both Pretty Penny and Beautiful Bill each have an unlimited number of each type of coin. Pennies, nickels, dimes, quarters, and dollar bills are worth $1,5,10,25,100$ cents respectively.

David and Evan each repeatedly flip a fair coin. David will stop when he flips a tail, and Evan will stop once he flips 2 consecutive tails. Find the probability that David flips more total heads than Evan.

Over all real numbers $x$ and $y$, find the minimum possible value of

$$(x y)^{2}+(x+7)^{2}+(2 y+7)^{2}$$

Let $A B C$ be a triangle with $A B=20, B C=10, C A=15$. Let $I$ be the incenter of $A B C$, and let $B I$ meet $A C$ at $E$ and $C I$ meet $A B$ at $F$. Suppose that the circumcircles of $B I F$ and $C I E$ meet at a point $D$ different from $I$. Find the length of the tangent from $A$ to the circumcircle of $D E F$.

A positive integer is called primer if it has a prime number of distinct prime factors. A positive integer is called primest if it has a primer number of distinct primer factors. A positive integer is called prime-minister if it has a primest number of distinct primest factors. Let $N$ be the smallest prime-minister number. Estimate $N$. An estimate of $E>0$ earns $\left\lfloor 20 \min \left(\frac{N}{E}, \frac{E}{N}\right)\right\rfloor$ points.

Pascal has a triangle. In the $n$th row, there are $n+1$ numbers $a_{n, 0}, a_{n, 1}, a_{n, 2}, \ldots, a_{n, n}$ where $a_{n, 0}=a_{n, n}=1$. For all $1 \leq k \leq n-1, a_{n, k}=a_{n-1, k}-a_{n-1, k-1}$. Let $N$ be the value of the sum

$$\sum_{k=0}^{2018} \frac{\left|a_{2018, k}\right|}{\binom{2018}{k}} .$$

Estimate $N$. An estimate of $E>0$ earns $\left\lfloor 20 \cdot 2^{-|N-E| / 70}\right\rfloor$ points.

An $n \times m$ maze is an $n \times m$ grid in which each cell is one of two things: a wall, or a blank. A maze is solvable if there exists a sequence of adjacent blank cells from the top left cell to the bottom right cell going through no walls. (In particular, the top left and bottom right cells must both be blank.) Let $N$ be the number of solvable $5 \times 5$ mazes. Estimate $N$. An estimate of $E>0$ earns $\left\lfloor 20 \min \left(\frac{N}{E}, \frac{E}{N}\right)^{2}\right\rfloor$ points.