This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 190

2024 ELMO Shortlist, G6

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]

2010 ELMO Problems, 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]

2024 ELMO Shortlist, C6

For positive integers $a$ and $b$, an $(a,b)$-shuffle of a deck of $a+b$ cards is any shuffle that preserves the relative order of the top $a$ cards and the relative order of the bottom $b$ cards. Let $n$, $k$, $a_1$, $a_2$, $\dots$, $a_k$, $b_1$, $b_2$, $\dots$, $b_k$ be fixed positive integers such that $a_i+b_i=n$ for all $1\leq i\leq k$. Big Bird has a deck of $n$ cards and will perform an $(a_i,b_i)$-shuffle for each $1\leq i\leq k$, in ascending order of $i$. Suppose that Big Bird can reverse the order of the deck. Prove that Big Bird can also achieve any of the $n!$ permutations of the cards. [i]Linus Tang[/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]

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]

2015 ELMO Problems, 3

Let $\omega$ be a circle and $C$ a point outside it; distinct points $A$ and $B$ are selected on $\omega$ so that $\overline{CA}$ and $\overline{CB}$ are tangent to $\omega$. Let $X$ be the reflection of $A$ across the point $B$, and denote by $\gamma$ the circumcircle of triangle $BXC$. Suppose $\gamma$ and $\omega$ meet at $D \neq B$ and line $CD$ intersects $\omega$ at $E \neq D$. Prove that line $EX$ is tangent to the circle $\gamma$. [i]Proposed by David Stoner[/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]

2024 ELMO Shortlist, A4

Tags: Elmo , algebra
The number $2024$ is written on a blackboard. Each second, if there exist positive integers $a,b,k$ such that $a^k+b^k$ is written on the blackboard, you may write $a^{k'}+b^{k'}$ on the blackboard for any positive integer $k'.$ Find all positive integers that you can eventually write on the blackboard. [i]Srinivas Arun[/i]

2023 ELMO Shortlist, C5

Define the [i]mexth[/i] of \(k\) sets as the \(k\)th smallest positive integer that none of them contain, if it exists. Does there exist a family \(\mathcal F\) of sets of positive integers such that [list] [*]for any nonempty finite subset \(\mathcal G\) of \(\mathcal F\), the mexth of \(\mathcal G\) exists, and [*]for any positive integer \(n\), there is exactly one nonempty finite subset \(\mathcal G\) of \(\mathcal F\) such that \(n\) is the mexth of \(\mathcal G\). [/list] [i]Proposed by Espen Slettnes[/i]

2023 ELMO Shortlist, N1

Let \(m\) be a positive integer. Find, in terms of \(m\), all polynomials \(P(x)\) with integer coefficients such that for every integer \(n\), there exists an integer \(k\) such that \(P(k)=n^m\). [i]Proposed by Raymond Feng[/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, 1

Define the sequence $a_1 = 2$ and $a_n = 2^{a_{n-1}} + 2$ for all integers $n \ge 2$. Prove that $a_{n-1}$ divides $a_n$ for all integers $n \ge 2$. [i]Proposed by Sam Korsky[/i]

2017 ELMO Problems, 6

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]

2017 ELMO Shortlist, 4

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]

2019 ELMO Shortlist, G3

Tags: geometry , Elmo
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]

2013 ELMO Shortlist, 1

Tags: function , algebra , Elmo
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, G4

In quadrilateral $ABCD$ with incenter $I$, points $W,X,Y,Z$ lie on sides $AB, BC,CD,DA$ with $AZ=AW$, $BW=BX$, $CX=CY$, $DY=DZ$. Define $T=\overline{AC}\cap\overline{BD}$ and $L=\overline{WY}\cap\overline{XZ}$. Let points $O_a,O_b,O_c,O_d$ be such that $\angle O_aZA=\angle O_aWA=90^\circ$ (and cyclic variants), and $G=\overline{O_aO_c}\cap\overline{O_bO_d}$. Prove that $\overline{IL}\parallel\overline{TG}$. [i]Neal Yan[/i]

2023 ELMO Shortlist, G4

Tags: Elmo , geometry
Let \(D\) be a point on segment \(PQ\). Let \(\omega\) be a fixed circle passing through \(D\), and let \(A\) be a variable point on \(\omega\). Let \(X\) be the intersection of the tangent to the circumcircle of \(\triangle ADP\) at \(P\) and the tangent to the circumcircle of \(\triangle ADQ\) at \(Q\). Show that as \(A\) varies, \(X\) lies on a fixed line. [i]Proposed by Elliott Liu and Anthony Wang[/i]

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]

2023 ELMO Shortlist, G4

Tags: Elmo , geometry
Let \(D\) be a point on segment \(PQ\). Let \(\omega\) be a fixed circle passing through \(D\), and let \(A\) be a variable point on \(\omega\). Let \(X\) be the intersection of the tangent to the circumcircle of \(\triangle ADP\) at \(P\) and the tangent to the circumcircle of \(\triangle ADQ\) at \(Q\). Show that as \(A\) varies, \(X\) lies on a fixed line. [i]Proposed by Elliott Liu and Anthony Wang[/i]

2015 ELMO Problems, 5

Let $m, n, k > 1$ be positive integers. For a set $S$ of positive integers, define $S(i,j)$ for $i<j$ to be the number of elements in $S$ strictly between $i$ and $j$. We say two sets $(X,Y)$ are a [i]fat[/i] pair if \[ X(i,j)\equiv Y(i,j) \pmod{n} \] for every $i,j \in X \cap Y$. (In particular, if $\left\lvert X \cap Y \right\rvert < 2$ then $(X,Y)$ is fat.) If there are $m$ distinct sets of $k$ positive integers such that no two form a fat pair, show that $m<n^{k-1}$. [i]Proposed by Allen Liu[/i]

2013 ELMO Shortlist, 5

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]

2010 ELMO Shortlist, 3

2010 MOPpers are assigned numbers 1 through 2010. Each one is given a red slip and a blue slip of paper. Two positive integers, A and B, each less than or equal to 2010 are chosen. On the red slip of paper, each MOPper writes the remainder when the product of A and his or her number is divided by 2011. On the blue slip of paper, he or she writes the remainder when the product of B and his or her number is divided by 2011. The MOPpers may then perform either of the following two operations: [list] [*] Each MOPper gives his or her red slip to the MOPper whose number is written on his or her blue slip. [*] Each MOPper gives his or her blue slip to the MOPper whose number is written on his or her red slip.[/list] Show that it is always possible to perform some number of these operations such that each MOPper is holding a red slip with his or her number written on it. [i]Brian Hamrick.[/i]

2023 ELMO Shortlist, G5

Tags: Elmo , geometry
Let \(ABC\) be an acute triangle with circumcircle \(\omega\). Let \(P\) be a variable point on the arc \(BC\) of \(\omega\) not containing \(A\). Squares \(BPDE\) and \(PCFG\) are constructed such that \(A\), \(D\), \(E\) lie on the same side of line \(BP\) and \(A\), \(F\), \(G\) lie on the same side of line \(CP\). Let \(H\) be the intersection of lines \(DE\) and \(FG\). Show that as \(P\) varies, \(H\) lies on a fixed circle. [i]Proposed by Karthik Vedula[/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]