Eddie assigns each of Jason, Jerry, and Jonathan a different positive integer. The three are each perfectly logical and currently know that their numbers are distinct but don't know each other's numbers. Additionally, if one of them knows the answer to the question they will say so immediately. They have the following conversation listed below in chronological order: [list] [*] Eddie: Does anyone know who has the smallest number? [*] Jason, Jerry, Jonathan (at the same time): I'm not sure. [*] Jonathan: Now I know who has the smallest number. [*] Eddie: Does anyone know who has the largest number? [*] Jason, Jonathan, Jerry (at the same time): I'm not sure. [*] Jerry: Now I know who has the largest number. [*] Jason: Wow, our numbers are in an geometric sequence! [/list] Find the sum of their numbers.

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

Michael and Andrew are playing the game Bust, which is played as follows: Michael chooses a positive integer less than or equal to $99$, and writes it on the board. Andrew then makes a move, which consists of him choosing a positive integer less than or equal to $ 8$ and increasing the integer on the board by the integer he chose. Play then alternates in this manner, with each person making exactly one move, until the integer on the board becomes greater than or equal to $100$. The person who made the last move loses. Let S be the sum of all numbers for which Michael could choose initially and win with both people playing optimally. Find S.

Jeffrey stands on a straight horizontal bridge that measures $20000$ meters across. He wishes to place a pole vertically at the center of the bridge so that the sum of the distances from the top of the pole to the two ends of the bridge is $20001$ meters. To the nearest meter, how long of a pole does Jeffrey need?

Define $\{p_n\}_{n=0}^\infty\subset\mathbb N$ and $\{q_n\}_{n=0}^\infty\subset\mathbb N$ to be sequences of natural numbers as follows: [list] [*]$p_0=q_0=1$; [*]For all $n\in\mathbb N$, $q_n$ is the smallest natural number such that there exists a natural number $p_n$ with $\gcd(p_n,q_n)=1$ satisfying \[\dfrac{p_{n-1}}{q_{n-1}} < \dfrac{p_n}{q_n} < \sqrt 2.\] [/list] Find $q_3$.

Let $\triangle{ABC}$ be a triangle with incenter $I.$ The incircle of triangle $\triangle{ABC}$ touches $\overline{BC}$ at $D.$ Let $M$ be the midpoint of $\overline{BC},$ and let line $AI$ meet the circumcircle of triangle $\triangle{ABC}$ again at $L \neq A.$ Let $\omega$ be the circle centered at $L$ tangent to $AB$ and $AC.$ If $\omega$ intersects $\overline{AD}$ at point $P,$ prove that $\angle{IPM}=90^\circ.$

NASA is launching a spaceship at the south pole, but a sudden earthquake shock caused the spaceship to be launched at an angle of $\theta$ from vertical ($0 < \theta < 90^\circ$). The spaceship crashed back to Earth, and NASA found the debris floating in the ocean in the northern hemisphere. NASA engineers concluded that $\tan \theta > M$, where $M$ is maximal. Find $M$. Assume that the Earth is a sphere, and the trajectory of the spaceship (in the reference frame of Earth) is an ellipse with the center of the Earth one of the foci. [i]Proposed by Kevin You[/i]

I define a "good day" as a day when both the day and the month evenly divide the concatenation of the two. For example, today (March $15$) is a good day since $3$ and $15$ both divide $315.$ However, March $9$ is not a good day since $9$ does not divide $39.$ How many good days are in March, April, and May combined?

Two right triangles are placed next to each other to form a quadrilateral as shown. What is the perimeter of the quadrilateral? [asy] size(4cm); fill((-5,0)--(0,12)--(0,6)--(8,0)--cycle, gray+opacity(0.3)); draw((0,0)--(0,12)--(-5,0)--cycle); draw((0,0)--(8,0)--(0,6)); label("5", (-2.5,0), S); label("13", (-2.5,6), dir(140)); label("6", (0,3), E); label("8", (4,0), S); [/asy] [i]Proposed by Nathan Xiong[/i]

Let $ABCD$ be a cyclic quadrilateral with $AB=3, BC=2, CD=6, DA=8,$ and circumcircle $\Gamma.$ The tangents to $\Gamma$ at $A$ and $C$ intersect at $P$ and the tangents to $\Gamma$ at $B$ and $D$ intersect at $Q.$ Suppose lines $PB$ and $PD$ intersect $\Gamma$ at points $W \neq B$ and $X \neq D,$ respectively. Similarly, suppose lines $QA$ and $QC$ intersect $\Gamma$ at points $Y \neq A$ and $Z \neq C,$ respectively. What is the value of $\frac{{WX}^2}{{YZ}^2}?$ [i]Proposed by Kyle Lee[/i]

On Misha's new phone, a passlock consists of six circles arranged in a $2\times 3$ rectangle. The lock is opened by a continuous path connecting the six circles; the path cannot pass through a circle on the way between two others (e.g. the top left and right circles cannot be adjacent). For example, the left path shown below is allowed but the right path is not. (Paths are considered to be oriented, so that a path starting at $A$ and ending at $B$ is different from a path starting at $B$ and ending at $A$. However, in the diagrams below, the paths are valid/invalid regardless of orientation.) How many passlocks are there consisting of all six circles? [asy] size(270); defaultpen(linewidth(0.8)); real r = 0.3, rad = 0.1, shift = 3.7; pen th = linewidth(5)+gray(0.2); for(int i=0; i<= 2;i=i+1) { for(int j=0; j<= 1;j=j+1) { fill(circle((i,j),r),gray(0.8)); fill(circle((i+shift,j),r),gray(0.8)); } draw((0,1)--(2-rad,1)^^(2,1-rad)--(2,rad)^^(2-rad,0)--(0,0),th); draw(arc((2-rad,1-rad),rad,0,90)^^arc((2-rad,rad),rad,270,360),th); draw((shift+1,0)--(shift+1,1-2*rad)^^(shift+1-rad,1-rad)--(shift+rad,1-rad)^^(shift+rad,1+rad)--(shift+2,1+rad),th); draw(arc((shift+1-rad,1-2*rad),rad,0,90)^^arc((shift+rad,1),rad,90,270),th); } [/asy]

Find all sets of five positive integers whose mode, mean, median, and range are all equal to $5$.

The lengths of the two legs of a right triangle are the two distinct roots of the quadratic $x^2 - 36x + 70$. What is the length of the triangle’s hypotenuse?

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$

Let $ABC$ be a triangle with $BC=30$, $AC=50$, and $AB=60$. Circle $\omega_B$ is the circle passing through $A$ and $B$ tangent to $BC$ at $B$; $\omega_C$ is defined similarly. Suppose the tangent to $\odot(ABC)$ at $A$ intersects $\omega_B$ and $\omega_C$ for the second time at $X$ and $Y$ respectively. Compute $XY$. Let $T = TNYWR$. For some positive integer $k$, a circle is drawn tangent to the coordinate axes such that the lines $x + y = k^2, x + y = (k+1)^2, \dots, x+y = (k+T)^2$ all pass through it. What is the minimum possible value of $k$?

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

Rectangle $R$ with area $20$ and diagonal of length $7$ is translated $2$ units in some direction to form a new rectangle $R'.$ The vertices of $R$ and $R'$ that are not contained in the other rectangle form a convex hexagon. Compute the maximum possible area of this hexagon.