$ABC$ is a triangle with $AB < AC$ and $\angle A = 2 \angle C$. $D$ is the point on $AC$ such that $CD = AB$. Let L be the line through $B$ parallel to $AC$. Let $L$ meet the external bisector of $\angle A$ at $M$ and the line through $C$ parallel to $AB$ at $N$. Show that $MD = ND$.

Given an integer $n \geq 3$, determine if there are $n$ integers $b_1, b_2, \dots , b_n$, distinct two-by-two (that is, $b_i \neq b_j$ for all $i \neq j$) and a polynomial $P(x)$ with coefficients integers, such that $P(b_1) = b_2, P(b_2) = b_3, \dots , P(b_{n-1}) = b_n$ and $P(b_n) = b_1$.

If $(2^x - 4^x) + (2^{-x} - 4^{-x}) = 3$, find the numerical value of the expression $$(8^x + 3\cdot 2^x) + (8^{-x} + 3\cdot 2^{-x}).$$

The base of a triangle is of length $b$, and the latitude is of length $h$. A rectangle of height $x$ is inscribed in the triangle with the base of the rectangle in the base of the triangle. The area of the rectangle is: $ \textbf{(A)}\ \frac{bx}{h}(h-x)\qquad\textbf{(B)}\ \frac{hx}{b}(b-x)\qquad\textbf{(C)}\ \frac{bx}{h}(h-2x)\qquad$ $\textbf{(D)}\ x(b-x)\qquad\textbf{(E)}\ x(h-x) $

Define a sequence by $s_0 = 1$ and for $d \geq 1$, $s_d = s_{d-1} + X_d$, where $X_d$ is chosen uniformly at random from the set $\{1, 2, \dots, d\}$. What is the probability that the sequence $s_0, s_1, s_2, \dots$ contains infinitely many primes?

Suppose you started at the origin on the number line in a coin-flipping game. Every time you flip a heads, you move forward one step, otherwise you move back one step. However, there are walls at positions $8$ and $-8$; if you are at these positions and your coin flip dictates that you should move past them, instead you must stay. What is the expected number of coin flips needed to have visited both walls?

In triangle $ABC$, with orthocenter $H$ and circumcircle $\Gamma$, the bisector of angle $BAC$ meets $\overline{BC}$ at $K$. Point $Q$ lies on $\Gamma$ such that $\overline{AQ} \perp \overline{QK}$. Circumcircle of $\triangle AQH$ meets $\overline{AC}$ at $Y$ and $\overline{AB}$ at $Z$. Let $\overline{BY}$ and $\overline{CZ}$ meet at $T$. Prove that $\overline{TH} \perp \overline{KA}$

Let $n\ge2$ be an integer and let $x>0$ be a real number. Prove that $$\left(1-\sqrt{\tanh x}\right)^n+\sqrt{\tanh(nx)}<1.$$

Let $n \geq 2$ be an integer. There are $n$ distinct circles in general position, that is, any two of them meet in two distinct points and there are no three of them meeting at one point. Those circles divide the plane in limited regions by circular edges, that meet at vertices (note that each circle have exactly $2n-2$ vertices). For each circle, temporarily color its vertices alternately black and white (note that, doing this, each vertex is colored twice, one for each circle passing through it). If the two temporarily colouring of a vertex coincide, this vertex is definitely colored with this common color; otherwise, it will be colored with gray. Show that if a circle has more than $n-2 + \sqrt{n-2}$ gray points, all vertices of some region are grey. Observation: In this problem, a region cannot contain vertices or circular edges on its interior. Also, the outer region of all circles also counts as a region.

For any finite sets $X$ and $Y$ of positive integers, denote by $f_X(k)$ the $k^{\text{th}}$ smallest positive integer not in $X$, and let $$X*Y=X\cup \{ f_X(y):y\in Y\}.$$Let $A$ be a set of $a>0$ positive integers and let $B$ be a set of $b>0$ positive integers. Prove that if $A*B=B*A$, then $$\underbrace{A*(A*\cdots (A*(A*A))\cdots )}_{\text{ A appears $b$ times}}=\underbrace{B*(B*\cdots (B*(B*B))\cdots )}_{\text{ B appears $a$ times}}.$$ [i]Proposed by Alex Zhai, United States[/i]

Let $ ABC$ be a triangle, let $ E, F$ be the tangency points of the incircle $ \Gamma(I)$ to the sides $ AC$, respectively $ AB$, and let $ M$ be the midpoint of the side $ BC$. Let $ N \equal{} AM \cap EF$, let $ \gamma(M)$ be the circle of diameter $ BC$, and let $ X, Y$ be the other (than $ B, C$) intersection points of $ BI$, respectively $ CI$, with $ \gamma$. Prove that \[ \frac {NX} {NY} \equal{} \frac {AC} {AB}. \] [i]Cosmin Pohoata[/i]

Let $ABCD$ be a parallelogram with $AC=BC.$ A point $P$ is chosen on the extension of ray $AB$ past $B.$ The circumcircle of $ACD$ meets the segment $PD$ again at $Q.$ The circumcircle of triangle $APQ$ meets the segment $PC$ at $R.$ Prove that lines $CD,AQ,BR$ are concurrent.

In a game of Among Us, there are $10$ players and $12$ colors. Each player has a "default" color that they will automatically get if nobody else has that color. Otherwise, they get a random color that is not selected. If $10$ random players with random default colors join a game one by one, the expected number of players to get their default color can be expressed as $\frac{m}{n}$. Compute $m+n$. Note that the default colors are not necessarily distinct. [i]Proposed by Jeff Lin[/i]

A particle moves along the $x$-axis. It collides elastically head-on with an identical particle initially at rest. Which of the following graphs could illustrate the momentum of each particle as a function of time? [asy] size(400); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); draw((0,0)--(0,5)); draw((0,1.5)--(5,1.5)); label("$p$",(0,5),N); label("$t$",(5,1.5),E); label("$\mathbf{(A)}$",(2.5,-0.5)); draw((0,1.5)--(2.5,1.5)--(2.5,0.75)--(4,0.75),black+linewidth(2)); draw((0,3.5)--(2.5,3.5)--(2.5,4.25)--(4,4.25),black+linewidth(2)); draw((8,0)--(8,5)); draw((8,1.5)--(13,1.5)); label("$p$",(8,5),N); label("$t$",(13,1.5),E); label("$\mathbf{(B)}$",(10.5,-0.5)); draw((8,1.5)--(10.5,1.5)--(10.5,2.5)--(12,2.5),black+linewidth(2)); draw((8,3.5)--(10.5,3.5)--(10.5,4.5)--(12,4.5),black+linewidth(2)); draw((16,0)--(16,5)); draw((16,1.5)--(21,1.5)); label("$p$",(16,5),N); label("$t$",(21,1.5),E); label("$\mathbf{(C)}$",(18.5,-0.5)); draw((16,1.5)--(18.5,1.5)--(18.5,2.25)--(20,2.25),black+linewidth(2)); draw((16,3.5)--(18.5,3.5)--(18.5,2.75)--(20,2.75),black+linewidth(2)); draw((24,0)--(24,5)); draw((24,1.5)--(29,1.5)); label("$p$",(24,5),N); label("$t$",(29,1.5),E); label("$\mathbf{(D)}$",(26.5,-0.5)); draw((24,1.5)--(26.5,1.5)--(26.75,3.25)--(28,3.25),black+linewidth(2)); draw((24,3.25)--(26.5,3.25)--(26.75,1.5)--(28,1.5),black+linewidth(2)); draw((32,0)--(32,5)); draw((32,1.5)--(37,1.5)); label("$p$",(32,5),N); label("$t$",(37,1.5),E); label("$\mathbf{(E)}$",(34.5,-0.5)); draw((32,1.5)--(34.5,1.5)--(34.5,0.5)--(36,0.5),black+linewidth(2)); draw((32,3.5)--(34.5,3.5)--(34.5,2.75)--(36,2.75),black+linewidth(2)); [/asy]

A $25$ foot ladder is placed against a vertical wall of a building. The foot of the ladder is $7$ feet from the base of the building. If the top of the ladder slips $4$ feet, then the foot of the ladder will slide: $\textbf{(A)}\ 9\text{ ft} \qquad \textbf{(B)}\ 15\text{ ft} \qquad \textbf{(C)}\ 5\text{ ft} \qquad \textbf{(D)}\ 8\text{ ft} \qquad \textbf{(E)}\ 4\text{ ft}$

$23$ frat brothers are sitting in a circle. One, call him Alex, starts with a gallon of water. On the first turn, Alex gives each person in the circle some rational fraction of his water. On each subsequent turn, every person with water uses the same scheme as Alex did to distribute his water, but in relation to themselves. For instance, suppose Alex gave $\frac{1}{2}$ and $\frac{1}{6}$ of his water to his left and right neighbors respectively on the first turn and kept $\frac{1}{3}$ for himself. On each subsequent turn everyone gives $\frac{1}{2}$ and $\frac{1}{6}$ of the water they started the turn with to their left and right neighbors, respectively, and keep the final third for themselves. After $23$ turns, Alex again has a gallon of water. What possibilities are there for the scheme he used in the first turn? (Note: you may find it useful to know that $1+x+x^2+\cdot +x^{23}$ has no polynomial factors with rational coefficients)