Found problems: 275
2018 USAJMO, 4
Triangle $ABC$ is inscribed in a circle of radius 2 with $\angle ABC \geq 90^\circ$, and $x$ is a real number satisfying the equation $x^4 + ax^3 + bx^2 + cx + 1 = 0$, where $a=BC$, $b=CA$, $c=AB$. Find all possible values of $x$.
2015 Switzerland Team Selection Test, 12
Given positive integers $m$ and $n$, prove that there is a positive integer $c$ such that the numbers $cm$ and $cn$ have the same number of occurrences of each non-zero digit when written in base ten.
2016 USAJMO, 6
Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all real numbers $x$ and $y$,
$$(f(x)+xy)\cdot f(x-3y)+(f(y)+xy)\cdot f(3x-y)=(f(x+y))^2.$$
2022 USAMO, 6
There are $2022$ users on a social network called Mathbook, and some of them are Mathbook-friends. (On Mathbook, friendship is always mutual and permanent.)
Starting now, Mathbook will only allow a new friendship to be formed between two users if they have [i]at least two[/i] friends in common. What is the minimum number of friendships that must already exist so that every user could eventually become friends with every other user?
2025 USAJMO, 1
Let $\mathbb Z$ be the set of integers, and let $f\colon \mathbb Z \to \mathbb Z$ be a function. Prove that there are infinitely many integers $c$ such that the function $g\colon \mathbb Z \to \mathbb Z$ defined by $g(x) = f(x) + cx$ is not bijective.
[i]Note: [/i] A function $g\colon \mathbb Z \to \mathbb Z$ is bijective if for every integer $b$, there exists exactly one integer $a$ such that $g(a) = b$.
2003 USAMO, 6
At the vertices of a regular hexagon are written six nonnegative integers whose sum is $2003^{2003}$. Bert is allowed to make moves of the following form: he may pick a vertex and replace the number written there by the absolute value of the difference between the numbers written at the two neighboring vertices. Prove that Bert can make a sequence of moves, after which the number 0 appears at all six vertices.
1997 USAMO, 5
Prove that, for all positive real numbers $ a$, $ b$, $ c$, the inequality
\[ \frac {1}{a^3 \plus{} b^3 \plus{} abc} \plus{} \frac {1}{b^3 \plus{} c^3 \plus{} abc} \plus{} \frac {1}{c^3 \plus{} a^3 \plus{} abc} \leq \frac {1}{abc}
\]
holds.
2015 USAMO, 6
Consider $0<\lambda<1$, and let $A$ be a multiset of positive integers. Let $A_n=\{a\in A: a\leq n\}$. Assume that for every $n\in\mathbb{N}$, the set $A_n$ contains at most $n\lambda$ numbers. Show that there are infinitely many $n\in\mathbb{N}$ for which the sum of the elements in $A_n$ is at most $\frac{n(n+1)}{2}\lambda$. (A multiset is a set-like collection of elements in which order is ignored, but repetition of elements is allowed and multiplicity of elements is significant. For example, multisets $\{1, 2, 3\}$ and $\{2, 1, 3\}$ are equivalent, but $\{1, 1, 2, 3\}$ and $\{1, 2, 3\}$ differ.)
1984 USAMO, 4
A difficult mathematical competition consisted of a Part I and a Part II with a combined total of $28$ problems. Each contestant solved $7$ problems altogether. For each pair of problems, there were exactly two contestants who solved both of them. Prove that there was a contestant who, in Part I, solved either no problems or at least four problems.
2016 USAMO, 6
Integers $n$ and $k$ are given, with $n\ge k\ge2$. You play the following game against an evil wizard.
The wizard has $2n$ cards; for each $i=1,\ldots,n$, there are two cards labeled $i$. Initially, the wizard places all cards face down in a row, in unknown order.
You may repeatedly make moves of the following form: you point to any $k$ of the cards. The wizard then turns those cards face up. If any two of the cards match, the game is over and you win. Otherwise, you must look away, while the wizard arbitrarily permutes the $k$ chosen cards and then turns them back face-down. Then, it is your turn again.
We say this game is [i]winnable[/i] if there exist some positive integer $m$ and some strategy that is guaranteed to win in at most $m$ moves, no matter how the wizard responds.
For which values of $n$ and $k$ is the game winnable?
2012 Olympic Revenge, 3
Let $G$ be a finite graph. Prove that one can partition $G$ into two graphs $A \cup B=G$ such that if we erase all edges conecting a vertex from $A$ to a vertex from $B$, each vertex of the new graph has even degree.
1995 USAMO, 2
A calculator is broken so that the only keys that still work are the $ \sin$, $ \cos$, and $ \tan$ buttons, and their inverses (the $ \arcsin$, $ \arccos$, and $ \arctan$ buttons). The display initially shows $ 0$. Given any positive rational number $ q$, show that pressing some finite sequence of buttons will yield the number $ q$ on the display. Assume that the calculator does real number calculations with infinite precision. All functions are in terms of radians.
2017 USAMO, 6
Find the minimum possible value of \[\frac{a}{b^3+4}+\frac{b}{c^3+4}+\frac{c}{d^3+4}+\frac{d}{a^3+4}\] given that $a$, $b$, $c$, $d$ are nonnegative real numbers such that $a+b+c+d=4$.
[i]Proposed by Titu Andreescu[/i]
1991 USAMO, 4
Let $a = \frac{m^{m+1} + n^{n+1}}{m^m + n^n}$, where $m$ and $n$ are positive integers. Prove that $a^m + a^n \geq m^m + n^n$.
2010 Korea National Olympiad, 1
$ x, y, z $ are positive real numbers such that $ x+y+z=1 $. Prove that
\[ \sqrt{ \frac{x}{1-x} } + \sqrt{ \frac{y}{1-y} } + \sqrt{ \frac{z}{1-z} } > 2 \]
2014 USAMO, 6
Prove that there is a constant $c>0$ with the following property: If $a, b, n$ are positive integers such that $\gcd(a+i, b+j)>1$ for all $i, j\in\{0, 1, \ldots n\}$, then\[\min\{a, b\}>c^n\cdot n^{\frac{n}{2}}.\]
2001 USAMO, 2
Let $ABC$ be a triangle and let $\omega$ be its incircle. Denote by $D_1$ and $E_1$ the points where $\omega$ is tangent to sides $BC$ and $AC$, respectively. Denote by $D_2$ and $E_2$ the points on sides $BC$ and $AC$, respectively, such that $CD_2=BD_1$ and $CE_2=AE_1$, and denote by $P$ the point of intersection of segments $AD_2$ and $BE_2$. Circle $\omega$ intersects segment $AD_2$ at two points, the closer of which to the vertex $A$ is denoted by $Q$. Prove that $AQ=D_2P$.
2011 USAMO, 5
Let $P$ be a given point inside quadrilateral $ABCD$. Points $Q_1$ and $Q_2$ are located within $ABCD$ such that
\[\angle Q_1BC=\angle ABP,\quad\angle Q_1CB=\angle DCP,\quad\angle Q_2AD=\angle BAP,\quad\angle Q_2DA=\angle CDP.\] Prove that $\overline{Q_1Q_2}\parallel\overline{AB}$ if and only if $\overline{Q_1Q_2}\parallel\overline{CD}$.
2004 France Team Selection Test, 1
Let $n$ be a positive integer, and $a_1,...,a_n, b_1,..., b_n$ be $2n$ positive real numbers such that
$a_1 + ... + a_n = b_1 + ... + b_n = 1$.
Find the minimal value of
$ \frac {a_1^2} {a_1 + b_1} + \frac {a_2^2} {a_2 + b_2} + ...+ \frac {a_n^2} {a_n + b_n}$.
1989 USAMO, 4
Let $ABC$ be an acute-angled triangle whose side lengths satisfy the inequalities $AB < AC < BC$. If point $I$ is the center of the inscribed circle of triangle $ABC$ and point $O$ is the center of the circumscribed circle, prove that line $IO$ intersects segments $AB$ and $BC$.
2022 USAMO, 3
Let $\mathbb{R}_{>0}$ be the set of all positive real numbers. Find all functions $f:\mathbb{R}_{>0} \to \mathbb{R}_{>0}$ such that for all $x,y\in \mathbb{R}_{>0}$ we have
\[f(x) = f(f(f(x)) + y) + f(xf(y)) f(x+y).\]
2025 USAJMO, 4
Let $n$ be a positive integer, and let $a_0,\,a_1,\dots,\,a_n$ be nonnegative integers such that $a_0\ge a_1\ge \dots\ge a_n.$ Prove that
\[
\sum_{i=0}^n i\binom{a_i}{2}\le\frac{1}{2}\binom{a_0+a_1+\dots+a_n}{2}.
\]
[i]Note:[/i] $\binom{k}{2}=\frac{k(k-1)}{2}$ for all nonnegative integers $k$.
2006 AIME Problems, 6
Square $ABCD$ has sides of length 1. Points $E$ and $F$ are on $\overline{BC}$ and $\overline{CD}$, respectively, so that $\triangle AEF$ is equilateral. A square with vertex $B$ has sides that are parallel to those of $ABCD$ and a vertex on $\overline{AE}$. The length of a side of this smaller square is $\displaystyle \frac{a-\sqrt{b}}{c}$, where $a$, $b$, and $c$ are positive integers and $b$ is not divisible by the square of any prime. Find $a+b+c$.
2011 USA Team Selection Test, 1
In an acute scalene triangle $ABC$, points $D,E,F$ lie on sides $BC, CA, AB$, respectively, such that $AD \perp BC, BE \perp CA, CF \perp AB$. Altitudes $AD, BE, CF$ meet at orthocenter $H$. Points $P$ and $Q$ lie on segment $EF$ such that $AP \perp EF$ and $HQ \perp EF$. Lines $DP$ and $QH$ intersect at point $R$. Compute $HQ/HR$.
[i]Proposed by Zuming Feng[/i]
1982 USAMO, 3
If a point $A_1$ is in the interior of an equilateral triangle $ABC$ and point $A_2$ is in the interior of $\triangle{A_1BC}$, prove that \[\operatorname{I.Q.} (A_1BC) > \operatorname{I.Q.} (A_2BC),\] where the [i]isoperrimetric quotient[/i] of a figure $F$ is defined by \[\operatorname{I.Q.}(F) = \frac{\operatorname{Area}(F)}{[\operatorname{Perimeter}(F)]^2}.\]