Let $A_{1}A_{2}\ldots A_{2n}$ be a convex polygon and let $P$ be a point in its interior such that it doesn't lie on any of the diagonals of the polygon. Prove that there is a side of the polygon such that none of the lines $PA_{1}$, $\ldots$, $PA_{2n}$ intersects it in its interior.

A regular polygon of $m$ sides is exactly enclosed (no overlaps, no gaps) by $m$ regular polygons of $n$ sides each. (Shown here for $m=4, n=8$.) If $m=10$, what is the value of $n$? [asy] size(200); defaultpen(linewidth(0.8)); draw(unitsquare); path p=(0,1)--(1,1)--(1+sqrt(2)/2,1+sqrt(2)/2)--(1+sqrt(2)/2,2+sqrt(2)/2)--(1,2+sqrt(2))--(0,2+sqrt(2))--(-sqrt(2)/2,2+sqrt(2)/2)--(-sqrt(2)/2,1+sqrt(2)/2)--cycle; draw(p); draw(shift((1+sqrt(2)/2,-sqrt(2)/2-1))*p); draw(shift((0,-2-sqrt(2)))*p); draw(shift((-1-sqrt(2)/2,-sqrt(2)/2-1))*p);[/asy] $ \textbf{(A)}\ 5 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 14 \qquad\textbf{(D)}\ 20 \qquad\textbf{(E)}\ 26 $

$ABC$ is a triangle such that $AC<AB<BC$ and $D$ is a point on side $AB$ satisfying $AC=AD$. The circumcircle of $ABC$ meets with the bisector of angle $A$ again at $E$ and meets with $CD$ again at $F$. $K$ is an intersection point of $BC$ and $DE$. Prove that $CK=AC$ is a necessary and sufficient condition for $DK \cdot EF = AC \cdot DF$.

Suppose $ \,G\,$ is a connected graph with $ \,k\,$ edges. Prove that it is possible to label the edges $ 1,2,\ldots ,k\,$ in such a way that at each vertex which belongs to two or more edges, the greatest common divisor of the integers labeling those edges is equal to 1. [b]Note: Graph-Definition[/b]. A [b]graph[/b] consists of a set of points, called vertices, together with a set of edges joining certain pairs of distinct vertices. Each pair of vertices $ \,u,v\,$ belongs to at most one edge. The graph $ G$ is connected if for each pair of distinct vertices $ \,x,y\,$ there is some sequence of vertices $ \,x \equal{} v_{0},v_{1},v_{2},\cdots ,v_{m} \equal{} y\,$ such that each pair $ \,v_{i},v_{i \plus{} 1}\;(0\leq i < m)\,$ is joined by an edge of $ \,G$.

In a bag are all natural numbers less than or equal to $999$ whose digits sum to $6$. What is the probability of drawing a number from the bag that is divisible by $11$?

Suppose $n > 1$ is an odd integer satisfying $n \mid 2^{\frac{n-1}{2}} + 1$. Prove [color=red]or disprove[/color] that $n$ is prime. [i] Note: unfortunately, the original form of this problem did not include the red text, rendering it unsolvable. We sincerely apologize for this error and are taking concrete steps to prevent similar issues from reoccurring, including computer-verifying problems where possible. All teams will receive full credit for the question.[/i]

Suppose that $A$ is a set of real numbers between $3$ and $2024$ inclusive such that for any $x, y \in A$ with $x \neq y,$ we have $|x-y|>\tfrac{xy}{2+2xy}.$ What is the largest possible size of $A$?

Let $A$ be an integer and $A>1$. Let $a_{1}=A^{A}$, $a_{n+1}=A^{a_{n}}$ and $b_{1}=A^{A+1}$, $b_{n+1}=2^{b_{n}}$, $n=1, 2, 3, ...$. Prove that $a_{n}<b_{n}$ for each $n$.

The sequence $a_1 = 1$, $a_2, a_3, \cdots$ is defined as follows: if $a_n - 2$ is a natural number not already occurring on the board, then $a_{n+1} = a_n-2$; otherwise, $a_{n+1} = a_n + 3$. Prove that every nonzero perfect square occurs in the sequence as the previous term increased by $3$.

Let $a,b,c$ be positive real numbers such that \[ a+b+c\geq abc. \] Prove that at least two of the inequalities \[ \frac{2}{a}+\frac{3}{b}+\frac{6}{c}\geq6,\;\;\;\;\;\frac{2}{b}+\frac{3}{c}+\frac{6}{a}\geq6,\;\;\;\;\;\frac{2}{c}+\frac{3}{a}+\frac{6}{b}\geq6 \] are true.

A lemming sits at a corner of a square with side length $10$ meters. The lemming runs $6.2$ meters along a diagonal toward the opposite corner. It stops, makes a $90^{\circ}$ right turn and runs $2$ more meters. A scientist measures the shortest distance between the lemming and each side of the square. What is the average of these four distances in meters? $\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 4.5 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6.2 \qquad \textbf{(E)}\ 7$

Let $ABCD$ be a rectangle with $AB = 20$ and $AD = 23.$ Let $M$ be the midpoint of $CD,$ and let $X$ be the reflection of $M$ across point $A.$ Compute the area of triangle $XBD.$

Let $a$, $b$, $c$ be the three roots of the equation $x^3-(k+1)x^2+kx+12=0$, where $k$ is a real number. If $(a-2)^3+(b-2)^3+(c-2)^3=-18$, find the value of $k$.

Let $ABC$ be a right triangle with hypotenuse $AB$. Point $E$ is on $AB$ with $AE = 10BE$, and point $D$ is outside triangle $ABC$ such that $DC = DB$ and $\angle CDA = \angle BDE$. Let $[ABC]$ and $[BCD]$ denote the areas of triangles $ABC$ and $BCD$. Determine the value of $\frac{[BCD]}{[ABC]}$.

Thanos establishes $5$ settlements on a remote planet, randomly choosing one of them to stay in, and then he randomly builds a system of roads between these settlements such that each settlement has exactly one outgoing (unidirectional) road to another settlement. Afterwards, the Avengers randomly choose one of the $5$ settlements to teleport to. Then, they (the Avengers) must use the system of roads to travel from one settlement to another. The probability that the Avengers can find Thanos can be written as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m+n$.

Point $X$ is chosen inside the non trapezoid quadrilateral $ABCD$ such that $\angle AXD +\angle BXC=180$. Suppose the angle bisector of $\angle ABX$ meets the $D$-altitude of triangle $ADX$ in $K$, and the angle bisector of $\angle DCX$ meets the $A$-altitude of triangle $ADX$ in $L$.We know $BK \perp CX$ and $CL \perp BX$. If the circumcenter of $ADX$ is on the line $KL$ prove that $KL \perp AD$. Proposed by [i]Alireza Dadgarnia[/i]