Found problems: 190
2017 ELMO Problems, 2
Let $ABC$ be a triangle with orthocenter $H,$ and let $M$ be the midpoint of $\overline{BC}.$ Suppose that $P$ and $Q$ are distinct points on the circle with diameter $\overline{AH},$ different from $A,$ such that $M$ lies on line $PQ.$ Prove that the orthocenter of $\triangle APQ$ lies on the circumcircle of $\triangle ABC.$
[i]Proposed by Michael Ren[/i]
2024 ELMO Problems, 4
Let $n$ be a positive integer. Find the number of sequences $a_0,a_1,a_2,\dots,a_{2n}$ of integers in the range $[0,n]$ such that for all integers $0\leq k\leq n$ and all nonnegative integers $m$, there exists an integer $k\leq i\leq 2k$ such that $\lfloor k/2^m\rfloor=a_i.$
[i]Andrew Carratu[/i]
2011 ELMO Shortlist, 3
Wanda the Worm likes to eat Pascal's triangle. One day, she starts at the top of the triangle and eats $\textstyle\binom{0}{0}=1$. Each move, she travels to an adjacent positive integer and eats it, but she can never return to a spot that she has previously eaten. If Wanda can never eat numbers $a,b,c$ such that $a+b=c$, prove that it is possible for her to eat 100,000 numbers in the first 2011 rows given that she is not restricted to traveling only in the first 2011 rows.
(Here, the $n+1$st row of Pascal's triangle consists of entries of the form $\textstyle\binom{n}{k}$ for integers $0\le k\le n$. Thus, the entry $\textstyle\binom{n}{k}$ is considered adjacent to the entries $\textstyle\binom{n-1}{k-1}$, $\textstyle\binom{n-1}{k}$, $\textstyle\binom{n}{k-1}$, $\textstyle\binom{n}{k+1}$, $\textstyle\binom{n+1}{k}$, $\textstyle\binom{n+1}{k+1}$.)
[i]Linus Hamilton.[/i]
2019 ELMO Shortlist, C1
Elmo and Elmo's clone are playing a game. Initially, $n\geq 3$ points are given on a circle. On a player's turn, that player must draw a triangle using three unused points as vertices, without creating any crossing edges. The first player who cannot move loses. If Elmo's clone goes first and players alternate turns, who wins? (Your answer may be in terms of $n$.)
[i]Proposed by Milan Haiman[/i]
2024 ELMO Problems, 1
In convex quadrilateral $ABCD$, let diagonals $\overline{AC}$ and $\overline{BD}$ intersect at $E$. Let the circumcircles of $ADE$ and $BCE$ intersect $\overline{AB}$ again at $P \neq A$ and $Q \neq B$, respectively. Let the circumcircle of $ACP$ intersect $\overline{AD}$ again at $R \neq A$, and let the circumcircle of $BDQ$ intersect $\overline{BC}$ again at $S \neq B$. Prove that $A$, $B$, $R$, and $S$ are concyclic.
[i]Tiger Zhang[/i]
2023 ELMO Shortlist, N3
Let \(a\), \(b\), and \(n\) be positive integers. A lemonade stand owns \(n\) cups, all of which are initially empty. The lemonade stand has a [i]filling machine[/i] and an [i]emptying machine[/i], which operate according to the following rules: [list] [*]If at any moment, \(a\) completely empty cups are available, the filling machine spends the next \(a\) minutes filling those \(a\) cups simultaneously and doing nothing else. [*]If at any moment, \(b\) completely full cups are available, the emptying machine spends the next \(b\) minutes emptying those \(b\) cups simultaneously and doing nothing else. [/list] Suppose that after a sufficiently long time has passed, both the filling machine and emptying machine work without pausing. Find, in terms of \(a\) and \(b\), the least possible value of \(n\).
[i]Proposed by Raymond Feng[/i]
2024 ELMO Problems, 6
For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.)
[i]Aprameya Tripathy[/i]
2019 ELMO Shortlist, G6
Let $ABC$ be an acute scalene triangle and let $P$ be a point in the plane. For any point $Q\neq A,B,C$, define $T_A$ to be the unique point such that $\triangle T_ABP \sim \triangle T_AQC$ and $\triangle T_ABP, \triangle T_AQC$ are oriented in the same direction (clockwise or counterclockwise). Similarly define $T_B, T_C$.
a) Find all $P$ such that there exists a point $Q$ with $T_A,T_B,T_C$ all lying on the circumcircle of $\triangle ABC$. Call such a pair $(P,Q)$ a [i]tasty pair[/i] with respect to $\triangle ABC$.
b) Keeping the notations from a), determine if there exists a tasty pair which is also tasty with respect to $\triangle T_AT_BT_C$.
[i]Proposed by Vincent Huang[/i]
2024 ELMO Problems, 5
In triangle $ABC$ with $AB<AC$ and $AB+AC=2BC$, let $M$ be the midpoint of $\overline{BC}$. Choose point $P$ on the extension of $\overline{BA}$ past $A$ and point $Q$ on segment $\overline{AC}$ such that $M$ lies on $\overline{PQ}$. Let $X$ be on the opposite side of $\overline{AB}$ from $C$ such that $\overline{AX} \parallel \overline{BC}$ and $AX=AP=AQ$. Let $\overline{BX}$ intersect the circumcircle of $BMQ$ again at $Y \neq B$, and let $\overline{CX}$ intersect the circumcircle of $CMP$ again at $Z \neq C$. Prove that $A$, $Y$, and $Z$ are collinear.
[i]Tiger Zhang[/i]
2024 ELMO Shortlist, N9
Let $P(x)$ be a polynomial with integer coefficients that has at least one rational root. Let $n$ be a positive integer.
Alan and Allan are playing a game. First, Alan writes down $n$ integers at $n$ different locations on a board. Then Allan may make moves of the following kind: choose a position that has integer $a$ written, then choose a different position that has integer $b$ written, then at the first position erase $a$ and in its place write $a+P(b)$. After any nonnegative number of moves, Allan may choose to end the game. Once Allan ends the game, his score is the number of times the mode (most common element) of the integers on the board appears.
Find, in terms of $P(x)$ and $n$, the maximum score Allan can guarantee.
[i]Henrick Rabinovitz[/i]
2024 ELMO Shortlist, C5
Let $\mathcal{S}$ be a set of $10$ points in a plane that lie within a disk of radius $1$ billion. Define a $move$ as picking a point $P \in \mathcal{S}$ and reflecting it across $\mathcal{S}$'s centroid. Does there always exist a sequence of at most $1500$ moves after which all points of $\mathcal{S}$ are contained in a disk of radius $10$?
[i]Advaith Avadhanam[/i]
2019 ELMO Shortlist, N5
Given an even positive integer $m$, find all positive integers $n$ for which there exists a bijection $f:[n]\to [n]$ so that, for all $x,y\in [n]$ for which $n\mid mx-y$, $$(n+1)\mid f(x)^m-f(y).$$
Note: For a positive integer $n$, we let $[n] = \{1,2,\dots, n\}$.
[i]Proposed by Milan Haiman and Carl Schildkraut[/i]
2024 ELMO Shortlist, N7
For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.)
[i]Aprameya Tripathy[/i]
2023 ELMO Shortlist, A4
Let \(f:\mathbb R\to\mathbb R\) be a function such that for all real numbers \(x\neq1\), \[f(x-f(x))+f(x)=\frac{x^2-x+1}{x-1}.\] Find all possible values of \(f(2023)\).
[i]Proposed by Linus Tang[/i]
2023 ELMO Shortlist, G6
Let \(ABCDEF\) be a convex cyclic hexagon such that quadrilateral \(ABDF\) is a square, and the incenter of \(\triangle ACE\) lines on \(\overline{BF}\). Diagonal \(CE\) intersects diagonals \(BD\) and \(DF\) at points \(P\) and \(Q\), respectively. Prove that the circumcircle of \(\triangle DPQ\) is tangent to \(\overline{BF}\).
[i]Proposed by Elliott Liu[/i]
2023 ELMO Shortlist, C6
For a set \(S\) of positive integers and a positive integer \(n\), consider the game of [i]\((n,S)\)-nim[/i], which is as follows. A pile starts with \(n\) watermelons. Two players, Deric and Erek, alternate turns eating watermelons from the pile, with Deric going first. On any turn, the number of watermelons eaten must be an element of \(S\). The last player to move wins. Let \(f(S)\) denote the set of positive integers \(n\) for which Deric has a winning strategy in \((n,S)\)-nim.
Let \(T\) be a set of positive integers. Must the sequence \[T, \; f(T), \; f(f(T)), \;\ldots\] be eventually constant?
[i]Proposed by Brandon Wang and Edward Wan[/i]
2024 ELMO Shortlist, C5
Let $\mathcal{S}$ be a set of $10$ points in a plane that lie within a disk of radius $1$ billion. Define a $move$ as picking a point $P \in \mathcal{S}$ and reflecting it across $\mathcal{S}$'s centroid. Does there always exist a sequence of at most $1500$ moves after which all points of $\mathcal{S}$ are contained in a disk of radius $10$?
[i]Advaith Avadhanam[/i]
2023 ELMO Shortlist, G3
Two triangles intersect to form seven finite disjoint regions, six of which are triangles with area 1. The last region is a hexagon with area \(A\). Compute the minimum possible value of \(A\).
[i]Proposed by Karthik Vedula[/i]
2024 ELMO Problems, 3
For some positive integer $n,$ Elmo writes down the equation
\[x_1+x_2+\dots+x_n=x_1+x_2+\dots+x_n.\]
Elmo inserts at least one $f$ to the left side of the equation and adds parentheses to create a valid functional equation. For example, if $n=3,$ Elmo could have created the equation
\[f(x_1+f(f(x_2)+x_3))=x_1+x_2+x_3.\]
Cookie Monster comes up with a function $f: \mathbb{Q}\to\mathbb{Q}$ which is a solution to Elmo's functional equation. (In other words, Elmo's equation is satisfied for all choices of $x_1,\dots,x_n\in\mathbb{Q})$. Is it possible that there is no integer $k$ (possibly depending on $f$) such that $f^k(x)=x$ for all $x$?
[i]Srinivas Arun[/i]
2023 ELMO Shortlist, G6
Let \(ABCDEF\) be a convex cyclic hexagon such that quadrilateral \(ABDF\) is a square, and the incenter of \(\triangle ACE\) lines on \(\overline{BF}\). Diagonal \(CE\) intersects diagonals \(BD\) and \(DF\) at points \(P\) and \(Q\), respectively. Prove that the circumcircle of \(\triangle DPQ\) is tangent to \(\overline{BF}\).
[i]Proposed by Elliott Liu[/i]
2017 ELMO Shortlist, 2
Find all functions $f:\mathbb{R}\to \mathbb{R}$ such that for all real numbers $a,b,$ and $c$:
(i) If $a+b+c\ge 0$ then $f(a^3)+f(b^3)+f(c^3)\ge 3f(abc).$
(ii) If $a+b+c\le 0$ then $f(a^3)+f(b^3)+f(c^3)\le 3f(abc).$
[i]Proposed by Ashwin Sah[/i]
2021 ELMO Problems, 1
In $\triangle ABC$, points $P$ and $Q$ lie on sides $AB$ and $AC$, respectively, such that the circumcircle of $\triangle APQ$ is tangent to $BC$ at $D$. Let $E$ lie on side $BC$ such that $BD = EC$. Line $DP$ intersects the circumcircle of $\triangle CDQ$ again at $X$, and line $DQ$ intersects the circumcircle of $\triangle BDP$ again at $Y$. Prove that $D$, $E$, $X$, and $Y$ are concyclic.
2024 ELMO Shortlist, A5
Allen and Alan play a game. A nonconstant polynomial $P(x,y)$ with real coefficients and a positive integer $d$ greater than the degree of $P$ are known to both Allen and Alan. Alan thinks of a polynomial $Q(x,y)$ with real coefficients and degree at most $d$ and keeps it secret. Allen can make queries of the form $(s,t)$, where $s$ and $t$ are real numbers such that $P(s,t)\neq0$. Alan must respond with the value $Q(s,t)$. Allen's goal is to determine whether $P$ divides $Q$. Find (in terms of $P$ and $d$) the smallest positive integer, $g$, such that Allen can always achieve this goal making no more than $g$ queries.
[i]Linus Tang[/i]
2023 ELMO Shortlist, G3
Two triangles intersect to form seven finite disjoint regions, six of which are triangles with area 1. The last region is a hexagon with area \(A\). Compute the minimum possible value of \(A\).
[i]Proposed by Karthik Vedula[/i]
2024 ELMO Shortlist, A6
Let $\mathbb R^+$ denote the set of positive real numbers. Find all functions $f:\mathbb R^+\to\mathbb R$ and $g:\mathbb R^+\to\mathbb R$ such that for all $x,y\in\mathbb R^+$, $g(x)-g(y)=(x-y)f(xy)$.
[i]Linus Tang[/i]