Define a function $f: \mathbb{N} \rightarrow \mathbb{N}$ to be $f(x)=(x+1)!-x!$. Find the number of positive integers $x<49$ such that $f(x)$ divides $f(49)$. [i]Proposed by David Tang[/i]

Suppose integers $a < b < c$ satisfy \[ a + b + c = 95\qquad\text{and}\qquad a^2 + b^2 + c^2 = 3083.\] Find $c$.

Amy has a six-sided die which always rolls values greater than or equal to the previous roll. She rolls the die repeatedly until she rolls a $6$. Find the expected value of the sum of all distinct values she has rolled when she finishes.

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?

The value of \[\frac{1}{20}-\frac{1}{21}+\frac{1}{20\times 21}\] can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by Nathan Xiong[/i]

Let $ABCD$ be a unit square, and suppose that $E$ and $F$ are on $\overline{AD}$ and $\overline{AB}$ such that $AE = AF = \tfrac23$. Let $\overline{CE}$ and $\overline{DF}$ intersect at $G$. If the area of $\triangle CFG$ can be expressed as simplified fraction $\frac{p}{q}$, find $p + q$. Let $T = TNYWR$. A total of $2T$ students go on a road trip. They take two cars, each of which seats $T$ people. Call two students \textit{friendly} if they sat together in the same car going to the trip and in the same car going back home. What is the smallest possible number of friendly pairs of students on the trip?

Let $\omega_1$ and $\omega_2$ be two circles intersecting at distinct points $A$ and $B.$ Point $X$ varies along $\omega_1,$ and point $Y$ is chosen on $\omega_2$ such that $AB$ bisects angle $\angle{XAY}.$ Prove that as $X$ varies along $\omega_1,$ the circumcenter of $\triangle{AXY}$ (if it exists) varies along a fixed line.

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]

Evaluate \[2^{7}\times 3^{0}+2^{6}\times 3^{1}+2^{5}\times 3^{2}+\cdots+2^{0}\times 3^{7}.\] [i]Proposed by Nathan Xiong[/i]

The binomial coefficient $\tbinom{n}{k}$ can be defined as the coefficient of $x^k$ in the expansion of $(1+x)^n.$ Similarly, define the trinomial coefficient $\tbinom{n}{k}_3$ as the coefficient of $x^k$ in the expansion of $(1+x+x^2)^n.$ Determine the number of integers $k$ with $0 \le k \le 4048$ such that $\tbinom{2024}{k}_3 \equiv 1 \pmod{3}.$

Suppose that k and x are positive integers such that $$\frac{k}{2}=\left( \sqrt{1 +\frac{\sqrt3}{2}}\right)^x+\left( \sqrt{1 -\frac{\sqrt3}{2}}\right)^x.$$ Find the sum of all possible values of $k$

Compute the sum of all integers $x$ for which there exists an integer $y$ such that \[x^3+xy+y^3=503.\] [i]Proposed by Nathan Xiong[/i]

The integers from $1$ to $9$ are arranged in a $3\times3$ grid. The rows and columns of the grid correspond to $6$ three-digit numbers, reading rows from left to right, and columns from top to bottom. Compute the least possible value of the largest of the $6$ numbers.

Consider an $m \times n$ grid of unit squares. Let $R$ be the total number of rectangles of any size, and let $S$ be the total number of squares of any size. Assume that the sides of the rectangles and squares are parallel to the sides of the $m \times n$ grid. If $\frac{R}{S} =\frac{759}{50}$ , then determine $mn$.

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

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.

Across all $x \in \mathbb{R}$, find the maximum value of the expression $$\sin x + \sin 3x + \sin 5x.$$

In a game of ping-pong, the score is $4-10$. Six points later, the score is $10-10$. You remark that it was impressive that I won the previous $6$ points in a row, but I remark back that you have won $n$ points in a row. What the largest value of $n$ such that this statement is true regardless of the order in which the points were distributed?

For any integer $a$, let $f(a) = |a^4 - 36a^2 + 96a - 64|$. What is the sum of all values of $f(a)$ that are prime? [i]Proposed by Alexander Wang[/i]

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?\]

Let $F_n$ denote the $n$th Fibonacci number, with $F_0=0, F_1=1$ and $F_{n}=F_{n-1}+F_{n-2}$ for $n \geq 2$. There exists a unique two digit prime $p$ such that for all $n$, $p | F_{n+100} + F_n$. Find $p$. [i]Proposed by Sam Rosenstrauch[/i]

Vincent is playing a game with Evil Bill. The game uses an infinite number of red balls, an infinite number of green balls, and a very large bag. Vincent first picks two nonnegative integers $g$ and $k$ such that $g < k \le 2016$, and Evil Bill places $g$ green balls and $2016 - g$ red balls in the bag, so that there is a total of $2016$ balls in the bag. Vincent then picks a ball of either color and places it in the bag. Evil Bill then inspects the bag. If the ratio of green balls to total balls in the bag is ever exactly $\frac{k}{2016}$ , then Evil Bill wins. If the ratio of green balls to total balls is greater than $\frac{k}{2016}$ , then Vincent wins. Otherwise, Vincent and Evil Bill repeat the previous two actions (Vincent picks a ball and Evil Bill inspects the bag). If $S$ is the sum of all possible values of $k$ that Vincent could choose and be able to win, determine the largest prime factor of $S$.

Compute the sum of all integers $x$ for which there exists an integer $y$ such that \[x^3+xy+y^3=503.\] [i]Proposed by Nathan Xiong[/i]

Consider the polynomial \[P(x)=x^3+3x^2+6x+10.\] Let its three roots be $a$, $b$, $c$. Define $Q(x)$ to be the monic cubic polynomial with roots $ab$, $bc$, $ca$. Compute $|Q(1)|$. [i]Proposed by Nathan Xiong[/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$.