Found problems: 275
1986 USAMO, 4
Two distinct circles $K_1$ and $K_2$ are drawn in the plane. They intersect at points $A$ and $B$, where $AB$ is the diameter of $K_1$. A point $P$ on $K_2$ and inside $K_1$ is also given.
Using only a "T-square" (i.e. an instrument which can produce a straight line joining two points and the perpendicular to a line through a point on or off the line), find a construction for two points $C$ and $D$ on $K_1$ such that $CD$ is perpendicular to $AB$ and $\angle CPD$ is a right angle.
2011 USAMO, 6
Let $A$ be a set with $|A|=225$, meaning that $A$ has 225 elements. Suppose further that there are eleven subsets $A_1, \ldots, A_{11}$ of $A$ such that $|A_i|=45$ for $1\leq i\leq11$ and $|A_i\cap A_j|=9$ for $1\leq i<j\leq11$. Prove that $|A_1\cup A_2\cup\ldots\cup A_{11}|\geq 165$, and give an example for which equality holds.
1986 India National Olympiad, 5
If $ P(x)$ is a polynomial with integer coefficients and $ a$, $ b$, $ c$, three distinct integers, then show that it is impossible to have $ P(a)\equal{}b$, $ P(b)\equal{}c$, $ P(c)\equal{}a$.
2023 USAMO, 3
Consider an $n$-by-$n$ board of unit squares for some odd positive integer $n$. We say that a collection $C$ of identical dominoes is a [i]maximal grid-aligned configuration[/i] on the board if $C$ consists of $(n^2-1)/2$ dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: $C$ then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let $k(C)$ be the number of distinct maximal grid-aligned configurations obtainable from $C$ by repeatedly sliding dominoes. Find all possible values of $k(C)$ as a function of $n$.
[i]Proposed by Holden Mui[/i]
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
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.
2016 USAMO, 3
Let $\triangle ABC$ be an acute triangle, and let $I_B, I_C,$ and $O$ denote its $B$-excenter, $C$-excenter, and circumcenter, respectively. Points $E$ and $Y$ are selected on $\overline{AC}$ such that $\angle ABY=\angle CBY$ and $\overline{BE}\perp\overline{AC}$. Similarly, points $F$ and $Z$ are selected on $\overline{AB}$ such that $\angle ACZ=\angle BCZ$ and $\overline{CF}\perp\overline{AB}$.
Lines $\overleftrightarrow{I_BF}$ and $\overleftrightarrow{I_CE}$ meet at $P$. Prove that $\overline{PO}$ and $\overline{YZ}$ are perpendicular.
[i]Proposed by Evan Chen and Telv Cohl[/i]
2011 USAMO, 1
Let $a, b, c$ be positive real numbers such that $a^2+b^2+c^2+(a+b+c)^2\leq4$. Prove that
\[\frac{ab+1}{(a+b)^2}+\frac{bc+1}{(b+c)^2}+\frac{ca+1}{(c+a)^2}\geq 3.\]
2005 Korea - Final Round, 2
Let $(a_{n})_{n=1}^{\infty}$ be a sequence of positive real numbers and let $\alpha_{n}$ be the
arithmetic mean of $a_{1},..., a_{n}$ . Prove that for all positive integers $N$ ,
\[\sum_{n=1}^{N}\alpha_{n}^{2}\leq 4\sum_{n=1}^{N}a_{n}^{2}. \]
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]
2012 AIME Problems, 1
Find the number of positive integers with three not necessarily distinct digits, $abc$, with $a \neq 0$, $c \neq 0$ such that both $abc$ and $cba$ are divisible by 4.
2009 India IMO Training Camp, 3
Let $ a,b$ be two distinct odd natural numbers.Define a Sequence $ { < a_n > }_{n\ge 0}$ like following:
$ a_1 \equal{} a \\
a_2 \equal{} b \\
a_n \equal{} \text{largest odd divisor of }(a_{n \minus{} 1} \plus{} a_{n \minus{} 2})$.
Prove that there exists a natural number $ N$ such that $ a_n \equal{} gcd(a,b) \forall n\ge N$.
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)$.
1997 USAMO, 2
Let $ABC$ be a triangle. Take points $D$, $E$, $F$ on the perpendicular bisectors of $BC$, $CA$, $AB$ respectively. Show that the lines through $A$, $B$, $C$ perpendicular to $EF$, $FD$, $DE$ respectively are concurrent.
2017 USAMO, 2
Let $m_1, m_2, \ldots, m_n$ be a collection of $n$ positive integers, not necessarily distinct. For any sequence of integers $A = (a_1, \ldots, a_n)$ and any permutation $w = w_1, \ldots, w_n$ of $m_1, \ldots, m_n$, define an [i]$A$-inversion[/i] of $w$ to be a pair of entries $w_i, w_j$ with $i < j$ for which one of the following conditions holds:
[list]
[*]$a_i \ge w_i > w_j$
[*]$w_j > a_i \ge w_i$, or
[*]$w_i > w_j > a_i$.
[/list]
Show that, for any two sequences of integers $A = (a_1, \ldots, a_n)$ and $B = (b_1, \ldots, b_n)$, and for any positive integer $k$, the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $A$-inversions is equal to the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $B$-inversions.
2021 USAMO, 4
A finite set $S$ of positive integers has the property that, for each $s \in S,$ and each positive integer divisor $d$ of $s$, there exists a unique element $t \in S$ satisfying $\text{gcd}(s, t) = d$. (The elements $s$ and $t$ could be equal.)
Given this information, find all possible values for the number of elements of $S$.
2007 Pre-Preparation Course Examination, 16
Prove that $2^{2^{n}}+2^{2^{{n-1}}}+1$ has at least $n$ distinct prime divisors.
2001 USAMO, 4
Let $P$ be a point in the plane of triangle $ABC$ such that the segments $PA$, $PB$, and $PC$ are the sides of an obtuse triangle. Assume that in this triangle the obtuse angle opposes the side congruent to $PA$. Prove that $\angle BAC$ is acute.
2011 USAJMO, 2
Let $a, b, c$ be positive real numbers such that $a^2+b^2+c^2+(a+b+c)^2\leq4$. Prove that
\[\frac{ab+1}{(a+b)^2}+\frac{bc+1}{(b+c)^2}+\frac{ca+1}{(c+a)^2}\geq 3.\]
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$.
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$.
1979 USAMO, 1
Determine all non-negative integral solutions $ (n_{1},n_{2},\dots , n_{14}) $ if any, apart from permutations, of the Diophantine Equation \[n_{1}^{4}+n_{2}^{4}+\cdots+n_{14}^{4}=1,599.\]