Let $A_1A_2A_3A_4$ and $B_1B_2B_3B_4$ be two squares such that the boundaries of $A_1A_2A_3A_4$ and $B_1B_2B_3B_4$ does not contain any line segment. Construct 16 line segments $A_iB_j$ for each possible $i,j \in \{1,2,3,4\}$. What is the maximum number of line segments that don't intersect the edges of $A_1A_2A_3A_4$ or $B_1B_2B_3B_4$? (intersection with a vertex is not counted). [i]Proposed by Allen Zheng[/i]

Find the product of all possible real values for $k$ such that the system of equations $$x^2+y^2= 80$$ $$x^2+y^2= k+2x-8y$$ has exactly one real solution $(x,y)$. [i]Proposed by Nathan Xiong[/i]

Let $BE$ and $CF$ be altitudes in triangle $ABC$. If $AE = 24$, $EC = 60$, and $BF = 31$, determine $AF$.

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

For how many permutations $\pi$ of $\{1,2,\ldots,9\}$ does there exist an integer $N$ such that \[N\equiv \pi(i)\pmod{i}\text{ for all integers }1\leq i\leq 9?\]

In $\vartriangle ABC$, $AB = 3$, $BC = 5$, and $CA = 6$. Points $D$ and $E$ are chosen such that $ACDE$ is a square which does not overlap with $\vartriangle ABC$. The length of $BD$ can be expressed in the form $\sqrt{m + n\sqrt{p}}$, where $m$, $n$, and $p$ are positive integers and $p$ is not divisible by the square of a prime. Determine the value of $m + n + p$.

Jerry places at most one rook in each cell of a $2025 \times 2025$ grid of cells. A rook [i]attacks[/i] another rook if the two rooks are in the same row or column and there are no other rooks between them. Determine, with proof, the maximum number of rooks Jerry can place on the grid such that no rook attacks $4$ other rooks.

Solve for $x$ if $\sqrt{x + 1}+ \sqrt{x} = 5.$ [i]Proposed by Eric Oh[/i]

Jonathan finds all ordered triples $(a, b, c)$ of positive integers such that $abc = 720$. For each ordered triple, he writes their sum $a + b + c$ on the board. (Numbers may appear more than once.) What is the sum of all the numbers written on the board?

Jonathan finds all ordered triples $(a, b, c)$ of positive integers such that $abc = 720$. For each ordered triple, he writes their sum $a + b + c$ on the board. (Numbers may appear more than once.) What is the sum of all the numbers written on the board?

Construction Mayhem University has been on a mission to expand and improve its campus! The university has recently adopted a new construction schedule where a new project begins every two days. Each project will take exactly one more day than the previous one to complete (so the first project takes 3, the second takes 4, and so on.) Suppose the new schedule starts on Day 1. On which day will there first be at least $10$ projects in place at the same time?

Let $U$ be the set of all complex numbers $m$ such that the $4$ roots of $(x^2+2x+5)(x^2-2mx+25)=0$ are concyclic in the complex plane. One can show that when the points of $U$ are plotted on the complex plane, it is visualized as the finite union of some curves. Find the sum of the lengths of those curves (i.e. the perimeter of $U$).

Given $10$ points arranged in a equilateral triangular grid of side length $4$, how many ways are there to choose two distinct line segments, with endpoints on the grid, that intersect in exactly one point (not necessarily on the grid)?

Let $\triangle{ABC}$ be an acute triangle with orthocenter $H.$ Points $E$ and $F$ are on segments $\overline{AC}$ and $\overline{AB},$ respectively, such that $\angle{EHF}=90^\circ.$ Let $X$ be the foot of the perpendicular from $H$ to $\overline{EF}.$ Prove that $\angle{BXC}=90^\circ.$

In an $n \times n$ square array of $1\times1$ cells, at least one cell is colored pink. Show that you can always divide the square into rectangles along cell borders such that each rectangle contains exactly one pink cell.

Andy rolls a fair 4-sided dice, numbered 1 to 4, until he rolls a number that is less than his last roll. If the expected number of times that Andy will roll the dice can be expressed as a reduced fraction $\frac{p}{q}$, find $p + q$. Let $T = TNYWR$. The solutions in $z$ to the equation \[\left(z + \frac Tz\right)^2 = 1\] form the vertices of a quadrilateral in the complex plane. Compute the area of this quadrilateral.

There are $5$ people who start with $1, 2, 3, 4,$ and $5$ cookies, respectively. Every minute, two different people are chosen uniformly at random. If they have $a$ and $b$ cookies and $a\neq b,$ the person with more cookies eats $|a-b|$ of their own cookies. If $a = b,$ the minute still passes with nothing happening. Compute the expected number of minutes until all $5$ people have an equal number of cookies.

Let $\phi=\tfrac{1+\sqrt 5}{2}$. Find \[\left(4+\phi^{\frac12}\right)\left(4-\phi^{\frac12}\right)\left(4+i\phi^{-\frac12}\right)\left(4-i\phi^{-\frac12}\right).\]

Alice and Bob have a fair coin with sides labeled $C$ and $M$, and they flip the coin repeatedly while recording the outcomes; for example, if they flip two $C$'s then an $M$, they have $CCM$ recorded. They play the following game: Alice chooses a four-character string $\mathcal A$, then Bob chooses two distinct three-character strings $\mathcal B_1$ and $\mathcal B_2$ such that neither is a substring of $\mathcal A$. Bob wins if $\mathcal A$ shows up in the running record before either $\mathcal B_1$ or $\mathcal B_2$ do, and otherwise Alice wins. Given that Alice chooses $\mathcal A = CMMC$ and Bob plays optimally, compute the probability that Bob wins.

Quadrilateral $ABCD$ with $AC = 800$ is inscribed in a circle, and $E, W, X, Y, Z$ are the midpoints of segments $BD$, $AB$, $BC$, $CD$, $DA$, respectively. If the circumcenters of $EW Z$ and $EXY$ are $O_1$ and $O_2$, respectively, determine $O_1O_2$.

Mr. DoBa likes to listen to music occasionally while he does his math homework. When he listens to classical music, he solves one problem every $3$ minutes. When he listens to rap music, however, he only solves one problem every $5$ minutes. Mr. DoBa listens to a playlist comprised of $60\%$ classical music and $40\%$ rap music. Each song is exactly $4$ minutes long. Suppose that the expected number of problems he solves in an hour does not depend on whether or not Mr. DoBa is listening to music at any given moment, and let $m$ the average number of problems Mr. DoBa solves per minute when he is not listening to music. Determine the value of $1000m$.

Compute the remainder when $10^{2021}$ is divided by $10101$. [i]Proposed by Nathan Xiong[/i]

Four students Alice, Bob, Charlie, and Diana want to arrange themselves in a line such that Alice is at either end of the line, i.e., she is not in between two students. In how many ways can the students do this? [i]Proposed by Nathan Xiong[/i]

Recall that in any row of Pascal's Triangle, the first and last elements of the row are $1$ and each other element in the row is the sum of the two elements above it from the previous row. With this in mind, define the $\textit{Pascal Squared Triangle}$ as follows: [list] [*] In the $n^{\text{th}}$ row, where $n\geq 1$, the first and last elements of the row equal $n^2$; [*] Each other element is the sum of the two elements directly above it. [/list] The first few rows of the Pascal Squared Triangle are shown below. \[\begin{array}{c@{\hspace{7em}} c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{4pt}}c@{\hspace{2pt}} c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{3pt}}c@{\hspace{2pt}} c@{\hspace{2pt}}c} \vspace{4pt} \text{Row 1: } & & & & & & 1 & & & & & \\\vspace{4pt} \text{Row 2: } & & & & & 4 & & 4 & & & & \\\vspace{4pt} \text{Row 3: } & & & & 9 & & 8 & & 9 & & & \\\vspace{4pt} \text{Row 4: } & & &16& &17& &17& & 16& & \\\vspace{4pt} \text{Row 5: } & &25 & &33& &34 & &33 & &25 & \end{array}\] Let $S_n$ denote the sum of the entries in the $n^{\text{th}}$ row. For how many integers $1\leq n\leq 10^6$ is $S_n$ divisible by $13$?

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]