Found problems: 303
2019 USAMO, 6
Find all polynomials $P$ with real coefficients such that $$\frac{P(x)}{yz}+\frac{P(y)}{zx}+\frac{P(z)}{xy}=P(x-y)+P(y-z)+P(z-x)$$ holds for all nonzero real numbers $x,y,z$ satisfying $2xyz=x+y+z$.
[i]Proposed by Titu Andreescu and Gabriel Dospinescu[/i]
2019 USAMO, 5
Two rational numbers \(\tfrac{m}{n}\) and \(\tfrac{n}{m}\) are written on a blackboard, where \(m\) and \(n\) are relatively prime positive integers. At any point, Evan may pick two of the numbers \(x\) and \(y\) written on the board and write either their arithmetic mean \(\tfrac{x+y}{2}\) or their harmonic mean \(\tfrac{2xy}{x+y}\) on the board as well. Find all pairs \((m,n)\) such that Evan can write 1 on the board in finitely many steps.
[i]Proposed by Yannick Yao[/i]
1976 USAMO, 1
(a) Suppose that each square of a 4 x 7 chessboard is colored either black or white. Prove that with [i]any[/i] such coloring, the board must contain a rectangle (formed by the horizontal and vertical lines of the board) whose four distinct unit corner squares are all of the same color.
(b) Exhibit a black-white coloring of a 4 x6 board in which the four corner squares of every rectangle, as described above, are not all of the same color.
1985 USAMO, 1
Determine whether or not there are any positive integral solutions of the simultaneous equations
\begin{align*}x_1^2+x_2^2+\cdots+x_{1985}^2&=y^3,\\
x_1^3+x_2^3+\cdots+x_{1985}^3&=z^2\end{align*}
with distinct integers $x_1$, $x_2$, $\ldots$, $x_{1985}$.
2019 USAJMO, 5
Let $n$ be a nonnegative integer. Determine the number of ways that one can choose $(n+1)^2$ sets $S_{i,j}\subseteq\{1,2,\ldots,2n\}$, for integers $i,j$ with $0\leq i,j\leq n$, such that:
[list]
[*] for all $0\leq i,j\leq n$, the set $S_{i,j}$ has $i+j$ elements; and
[*] $S_{i,j}\subseteq S_{k,l}$ whenever $0\leq i\leq k\leq n$ and $0\leq j\leq l\leq n$.
[/list]
[i]Proposed by Ricky Liu[/i]
1989 USAMO, 2
The 20 members of a local tennis club have scheduled exactly 14 two-person games among themselves, with each member playing in at least one game. Prove that within this schedule there must be a set of 6 games with 12 distinct players.
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?
2014 USAJMO, 3
Let $\mathbb{Z}$ be the set of integers. Find all functions $f : \mathbb{Z} \rightarrow \mathbb{Z}$ such that \[xf(2f(y)-x)+y^2f(2x-f(y))=\frac{f(x)^2}{x}+f(yf(y))\] for all $x, y \in \mathbb{Z}$ with $x \neq 0$.
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.
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$.
2020 CHMMC Winter (2020-21), 9
Triangle $ABC$ has circumcenter $O$ and circumcircle $\omega$. Let $A_{\omega}$ be the point diametrically opposite $A$ on $\omega$, and let $H$ be the foot of the altitude from $A$ onto $BC$. Let $H_B$ and $H_C$ be the reflections of $H$ over $B$ and $C$, respectively. Point $P$ is the intersection of line $A_{\omega}B$ and the perpendicular of $BC$ at point $H_B$, and point $Q$ is the intersection of line $A_{\omega}C$ and the perpendicular of $CB$ at point $H_C$. The circles $\omega_1$ and $\omega_2$ have the respective centers $P$ and $Q$ and respective radii $PA$ and $QA$. Suppose that $\omega$, $\omega_1$, and $\omega_2$ intersect at another common point $X$. If $AO = \frac{\sqrt{105}}{5}$ and $AX = 4$, then $|AB - CA|^2$ can be written as $m - n\sqrt{p}$ for positive integers $m$ and $n$ and squarefree positive integer $p$. Find $m + n + p$.
[i]Note: the reflection of a point $P$ over another point $Q \neq P$ is the point $P'$ such that $Q$ is the midpoint of $P$ and $P'$.[/i]
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 \]
1996 USAMO, 5
Let $ABC$ be a triangle, and $M$ an interior point such that $\angle MAB=10^\circ$, $\angle MBA=20^\circ$, $\angle MAC=40^\circ$ and $\angle MCA=30^\circ$. Prove that the triangle is isosceles.
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}$.
2003 USAMO, 2
A convex polygon $\mathcal{P}$ in the plane is dissected into smaller convex polygons by drawing all of its diagonals. The lengths of all sides and all diagonals of the polygon $\mathcal{P}$ are rational numbers. Prove that the lengths of all sides of all polygons in the dissection are also rational numbers.
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$.