Found problems: 190
2019 ELMO Shortlist, G3
Let $\triangle ABC$ be an acute triangle with incenter $I$ and circumcenter $O$. The incircle touches sides $BC,CA,$ and $AB$ at $D,E,$ and $F$ respectively, and $A'$ is the reflection of $A$ over $O$. The circumcircles of $ABC$ and $A'EF$ meet at $G$, and the circumcircles of $AMG$ and $A'EF$ meet at a point $H\neq G$, where $M$ is the midpoint of $EF$. Prove that if $GH$ and $EF$ meet at $T$, then $DT\perp EF$.
[i]Proposed by Ankit Bisain[/i]
2023 ELMO Shortlist, A1
Find all polynomials \(P(x)\) with real coefficients such that for all nonzero real numbers \(x\), \[P(x)+P\left(\frac1x\right) =\frac{P\left(x+\frac1x\right) +P\left(x-\frac1x\right)}2.\]
[i]Proposed by Holden Mui[/i]
2024 ELMO Shortlist, C7
Let $n\ge 2$ be a positive integer, and consider an $n\times n$ grid of $n^2$ equilateral triangles. Two triangles are adjacent if they share at least one vertex. Each triangle is colored red or blue, splitting the grid into regions.
Find, with proof, the minimum number of triangles in the largest region.
[i]Rohan Bodke[/i]
2024 ELMO Shortlist, N4
Find all pairs $(a,b)$ of positive integers such that $a^2\mid b^3+1$ and $b^2\mid a^3+1$.
[i]Linus Tang[/i]
2023 ELMO Shortlist, C7
A [i]discrete hexagon with center \((a,b,c)\) \emph{(where \(a\), \(b\), \(c\) are integers)[/i] and radius \(r\) [i](a nonnegative integer)[/i]} is the set of lattice points \((x,y,z)\) such that \(x+y+z=a+b+c\) and \(\max(|x-a|,|y-b|,|z-c|)\le r\).
Let \(n\) be a nonnegative integer and \(S\) be the set of triples \((x,y,z)\) of nonnegative integers such that \(x+y+z=n\). If \(S\) is partitioned into discrete hexagons, show that at least \(n+1\) hexagons are needed.
[i]Proposed by Linus Tang[/i]
2019 ELMO Shortlist, G1
Let $ABC$ be an acute triangle with orthocenter $H$ and circumcircle $\Gamma$. Let $BH$ intersect $AC$ at $E$, and let $CH$ intersect $AB$ at $F$. Let $AH$ intersect $\Gamma$ again at $P \neq A$. Let $PE$ intersect $\Gamma$ again at $Q \neq P$. Prove that $BQ$ bisects segment $\overline{EF}$.
[i]Proposed by Luke Robitaille[/i]
2015 ELMO Problems, 4
Let $a > 1$ be a positive integer. Prove that for some nonnegative integer $n$, the number $2^{2^n}+a$ is not prime.
[i]Proposed by Jack Gurev[/i]
2017 ELMO Shortlist, 1
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 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]
2024 ELMO Shortlist, N4
Find all pairs $(a,b)$ of positive integers such that $a^2\mid b^3+1$ and $b^2\mid a^3+1$.
[i]Linus Tang[/i]
2017 ELMO Shortlist, 2
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]
2010 Contests, 3
Let $n > 1$ be a positive integer. A 2-dimensional grid, infinite in all directions, is given. Each 1 by 1 square in a given $n$ by $n$ square has a counter on it. A [i]move[/i] consists of taking $n$ adjacent counters in a row or column and sliding them each by one space along that row or column. A [i]returning sequence[/i] is a finite sequence of moves such that all counters again fill the original $n$ by $n$ square at the end of the sequence.
[list]
[*] Assume that all counters are distinguishable except two, which are indistinguishable from each other. Prove that any distinguishable arrangement of counters in the $n$ by $n$ square can be reached by a returning sequence.
[*] Assume all counters are distinguishable. Prove that there is no returning sequence that switches two counters and returns the rest to their original positions.[/list]
[i]Mitchell Lee and Benjamin Gunby.[/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]
2023 ELMO Shortlist, G7
Let \(\mathcal E\) be an ellipse with foci \(F_1\) and \(F_2\), and let \(P\) be a point on \(\mathcal E\). Suppose lines \(PF_1\) and \(PF_2\) intersect \(\mathcal E\) again at distinct points \(A\) and \(B\), and the tangents to \(\mathcal E\) at \(A\) and \(B\) intersect at point \(Q\). Show that the midpoint of \(\overline{PQ}\) lies on the circumcircle of \(\triangle PF_1F_2\).
[i]Proposed by Karthik Vedula[/i]
2014 Contests, 1
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, N3
Given a positive integer $k$, find all polynomials $P$ of degree $k$ with integer coefficients such that for all positive integers $n$ where all of $P(n)$, $P(2024n)$, $P(2024^2n)$ are nonzero, we have
$$\frac{\gcd(P(2024n), P(2024^2n))}{\gcd(P(n), P(2024n))}=2024^k.$$
[i]Allen Wang[/i]
2023 ELMO Shortlist, C1
Elmo has 2023 cookie jars, all initially empty. Every day, he chooses two distinct jars and places a cookie in each. Every night, Cookie Monster finds a jar with the most cookies and eats all of them. If this process continues indefinitely, what is the maximum possible number of cookies that the Cookie Monster could eat in one night?
[i]Proposed by Espen Slettnes[/i]
2024 ELMO Shortlist, G1
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, C2
Alice is performing a magic trick. She has a standard deck of 52 cards, which she may order beforehand. She invites a volunteer to pick an integer \(0\le n\le 52\), and cuts the deck into a pile with the top \(n\) cards and a pile with the remaining \(52-n\). She then gives both piles to the volunteer, who riffles them together and hands the deck back to her face down. (Thus, in the resulting deck, the cards that were in the deck of size \(n\) appear in order, as do the cards that were in the deck of size \(52-n\).)
Alice then flips the cards over one-by-one from the top. Before flipping over each card, she may choose to guess the color of the card she is about to flip over. She stops if she guesses incorrectly. What is the maximum number of correct guesses she can guarantee?
[i]Proposed by Espen Slettnes[/i]
2023 ELMO Shortlist, A6
Let \(\mathbb R_{>0}\) denote the set of positive real numbers and \(\mathbb R_{\ge0}\) the set of nonnegative real numbers. Find all functions \(f:\mathbb R\times \mathbb R_{>0}\to \mathbb R_{\ge0}\) such that for all real numbers \(a\), \(b\), \(x\), \(y\) with \(x,y>0\), we have \[f(a,x)+f(b,y)=f(a+b,x+y)+f(ay-bx,xy(x+y)).\]
[i]Proposed by Luke Robitaille[/i]
2023 ELMO Shortlist, G8
Convex quadrilaterals \(ABCD\), \(A_1B_1C_1D_1\), and \(A_2B_2C_2D_2\) are similar with vertices in order. Points \(A\), \(A_1\), \(B_2\), \(B\) are collinear in order, points \(B\), \(B_1\), \(C_2\), \(C\) are collinear in order, points \(C\), \(C_1\), \(D_2\), \(D\) are collinear in order, and points \(D\), \(D_1\), \(A_2\), \(A\) are collinear in order. Diagonals \(AC\) and \(BD\) intersect at \(P\), diagonals \(A_1C_1\) and \(B_1D_1\) intersect at \(P_1\), and diagonals \(A_2C_2\) and \(B_2D_2\) intersect at \(P_2\). Prove that points \(P\), \(P_1\), and \(P_2\) are collinear.
[i]Proposed by Holden Mui[/i]
2024 ELMO Shortlist, C1
Let $n \ge 3$ be a positive integer, and let $S$ be a set of $n$ distinct points in the plane. Call an unordered pair of distinct points ${A,B}$ [i]tasty[/i] if there exists a circle passing through $A$ and $B$ not passing through or containing any other point in $S$. Find the maximum number of tasty pairs over all possible sets $S$ of $n$ points.
[i]Tiger Zhang[/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]
2024 ELMO Shortlist, A2
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]
2019 ELMO Shortlist, G4
Let triangle $ABC$ have altitudes $BE$ and $CF$ which meet at $H$. The reflection of $A$ over $BC$ is $A'$. Let $(ABC)$ meet $(AA'E)$ at $P$ and $(AA'F)$ at $Q$. Let $BC$ meet $PQ$ at $R$. Prove that $EF \parallel HR$.
[i]Proposed by Daniel Hu[/i]