Let $ABC$ be a triangle. The incircle $\omega$ of $\triangle ABC$, which has radius $3$, is tangent to $\overline{BC}$ at $D$. Suppose the length of the altitude from $A$ to $\overline{BC}$ is $15$ and $BD^2 + CD^2 = 33$. What is $BC$?

Let $ABC$ be an acute triangle with circumcircle $\omega$. Let $D$ and $E$ be the feet of the altitudes from $B$ and $C$ onto sides $AC$ and $AB$, respectively. Lines $BD$ and $CE$ intersect $\omega$ again at points $P \neq B$ and $Q \neq C$. Suppose that $PD=3$, $QE=2$, and $AP \parallel BC$. Compute $DE$. [i]Proposed by Kyle Lee[/i]

A fair coin is flipped $6$ times. The probability that the coin lands on the same side $3$ flips in a row at some point can be expressed as a common fraction $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $100m + n$.

In the national math league, there are $7$ teams. Their season is a round robin format, where each team plays other. Find the number of ways the games could go such that they have equal number of wins. [i]Proposed by Ishin Shah[/i]

Adam places down cards one at a time from a standard 52 card deck (without replacement) in a pile. Each time he places a card, he gets points equal to the number of cards in a row immediately before his current card that are all the same suit as the current card. For instance, if there are currently two hearts on the top of the pile (and the third card in the pile is not hearts), then placing a heart would be worth 2 points, and placing a card of any other suit would be worth 0 points. What is the expected number of points Adam will have after placing all 52 cards? [i]Proposed by Adam Bertelli[/i]

Suppose Pat and Rick are playing a game in which they take turns writing numbers from $\{1, 2, \dots, 97\}$ on a blackboard. In each round, Pat writes a number, then Rick writes a number; Rick wins if the sum of all the numbers written on the blackboard after $n$ rounds is divisible by 100. Find the minimum positive value of $n$ for which Rick has a winning strategy.

Suppose that $a$ and $b$ are non-negative integers satisfying $a + b + ab + a^b = 42$. Find the sum of all possible values of $a + b$. Let $T = TNYWR$. Suppose that a sequence $\{a_n\}$ is defined via $a_1 = 11, a_2 = T$, and $a_n = a_{n-1} + 2a_{n-2}$ for $n \ge 3$. Find $a_{19} + a_{20}$.

Let $f:\mathbb{N}\to \mathbb{N}$ be a bijection satisfying $f(ab)=f(a)f(b)$ for all $a,b\in \mathbb{N}$. Determine the minimum possible value of $f(n)/n$, taken over all possible $f$ and all $n\leq 2019$.

Suppose that $$\frac{(\sqrt2)^5 + 1}{\sqrt2 + 1} \times \frac{2^5 + 1}{2 + 1} \times \frac{4^5 + 1}{4 + 1} \times \frac{16^5 + 1}{16 + 1} =\frac{m}{7 + 3\sqrt2}$$ for some integer $m$. How many $0$’s are in the binary representation of $m$? (For example, the number $20 = 10100_2$ has three $0$’s in its binary representation.)

Equilateral triangle $T_0$ with side length $3$ is on a plane. Given triangle $T_n$ on the plane, triangle $T_{n+1}$ is constructed on the plane by translating $T_n$ by $1$ unit, in one of six directions parallel to one of the sides of $T_n$. The direction is chosen uniformly at random. Let $a$ be the least integer such that at most one point on the plane is in or on all of $T_0, T_1, T_2, \ldots, T_a$. It can be shown that $a$ exists with probability $1$. Find the probability that $a$ is even. [i]Proposed by Justin Hseih[/i]

For some integer $n > 0$, a square paper of side length $2^{n}$ is repeatedly folded in half, right-to-left then bottom-to-top, until a square of side length 1 is formed. A hole is then drilled into the square at a point $\tfrac{3}{16}$ from the top and left edges, and then the paper is completely unfolded. The holes in the unfolded paper form a rectangular array of unevenly spaced points; when connected with horizontal and vertical line segments, these points form a grid of squares and rectangles. Let $P$ be a point chosen randomly from \textit{inside} this grid. Suppose the largest $L$ such that, for all $n$, the probability that the four segments $P$ is bounded by form a square is at least $L$ can be written in the form $\tfrac mn$ where $m$ and $n$ are positive relatively prime integers. Find $m+n$.

Bob has $30$ identical unit cubes. He can join two cubes together by gluing a face on one cube to a face on the other cube. He must join all the cubes together into one connected solid. Over all possible solids that Bob can build, what is the largest possible surface area of the solid? [i]Proposed by Nathan Xiong[/i]

Two right triangles are placed next to each other to form a quadrilateral as shown. What is the perimeter of the quadrilateral? [asy] size(4cm); fill((-5,0)--(0,12)--(0,6)--(8,0)--cycle, gray+opacity(0.3)); draw((0,0)--(0,12)--(-5,0)--cycle); draw((0,0)--(8,0)--(0,6)); label("5", (-2.5,0), S); label("13", (-2.5,6), dir(140)); label("6", (0,3), E); label("8", (4,0), S); [/asy] [i]Proposed by Nathan Xiong[/i]

Say an odd positive integer $n > 1$ is $\textit{twinning}$ if $p - 2 \mid n$ for every prime $p \mid n$. Find the number of twinning integers less than 250.

In a $2024 \times 2024$ grid of squares, each square is colored either black or white. An ant starts at some black square in the grid and starts walking parallel to the sides of the grid. During this walk, it can choose (not required) to turn $90^\circ$ clockwise or counterclockwise if it is currently on a black square, otherwise it must continue walking in the same direction. A coloring of the grid is called [i]simple[/i] if it is [b]not[/b] possible for the ant to arrive back at its starting location after some time. How many simple colorings of the grid are maximal, in the sense that adding any black square results in a coloring that is not simple?

Determine the maximum possible value of $$\sqrt{x}(2\sqrt{x}+\sqrt{1-x})(3\sqrt{x}+4\sqrt{1-x})$$ over all $x\in [0,1]$.

Complex numbers $\omega_1, \ldots, \omega_n$ each have magnitude $1.$ Let $z$ be a complex number distinct from $\omega_1, \ldots, \omega_n$ such that $$\frac{z+\omega_1}{z-\omega_1}+\ldots+\frac{z+\omega_n}{z-\omega_n}=0.$$ Prove that $|z|=1.$

Find the smallest positive integer $n$ for which $315^2-n^2$ evenly divides $315^3-n^3$. [i]Proposed by Kyle Lee[/i]

Jan rolls a fair six-sided die and calls the result $r$. Then, he picks real numbers $a$ and $b$ between 0 and 1 uniformly at random and independently. If the probability that the polynomial $\tfrac{x^2}{r} - x\sqrt{a} + b$ has a real root can be expressed as simplified fraction $\frac{p}{q}$, find $p$. Let $T = TNYWR$. Compute the number of ordered triples $(a,b,c)$ such that $a$, $b$, and $c$ are distinct positive integers and $a + b + c = T$.

Points $A(0,0)$ and $B(1,1)$ are located on the parabola $y=x^2$. A third point $C$ is positioned on this parabola between $A$ and $B$ such that $AC=CB=r$. What is $r^2$?

A [i]weird checkerboard[/i] is a coloring of an $8\times8$ grid constructed by making some (possibly none or all) of the following $14$ cuts: [list] [*] the $7$ vertical cuts along a gridline through the entire height of the board, [*] and the $7$ horizontal cuts along a gridline through the entire width of the board. [/list] The divided rectangles are then colored black and white such that the bottom left corner of the grid is black, and no two rectangles adjacent by an edge share a color. Compute the number of weird checkerboards that have an equal amount of area colored black and white. [center] [img]https://cdn.artofproblemsolving.com/attachments/9/b/f768a7a51c9c9bc56a1d55427c33e15e4bcd74.png[/img] [/center]

Misha is currently taking a Complexity Theory exam, but he seems to have forgotten a lot of the material! In the question, he is asked to fill in the following boxes with $\subseteq$ and $\subsetneq$ to identify the relationship between different complexity classes: $$\mathsf{NL}\ \fbox{\phantom{tt}}\ \mathsf{P}\ \fbox{\phantom{tt}}\ \mathsf{NP}\ \fbox{\phantom{tt}}\ \mathsf{PH}\ \fbox{\phantom{tt}}\ \mathsf{PSPACE}\ \fbox{\phantom{tt}}\ \mathsf {EXP}$$ and $$\mathsf{coNL}\ \fbox{\phantom{tt}}\ \mathsf{P}\ \fbox{\phantom{tt}}\ \mathsf{coNP}\ \fbox{\phantom{tt}}\ \mathsf{PH}$$ Luckily, he remembers that $\mathsf{P} \neq \mathsf{EXP}$, $\mathsf{NL} \neq \mathsf{PSPACE}$, $\mathsf{coNL} \neq \mathsf{PSPACE}$, and $\mathsf{NP} \neq \mathsf{coNP}\implies \mathsf{P}\neq \mathsf{NP} \land \mathsf{P}\neq \mathsf{coNP}$. How many ways are there for him to fill in the boxes so as not to contradict what he remembers?

Let $\mathcal{P}$ be the unique parabola in the $xy$-plane which is tangent to the $x$-axis at $(5,0)$ and to the $y$-axis at $(0,12)$. We say a line $\ell$ is $\mathcal{P}$-friendly if the $x$-axis, $y$-axis, and $\mathcal{P}$ divide $\ell$ into three segments, each of which has equal length. If the sum of the slopes of all $\mathcal{P}$-friendly lines can be written in the form $-\tfrac mn$ for $m$ and $n$ positive relatively prime integers, find $m+n$.

For a positive integer $k$, define the $k$-[i]pop[/i] of a positive integer $n$ as the infinite sequence of integers $a_1, a_2, ...$ such that $a_1 = n$ and $$a_{i+1}= \left\lfloor \frac{a_i}{k} \right\rfloor , i = 1, 2, ..$$ where $ \lfloor x\rfloor $ denotes the greatest integer less than or equal to $x$. Furthermore, define a positive integer $m$ to be $k$-[i]pop avoiding[/i] if $k$ does not divide any nonzero term in the $k$-pop of $m$. For example, $14$ is 3-pop avoiding because $3$ does not divide any nonzero term in the $3$-pop of $14$, which is $14, 4, 1, 0, 0, ....$ Suppose that the number of positive integers less than $13^{2018}$ which are $13$-pop avoiding is equal to N. What is the remainder when $N$ is divided by $1000$?

Suppose we have a cubic polynomial $p(x)$ such that $p(0)=0,p(1)=1,$ and $p(x)\leq \sqrt x$ for $0\leq x \leq 1.$ Suppose $p(0.5)$ is maximized. What is the sum of $p(0.25)+p(0.75)?$ [i]Proposed by Ishin Shah[/i]