How many distinct triangles are there with prime side lengths and perimeter $100$? [i]Proposed by Muztaba Syed[/i] [hide=Solution][i]Solution.[/i] $\boxed{0}$ As the perimeter is even, $1$ of the sides must be $2$. Thus, the other $2$ sides are congruent by Triangle Inequality. Thus, for the perimeter to be $100$, both of the other sides must be $49$, but as $49$ is obviously composite, the answer is thus $\boxed{0}$.[/hide]

Evin and Jerry are playing a game with a pile of marbles. On each players' turn, they can remove $2$, $3$, $7$, or $8$ marbles. If they can’t make a move, because there's $0$ or $1$ marble left, they lose the game. Given that Evin goes first and both players play optimally, for how many values of $n$ from $1$ to $1434$ does Evin lose the game? [i]Proposed by Evin Liang[/i] [hide=Solution][i]Solution.[/i] $\boxed{573}$ Observe that no matter how many marbles a one of them removes, the next player can always remove marbles such that the total number of marbles removed is $10$. Thus, when the number of marbles is a multiple of $10$, the first player loses the game. We analyse this game based on the number of marbles modulo $10$: If the number of marbles is $0$ modulo $10$, the first player loses the game If the number of marbles is $2$, $3$, $7$, or $8$ modulo $10$, the first player wins the game by moving to $0$ modulo 10 If the number of marbles is $5$ modulo $10$, the first player loses the game because every move leads to $2$, $3$, $7$, or $8$ modulo $10$ In summary, the first player loses if it is $0$ mod 5, and wins if it is $2$ or $3$ mod $5$. Now we solve the remaining cases by induction. The first player loses when it is $1$ modulo $5$ and wins when it is $4$ modulo $5$. The base case is when there is $1$ marble, where the first player loses because there is no move. When it is $4$ modulo $5$, then the first player can always remove $3$ marbles and win by the inductive hypothesis. When it is $1$ modulo $5$, every move results in $3$ or $4$ modulo $5$, which allows the other player to win by the inductive hypothesis. Thus, Evin loses the game if n is $0$ or $1$ modulo $5$. There are $\boxed{573}$ such values of $n$ from $1$ to $1434$.[/hide]

For a real number $x$, the minimum value of the expression $$\frac{2x^2 + x - 3}{x^2 - 2x + 3}$$ can be written in the form $\frac{a-\sqrt{b}}{c}$, where $a, b$, and $c$ are positive integers such that $a$ and $c$ are relatively prime. Find $a + b + c$

A four-digit number $n$ is said to be [i]literally 1434[/i] if, when every digit is replaced by its remainder when divided by $5$, the result is $1434$. For example, $1984$ is [i]literally 1434[/i] because $1$ mod $5$ is $1$, $9$ mod $5$ is $4$, $8$ mod $5$ is $3$, and $4$ mod $5$ is $4$. Find the sum of all four-digit positive integers that are [i]literally 1434[/i]. [i]Proposed by Evin Liang[/i] [hide=Solution] [i]Solution.[/i] $\boxed{67384}$ The possible numbers are $\overline{abcd}$ where $a$ is $1$ or $6$, $b$ is $4$ or $9$, $c$ is $3$ or $8$, and $d$ is $4$ or $9$. There are $16$ such numbers and the average is $\dfrac{8423}{2}$, so the total in this case is $\boxed{67384}$. [/hide]

Evin and Jerry are playing a game with a pile of marbles. On each players' turn, they can remove $2$, $3$, $7$, or $8$ marbles. If they can’t make a move, because there's $0$ or $1$ marble left, they lose the game. Given that Evin goes first and both players play optimally, for how many values of $n$ from $1$ to $1434$ does Evin lose the game? [i]Proposed by Evin Liang[/i] [hide=Solution][i]Solution.[/i] $\boxed{573}$ Observe that no matter how many marbles a one of them removes, the next player can always remove marbles such that the total number of marbles removed is $10$. Thus, when the number of marbles is a multiple of $10$, the first player loses the game. We analyse this game based on the number of marbles modulo $10$: If the number of marbles is $0$ modulo $10$, the first player loses the game If the number of marbles is $2$, $3$, $7$, or $8$ modulo $10$, the first player wins the game by moving to $0$ modulo 10 If the number of marbles is $5$ modulo $10$, the first player loses the game because every move leads to $2$, $3$, $7$, or $8$ modulo $10$ In summary, the first player loses if it is $0$ mod 5, and wins if it is $2$ or $3$ mod $5$. Now we solve the remaining cases by induction. The first player loses when it is $1$ modulo $5$ and wins when it is $4$ modulo $5$. The base case is when there is $1$ marble, where the first player loses because there is no move. When it is $4$ modulo $5$, then the first player can always remove $3$ marbles and win by the inductive hypothesis. When it is $1$ modulo $5$, every move results in $3$ or $4$ modulo $5$, which allows the other player to win by the inductive hypothesis. Thus, Evin loses the game if n is $0$ or $1$ modulo $5$. There are $\boxed{573}$ such values of $n$ from $1$ to $1434$.[/hide]

Eminem is trying to find the real Slim Shady in a row of $2025$ indistinguishable Slim Shady clones, one of which is the real Slim Shady. Eminem randomly guesses, and if he guesses wrong, a new clone joins the row and all the clones randomly rearrange themselves. He keeps guessing as more identical clones are added, trying to find the real Slim Shady. Find the probability that he will eventually find him within $15$ guesses.

Let $R$ be the rectangle on the cartesian plane with vertices $(0,0)$, $(5,0)$, $(5,7)$, and $(0,7)$. Find the number of squares with sides parallel to the axes and vertices that are lattice points that lie within the region bounded by $R$. [i]Proposed by Boyan Litchev[/i] [hide=Solution][i]Solution[/i]. $\boxed{85}$ We have $(6-n)(8-n)$ distinct squares with side length $n$, so the total number of squares is $5 \cdot 7+4 \cdot 6+3 \cdot 5+2 \cdot 4+1\cdot 3 = \boxed{85}$.[/hide]

In Survev.io, Calvin observes that he has exactly twice as much blue ammo as red ammo. After firing one blue bullet and $9$ red bullets, he remarks that the amount of blue ammo he has is divisible by $5$ and the amount of red ammo he has is divisible by $7$. Find the least amount of red ammo he could have started with.

A positive $n$ is called [i]sigma rizz[/i] if the sum of its digits is equal to two times the number of digits it has. Find the number of sigma rizz numbers less than $1000.$

A four-digit number $n$ is said to be [i]literally 1434[/i] if, when every digit is replaced by its remainder when divided by $5$, the result is $1434$. For example, $1984$ is [i]literally 1434[/i] because $1$ mod $5$ is $1$, $9$ mod $5$ is $4$, $8$ mod $5$ is $3$, and $4$ mod $5$ is $4$. Find the sum of all four-digit positive integers that are [i]literally 1434[/i]. [i]Proposed by Evin Liang[/i] [hide=Solution] [i]Solution.[/i] $\boxed{67384}$ The possible numbers are $\overline{abcd}$ where $a$ is $1$ or $6$, $b$ is $4$ or $9$, $c$ is $3$ or $8$, and $d$ is $4$ or $9$. There are $16$ such numbers and the average is $\dfrac{8423}{2}$, so the total in this case is $\boxed{67384}$. [/hide]

In Brawl Stars, Rico can shoot his opponent directly or make his bullet bounce off the wall at the same angle. His opponent is $15$ feet in front of him and there are infinitely long walls $1$ feet to the left and right of Rico. If Rico's bullet travels $d$ feet before hitting the opponent, find the sum of all possible integer values of $d$.

Let $R$ be the rectangle on the cartesian plane with vertices $(0,0)$, $(5,0)$, $(5,7)$, and $(0,7)$. Find the number of squares with sides parallel to the axes and vertices that are lattice points that lie within the region bounded by $R$. [i]Proposed by Boyan Litchev[/i] [hide=Solution][i]Solution[/i]. $\boxed{85}$ We have $(6-n)(8-n)$ distinct squares with side length $n$, so the total number of squares is $5 \cdot 7+4 \cdot 6+3 \cdot 5+2 \cdot 4+1\cdot 3 = \boxed{85}$.[/hide]

Travis Scott says "FEIN'' every $0.8$ seconds. Find the tens digit of the number of times he says "FEIN'' in $1$ minute.

The Den has two deals on chicken wings. The first deal is $4$ chicken wings for $3$ dollars, and the second deal is $11$ chicken wings for $ 8$ dollars. If Jeremy has $18$ dollars, what is the largest number of chicken wings he can buy?

In Pokemon, there are $10$ indistinguishable Poke Beans in a pile. Pikachu eats a prime number of Poke Beans. Charmander eats an even number of Poke Beans. Snorlax eats an odd number of Poke Beans. Find the number of ways for the three Pokemon to eat all $10$ Poke Beans.

Determine the least integer $n$ such that for any set of $n$ lines in the 2D plane, there exists either a subset of $1001$ lines that are all parallel, or a subset of $1001$ lines that are pairwise nonparallel. [i]Proposed by Samuel Wang[/i] [hide=Solution][i]Solution.[/i] $\boxed{1000001}$ Since being parallel is a transitive property, we note that in order for this to not exist, there must exist at most $1001$ groups of lines, all pairwise intersecting, with each group containing at most $1001$ lines. Thus, $n = 1000^2 + 1 = \boxed{1000001}$.[/hide]

A rectangular tea bag $PART$ has a logo in its interior at the point $Y$ . The distances from $Y$ to $PT$ and $PA$ are $12$ and $9$ respectively, and triangles $\triangle PYT$ and $\triangle AYR$ have areas $84$ and $42$ respectively. Find the perimeter of pentagon $PARTY$. [i]Proposed by Muztaba Syed[/i] [hide=Solution] [i]Solution[/i]. $\boxed{78}$ Using the area and the height in $\triangle PYT$, we see that $PT = 14$, and thus $AR = 14$, meaning the height from $Y$ to $AR$ is $6$. This means $PA = TR = 18$. By the Pythagorean Theorem $PY=\sqrt{12^2+9^2} = 15$ and $YT =\sqrt{12^2 +5^2} = 13$. Combining all of these gives us an answer of $18+14+18+13+15 = \boxed{78}$. [/hide]

On day $1$ of the new year, John Adams and Samuel Adams each drink one gallon of tea. For each positive integer $n$, on the $n$th day of the year, John drinks $n$ gallons of tea and Samuel drinks $n^2$ gallons of tea. After how many days does the combined tea intake of John and Samuel that year first exceed $900$ gallons? [i]Proposed by Aidan Duncan[/i] [hide=Solution] [i]Solution. [/i] $\boxed{13}$ The total amount that John and Samuel have drank by day $n$ is $$\dfrac{n(n+1)(2n+1)}{6}+\dfrac{n(n+1)}{2}=\dfrac{n(n+1)(n+2)}{3}.$$ Now, note that ourdesired number of days should be a bit below $\sqrt[3]{2700}$. Testing a few values gives $\boxed{13}$ as our answer. [/hide]

Tnag is repeating the phrase "sigma sigma on the wall'' an infinite number times. Between each word, there is exactly one second of pause. Adam has heard the phrase so many times that he has come up with a game using two numbers $x$ and $y$: Start with a score of 0. [list] [*] At a random time, Adam will hear the word $a$ (each of the 5 words are equally likely to be heard). [*] Then [list] [*] if $a$ is "sigma'', Adam will multiply his score by $x$, and [*] if $a$ is any of the other words, Adam will add $y$ to his score. [/list] [/list] Let $f(x,y)$ be Adam's expected score after infinitely many steps. Find \[ \sum_{n=2}^{\infty}f\left(\frac{1}{n}, \frac{1}{n^2}\right). \]

Let [i]Revolution[/i]$(x) = x^3 +Ux^2 +Sx + A$, where $U$, $S$, and $A$ are all integers and $U +S + A +1 = 1773$. Given that [i]Revolution[/i] has exactly two distinct nonzero integer roots $G$ and $B$, find the minimum value of $|GB|$. [i]Proposed by Jacob Xu[/i] [hide=Solution] [i]Solution.[/i] $\boxed{392}$ Notice that $U + S + A + 1$ is just [i]Revolution[/i]$(1)$ so [i]Revolution[/i]$(1) = 1773$. Since $G$ and $B$ are integer roots we write [i]Revolution[/i]$(X) = (X-G)^2(X-B)$ without loss of generality. So Revolution$(1) = (1-G)^2(1-B) = 1773$. $1773$ can be factored as $32 \cdot 197$, so to minimize $|GB|$ we set $1-G = 3$ and $1-B = 197$. We get that $G = -2$ and $B = -196$ so $|GB| = \boxed{392}$. [/hide]

In equilateral triangle $ABC$, $AB=2$ and $M$ is the midpoint of $AB$. A laser is shot from $M$ in a certain direction, and whenever it collides with a side of $ABC$ it will reflect off the side such that the acute angle formed by the incident ray and the side is equal to the acute angle formed by the reflected ray and the side. Once the laser coincides with a vertex, it stops. Find the sum of the smallest three possible integer distances that the laser could have traveled. [i]Proposed by Jerry Xu[/i] [hide=Solution] [i]Solution.[/i] $\boxed{21}$ Whenever the laser hits a side of the triangle, reflect the laser's path over that side so that the path of the laser forms a straight line. We want the path of the laser to coincide with a vertex of one of the reflected triangles. Thus, we can restate the problem as follows: Tessellate the plane with equilateral triangles of side length $3$. Consider one of these equilateral triangles $ABC$ with $M$ being the midpoint of $AB=2$. Find the sum of the three minimum integer distances from $M$ to any vertex in the plane. [asy] import geometry; size(8cm); pair A = (0,sqrt(3)); pair B = (-1,0); pair C = (1,0); pair M = (0,0); for (int i = -1; i <= 2; ++i) { draw((i-3,i*sqrt(3))--(-i+3,i*sqrt(3))); draw(((i-1)*2,-sqrt(3))--(i+1,(2-i)*sqrt(3))); draw((-i-1,(2-i)*sqrt(3))--((1-i)*2,-sqrt(3))); } draw(A--B--C--A, red); dot(M); label("$A$",A+(0,0.25),N); label("$B$",B-(0.25,0),SW); label("$C$",C+(0.25,0),SE); label("$M$",M,S); [/asy] It is trivial to see that the vertical distance between $M$ and a given vertex is $n\sqrt{3}$ for $n \in \mathbb{N}^{0}$. If $n$ is even, the horizontal distance between $O$ and a given vertex is $1+2m$ for $m \in \mathbb{N}^{0}$. If $n$ is odd, the horizontal distance is $2m$ for $m \in \mathbb{N}^{0}$. We consider two separate cases: $1.$ $n$ is even. We thus want to find $l \in \mathbb{N}$ such that $$\left(n\sqrt{3}\right)^2+(1+2m)^2=l^2.$$Make the substitution $1+2m=k$ to get that $$3n^2+k^2=l^2.$$Notice that these equations form a family of generalized Pell equations $y^2-3x^2=N$ with $N=k^2$. We can find some set of roots to these equations using the multiplicative principle: we will use this idea to find three small $l$ values, and that gives us an upper bound on what the three $l$ values can be. From there, a simple bash of lower $l$ values to see if solutions to each generalized Pell equation not given by the multiplicative principle exist finishes this case. By the multiplicative principle some set of solutions $(x_n,y_n)$ to the above equation with sufficiently small $x_n$ follow the formula$$x_n\sqrt{3}+y_n=\left(x_0\sqrt{3}+y_0\right)\left(u_n\sqrt{3}+v_n\right),$$where $\left(x_0,y_0\right)$ is a solution to the generalized Pell equation and $\left(u_n,v_n\right)$ are solutions to the Pell equation $y^2-3x^2=1$. Remember that the solutions to this last Pell equation satisfy$$u_n\sqrt{3}+v_n=\left(u_0\sqrt{3}+v_0\right)^k$$where the trivial positive integer solution $$\left(u_0, v_0\right)=(1,2)$$(this can easily be found by inspection or by taking the convergents of the continued fraction expansion of $\sqrt{3}$). We thus get that$$\left(u_1,v_1\right)=(4,7),\left(u_2,v_2\right)=(15,26),\left(u_2,v_2\right)=(56,97)\dots$$(also don't forget that $(u,v)=(0,1)$ is another solution). From here, note that $k$ must be odd since $k=1+2m$ for $m \in \mathbb{N}^{0}$. For $k=1$, the smallest three solutions to the Pell equation with $n$ even are \begin{align*} (x,y)&=(0,1),(4,7),(56,97) \\ \longrightarrow (n,m,l)&=(0,0,1),(4,0,7),(56,0,97) \end{align*}Our current smallest three values of $l$ are thus $1,7,97$. A quick check confirms that all of these solutions are not extraneous (extraneous solutions appear when the path taken by the laser prematurely hits a vertex). For $k=3$, using the multiplicative principle we get two new smaller solutions \begin{align*} (x,y)&=(0,3),(12,21) \\ \longrightarrow (n,m,l)&=(0,1,3),(12,1,21) \end{align*}However, note that $(n,m,l)=(0,1,3)$ is extraneous since is equivalent to the path that is traced out by the solution $(n,m,l)=(0,0,1)$ found previously and will thus hit a vertex prematurely. Thus, our new three smallest values of $l$ are $1,7,21$. For $k \ge 5$, it is evident that there are no more smaller integral values of $l$ that can be found using the multiplicative principle: the solution set $(n,m,l)=\left(0,\dfrac{k-1}{2},k\right)$ is always extraneous for $k > 1$ since it is equivalent to the path traced out by $(0,0,1)$ as described above, and any other solutions will give larger values of $l$. Thus, we now only need to consider solutions to each generalized Pell equation not found by the multiplicative principle. A quick bash shows that $l=3,5,9,11$ gives no solutions for any odd $k$ and even $n$, however $n=13$ gives $k=11$ and $n=4$, a non-extraneous solution smaller than one of the three we currently have. Thus, our new three smallest $l$ values are $1,7,13$. $2$. $n$ is odd. We thus want to find $l \in \mathbb{N}$ such that $$\left(n\sqrt{3}\right)^2+(2m)^2=l^2.$$Make the substitution $2m=k$ to get that $$3n^2+k^2=l^2.$$This is once again a family of generalized Pell equations with $N=k^2$, however this time we must have $k$ even instead of $k$ odd. However, note that there are no solutions to this family of Pell equation with $n$ odd: $k^2 \equiv 0 \text{ (mod }4)$ since $k$ is even, and $3n^2 \equiv 3 \text{ (mod }4)$ since $n$ is odd, however $0+3 \equiv 3 \text{ (mod }4)$ is not a possible quadratic residue mod $4$. Thus, this case gives no solutions. Our final answer is thus $1+7+13=\boxed{21}$. [/hide]

Bamal, Halvan, and Zuca are playing [i]The Game[/i]. To start, they‘re placed at random distinct vertices on regular hexagon $ABCDEF$. Two or more players collide when they‘re on the same vertex. When this happens, all the colliding players lose and the game ends. Every second, Bamal and Halvan teleport to a random vertex adjacent to their current position (each with probability $\dfrac{1}{2}$), and Zuca teleports to a random vertex adjacent to his current position, or to the vertex directly opposite him (each with probability $\dfrac{1}{3}$). What is the probability that when [i]The Game[/i] ends Zuca hasn‘t lost? [i]Proposed by Edwin Zhao[/i] [hide=Solution][i]Solution.[/i] $\boxed{\dfrac{29}{90}}$ Color the vertices alternating black and white. By a parity argument if someone is on a different color than the other two they will always win. Zuca will be on opposite parity from the others with probability $\dfrac{3}{10}$. They will all be on the same parity with probability $\dfrac{1}{10}$. At this point there are $2 \cdot 2 \cdot 3$ possible moves. $3$ of these will lead to the same arrangement, so we disregard those. The other $9$ moves are all equally likely to end the game. Examining these, we see that Zuca will win in exactly $2$ cases (when Bamal and Halvan collide and Zuca goes to a neighboring vertex). Combining all of this, the answer is $$\dfrac{3}{10}+\dfrac{2}{9} \cdot \dfrac{1}{10}=\boxed{\dfrac{29}{90}}$$ [/hide]

In equilateral triangle $ABC$, $AB=2$ and $M$ is the midpoint of $AB$. A laser is shot from $M$ in a certain direction, and whenever it collides with a side of $ABC$ it will reflect off the side such that the acute angle formed by the incident ray and the side is equal to the acute angle formed by the reflected ray and the side. Once the laser coincides with a vertex, it stops. Find the sum of the smallest three possible integer distances that the laser could have traveled. [i]Proposed by Jerry Xu[/i] [hide=Solution] [i]Solution.[/i] $\boxed{21}$ Whenever the laser hits a side of the triangle, reflect the laser's path over that side so that the path of the laser forms a straight line. We want the path of the laser to coincide with a vertex of one of the reflected triangles. Thus, we can restate the problem as follows: Tessellate the plane with equilateral triangles of side length $3$. Consider one of these equilateral triangles $ABC$ with $M$ being the midpoint of $AB=2$. Find the sum of the three minimum integer distances from $M$ to any vertex in the plane. [asy] import geometry; size(8cm); pair A = (0,sqrt(3)); pair B = (-1,0); pair C = (1,0); pair M = (0,0); for (int i = -1; i <= 2; ++i) { draw((i-3,i*sqrt(3))--(-i+3,i*sqrt(3))); draw(((i-1)*2,-sqrt(3))--(i+1,(2-i)*sqrt(3))); draw((-i-1,(2-i)*sqrt(3))--((1-i)*2,-sqrt(3))); } draw(A--B--C--A, red); dot(M); label("$A$",A+(0,0.25),N); label("$B$",B-(0.25,0),SW); label("$C$",C+(0.25,0),SE); label("$M$",M,S); [/asy] It is trivial to see that the vertical distance between $M$ and a given vertex is $n\sqrt{3}$ for $n \in \mathbb{N}^{0}$. If $n$ is even, the horizontal distance between $O$ and a given vertex is $1+2m$ for $m \in \mathbb{N}^{0}$. If $n$ is odd, the horizontal distance is $2m$ for $m \in \mathbb{N}^{0}$. We consider two separate cases: $1.$ $n$ is even. We thus want to find $l \in \mathbb{N}$ such that $$\left(n\sqrt{3}\right)^2+(1+2m)^2=l^2.$$Make the substitution $1+2m=k$ to get that $$3n^2+k^2=l^2.$$Notice that these equations form a family of generalized Pell equations $y^2-3x^2=N$ with $N=k^2$. We can find some set of roots to these equations using the multiplicative principle: we will use this idea to find three small $l$ values, and that gives us an upper bound on what the three $l$ values can be. From there, a simple bash of lower $l$ values to see if solutions to each generalized Pell equation not given by the multiplicative principle exist finishes this case. By the multiplicative principle some set of solutions $(x_n,y_n)$ to the above equation with sufficiently small $x_n$ follow the formula$$x_n\sqrt{3}+y_n=\left(x_0\sqrt{3}+y_0\right)\left(u_n\sqrt{3}+v_n\right),$$where $\left(x_0,y_0\right)$ is a solution to the generalized Pell equation and $\left(u_n,v_n\right)$ are solutions to the Pell equation $y^2-3x^2=1$. Remember that the solutions to this last Pell equation satisfy$$u_n\sqrt{3}+v_n=\left(u_0\sqrt{3}+v_0\right)^k$$where the trivial positive integer solution $$\left(u_0, v_0\right)=(1,2)$$(this can easily be found by inspection or by taking the convergents of the continued fraction expansion of $\sqrt{3}$). We thus get that$$\left(u_1,v_1\right)=(4,7),\left(u_2,v_2\right)=(15,26),\left(u_2,v_2\right)=(56,97)\dots$$(also don't forget that $(u,v)=(0,1)$ is another solution). From here, note that $k$ must be odd since $k=1+2m$ for $m \in \mathbb{N}^{0}$. For $k=1$, the smallest three solutions to the Pell equation with $n$ even are \begin{align*} (x,y)&=(0,1),(4,7),(56,97) \\ \longrightarrow (n,m,l)&=(0,0,1),(4,0,7),(56,0,97) \end{align*}Our current smallest three values of $l$ are thus $1,7,97$. A quick check confirms that all of these solutions are not extraneous (extraneous solutions appear when the path taken by the laser prematurely hits a vertex). For $k=3$, using the multiplicative principle we get two new smaller solutions \begin{align*} (x,y)&=(0,3),(12,21) \\ \longrightarrow (n,m,l)&=(0,1,3),(12,1,21) \end{align*}However, note that $(n,m,l)=(0,1,3)$ is extraneous since is equivalent to the path that is traced out by the solution $(n,m,l)=(0,0,1)$ found previously and will thus hit a vertex prematurely. Thus, our new three smallest values of $l$ are $1,7,21$. For $k \ge 5$, it is evident that there are no more smaller integral values of $l$ that can be found using the multiplicative principle: the solution set $(n,m,l)=\left(0,\dfrac{k-1}{2},k\right)$ is always extraneous for $k > 1$ since it is equivalent to the path traced out by $(0,0,1)$ as described above, and any other solutions will give larger values of $l$. Thus, we now only need to consider solutions to each generalized Pell equation not found by the multiplicative principle. A quick bash shows that $l=3,5,9,11$ gives no solutions for any odd $k$ and even $n$, however $n=13$ gives $k=11$ and $n=4$, a non-extraneous solution smaller than one of the three we currently have. Thus, our new three smallest $l$ values are $1,7,13$. $2$. $n$ is odd. We thus want to find $l \in \mathbb{N}$ such that $$\left(n\sqrt{3}\right)^2+(2m)^2=l^2.$$Make the substitution $2m=k$ to get that $$3n^2+k^2=l^2.$$This is once again a family of generalized Pell equations with $N=k^2$, however this time we must have $k$ even instead of $k$ odd. However, note that there are no solutions to this family of Pell equation with $n$ odd: $k^2 \equiv 0 \text{ (mod }4)$ since $k$ is even, and $3n^2 \equiv 3 \text{ (mod }4)$ since $n$ is odd, however $0+3 \equiv 3 \text{ (mod }4)$ is not a possible quadratic residue mod $4$. Thus, this case gives no solutions. Our final answer is thus $1+7+13=\boxed{21}$. [/hide]

In Ace Attorney, Phoenix Wright is rolling a standard fair $20$-sided die. He can roll this die up to three times. After each roll, Phoenix can yell "Objection!'' to roll again, or "Hold It!'' to stop and keep his current number. If Phoenix plays optimally to maximize his final number, find the expected value of this number.

On day $1$ of the new year, John Adams and Samuel Adams each drink one gallon of tea. For each positive integer $n$, on the $n$th day of the year, John drinks $n$ gallons of tea and Samuel drinks $n^2$ gallons of tea. After how many days does the combined tea intake of John and Samuel that year first exceed $900$ gallons? [i]Proposed by Aidan Duncan[/i] [hide=Solution] [i]Solution. [/i] $\boxed{13}$ The total amount that John and Samuel have drank by day $n$ is $$\dfrac{n(n+1)(2n+1)}{6}+\dfrac{n(n+1)}{2}=\dfrac{n(n+1)(n+2)}{3}.$$ Now, note that ourdesired number of days should be a bit below $\sqrt[3]{2700}$. Testing a few values gives $\boxed{13}$ as our answer. [/hide]