Found problems: 303
1982 USAMO, 2
Let $X_r=x^r+y^r+z^r$ with $x,y,z$ real. It is known that if $S_1=0$, \[(*)\quad\frac{S_{m+n}}{m+n}=\frac{S_m}{m}\frac{S_n}{n}\] for $(m,n)=(2,3),(3,2),(2,5)$, or $(5,2)$. Determine [i]all[/i] other pairs of integers $(m,n)$ if any, so that $(*)$ holds for all real numbers $x,y,z$ such that $x+y+z=0$.
2007 Moldova National Olympiad, 11.7
Given a tetrahedron $VABC$ with edges $VA$, $VB$ and $VC$ perpendicular any two of them. The sum of the lengths of the tetrahedron's edges is $3p$. Find the maximal volume of $VABC$.
1980 USAMO, 3
Let $F_r=x^r\sin{rA}+y^r\sin{rB}+z^r\sin{rC}$, where $x,y,z,A,B,C$ are real and $A+B+C$ is an integral multiple of $\pi$. Prove that if $F_1=F_2=0$, then $F_r=0$ for all positive integral $r$.
2016 USAMO, 1
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$.
2008 Tuymaada Olympiad, 2
Is it possible to arrange on a circle all composite positive integers not exceeding $ 10^6$, so that no two neighbouring numbers are coprime?
[i]Author: L. Emelyanov[/i]
[hide="Tuymaada 2008, Junior League, First Day, Problem 2."]Prove that all composite positive integers not exceeding $ 10^6$
may be arranged on a circle so that no two neighbouring numbers are coprime. [/hide]
2004 India IMO Training Camp, 2
Prove that for every positive integer $n$ there exists an $n$-digit number divisible by $5^n$ all of whose digits are odd.
2018 USAJMO, 5
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]
2023 USAMO, 2
Let $\mathbb{R}^+$ be the set of positive real numbers. Find all functions $f \colon \mathbb{R}^+ \to \mathbb{R}^+$ such that, for all $x,y \in \mathbb{R}^+$,
$$f(xy+f(x))=xf(y)+2.$$
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$).
2023 USAJMO Solutions by peace09, 5
A positive integer $a$ is selected, and some positive integers are written on a board. Alice and Bob play the following game. On Alice's turn, she must replace some integer $n$ on the board with $n+a$, and on Bob's turn he must replace some even integer $n$ on the board with $n/2$. Alice goes first and they alternate turns. If on his turn Bob has no valid moves, the game ends.
After analyzing the integers on the board, Bob realizes that, regardless of what moves Alice makes, he will be able to force the game to end eventually. Show that, in fact, for this value of $a$ and these integers on the board, the game is guaranteed to end regardless of Alice's or Bob's moves.
2019 USAMO, 3
Let $K$ be the set of all positive integers that do not contain the digit $7$ in their base-$10$ representation. Find all polynomials $f$ with nonnegative integer coefficients such that $f(n)\in K$ whenever $n\in K$.
[i]Proposed by Titu Andreescu, Cosmin Pohoata, and Vlad Matei[/i]
2014 Math Prize For Girls Problems, 2
Let $x_1$, $x_2$, …, $x_{10}$ be 10 numbers. Suppose that $x_i + 2 x_{i + 1} = 1$ for each $i$ from 1 through 9. What is the value of $x_1 + 512 x_{10}$?
2020 CHMMC Winter (2020-21), 10
Let $\omega$ be a nonreal $47$th root of unity. Suppose that $\mathcal{S}$ is the set of polynomials of degree at most $46$ and coefficients equal to either $0$ or $1$. Let $N$ be the number of polynomials $Q \in \mathcal{S}$ such that
\[
\sum_{j = 0}^{46} \frac{Q(\omega^{2j}) - Q(\omega^{j})}{\omega^{4j} + \omega^{3j} + \omega^{2j} + \omega^j + 1} = 47.
\]
The prime factorization of $N$ is $p_1^{\alpha_1}p_2^{\alpha_2} \dots p_s^{\alpha_s}$ where $p_1, \ldots, p_s$ are distinct primes and $\alpha_1, \alpha_2, \ldots, \alpha_s$ are positive integers. Compute $\sum_{j = 1}^s p_j\alpha_j$.
2020 CHMMC Winter (2020-21), 5
[i](8 pts)[/i] Let $n$ be a positive integer, and let $a, b, c$ be real numbers.
(a) [i](2 pts)[/i] Given that $a\cos x+b\cos 2x +c\cos 3x \geq -1$ for all reals $x$, find, with proof, the maximum possible value of $a+b+c$.
(b) [i](6 pts)[/i] Let $f$ be a degree $n$ polynomial with real coefficients. Suppose that $|f(z)| \leq \left|f(z)+\frac{2}{z}\right|$ for all complex $z$ lying on the unit circle. Find, with proof, the maximum possible value of $f(1)$.
2022 USAMO, 2
Let $b\geq2$ and $w\geq2$ be fixed integers, and $n=b+w$. Given are $2b$ identical black rods and $2w$ identical white rods, each of side length 1.
We assemble a regular $2n-$gon using these rods so that parallel sides are the same color. Then, a convex $2b$-gon $B$ is formed by translating the black rods, and a convex $2w$-gon $W$ is formed by translating the white rods. An example of one way of doing the assembly when $b=3$ and $w=2$ is shown below, as well as the resulting polygons $B$ and $W$.
[asy]size(10cm);
real w = 2*Sin(18);
real h = 0.10 * w;
real d = 0.33 * h;
picture wht;
picture blk;
draw(wht, (0,0)--(w,0)--(w+d,h)--(-d,h)--cycle);
fill(blk, (0,0)--(w,0)--(w+d,h)--(-d,h)--cycle, black);
// draw(unitcircle, blue+dotted);
// Original polygon
add(shift(dir(108))*blk);
add(shift(dir(72))*rotate(324)*blk);
add(shift(dir(36))*rotate(288)*wht);
add(shift(dir(0))*rotate(252)*blk);
add(shift(dir(324))*rotate(216)*wht);
add(shift(dir(288))*rotate(180)*blk);
add(shift(dir(252))*rotate(144)*blk);
add(shift(dir(216))*rotate(108)*wht);
add(shift(dir(180))*rotate(72)*blk);
add(shift(dir(144))*rotate(36)*wht);
// White shifted
real Wk = 1.2;
pair W1 = (1.8,0.1);
pair W2 = W1 + w*dir(36);
pair W3 = W2 + w*dir(108);
pair W4 = W3 + w*dir(216);
path Wgon = W1--W2--W3--W4--cycle;
draw(Wgon);
pair WO = (W1+W3)/2;
transform Wt = shift(WO)*scale(Wk)*shift(-WO);
draw(Wt * Wgon);
label("$W$", WO);
/*
draw(W1--Wt*W1);
draw(W2--Wt*W2);
draw(W3--Wt*W3);
draw(W4--Wt*W4);
*/
// Black shifted
real Bk = 1.10;
pair B1 = (1.5,-0.1);
pair B2 = B1 + w*dir(0);
pair B3 = B2 + w*dir(324);
pair B4 = B3 + w*dir(252);
pair B5 = B4 + w*dir(180);
pair B6 = B5 + w*dir(144);
path Bgon = B1--B2--B3--B4--B5--B6--cycle;
pair BO = (B1+B4)/2;
transform Bt = shift(BO)*scale(Bk)*shift(-BO);
fill(Bt * Bgon, black);
fill(Bgon, white);
label("$B$", BO);[/asy]
Prove that the difference of the areas of $B$ and $W$ depends only on the numbers $b$ and $w$, and not on how the $2n$-gon was assembled.
[i]Proposed by Ankan Bhattacharya[/i]
2015 USAMO, 1
Solve in integers the equation
\[ x^2+xy+y^2 = \left(\frac{x+y}{3}+1\right)^3. \]
2003 USAMO, 3
Let $n \neq 0$. For every sequence of integers \[ A = a_0,a_1,a_2,\dots, a_n \] satisfying $0 \le a_i \le i$, for $i=0,\dots,n$, define another sequence \[ t(A)= t(a_0), t(a_1), t(a_2), \dots, t(a_n) \] by setting $t(a_i)$ to be the number of terms in the sequence $A$ that precede the term $a_i$ and are different from $a_i$. Show that, starting from any sequence $A$ as above, fewer than $n$ applications of the transformation $t$ lead to a sequence $B$ such that $t(B) = B$.
2019 USAMO, 4
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]
2024 USAMO, 5
Point $D$ is selected inside acute $\triangle ABC$ so that $\angle DAC = \angle ACB$ and $\angle BDC = 90^{\circ} + \angle BAC$. Point $E$ is chosen on ray $BD$ so that $AE = EC$. Let $M$ be the midpoint of $BC$.
Show that line $AB$ is tangent to the circumcircle of triangle $BEM$.
[i]Proposed by Anton Trygub[/i]
2023 USAMO, 6
Let $ABC$ be a triangle with incenter $I$ and excenters $I_a$, $I_b$, and $I_c$ opposite $A$, $B$, and $C$, respectively. Let $D$ be an arbitrary point on the circumcircle of $\triangle{ABC}$ that does not lie on any of the lines $II_a$, $I_bI_c$, or $BC$. Suppose the circumcircles of $\triangle{DII_a}$ and $\triangle{DI_bI_c}$ intersect at two distinct points $D$ and $F$. If $E$ is the intersection of lines $DF$ and $BC$, prove that $\angle{BAD} = \angle{EAC}$.
[i]Proposed by Zach Chroman[/i]
1983 USAMO, 1
On a given circle, six points $A$, $B$, $C$, $D$, $E$, and $F$ are chosen at random, independently and uniformly with respect to arc length. Determine the probability that the two triangles $ABC$ and $DEF$ are disjoint, i.e., have no common points.
1990 USAMO, 1
A certain state issues license plates consisting of six digits (from 0 to 9). The state requires that any two license plates differ in at least two places. (For instance, the numbers 027592 and 020592 cannot both be used.) Determine, with proof, the maximum number of distinct license plates that the state can use.
1988 USAMO, 3
A function $f(S)$ assigns to each nine-element subset of $S$ of the set $\{1,2,\ldots, 20\}$ a whole number from $1$ to $20$. Prove that regardless of how the function $f$ is chosen, there will be a ten-element subset $T\subset\{1,2,\ldots, 20\}$ such that $f(T - \{k\})\neq k$ for all $k\in T$.
2011 Purple Comet Problems, 21
If a, b, and c are non-negative real numbers satisfying $a + b + c = 400$, fi nd the maximum possible value of $\sqrt{2a+b}+\sqrt{2b+c}+\sqrt{2c+a}$.
2025 USAMO, 6
Let $m$ and $n$ be positive integers with $m\geq n$. There are $m$ cupcakes of different flavors arranged around a circle and $n$ people who like cupcakes. Each person assigns a nonnegative real number score to each cupcake, depending on how much they like the cupcake. Suppose that for each person $P$, it is possible to partition the circle of $m$ cupcakes into $n$ groups of consecutive cupcakes so that the sum of $P$'s scores of the cupcakes in each group is at least $1$. Prove that it is possible to distribute the $m$ cupcakes to the $n$ people so that each person $P$ receives cupcakes of total score at least $1$ with respect to $P$.