7. Peggy picks three positive integers between $1$ and $25$, inclusive, and tells us the following information about those numbers: [list] [*] Exactly one of them is a multiple of $2$; [*] Exactly one of them is a multiple of $3$; [*] Exactly one of them is a multiple of $5$; [*] Exactly one of them is a multiple of $7$; [*] Exactly one of them is a multiple of $11$. [/list] What is the maximum possible sum of the integers that Peggy picked? 8. What is the largest positive integer $k$ such that $2^k$ divides $2^{4^8}+8^{2^4}+4^{8^2}$? 9. Find the smallest integer $n$ such that $n$ is the sum of $7$ consecutive positive integers and the sum of $12$ consecutive positive integers.

$ABCD$ is a square with sides of unit length. Points $E$ and $F$ are taken on sides $AB$ and $AD$ respectively so that $AE = AF$ and the quadrilateral $CDFE$ has maximum area. What is this maximum area?

You know that the binary function $\diamond$ takes in two non-negative integers and has the following properties: \begin{align*}0\diamond a&=1\\ a\diamond a&=0\end{align*} $\text{If } a<b, \text{ then } a\diamond b\&=(b-a)[(a-1)\diamond (b-1)].$ Find a general formula for $x\diamond y$, assuming that $y\gex>0$.

Triangle $ABC$ has sidelengths $AB=1$, $BC=\sqrt{3}$, and $AC=2$. Points $D,E$, and $F$ are chosen on $AB, BC$, and $AC$ respectively, such that $\angle EDF = \angle DFA = 90^{\circ}$. Given that the maximum possible value of $[DEF]^2$ can be expressed as $\frac{a}{b}$ for positive integers $a, b$ with $\gcd (a, b) = 1$, find $a + b$. (Here $[DEF]$ denotes the area of triangle $DEF$.) [i]Proposed by Vismay Sharan[/i]

13. The triangle with vertices $(0,0), (a,b)$, and $(a,-b)$ has area $10$. Find the sum of all possible positive integer values of $a$, given that $b$ is a positive integer. 14. Elsa is venturing into the unknown. She stands on $(0,0)$ in the coordinate plane, and each second, she moves to one of the four lattice points nearest her, chosen at random and with equal probability. If she ever moves to a lattice point she has stood on before, she has ventured back into the known, and thus stops venturing into the unknown from then on. After four seconds have passed, the probability that Elsa is still venturing into the unknown can be expressed as $\frac{a}{b}$ in simplest terms. Find $a+b$. (A lattice point is a point with integer coordinates.) 15. Let $ABCD$ be a square with side length $4$. Points $X, Y,$ and $Z$, distinct from points $A, B, C,$ and $D$, are selected on sides $AD, AB,$ and $CD$, respectively, such that $XY = 3, XZ = 4$, and $\angle YXZ = 90^{\circ}$. If $AX = \frac{a}{b}$ in simplest terms, then find $a + b$.

How many positive integers between 1 and 400 (inclusive) have exactly 15 positive integer factors?

Let $A$ and $B$ be digits between $0$ and $9$, and suppose that the product of the two-digit numbers $\overline{AB}$ and $\overline{BA}$ is equal to $k$. Given that $k+1$ is a multiple of $101$, find $k$. [i]Proposed by Andrew Wu[/i]

Consider a finite set of points $T\in\mathbb{R}^n$ contained in the $n$-dimensional unit ball centered at the origin, and let $X$ be the convex hull of $T$. Prove that for all positive integers $k$ and all points $x\in X$, there exist points $t_1, t_2, \dots, t_k\in T$, not necessarily distinct, such that their centroid \[\frac{t_1+t_2+\dots+t_k}{k}\]has Euclidean distance at most $\frac{1}{\sqrt{k}}$ from $x$. (The $n$-dimensional unit ball centered at the origin is the set of points in $\mathbb{R}^n$ with Euclidean distance at most $1$ from the origin. The convex hull of a set of points $T\in\mathbb{R}^n$ is the smallest set of points $X$ containing $T$ such that each line segment between two points in $X$ lies completely inside $X$.)

How many ways are there to fill in a $2\times 2$ square grid with the numbers $1,2,3,$ and $4$ such that the numbers in any two grid squares that share an edge have an absolute difference of at most $2$? [i]Proposed by Andrew Wu[/i]

Cat and Claire are having a conversation about Cat's favorite number. Cat says, "My favorite number is a two-digit positive integer that is the product of three distinct prime numbers!" Claire says, "I don't know your favorite number yet, but I do know that among four of the numbers that might be your favorite number, you could start with any one of them, add a second, subtract a third, and get the fourth!" Cat says, "That's cool! My favorite number is not among those four numbers, though." Claire says, "Now I know your favorite number!" What is Cat's favorite number? [i]Proposed by Andrew Wu and Andrew Milas[/i]

Suppose that $P(x)$ is a monic quadratic polynomial satisfying $aP(a) = 20P(20) = 22P(22)$ for some integer $a\neq 20, 22$. Find the minimum possible positive value of $P(0)$. [i]Proposed by Andrew Wu[/i] (Note: wording changed from original to specify that $a \neq 20, 22$.)

What quadratic polynomial whose coefficient of $x^2$ is $1$ has roots which are the complex conjugates of the solutions of $x^2 -6x+ 11 = 2xi-10i$? (Note that the complex conjugate of $a+bi$ is $a-bi$, where a and b are real numbers.)

Rice University and Stanford University write questions and corresponding solutions for a high school math tournament. The Rice group writes 10 questions every hour but make a mistake in calculating their solutions 10% of the time. The Stanford group writes 20 problems every hour and makes solution mistakes 20% of the time. Each school works for 10 hours and then sends all problems to Smartie to be checked. However, Smartie isn’t really so smart, and only 75% of the problems she thinks are wrong are actually incorrect. Smartie thinks 20% of questions from Rice have incorrect solutions, and that 10% of questions from Stanford have incorrect solutions. This problem was definitely written and solved correctly. What is the probability that Smartie thinks its solution is wrong?

10. Prair picks a three-digit palindrome $n$ at random. If the probability that $2n$ is also a palindrome can be expressed as $\frac{p}{q}$ in simplest terms, find $p + q$. (A palindrome is a number that reads the same forwards as backwards; for example, $161$ and $2992$ are palindromes, but $342$ is not.) 11. If two distinct integers are picked randomly between $1$ and $50$ inclusive, the probability that their sum is divisible by $7$ can be expressed as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$. 12. Ali is playing a game involving rolling standard, fair six-sided dice. She calls two consecutive die rolls such that the first is less than the second a "rocket." If, however, she ever rolls two consecutive die rolls such that the second is less than the first, the game stops. If the probability that Ali gets five rockets is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers, find $p+q$.

The [b]Collaptz function[/b] is defined as $$C(n) = \begin{cases} 3n - 1 & n\textrm{~odd}, \\ \frac{n}{2} & n\textrm{~even}.\end{cases}$$ We obtain the [b]Collaptz sequence[/b] of a number by repeatedly applying the Collaptz function to that number. For example, the Collaptz sequence of $13$ begins with $13, 38, 19, 56, 28, \cdots$ and so on. Find the sum of the three smallest positive integers $n$ whose Collaptz sequences do not contain $1,$ or in other words, do not [b]collaptzse[/b]. [i]Proposed by Andrew Wu and Jason Wang[/i]

The median to a 10 cm side of a triangle has length 9 cm and is perpendicular to a second median of the triangle. Find the exact value in centimeters of the length of the third median.

The Princeton University Band plays a setlist of 8 distinct songs, 3 of which are tiring to play. If the Band can't play any two tiring songs in a row, how many ways can the band play its 8 songs?

Julie runs a website where she sells university themed clothing. On Monday, she sells thirteen Stanford sweatshirts and nine Harvard sweatshirts for a total of $\$370$. On Tuesday, she sells nine Stanford sweatshirts and two Harvard sweatshirts for a total of $\$180$. On Wednesday, she sells twelve Stanford sweatshirts and six Harvard sweatshirts. If Julie didn't change the prices of any items all week, how much money did she take in (total number of dollars) from the sale of Stanford and Harvard sweatshirts on Wednesday?

Let $m>1$ be a fixed positive integer. For a nonempty string of base-ten digits $S$, let $c(S)$ be the number of ways to split $S$ into contiguous nonempty strings of digits such that the base-ten number represented by each string is divisible by $m$. These strings are allowed to have leading zeroes. In terms of $m$, what are the possible values that $c(S)$ can take? For example, if $m=2$, then $c(1234)=2$ as the splits $1234$ and $12|34$ are valid, while the other six splits are invalid.

Suppose that $a_1, a_2, a_3, \ldots$ is an infinite geometric sequence such that for all $i \ge 1$, $a_i$ is a positive integer. Suppose furthermore that $a_{20} + a_{21} = 20^{21}$. If the minimum possible value of $a_1$ can be expressed as $2^a 5^b$ for positive integers $a$ and $b$, find $a + b$. [i]Proposed by Andrew Wu[/i]

Suppose we have a pack of $2n$ cards, in the order $1, 2, . . . , 2n$. A perfect shuffle of these cards changes the order to $n+1, 1, n+2, 2, . . ., n- 1, 2n, n$ ; i.e., the cards originally in the first $n$ positions have been moved to the places $2, 4, . . . , 2n$, while the remaining $n$ cards, in their original order, fill the odd positions $1, 3, . . . , 2n - 1.$ Suppose we start with the cards in the above order $1, 2, . . . , 2n$ and then successively apply perfect shuffles. What conditions on the number $n$ are necessary for the cards eventually to return to their original order? Justify your answer. [hide="Remark"] Remark. This problem is trivial. Alternatively, it may be required to find the least number of shuffles after which the cards will return to the original order.[/hide]

Suppose that $a_1 = 1,$ $a_2 = 2$, and for any $n \ge 3$, $a_n = a_1 + a_2 + \cdots + a_{n-1}$. Find $\frac{a_{2021}}{a_{2020}}$. [i]Proposed by Andrew Wu[/i]

Find the prime factorization of $\textstyle\sum_{1\le i < j \le 100}ij$.

A student at Harvard named Kevin Was counting his stones by $11$ He messed up $n$ times And instead counted $9$s And wound up at $2007$. How many values of $n$ could make this limerick true?

Cat and Claire are having a conversation about Cat's favorite number. Cat says, "My favorite number is a two-digit positive integer with distinct nonzero digits, $\overline{AB}$, such that $A$ and $B$ are both factors of $\overline{AB}$." Claire says, "I don't know your favorite number yet, but I do know that among four of the numbers that might be your favorite number, you could start with any one of them, add a second, subtract a third, and get the fourth!" Cat says, "That's cool, and my favorite number is among those four numbers! Also, the square of my number is the product of two of the other numbers among the four you mentioned!" Claire says, "Now I know your favorite number!" What is Cat's favorite number? [i]Proposed by Andrew Wu[/i]