Found problems: 275
2011 USAMO, 2
An integer is assigned to each vertex of a regular pentagon so that the sum of the five integers is 2011. A turn of a solitaire game consists of subtracting an integer $m$ from each of the integers at two neighboring vertices and adding $2m$ to the opposite vertex, which is not adjacent to either of the first two vertices. (The amount $m$ and the vertices chosen can vary from turn to turn.) The game is won at a certain vertex if, after some number of turns, that vertex has the number 2011 and the other four vertices have the number 0. Prove that for any choice of the initial integers, there is exactly one vertex at which the game can be won.
2001 AMC 12/AHSME, 24
In $ \triangle ABC$, $ \angle ABC \equal{} 45^\circ$. Point $ D$ is on $ \overline{BC}$ so that $ 2 \cdot BD \equal{} CD$ and $ \angle DAB \equal{} 15^\circ$. Find $ \angle ACB$.
[asy]
pair A, B, C, D;
A = origin;
real Bcoord = 3*sqrt(2) + sqrt(6);
B = Bcoord/2*dir(180);
C = sqrt(6)*dir(120);
draw(A--B--C--cycle);
D = (C-B)/2.4 + B;
draw(A--D);
label("$A$", A, dir(0));
label("$B$", B, dir(180));
label("$C$", C, dir(110));
label("$D$", D, dir(130));
[/asy]
$ \textbf{(A)} \ 54^\circ \qquad \textbf{(B)} \ 60^\circ \qquad \textbf{(C)} \ 72^\circ \qquad \textbf{(D)} \ 75^\circ \qquad \textbf{(E)} \ 90^\circ$
1990 USAMO, 4
Find, with proof, the number of positive integers whose base-$n$ representation consists of distinct digits with the property that, except for the leftmost digit, every digit differs by $\pm 1$ from some digit further to the left. (Your answer should be an explicit function of $n$ in simplest form.)
1985 USAMO, 3
Let $A,B,C,D$ denote four points in space such that at most one of the distances $AB,AC,AD,BC,BD,CD$ is greater than $1$. Determine the maximum value of the sum of the six distances.
2007 AIME Problems, 15
Let $ABC$ be an equilateral triangle, and let $D$ and $F$ be points on sides $BC$ and $AB$, respectively, with $FA=5$ and $CD=2$. Point $E$ lies on side $CA$ such that $\angle DEF = 60^\circ$. The area of triangle $DEF$ is $14\sqrt{3}$. The two possible values of the length of side $AB$ are $p \pm q\sqrt{r}$, where $p$ and $q$ are rational, and $r$ is an integer not divisible by the square of a prime. Find $r$.
2016 USAMO, 4
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.$$
2002 AMC 10, 9
Using the letters $ A$, $ M$, $ O$, $ S$, and $ U$, we can form $ 120$ five-letter "words". If these "words" are arranged in alphabetical order, then the "word" $ USAMO$ occupies position
$ \textbf{(A)}\ 112 \qquad
\textbf{(B)}\ 113 \qquad
\textbf{(C)}\ 114 \qquad
\textbf{(D)}\ 115 \qquad
\textbf{(E)}\ 116$
2000 USAMO, 1
Call a real-valued function $ f$ [i]very convex[/i] if
\[ \frac {f(x) \plus{} f(y)}{2} \ge f\left(\frac {x \plus{} y}{2}\right) \plus{} |x \minus{} y|
\]
holds for all real numbers $ x$ and $ y$. Prove that no very convex function exists.
1986 USAMO, 5
By a partition $\pi$ of an integer $n\ge 1$, we mean here a representation of $n$ as a sum of one or more positive integers where the summands must be put in nondecreasing order. (E.g., if $n=4$, then the partitions $\pi$ are $1+1+1+1$, $1+1+2$, $1+3, 2+2$, and $4$).
For any partition $\pi$, define $A(\pi)$ to be the number of $1$'s which appear in $\pi$, and define $B(\pi)$ to be the number of distinct integers which appear in $\pi$. (E.g., if $n=13$ and $\pi$ is the partition $1+1+2+2+2+5$, then $A(\pi)=2$ and $B(\pi) = 3$).
Prove that, for any fixed $n$, the sum of $A(\pi)$ over all partitions of $\pi$ of $n$ is equal to the sum of $B(\pi)$ over all partitions of $\pi$ of $n$.
2016 USAJMO, 4
Find, with proof, the least integer $N$ such that if any $2016$ elements are removed from the set ${1, 2,...,N}$, one can still find $2016$ distinct numbers among the remaining elements with sum $N$.
1982 AMC 12/AHSME, 2
If a number eight times as large as $x$ is increased by two, then one fourth of the result equals
$\textbf{(A)} \ 2x + \frac{1}{2} \qquad \textbf{(B)} \ x + \frac{1}{2} \qquad \textbf{(C)} \ 2x+2 \qquad \textbf{(D)} \ 2x+4 \qquad \textbf{(E)} \ 2x+16$
1993 Brazil National Olympiad, 1
The sequence $(a_n)_{n \in\mathbb{N}}$ is defined by $a_1 = 8, a_2 = 18, a_{n+2} = a_{n+1}a_{n}$. Find all terms which are perfect squares.
1983 USAMO, 3
Each set of a finite family of subsets of a line is a union of two closed intervals. Moreover, any three of the sets of the family have a point in common. Prove that there is a point which is common to at least half the sets of the family.
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}$.
2013 USAMO, 3
Let $n$ be a positive integer. There are $\tfrac{n(n+1)}{2}$ marks, each with a black side and a white side, arranged into an equilateral triangle, with the biggest row containing $n$ marks. Initially, each mark has the black side up. An [i]operation[/i] is to choose a line parallel to the sides of the triangle, and flipping all the marks on that line. A configuration is called [i]admissible [/i] if it can be obtained from the initial configuration by performing a finite number of operations. For each admissible configuration $C$, let $f(C)$ denote the smallest number of operations required to obtain $C$ from the initial configuration. Find the maximum value of $f(C)$, where $C$ varies over all admissible configurations.
2013 Tuymaada Olympiad, 7
Points $A_1$, $A_2$, $A_3$, $A_4$ are the vertices of a regular tetrahedron of edge length $1$. The points $B_1$ and $B_2$ lie inside the figure bounded by the plane $A_1A_2A_3$ and the spheres of radius $1$ and centres $A_1$, $A_2$, $A_3$.
Prove that $B_1B_2 < \max\{B_1A_1, B_1A_2, B_1A_3, B_1A_4\}$.
[i] A. Kupavsky [/i]
1978 USAMO, 2
$ABCD$ and $A'B'C'D'$ are square maps of the same region, drawn to different scales and superimposed as shown in the figure. Prove that there is only one point $O$ on the small map that lies directly over point $O'$ of the large map such that $O$ and $O'$ each represent the same place of the country. Also, give a Euclidean construction (straight edge and compass) for $O$.
[asy]
size(200);
defaultpen(linewidth(0.7)+fontsize(10));
real theta = -100, r = 0.3; pair D2 = (0.3,0.76);
string[] lbl = {'A', 'B', 'C', 'D'}; draw(unitsquare); draw(shift(D2)*rotate(theta)*scale(r)*unitsquare);
for(int i = 0; i < lbl.length; ++i) {
pair Q = dir(135-90*i), P = (.5,.5)+Q/2^.5;
label("$"+lbl[i]+"'$", P, Q);
label("$"+lbl[i]+"$",D2+rotate(theta)*(r*P), rotate(theta)*Q);
}[/asy]
2011 USAMO, 4
Consider the assertion that for each positive integer $n\geq2$, the remainder upon dividing $2^{2^n}$ by $2^n-1$ is a power of $4$. Either prove the assertion or find (with proof) a counterexample.
2013 Princeton University Math Competition, 5
Suppose $w,x,y,z$ satisfy \begin{align*}w+x+y+z&=25,\\wx+wy+wz+xy+xz+yz&=2y+2z+193\end{align*} The largest possible value of $w$ can be expressed in lowest terms as $w_1/w_2$ for some integers $w_1,w_2>0$. Find $w_1+w_2$.
2012 Putnam, 1
Let $d_1,d_2,\dots,d_{12}$ be real numbers in the open interval $(1,12).$ Show that there exist distinct indices $i,j,k$ such that $d_i,d_j,d_k$ are the side lengths of an acute triangle.
2006 USAMO, 4
Find all positive integers $n$ such that there are $k \geq 2$ positive rational numbers $a_1, a_2, \ldots, a_k$ satisfying $a_1 + a_2 + \ldots + a_k = a_1 \cdot a_2 \cdots a_k = n.$
2003 USAMO, 5
Let $ a$, $ b$, $ c$ be positive real numbers. Prove that
\[ \dfrac{(2a \plus{} b \plus{} c)^2}{2a^2 \plus{} (b \plus{} c)^2} \plus{} \dfrac{(2b \plus{} c \plus{} a)^2}{2b^2 \plus{} (c \plus{} a)^2} \plus{} \dfrac{(2c \plus{} a \plus{} b)^2}{2c^2 \plus{} (a \plus{} b)^2} \le 8.
\]
2014 USA Team Selection Test, 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 USAJMO, 5
Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ that satisfy
\[
f(x^2-y)+2yf(x)=f(f(x))+f(y)
\]
for all $x,y\in\mathbb{R}$.
[i]Proposed by Carl Schildkraut[/i]
2021 USAMO, 2
The Planar National Park is a subset of the Euclidean plane consisting of several trails which meet at junctions. Every trail has its two endpoints at two different junctions whereas each junction is the endpoint of exactly three trails. Trails only intersect at junctions (in particular, trails only meet at endpoints). Finally, no trails begin and end at the same two junctions. (An example of one possible layout of the park is shown to the left below, in which there are six junctions and nine trails.)
[center]
[img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvZS9mLzc1YmNjN2YxMWZhZTNhMTVkZTQ4NWE1ZDIyMDNhN2I5NzY0NTBlLnBuZw==&rn=Z3JhcGguUE5H[/img]
[/center]
A visitor walks through the park as follows: she begins at a junction and starts walking along a trail. At the end of that first trail, she enters a junction and turns left. On the next junction she turns right, and so on, alternating left and right turns at each junction. She does this until she gets back to the junction where she started. What is the largest possible number of times she could have entered any junction during her walk, over all possible layouts of the park?