Let $ABC$ be an acute triangle (with $AB \ne AC$) and $M$ be the midpoint of $BC$. The circle of diameter $AM$ cuts $AC$ at $N$ and $BC$ again at $H$. A point $K$ is taken on $AC$ (between $A$ and $N$) such that $CN = NK$. Segments $AH$ and $BK$ intersect at $L$. The circle that passes through $A$,$K$ and $L$ cuts $AB$ at $P$. Prove that $C$,$L$ and $P$ are collinear.

The incircle of triangle $ABC$ for which $AB\neq AC$, is tangent to sides $BC,CA$ and $AB$ in points $D,E$ and $F$ respectively. Perpendicular from $D$ to $EF$ intersects side $AB$ at $X$, and the second intersection point of circumcircles of triangles $AEF$ and $ABC$ is $T$. Prove that $TX\perp TF$. [i]Proposed By Pedram Safaei[/i]

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]

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]

4. Suppose that $\overline{A2021B}$ is a six-digit integer divisible by $9$. Find the maximum possible value of $A \cdot B$. 5. In an arbitrary triangle, two distinct segments are drawn from each vertex to the opposite side. What is the minimum possible number of intersection points between these segments? 6. Suppose that $a$ and $b$ are positive integers such that $\frac{a}{b-20}$ and $\frac{b+21}{a}$ are positive integers. Find the maximum possible value of $a + b$.

Kara rolls a six-sided die, and if on that first roll she rolls an $n$, she rolls the die $n-1$ more times. She then computes that the product of all her rolls, including the first, is $8$. How many distinct sequences of rolls could Kara have rolled? [i]Proposed by Andrew Wu[/i]

Georgina calls a $992$-element subset $A$ of the set $S = \{1, 2, 3, \ldots , 1984\}$ a [b]halfthink set[/b] if [list] [*] the sum of the elements in $A$ is equal to half of the sum of the elements in $S$, and [*] exactly one pair of elements in $A$ differs by $1$. [/list] She notices that for some values of $n$, with $n$ a positive integer between $1$ and $1983$, inclusive, there are no halfthink sets containing both $n$ and $n+1$. Find the last three digits of the product of all possible values of $n$. [i]Proposed by Andrew Wu and Jason Wang[/i] (Note: wording changed from original to specify what $n$ can be.)

For nonnegative integers $n$ and $k$, define $Q(n, k)$ to be the coefficient of $x^{k}$ in the expansion $(1+x+x^{2}+x^{3})^{n}$. Prove that $Q(n, k) = \sum_{j=0}^{k}\binom{n}{j}\binom{n}{k-2j}$. [hide="hint"] Think of $\binom{n}{j}$ as the number of ways you can pick the $x^{2}$ term in the expansion.[/hide]

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]

Four students from Harvard, one of them named Jack, and five students from MIT, one of them named Jill, are going to see a Boston Celtics game. However, they found out that only $ 5$ tickets remain, so $ 4$ of them must go back. Suppose that at least one student from each school must go see the game, and at least one of Jack and Jill must go see the game, how many ways are there of choosing which $ 5$ people can see the game?

A box of strawberries, containing $12$ strawberries total, costs $\$ 2$. A box of blueberries, containing $48$ blueberries total, costs $ \$ 3$. Suppose that for $\$ 12$, Sareen can either buy $m$ strawberries total or $n$ blueberries total. Find $n - m$. [i]Proposed by Andrew Wu[/i]

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?

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

Suppose two circles $\Omega_1$ and $\Omega_2$ with centers $O_1$ and $O_2$ have radii $3$ and $4$, respectively. Suppose that points $A$ and $B$ lie on circles $\Omega_1$ and $\Omega_2$, respectively, such that segments $AB$ and $O_1O_2$ intersect and that $AB$ is tangent to $\Omega_1$ and $\Omega_2$. If $O_1O_2=25$, find the area of quadrilateral $O_1AO_2B$. [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ import graph; size(12cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -12.81977592804657, xmax = 32.13023014338037, ymin = -14.185056097058798, ymax = 12.56855801985179; /* image dimensions */ /* draw figures */ draw(circle((-3.4277328104418046,-1.4524996726688195), 3), linewidth(1.2)); draw(circle((21.572267189558197,-1.4524996726688195), 4), linewidth(1.2)); draw((-2.5877328104418034,1.4275003273311748)--(20.452267189558192,-5.2924996726687885), linewidth(1.2)); /* dots and labels */ dot((-3.4277328104418046,-1.4524996726688195),linewidth(3pt) + dotstyle); label("$O_1$", (-4.252707018231291,-1.545940604327141), N * labelscalefactor); dot((21.572267189558197,-1.4524996726688195),linewidth(3pt) + dotstyle); label("$O_2$", (21.704189347819636,-1.250863978037686), NE * labelscalefactor); dot((-2.5877328104418034,1.4275003273311748),linewidth(3pt) + dotstyle); label("$A$", (-2.3937351324858342,1.6999022848568643), NE * labelscalefactor); dot((20.452267189558192,-5.2924996726687885),linewidth(3pt) + dotstyle); label("$B$", (20.671421155806545,-4.9885012443707835), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy] [i]Proposed by Deyuan Li and Andrew Milas[/i]

Your team receives up to $100$ points total for the team round. To play this minigame for up to $10$ bonus points, you must decide how to construct an optimal army with number of soldiers equal to the points you receive. Construct an army of $100$ soldiers with $5$ flanks; thus your army is the union of battalions $B_1$, $B_2$, $B_3$, $B_4$, and $B_5$. You choose the size of each battalion such that $|B_1|+|B_2|+|B_3|+|B_4|+|B_5|=100$. The size of each batallion must be integral and non-negative. Then, suppose you receive $n$ points for the Team Round. We will then "supply" your army as follows: if $n>B_1$, we fill in battalion $1$ so that it has $|B_1|$ soldiers; then repeat for the next battalion with $n-|B_1|$ soldiers. If at some point there are not enough soldiers to fill the battalion, the remainder will be put in that battalion and subsequent battalions will be empty. (Ex: suppose you tell us to form battalions of size $\{20,30,20,20,10\}$, and your team scores $73$ points. Then your battalions will actually be $\{20,30,20,3,0\}$.) Your team's army will then "fight" another's. The $B_i$ of both teams will be compared with the other $B_i$, and the winner of the overall war is the army who wins the majority of the battalion fights. The winner receives $1$ victory point, and in case of ties, both teams receive $\tfrac12$ victory points. Every team's army will fight everyone else's and the team war score will be the sum of the victory points won from wars. The teams with ranking $x$ where $7k\leq x\leq 7(k+1)$ will earn $10-k$ bonus points. For example: Team Princeton decides to allocate its army into battalions with size $|B_1|$, $|B_2|$, $|B_3|$, $|B_4|$, $|B_5|$ $=$ $20$, $20$, $20$, $20$, $20$. Team MIT allocates its army into battalions with size $|B_1|$, $|B_2|$, $|B_3|$, $|B_4|$, $|B_5|$ $=$ $10$, $10$, $10$, $10$, $60$. Now suppose Princeton scores $80$ points on the Team Round, and MIT scores $90$ points. Then after supplying, the armies will actually look like $\{20, 20, 20, 20, 0\}$ for Princeton and $\{10, 10, 10, 10, 50\}$ for MIT. Then note that in a war, Princeton beats MIT in the first four battalion battles while MIT only wins the last battalion battle; therefore Princeton wins the war, and Princeton would win $1$ victory point.

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.

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.

Prove that for any natural numbers $0 \leq i_1 < i_2 < \cdots < i_k$ and $0 \leq j_1 < j_2 < \cdots < j_k$, the matrix $A = (a_{rs})_{1\leq r,s\leq k}$, $a_{rs} = {i_r + j_s\choose i_r} = {(i_r + j_s)!\over i_r!\, j_s!}$ ($1\leq r,s\leq k$) is nonsingular.

Team Stanford has a $ \frac{1}{3}$ chance of winning any given math contest. If Stanford competes in 4 contests this quarter, what is the probability that the team will win at least once?

The Dinky is a train connecting Princeton to the outside world. It runs on an odd schedule: the train arrive once every one-hour block at some uniformly random time (once at a random time between $\text{9am}$ and $\text{10am}$, once at a random time between $\text{10am}$ and $\text{11am}$, and so on). One day, Emilia arrives at the station, at some uniformly random time, and does not know the time. She expects to wait for $y$ minutes for the next train to arrive. After waiting for an hour, a train has still not come. She now expects to wait for $z$ minutes. Find $yz$.

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?

Christopher and Robin are playing a game in which they take turns tossing a circular token of diameter 1 inch onto an infinite checkerboard whose squares have sides of 2 inches. If the token lands entirely in a square, the player who tossed the token gets 1 point; otherwise, the other player gets 1 point. A player wins as soon as he gets two more points than the other player. If Christopher tosses first, what is the probability that he will win? Express your answer as a fraction.

A right rectangular prism has integer side lengths $a$, $b$, and $c$. If $\text{lcm}(a,b)=72$, $\text{lcm}(a,c)=24$, and $\text{lcm}(b,c)=18$, what is the sum of the minimum and maximum possible volumes of the prism? [i]Proposed by Deyuan Li and Andrew Milas[/i]

Including the original, how many ways are there to rearrange the letters in PRINCETON so that no two vowels (I, E, O) are consecutive and no three consonants (P, R, N, C, T, N) are consecutive?