Found problems: 190
Revenge EL(S)MO 2024, PDF + Others
[b]The [color = #833]R[/color]ELMO has concluded[/b]. Thanks to all participants!
[rule]
[center]
[size = 250][b][color = #833]Revenge[/color][/b] ELMO, Year Three
[/size]
[img width = 40]
https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcQrox2Fm5Kg9-F5edUKOykXa6Bbtzr2Os00ZBlhhNx6YiXgyORoJUIFpVbjBdh4bUPwIYE&usqp=CAU[/img]
[/center]
[rule]
[size = 150]Overview[/size]
The [b]ELMO[/b] is an annual contest given to [b]new students[/b] at the USA Math Olympiad Program, written completely by the [b]returning students[/b]....
The [b][color = #833]R[/color]ELMO[/b] is an annual contest given to [b]returning students[/b] at the USA Math Olympiad Program, written completely by the [b]new students[/b]!
We are inviting everybody from AoPS to take the RELMO. On [b]June 16th[/b], while the returning MOPpers are taking the RELMO, we will publish the problems on [b]this thread[/b].
[rule]
[size = 150]Rules And Procedures[/size]
Find the test links here: [hide]
[url=https://drive.google.com/file/d/1UkFM1WJn9vu6kf4aALIguE7gfdNxk527/view?usp=drive_link]The RELMO[/url]
[hide = The S variants]
[url=https://drive.google.com/file/d/10PBVMIWN6Fy4ooJlqpk9D7qo4IIEhrc8/view?usp=drive_link]The RELSMO[/url]
[rule]
[url=https://drive.google.com/file/d/1USsVgml7yveN5IlqnaAae9op0zLzG-_n/view?usp=drive_link]The RELBMO[/url]
[url=https://drive.google.com/file/d/1dYlw8339D-tUfvM-9lsqDWN66XDASJOO/view?usp=drive_link]The RELMORZ[/url]
[url=https://drive.google.com/file/d/10SIm5jb7aqQqN8x1vjlhCm88vRu-JgyN/view?usp=drive_link]The RELSSMO[/url]
[url=https://drive.google.com/file/d/1YUJ6atkC2wU6x_DZmjszXV0Flzr_W5SX/view?usp=drive_link]The RELXMO[/url]
[/hide][/hide]
[hide = Test Errata]
For problem 2 on the RELMO: assume that the quadrilateral is convex.
[/hide]
The [b][color = #833]RELMO[/color][/b] consists of [b]six problems[/b] to be solved in [b]four and a half hours[/b]. Online submissions will be [b]unofficially graded[/b] – when the test is released, there will be a google form to submit solutions.
If you would like some practice before the test, we recommend that you take a look at the past two RELMO's: [url=https://artofproblemsolving.com/community/c5t32737f5h2870938](Year 1)[/url] [url = https://artofproblemsolving.com/community/c5h3098990](Year 2)[/url]
[rule]
We hope you enjoy the problems!
[color = #833] - the new MOPpers[/color]
2024 ELMO Shortlist, C4
Let $n \geq 2$ be a positive integer. Let $\mathcal{R}$ be a connected set of unit squares on a grid. A [i]bar[/i] is a rectangle of length or width $1$ which is fully contained in $\mathcal{R}$. A bar is [i]special[/i] if it is not fully contained within any larger bar. Given that $\mathcal{R}$ contains special bars of sizes $1 \times 2,1 \times 3,\ldots,1 \times n$, find the smallest possible number of unit squares in $\mathcal{R}$.
[i]Srinivas Arun[/i]
2012 ELMO Shortlist, 1
In acute triangle $ABC$, let $D,E,F$ denote the feet of the altitudes from $A,B,C$, respectively, and let $\omega$ be the circumcircle of $\triangle AEF$. Let $\omega_1$ and $\omega_2$ be the circles through $D$ tangent to $\omega$ at $E$ and $F$, respectively. Show that $\omega_1$ and $\omega_2$ meet at a point $P$ on $BC$ other than $D$.
[i]Ray Li.[/i]
2017 ELMO Shortlist, 1
Let $a_1,a_2,\dots, a_n$ be positive integers with product $P,$ where $n$ is an odd positive integer. Prove that $$\gcd(a_1^n+P,a_2^n+P,\dots, a_n^n+P)\le 2\gcd(a_1,\dots, a_n)^n.$$
[i]Proposed by Daniel Liu[/i]
2024 ELMO Shortlist, A7
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]
2024 ELMO Shortlist, N6
Given a positive integer whose base-$10$ representation is $\overline{d_k\ldots d_0}$ for some integer $k \geq 0$, where $d_k \neq 0$, a move consists of selecting some integers $0 \leq i \leq j \leq k$, such that the digits $d_j,\ldots,d_i$ are not all $0$, erasing them from $n$, and replacing them with a divisor of $\overline{d_j\ldots d_i}$ (this divisor need not have the same number of digits as $\overline{d_j\ldots d_i}$).
Prove that for all sufficiently large even integers $n$, we may apply some sequence of moves to $n$ to transform it into $2024$.
[i]Allen Wang[/i]
2017 ELMO Problems, 3
nic$\kappa$y is drawing kappas in the cells of a square grid. However, he does not want to draw kappas in three consecutive cells (horizontally, vertically, or diagonally). Find all real numbers $d>0$ such that for every positive integer $n,$ nic$\kappa$y can label at least $dn^2$ cells of an $n\times n$ square.
[i]Proposed by Mihir Singhal and Michael Kural[/i]
2024 ELMO Shortlist, C8
Let $n\ge5$ be an integer. A trapezoid with base lengths of $1$ and $r$ is tiled by $n$ (not necessarily congruent) equilateral triangles. In terms of $n$, find the maximum possible value of $r$.
[i]Linus Tang[/i]
2023 ELMO Shortlist, G1
Let \(ABCDE\) be a regular pentagon. Let \(P\) be a variable point on the interior of segment \(AB\) such that \(PA\ne PB\). The circumcircles of \(\triangle PAE\) and \(\triangle PBC\) meet again at \(Q\). Let \(R\) be the circumcenter of \(\triangle DPQ\). Show that as \(P\) varies, \(R\) lies on a fixed line.
[i]Proposed by Karthik Vedula[/i]
2024 ELMO Shortlist, C2
Let $n$ be a fixed positive integer. Ben is playing a computer game. The computer picks a tree $T$ such that no vertex of $T$ has degree $2$ and such that $T$ has exactly $n$ leaves, labeled $v_1,\ldots, v_n$. The computer then puts an integer weight on each edge of $T$, and shows Ben neither the tree $T$ nor the weights. Ben can ask queries by specifying two integers $1\leq i < j \leq n$, and the computer will return the sum of the weights on the path from $v_i$ to $v_j$. At any point, Ben can guess whether the tree's weights are all zero. He wins the game if he is correct, and loses if he is incorrect.
(a) Show that if Ben asks all $\binom n2$ possible queries, then he can guarantee victory.
(b) Does Ben have a strategy to guarantee victory in less than $\binom n2$ queries?
[i]Brandon Wang[/i]
2014 ELMO Shortlist, 4
Find all triples $(f,g,h)$ of injective functions from the set of real numbers to itself satisfying
\begin{align*}
f(x+f(y)) &= g(x) + h(y) \\
g(x+g(y)) &= h(x) + f(y) \\
h(x+h(y)) &= f(x) + g(y)
\end{align*}
for all real numbers $x$ and $y$. (We say a function $F$ is [i]injective[/i] if $F(a)\neq F(b)$ for any distinct real numbers $a$ and $b$.)
[i]Proposed by Evan Chen[/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]
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]
2023 ELMO Shortlist, N2
Determine the greatest positive integer \(n\) for which there exists a sequence of distinct positive integers \(s_1\), \(s_2\), \(\ldots\), \(s_n\) satisfying \[s_1^{s_2}=s_2^{s_3}=\cdots=s_{n-1}^{s_n}.\]
[i]Proposed by Holden Mui[/i]
2013 ELMO Shortlist, 3
Let $a_1,a_2,...,a_9$ be nine real numbers, not necessarily distinct, with average $m$. Let $A$ denote the number of triples $1 \le i < j < k \le 9$ for which $a_i + a_j + a_k \ge 3m$. What is the minimum possible value of $A$?
[i]Proposed by Ray Li[/i]
2023 ELMO Shortlist, A3
Does there exist an infinite sequence of integers \(a_0\), \(a_1\), \(a_2\), \(\ldots\) such that \(a_0\ne0\) and, for any integer \(n\ge0\), the polynomial \[P_n(x)=\sum_{k=0}^na_kx^k\] has \(n\) distinct real roots?
[i]Proposed by Amol Rama and Espen Slettnes[/i]
2013 ELMO Problems, 3
Let $m_1,m_2,...,m_{2013} > 1$ be 2013 pairwise relatively prime positive integers and $A_1,A_2,...,A_{2013}$ be 2013 (possibly empty) sets with $A_i\subseteq \{1,2,...,m_i-1\}$ for $i=1,2,...,2013$. Prove that there is a positive integer $N$ such that
\[ N \le \left( 2\left\lvert A_1 \right\rvert + 1 \right)\left( 2\left\lvert A_2 \right\rvert + 1 \right)\cdots\left( 2\left\lvert A_{2013} \right\rvert + 1 \right) \]
and for each $i = 1, 2, ..., 2013$, there does [i]not[/i] exist $a \in A_i$ such that $m_i$ divides $N-a$.
[i]Proposed by Victor Wang[/i]
2009 ELMO Problems, 6
Let $p$ be an odd prime and $x$ be an integer such that $p \mid x^3 - 1$ but $p \nmid x - 1$. Prove that \[ p \mid (p - 1)!\left(x - \frac {x^2}{2} + \frac {x^3}{3} - \cdots - \frac {x^{p - 1}}{p - 1}\right).\][i]John Berman[/i]
2016 ELMO Problems, 6
Elmo is now learning olympiad geometry. In triangle $ABC$ with $AB\neq AC$, let its incircle be tangent to sides $BC$, $CA$, and $AB$ at $D$, $E$, and $F$, respectively. The internal angle bisector of $\angle BAC$ intersects lines $DE$ and $DF$ at $X$ and $Y$, respectively. Let $S$ and $T$ be distinct points on side $BC$ such that $\angle XSY=\angle XTY=90^\circ$. Finally, let $\gamma$ be the circumcircle of $\triangle AST$.
(a) Help Elmo show that $\gamma$ is tangent to the circumcircle of $\triangle ABC$.
(b) Help Elmo show that $\gamma$ is tangent to the incircle of $\triangle ABC$.
[i]James Lin[/i]
2023 ELMO Shortlist, G1
Let \(ABCDE\) be a regular pentagon. Let \(P\) be a variable point on the interior of segment \(AB\) such that \(PA\ne PB\). The circumcircles of \(\triangle PAE\) and \(\triangle PBC\) meet again at \(Q\). Let \(R\) be the circumcenter of \(\triangle DPQ\). Show that as \(P\) varies, \(R\) lies on a fixed line.
[i]Proposed by Karthik Vedula[/i]
2017 ELMO Problems, 4
An integer $n>2$ is called [i]tasty[/i] if for every ordered pair of positive integers $(a,b)$ with $a+b=n,$ at least one of $\frac{a}{b}$ and $\frac{b}{a}$ is a terminating decimal. Do there exist infinitely many tasty integers?
[i]Proposed by Vincent Huang[/i]
2017 ELMO Problems, 1
Let $a_1,a_2,\dots, a_n$ be positive integers with product $P,$ where $n$ is an odd positive integer. Prove that $$\gcd(a_1^n+P,a_2^n+P,\dots, a_n^n+P)\le 2\gcd(a_1,\dots, a_n)^n.$$
[i]Proposed by Daniel Liu[/i]
2012 ELMO Problems, 1
In acute triangle $ABC$, let $D,E,F$ denote the feet of the altitudes from $A,B,C$, respectively, and let $\omega$ be the circumcircle of $\triangle AEF$. Let $\omega_1$ and $\omega_2$ be the circles through $D$ tangent to $\omega$ at $E$ and $F$, respectively. Show that $\omega_1$ and $\omega_2$ meet at a point $P$ on $BC$ other than $D$.
[i]Ray Li.[/i]
2024 ELMO Shortlist, C3
Let $n$ and $k$ be positive integers and $G$ be a complete graph on $n$ vertices. Each edge of $G$ is colored one of $k$ colors such that every triangle consists of either three edges of the same color or three edges of three different colors. Furthermore, there exist two different-colored edges. Prove that $n\le(k-1)^2$.
[i]Linus Tang[/i]
2024 ELMO Shortlist, N5
Let $T$ be a finite set of squarefree integers.
(a) Show that there exists an integer polynomial $P(x)$ such that the set of squarefree numbers in the range of $P(n)$ across all $n \in \mathbb{Z}$ is exactly $T$.
(b) Suppose that $T$ is allowed to be infinite. Is it still true that for all choices of $T$, such an integer polynomial $P(x)$ exists?
[i]Allen Wang[/i]