Found problems: 303
2011 USA TSTST, 3
Prove that there exists a real constant $c$ such that for any pair $(x,y)$ of real numbers, there exist relatively prime integers $m$ and $n$ satisfying the relation
\[
\sqrt{(x-m)^2 + (y-n)^2} < c\log (x^2 + y^2 + 2).
\]
2016 USAJMO, 3
Let $X_1, X_2, \ldots, X_{100}$ be a sequence of mutually distinct nonempty subsets of a set $S$. Any two sets $X_i$ and $X_{i+1}$ are disjoint and their union is not the whole set $S$, that is, $X_i\cap X_{i+1}=\emptyset$ and $X_i\cup X_{i+1}\neq S$, for all $i\in\{1, \ldots, 99\}$. Find the smallest possible number of elements in $S$.
2025 USAMO, 4
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$.
2023 USAMO, 5
Let $n\geq3$ be an integer. We say that an arrangement of the numbers $1$, $2$, $\dots$, $n^2$ in a $n \times n$ table is [i]row-valid[/i] if the numbers in each row can be permuted to form an arithmetic progression, and [i]column-valid[/i] if the numbers in each column can be permuted to form an arithmetic progression. For what values of $n$ is it possible to transform any row-valid arrangement into a column-valid arrangement by permuting the numbers in each row?
2014 Contests, 2
Let $a_1,a_2,a_3,\ldots$ be a sequence of integers, with the property that every consecutive group of $a_i$'s averages to a perfect square. More precisely, for every positive integers $n$ and $k$, the quantity \[\frac{a_n+a_{n+1}+\cdots+a_{n+k-1}}{k}\] is always the square of an integer. Prove that the sequence must be constant (all $a_i$ are equal to the same perfect square).
[i]Evan O'Dorney and Victor Wang[/i]
2024 USAMO, 1
Find all integers $n \geq 3$ such that the following property holds: if we list the divisors of $n!$ in increasing order as $1 = d_1 < d_2 < \dots < d_k = n!$, then we have
\[ d_2 - d_1 \leq d_3 - d_2 \leq \dots \leq d_k - d_{k-1}. \]
[i]Proposed by Luke Robitaille.[/i]
2007 AIME Problems, 12
The increasing geometric sequence $x_{0},x_{1},x_{2},\ldots$ consists entirely of integral powers of $3.$ Given that \[\sum_{n=0}^{7}\log_{3}(x_{n}) = 308\qquad\text{and}\qquad 56 \leq \log_{3}\left ( \sum_{n=0}^{7}x_{n}\right ) \leq 57,\] find $\log_{3}(x_{14}).$
2013 NIMO Problems, 8
Let $AXYZB$ be a convex pentagon inscribed in a semicircle with diameter $AB$. Suppose that $AZ-AX=6$, $BX-BZ=9$, $AY=12$, and $BY=5$. Find the greatest integer not exceeding the perimeter of quadrilateral $OXYZ$, where $O$ is the midpoint of $AB$.
[i]Proposed by Evan Chen[/i]
2011 USAMO, 3
In hexagon $ABCDEF$, which is nonconvex but not self-intersecting, no pair of opposite sides are parallel. The internal angles satisfy $\angle A=3\angle D$, $\angle C=3\angle F$, and $\angle E=3\angle B$. Furthermore $AB=DE$, $BC=EF$, and $CD=FA$. Prove that diagonals $\overline{AD}$, $\overline{BE}$, and $\overline{CF}$ are concurrent.
1974 USAMO, 1
Let $ a,b,$ and $ c$ denote three distinct integers, and let $ P$ denote a polynomial having integer coefficients. Show that it is impossible that $ P(a) \equal{} b, P(b) \equal{} c,$ and $ P(c) \equal{} a$.
2011 USA TSTST, 6
Let $a, b, c$ be positive real numbers in the interval $[0, 1]$ with $a+b, b+c, c+a \ge 1$. Prove that
\[
1 \le (1-a)^2 + (1-b)^2 + (1-c)^2 +
\frac{2\sqrt{2} abc}{\sqrt{a^2+b^2+c^2}}.
\]
2005 Romania National Olympiad, 1
Let $ABCD$ be a parallelogram. The interior angle bisector of $\angle ADC$ intersects the line $BC$ in $E$, and the perpendicular bisector of the side $AD$ intersects the line $DE$ in $M$. Let $F= AM \cap BC$. Prove that:
a) $DE=AF$;
b) $AD\cdot AB = DE\cdot DM$.
[i]Daniela and Marius Lobaza, Timisoara[/i]
2017 Taiwan TST Round 1, 1
Let ${\cal C}_1$ and ${\cal C}_2$ be concentric circles, with ${\cal C}_2$ in the interior of ${\cal C}_1$. From a point $A$ on ${\cal C}_1$ one draws the tangent $AB$ to ${\cal C}_2$ ($B\in {\cal C}_2$). Let $C$ be the second point of intersection of $AB$ and ${\cal C}_1$, and let $D$ be the midpoint of $AB$. A line passing through $A$ intersects ${\cal C}_2$ at $E$ and $F$ in such a way that the perpendicular bisectors of $DE$ and $CF$ intersect at a point $M$ on $AB$. Find, with proof, the ratio $AM/MC$.
2011 Indonesia TST, 2
At a certain mathematical conference, every pair of mathematicians are either friends or strangers. At mealtime, every participant eats in one of two large dining rooms. Each mathematician insists upon eating in a room which contains an even number of his or her friends. Prove that the number of ways that the mathematicians may be split between the two rooms is a power of two (i.e., is of the form $ 2^k$ for some positive integer $ k$).
2020 CHMMC Winter (2020-21), 6
[i](9 pts)[/i] Let $ABC$ be a triangle with circumcenter $O$. The interior bisector of $\angle BAC$ intersects $BC$ at $D$. Circle $\omega_A$ is tangent to segments $AB$ and $AC$ and internally tangent to the circumcircle of $ABC$ at the point $P$. Let $E$ and $F$ be the respective points at which the $B$-excircle and $C$-excircle of $ABC$ are tangent to $AC$ and $AB$. Suppose that lines $BE$ and $CF$ pass through a common point $N$ on the circumcircle of $AEF$.
[i]Note: for a triangle $ABC$, the $A$-excircle is the circle lying outside triangle $ABC$ that is tangent to side $BC$ and the extensions of sides $AB, AC$. The $B, C$-excircles are defined similarly.[/i]
(a) [i](7 pts)[/i] Prove that the circumcircle of $PDO$ passes through $N$.
(b) [i](2 pts)[/i] Suppose that $\frac{PD}{BC} = \frac{2}{7}$. Find, with proof, the value of $\cos (\angle BAC)$.
1981 USAMO, 4
The sum of the measures of all the face angles of a given complex polyhedral angle is equal to the sum of all its dihedral angles. Prove that the polyhedral angle is a trihedral angle.
$\mathbf{Note:}$ A convex polyhedral angle may be formed by drawing rays from an exterior point to all points of a convex polygon.
2017 USAJMO, 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$.
2018 USAMO, 2
Find all functions $f:(0,\infty) \rightarrow (0,\infty)$ such that \[f\left(x+\frac{1}{y}\right)+f\left(y+\frac{1}{z}\right) + f\left(z+\frac{1}{x}\right) = 1\] for all $x,y,z >0$ with $xyz =1$.
2012 ELMO Shortlist, 8
Consider the equilateral triangular lattice in the complex plane defined by the Eisenstein integers; let the ordered pair $(x,y)$ denote the complex number $x+y\omega$ for $\omega=e^{2\pi i/3}$. We define an $\omega$-chessboard polygon to be a (non self-intersecting) polygon whose sides are situated along lines of the form $x=a$ or $y=b$, where $a$ and $b$ are integers. These lines divide the interior into unit triangles, which are shaded alternately black and white so that adjacent triangles have different colors. To tile an $\omega$-chessboard polygon by lozenges is to exactly cover the polygon by non-overlapping rhombuses consisting of two bordering triangles. Finally, a [i]tasteful tiling[/i] is one such that for every unit hexagon tiled by three lozenges, each lozenge has a black triangle on its left (defined by clockwise orientation) and a white triangle on its right (so the lozenges are BW, BW, BW in clockwise order).
a) Prove that if an $\omega$-chessboard polygon can be tiled by lozenges, then it can be done so tastefully.
b) Prove that such a tasteful tiling is unique.
[i]Victor Wang.[/i]
1998 USAMO, 6
Let $n \geq 5$ be an integer. Find the largest integer $k$ (as a function of $n$) such that there exists a convex $n$-gon $A_{1}A_{2}\dots A_{n}$ for which exactly $k$ of the quadrilaterals $A_{i}A_{i+1}A_{i+2}A_{i+3}$ have an inscribed circle. (Here $A_{n+j} = A_{j}$.)
1993 USAMO, 2
Let $\, ABCD \,$ be a convex quadrilateral such that diagonals $\, AC \,$ and $\, BD \,$ intersect at right angles, and let $\, E \,$ be their intersection. Prove that the reflections of $\, E \,$ across $\, AB, \, BC, \, CD, \, DA \,$ are concyclic.
2018 USAMO, 4
Let $p$ be a prime, and let $a_1, \dots, a_p$ be integers. Show that there exists an integer $k$ such that the numbers
\[a_1 + k, a_2 + 2k, \dots, a_p + pk\]
produce at least $\tfrac{1}{2} p$ distinct remainders upon division by $p$.
[i]Proposed by Ankan Bhattacharya[/i]
2010 USAMO, 3
The 2010 positive numbers $a_1, a_2, \ldots , a_{2010}$ satisfy the inequality $a_ia_j \le i+j$ for all distinct indices $i, j$. Determine, with proof, the largest possible value of the product $a_1a_2\ldots a_{2010}$.
1982 USAMO, 4
Prove that there exists a positive integer $k$ such that $k\cdot2^n+1$ is composite for every integer $n$.
2004 Germany Team Selection Test, 2
Find all pairs of positive integers $\left(n;\;k\right)$ such that $n!=\left( n+1\right)^{k}-1$.