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: 105

2011 USAJMO, 6

Consider the assertion that for each positive integer $n\geq2$, the remainder upon dividing $2^{2^n}$ by $2^n-1$ is a power of $4$. Either prove the assertion or find (with proof) a counterexample.

2023 USAJMO, 2

In an acute triangle $ABC$, let $M$ be the midpoint of $\overline{BC}$. Let $P$ be the foot of the perpendicular from $C$ to $AM$. Suppose that the circumcircle of triangle $ABP$ intersects line $BC$ at two distinct points $B$ and $Q$. Let $N$ be the midpoint of $\overline{AQ}$. Prove that $NB=NC$. [i]Proposed by Holden Mui[/i]

2023 USAMO, 1

In an acute triangle $ABC$, let $M$ be the midpoint of $\overline{BC}$. Let $P$ be the foot of the perpendicular from $C$ to $AM$. Suppose that the circumcircle of triangle $ABP$ intersects line $BC$ at two distinct points $B$ and $Q$. Let $N$ be the midpoint of $\overline{AQ}$. Prove that $NB=NC$. [i]Proposed by Holden Mui[/i]

2017 USAMO, 1

Prove that there are infinitely many distinct pairs $(a, b)$ of relatively prime integers $a>1$ and $b>1$ such that $a^b+b^a$ is divisible by $a+b$.

2023 USAJMO, 1

Tags: USAJMO , Hi
Find all triples of positive integers $(x,y,z)$ that satisfy the equation $$2(x+y+z+2xyz)^2=(2xy+2yz+2zx+1)^2+2023.$$

2012 AIME Problems, 4

Ana, Bob, and Cao bike at constant rates of $8.6$ meters per second, $6.2$ meters per second, and $5$ meters per second, respectively. They all begin biking at the same time from the northeast corner of a rectangular field whose longer side runs due west. Ana starts biking along the edge of the field, initially heading west, Bob starts biking along the edge of the field, initially heading south, and Cao bikes in a straight line across the field to a point D on the south edge of the field. Cao arrives at point D at the same time that Ana and Bob arrive at D for the first time. The ratio of the field's length to the field's width to the distance from point D to the southeast corner of the field can be represented as $p : q : r$, where $p$, $q$, and $r$ are positive integers with p and q relatively prime. Find $p + q + r$.

2010 USAJMO, 3

Let $AXYZB$ be a convex pentagon inscribed in a semicircle of diameter $AB$. Denote by $P$, $Q$, $R$, $S$ the feet of the perpendiculars from $Y$ onto lines $AX$, $BX$, $AZ$, $BZ$, respectively. Prove that the acute angle formed by lines $PQ$ and $RS$ is half the size of $\angle XOZ$, where $O$ is the midpoint of segment $AB$.

2017 USAJMO, 2

Consider the equation \[(3x^3+xy^2)(x^2y+3y^3)=(x-y)^7\] (a) Prove that there are infinitely many pairs $(x,y)$ of positive integers satisfying the equation. (b) Describe all pairs $(x,y)$ of positive integers satisfying the equation.

2019 USAJMO, 2

Let $\mathbb{Z}$ be the set of all integers. Find all pairs of integers $(a,b)$ for which there exist functions $f \colon \mathbb{Z}\rightarrow \mathbb{Z}$ and $g \colon \mathbb{Z} \rightarrow \mathbb{Z}$ satisfying \[ f(g(x))=x+a \quad\text{and}\quad g(f(x))=x+b \] for all integers $x$. [i]Proposed by Ankan Bhattacharya[/i]

2015 USAJMO, 1

Tags: AMC , USA(J)MO , USAJMO
Given a sequence of real numbers, a move consists of choosing two terms and replacing each with their arithmetic mean. Show that there exists a sequence of 2015 distinct real numbers such that after one initial move is applied to the sequence -- no matter what move -- there is always a way to continue with a finite sequence of moves so as to obtain in the end a constant sequence.

2020 USOJMO, 1

Let $n \geq 2$ be an integer. Carl has $n$ books arranged on a bookshelf. Each book has a height and a width. No two books have the same height, and no two books have the same width. Initially, the books are arranged in increasing order of height from left to right. In a move, Carl picks any two adjacent books where the left book is wider and shorter than the right book, and swaps their locations. Carl does this repeatedly until no further moves are possible. Prove that regardless of how Carl makes his moves, he must stop after a finite number of moves, and when he does stop, the books are sorted in increasing order of width from left to right. [i]Proposed by Milan Haiman[/i]

2010 USAJMO, 1

A [i]permutation[/i] of the set of positive integers $[n] = \{1, 2, . . . , n\}$ is a sequence $(a_1 , a_2 , \ldots, a_n ) $ such that each element of $[n]$ appears precisely one time as a term of the sequence. For example, $(3, 5, 1, 2, 4)$ is a permutation of $[5]$. Let $P (n)$ be the number of permutations of $[n]$ for which $ka_k$ is a perfect square for all $1 \leq k \leq n$. Find with proof the smallest $n$ such that $P (n)$ is a multiple of $2010$.

2024 USAJMO, 4

Let $n \geq 3$ be an integer. Rowan and Colin play a game on an $n \times n$ grid of squares, where each square is colored either red or blue. Rowan is allowed to permute the rows of the grid and Colin is allowed to permute the columns. A grid coloring is [i]orderly[/i] if: [list] [*]no matter how Rowan permutes the rows of the coloring, Colin can then permute the columns to restore the original grid coloring; and [*]no matter how Colin permutes the columns of the coloring, Rowan can then permute the rows to restore the original grid coloring. [/list] In terms of $n$, how many orderly colorings are there? [i]Proposed by Alec Sun[/i]

2021 USAJMO, 3

Tags: USAJMO
An equilateral triangle $\Delta$ of side length $L>0$ is given. Suppose that $n$ equilateral triangles with side length 1 and with non-overlapping interiors are drawn inside $\Delta$, such that each unit equilateral triangle has sides parallel to $\Delta$, but with opposite orientation. (An example with $n=2$ is drawn below.) [asy] draw((0,0)--(1,0)--(1/2,sqrt(3)/2)--cycle,linewidth(0.5)); filldraw((0.45,0.55)--(0.65,0.55)--(0.55,0.55-sqrt(3)/2*0.2)--cycle,gray,linewidth(0.5)); filldraw((0.54,0.3)--(0.34,0.3)--(0.44,0.3-sqrt(3)/2*0.2)--cycle,gray,linewidth(0.5)); [/asy] Prove that \[n \leq \frac{2}{3} L^{2}.\]

2013 USAJMO, 1

Are there integers $a$ and $b$ such that $a^5b+3$ and $ab^5+3$ are both perfect cubes of integers?

2012 USAJMO, 3

Let $a,b,c$ be positive real numbers. Prove that $\frac{a^3+3b^3}{5a+b}+\frac{b^3+3c^3}{5b+c}+\frac{c^3+3a^3}{5c+a} \geq \frac{2}{3}(a^2+b^2+c^2)$.

2010 Contests, 1

A [i]permutation[/i] of the set of positive integers $[n] = \{1, 2, . . . , n\}$ is a sequence $(a_1 , a_2 , \ldots, a_n ) $ such that each element of $[n]$ appears precisely one time as a term of the sequence. For example, $(3, 5, 1, 2, 4)$ is a permutation of $[5]$. Let $P (n)$ be the number of permutations of $[n]$ for which $ka_k$ is a perfect square for all $1 \leq k \leq n$. Find with proof the smallest $n$ such that $P (n)$ is a multiple of $2010$.

2011 USAJMO, 1

Find, with proof, all positive integers $n$ for which $2^n + 12^n + 2011^n$ is a perfect square.

2025 USAJMO, 5

Let $H$ be the orthocenter of acute triangle $ABC$, let $F$ be the foot of the altitude from $C$ to $AB$, and let $P$ be the reflection of $H$ across $BC$. Suppose that the circumcircle of triangle $AFP$ intersects line $BC$ at two distinct points $X$ and $Y$. Prove that $C$ is the midpoint of $XY$.

2010 USAJMO, 2

Let $n > 1$ be an integer. Find, with proof, all sequences $x_1 , x_2 , \ldots , x_{n-1}$ of positive integers with the following three properties: (a). $x_1 < x_2 < \cdots < x_{n-1}$ ; (b). $x_i + x_{n-i} = 2n$ for all $i = 1, 2, \ldots , n - 1$; (c). given any two indices $i$ and $j$ (not necessarily distinct) for which $x_i + x_j < 2n$, there is an index $k$ such that $x_i + x_j = x_k$.

Russian TST 2017, P1

Are there integers $a$ and $b$ such that $a^5b+3$ and $ab^5+3$ are both perfect cubes of integers?

2025 USAJMO, 3

Let $m$ and $n$ be positive integers, and let $\mathcal R$ be a $2m\times{2n}$ grid of unit squares. A [i]domino[/i] is a $1\times2{}$ or $2\times{1}$ rectangle. A subset $S$ of grid squares in $\mathcal R$ is [i]domino-tileable[/i] if dominoes can be placed to cover every square of $S$ exactly once with no domino extending outside of $S$. [i]Note[/i]: The empty set is domino tileable. An [i]up-right path[/i] is a path from the lower-left corner of $\mathcal R$ to the upper-right corner of $\mathcal R$ formed by exactly $2m+2n$ edges of the grid squares. Determine, with proof, in terms of $m$ and $n$, the number of up-right paths that divide $\mathcal R$ into two domino-tileable subsets.

2019 USAJMO, 4

Let $ABC$ be a triangle with $\angle ABC$ obtuse. The [i]$A$-excircle[/i] is a circle in the exterior of $\triangle ABC$ that is tangent to side $BC$ of the triangle and tangent to the extensions of the other two sides. Let $E$, $F$ be the feet of the altitudes from $B$ and $C$ to lines $AC$ and $AB$, respectively. Can line $EF$ be tangent to the $A$-excircle? [i]Proposed by Ankan Bhattacharya, Zack Chroman, and Anant Mudgal[/i]

2023 USAJMO, 6

Tags: AMC , USA(J)MO , USAJMO , geometry
Isosceles triangle $ABC$, with $AB=AC$, is inscribed in circle $\omega$. Let $D$ be an arbitrary point inside $BC$ such that $BD\neq DC$. Ray $AD$ intersects $\omega$ again at $E$ (other than $A$). Point $F$ (other than $E$) is chosen on $\omega$ such that $\angle DFE = 90^\circ$. Line $FE$ intersects rays $AB$ and $AC$ at points $X$ and $Y$, respectively. Prove that $\angle XDE = \angle EDY$. [i]Proposed by Anton Trygub[/i]

2017 USAJMO, 6

Let $P_1$, $P_2$, $\dots$, $P_{2n}$ be $2n$ distinct points on the unit circle $x^2+y^2=1$, other than $(1,0)$. Each point is colored either red or blue, with exactly $n$ red points and $n$ blue points. Let $R_1$, $R_2$, $\dots$, $R_n$ be any ordering of the red points. Let $B_1$ be the nearest blue point to $R_1$ traveling counterclockwise around the circle starting from $R_1$. Then let $B_2$ be the nearest of the remaining blue points to $R_2$ travelling counterclockwise around the circle from $R_2$, and so on, until we have labeled all of the blue points $B_1, \dots, B_n$. Show that the number of counterclockwise arcs of the form $R_i \to B_i$ that contain the point $(1,0)$ is independent of the way we chose the ordering $R_1, \dots, R_n$ of the red points.