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

Show that the curve $x^{3}+3xy+y^{3}=1$ contains only one set of three distinct points, $A,B,$ and $C,$ which are the vertices of an equilateral triangle.

Let $ C_1$ and $ C_2$ be externally tangent circles with radius 2 and 3, respectively. Let $ C_3$ be a circle internally tangent to both $ C_1$ and $ C_2$ at points $ A$ and $ B$, respectively. The tangents to $ C_3$ at $ A$ and $ B$ meet at $ T$, and $ TA \equal{} 4$. Determine the radius of $ C_3$.

A binary string is a string consisting of only 0’s and 1’s (for instance, 001010, 101, etc.). What is the probability that a randomly chosen binary string of length 10 has 2 consecutive 0’s? Express your answer as a fraction.

The Duke of Squares left to his three sons a square estate, $100\times 100$ square miles, made up of ten thousand $1\times 1$ square mile square plots. The whole estate was divided among his sons as follows. Each son was assigned a point inside the estate. A $1\times 1$ square plot was bequeathed to the son whose assigned point was closest to the center of this square plot. Is it true that, irrespective of the choice of assigned points, each of the regions bequeathed to the sons is connected (that is, there is a path between every two of its points, never leaving the region)?

Find all functions $f: \mathbb{R}^+\to\mathbb{R}^+$ such that \[f(x+f(y+xy))=(y+1)f(x+1)-1\]for all $x,y\in\mathbb{R}^+$. ($\mathbb{R}^+$ denotes the set of positive real numbers.)

Let $ATHEM$ be a convex pentagon with $AT = 14$, $TH = MA = 20$, $HE = EM = 15$, and $\angle THE = \angle EMA = 90^{\circ}$. Find the area of $ATHEM$. [i]Proposed by Andrew Wu[/i]

Let $G$ be an undirected simple graph. Let $f(G)$ be the number of ways to orient all of the edges of $G$ in one of the two possible directions so that the resulting directed graph has no directed cycles. Show that $f(G)$ is a multiple of $3$ if and only if $G$ has a cycle of odd length.

Let $\Gamma_1$ and $\Gamma_2$ be externally tangent circles with radii lengths $2$ and $6$, respectively, and suppose that they are tangent to and lie on the same side of line $\ell$. Points $A$ and $B$ are selected on $\ell$ such that $\Gamma_1$ and $\Gamma_2$ are internally tangent to the circle with diameter $AB$. If $AB = a + b\sqrt{c}$ for positive integers $a, b, c$ with $c$ squarefree, then find $a + b + c$. [i]Proposed by Andrew Wu, Deyuan Li, and Andrew Milas[/i]

Carissa is crossing a very, very, very wide street, and did not properly check both ways before doing so. (Don't be like Carissa!) She initially begins walking at $2$ feet per second. Suddenly, she hears a car approaching, and begins running, eventually making it safely to the other side, half a minute after she began crossing. Given that Carissa always runs $n$ times as fast as she walks and that she spent $n$ times as much time running as she did walking, and given that the street is $260$ feet wide, find Carissa's running speed, in feet per second. [i]Proposed by Andrew Wu[/i]

Find the least $n$ such that any subset of ${1,2,\dots,100}$ with $n$ elements has 2 elements with a difference of 9.

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

(a) Find all triples $(x,y,z)$ of positive integers such that $xy \equiv 2 (\bmod{z})$ , $yz \equiv 2 (\bmod{x})$ and $zx \equiv 2 (\bmod{y} )$ (b) Let $n \geq 1$ be an integer. Give an algoritm to determine all triples $(x,y,z)$ such that '2' in part (a) is replaced by 'n' in all three congruences.

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?

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

Let $ABC$ be an isosceles triangle with $\angle{ABC} = \angle{ACB} = 80^\circ$. Let $D$ be a point on $AB$ such that $\angle{DCB} = 60^\circ$ and $E$ be a point on $AC$ such that $\angle{ABE} = 30^\circ$. Find $\angle{CDE}$ in degrees.

At Stanford in 1988, human calculator Shakuntala Devi was asked to compute $m = \sqrt[3]{61{,}629{,}875}$ and $n = \sqrt[7]{170{,}859{,}375}$. Given that $m$ and $n$ are both integers, compute $100m+n$. [i]Proposed by Evan Chen[/i]

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.

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]

Given that six-digit positive integer $\overline{ABCDEF}$ has distinct digits $A,$ $B,$ $C,$ $D,$ $E,$ $F$ between $1$ and $8$, inclusive, and that it is divisible by $99$, find the maximum possible value of $\overline{ABCDEF}$. [i]Proposed by Andrew Milas[/i]

A pack of MIT students are holding an escape room, where students may compete in teams of 4, 5, or 6. There is \$60 dollars worth of prize money in Amazon gift cards for the winning team. If each gift card can contain any whole number of dollars, what is the minimum number of gift cards required so that the prize money can be distributed evenly among any team? [i]Lightning 4.1[/i]

Charlotte is playing the hit new web number game, Primle. In this game, the objective is to guess a two-digit positive prime integer between $10$ and $99$, called the [i]Primle[/i]. For each guess, a digit is highlighted blue if it is in the [i]Primle[/i], but not in the correct place. A digit is highlighted orange if it is in the [i]Primle[/i] and is in the correct place. Finally, a digit is left unhighlighted if it is not in the [i]Primle[/i]. If Charlotte guesses $13$ and $47$ and is left with the following game board, what is the [i]Primle[/i]? $$\begin{array}{c} \boxed{1} \,\, \boxed{3} \\[\smallskipamount] \boxed{4}\,\, \fcolorbox{black}{blue}{\color{white}7} \end{array}$$ [i]Proposed by Andrew Wu and Jason Wang[/i]

Squares $ABCD$ and $BEFG$ are located as shown in the figure. It turned out that points $A, G$ and $E$ lie on the same straight line. Prove that then the points $D, F$ and $E$ also lie on the same line. [img]https://cdn.artofproblemsolving.com/attachments/4/2/9faf29a399d3a622c84f5d4a3cfcf5e99539c0.png[/img]

For what values of $a$ does the system of equations \[x^2 = y^2,(x-a)^2 +y^2 = 1\]have exactly 2 solutions?

Find the 2000th positive integer that is not the difference between any two integer squares.