% © Evan Chen
% Downloaded from https://web.evanchen.cc/
\documentclass[11pt]{scrartcl}
\usepackage[sexy]{evan}
\ihead{\footnotesize\textbf{\thetitle}}
\ohead{\footnotesize\href{http://web.evanchen.cc}{\ttfamily web.evanchen.cc},
updated \today}
\title{USAMO 2006 Solution Notes}
\date{\today}
\begin{document}
\maketitle
\begin{abstract}
This is a compilation of solutions
for the 2006 USAMO.
The ideas of the solution are a mix of my own work,
the solutions provided by the competition organizers,
and solutions found by the community.
However, all the writing is maintained by me.
These notes will tend to be a bit more advanced and terse than the ``official''
solutions from the organizers.
In particular, if a theorem or technique is not known to beginners
but is still considered ``standard'', then I often prefer to
use this theory anyways, rather than try to work around or conceal it.
For example, in geometry problems I typically use directed angles
without further comment, rather than awkwardly work around configuration issues.
Similarly, sentences like ``let $\mathbb{R}$ denote the set of real numbers''
are typically omitted entirely.
Corrections and comments are welcome!
\end{abstract}
\tableofcontents
\newpage
\addtocounter{section}{-1}
\section{Problems}
\begin{enumerate}[\bfseries 1.]
\item %% Problem 1
Let $p$ be a prime number and let $s$ be an integer with $0 < s < p$.
Prove that there exist integers $m$ and $n$ with $0 < m < n < p$ and
\[ \left \{\frac{sm}{p} \right\} < \left \{\frac{sn}{p} \right \} < \frac{s}{p} \]
if and only if $s$ is not a divisor of $p-1$.
\item %% Problem 2
Let $k > 0$ be a fixed integer.
Compute the minimum integer $N$ (in terms of $k$) for which
there exists a set of $2k+1$ distinct positive integers
that has sum greater than $N$,
but for which every subset of size $k$ has sum at most $N/2$.
\item %% Problem 3
For integral $m$, let $p(m)$ be the greatest prime divisor of $m$.
By convention, we set $p(\pm 1) = 1$ and $p(0) = \infty$.
Find all polynomials $f$ with integer coefficients
such that the sequence
\[ \{ p(f(n^2)) - 2n \}_{n \geq 0} \]
is bounded above.
(In particular, this requires $f(n^2) \neq 0$ for $n \ge 0$.)
\item %% Problem 4
Find all positive integers $n$ for which there exist an integer $k \ge 2$
and positive rational numbers $a_1$, \dots, $a_k$ satisfying
$a_1 + a_2 + \dots + a_k = a_1 a_2 \dots a_k = n$.
\item %% Problem 5
A mathematical frog jumps along the number line.
The frog starts at $1$, and jumps according to the following rule:
if the frog is at integer $n$,
then it can jump either to $n+1$ or to $n + 2^{m_n+1}$
where $2^{m_n}$ is the largest power of $2$ that is a factor of $n$.
Show that if $k \ge 2$ is a positive integer
and $i$ is a nonnegative integer,
then the minimum number of jumps needed to reach $2^ik$
is greater than the minimum number of jumps needed to reach $2^i$.
\item %% Problem 6
Let $ABCD$ be a quadrilateral,
and let $E$ and $F$ be points on sides $AD$ and $BC$,
respectively, such that $\frac{AE}{ED} = \frac{BF}{FC}$.
Ray $FE$ meets rays $BA$ and $CD$ at $S$ and $T$, respectively.
Prove that the circumcircles of triangles $SAE$, $SBF$, $TCF$, and $TDE$
pass through a common point.
\end{enumerate}
\pagebreak
\section{Solutions to Day 1}
\subsection{USAMO 2006/1, proposed by Kiran Kedlaya}
\textsl{Available online at \url{https://aops.com/community/p490569}.}
\begin{mdframed}[style=mdpurplebox,frametitle={Problem statement}]
Let $p$ be a prime number and let $s$ be an integer with $0 < s < p$.
Prove that there exist integers $m$ and $n$ with $0 < m < n < p$ and
\[ \left \{\frac{sm}{p} \right\} < \left \{\frac{sn}{p} \right \} < \frac{s}{p} \]
if and only if $s$ is not a divisor of $p-1$.
\end{mdframed}
It's equivalent to $ms \bmod p < ns \bmod p < s$,
where $x \bmod p$ means the remainder when $x$ is divided by $p$,
by slight abuse of notation.
We will assume $s \ge 2$ for simplicity,
since the case $s = 1$ is clear.
For any $x \in \{1, 2, \dots, s-1\}$
we define $f(x)$ to be the unique number in $\{1, \dots, p-1\}$
such that $s \cdot f(x) \bmod p = x$.
Then, $m$ and $n$ fail to exist exactly when
\[ f(s-1) < f(s-2) < \dots < f(1). \]
We give the following explicit description of $f$:
choose $t \equiv -s^{-1} \pmod p$, $0 < t < p$.
Then $f(x) = 1 + (s-x) \cdot t \bmod p$.
So our displayed inequality is equivalent to
\[ (1+t) \bmod p < (1+2t) \bmod p < (1+3t) \bmod p
< \dots < (1+(s-1)t) \bmod p. \]
This just means that the sequence $1+kt$
never ``wraps around'' modulo $p$
as we take $k=1,2,\dots,s-1$.
Since we assumed $s \neq 1$, we have $0 < 1+t < p$.
Now since $1+kt$ never wraps around as $k=1,2,\dots,s-1$,
and increases in increments of $t$,
it follows that $1+kt < p$ for all $k = 1, 2, \dots, s-1$.
Finally, as $1+st \equiv 0 \pmod p$ we get $1+st=p$.
In summary, $m$, $n$ fail to exist
precisely when $1 + st = p$.
That is of course equivalent to $s \mid p-1$.
\pagebreak
\subsection{USAMO 2006/2, proposed by Dick Gibbs}
\textsl{Available online at \url{https://aops.com/community/p490581}.}
\begin{mdframed}[style=mdpurplebox,frametitle={Problem statement}]
Let $k > 0$ be a fixed integer.
Compute the minimum integer $N$ (in terms of $k$) for which
there exists a set of $2k+1$ distinct positive integers
that has sum greater than $N$,
but for which every subset of size $k$ has sum at most $N/2$.
\end{mdframed}
The answer is $N = k(2k^2+3k+3)$ given by
\[ S = \left\{ k^2+1, k^2+2, \dots, k^2+2k+1 \right\}. \]
To show this is best possible,
let the set be $S = \{ a_0 < a_1 < \dots < a_{2k} \}$
so that the hypothesis becomes
\begin{align*}
N + 1 &\le a_0 + a_1 + \dots + a_{2k} \\
N/2 &\ge a_{k+1} + \dots + a_{2k}.
\end{align*}
Subtracting twice the latter from the former gives
\begin{align*}
a_0 &\ge 1 + (a_{k+1}-a_1) + (a_{k+2}-a_2) + \dots
+ (a_{2k} - a_k) \\
&\ge 1 + \underbrace{k + k + \dots + k}_{k \text{ terms}} = 1 + k^2.
\end{align*}
Now, we have
\begin{align*}
N/2 &\ge a_{k+1} + \dots + a_{2k} \\
&\ge (a_0 + (k+1)) + (a_0 + (k+2)) + \dots + (a_0 + 2k) \\
&= k \cdot a_0 + \left( (k+1) + \dots + 2k \right) \\
&\ge k(k^2+1) + k \cdot \frac{3k+1}{2}
\end{align*}
so $N \ge k(2k^2+3k+3)$.
\begin{remark*}
The exact value of $N$ is therefore very superficial.
From playing with these concrete examples
we find out we are essentially
just trying to find an increasing set $S$ obeying
\[ a_0 + a_1 + \dots + a_k > a_{k+1} + \dots + a_{2k} \qquad (\star) \]
and indeed given a sequence satisfying these properties
one simply sets $N = 2(a_{k+1} + \dots + a_{2k})$.
Therefore we can focus almost entirely on $a_i$ and not $N$.
\end{remark*}
\begin{remark*}
It is relatively straightforward to figure out what is going on
based on the small cases.
For example, one can work out by hand that
\begin{itemize}
\ii $\{2,3,4\}$ is optimal for $k=1$
\ii $\{5,6,7,8,9\}$ is optimal for $k=2$,
\ii $\{10,11,12,13,14,15,16\}$ is optimal for $k=3$.
\end{itemize}
In all the examples,
the $a_i$ are an arithmetic progression of difference $1$,
so that $a_j - a_i \ge j-i$ is a sharp for all $ic$, such that $p$ divides some $f(n^2)$, by Schur's Theorem.
Looking mod such a $p$ we can find $n$ between $0$
and $\tfrac{p-1}{2}$ (since $n^2 \equiv (-n)^2 \pmod p$).
We claim that only finitely many $p$ from this set can fail now.
For if a $p$ fails, then its $n$ must be between
$\tfrac{p-1}{2} - c$ and $\tfrac{p-1}{2}$.
That means for some $0 \le k \le c$ we have
\[ 0 \equiv f\left( \left(\frac{p-1}{2}-k\right)^2 \right)
\equiv f\left( \left( k + \frac12 \right)^2 \right) \pmod{p}. \]
There are only finitely many $p$ dividing
\[ \prod_{k=1}^c f\left( \left( k+\frac12 \right)^2 \right) \]
unless one of the terms in the product is zero;
this means that $4n-(2k+1)^2$ divides $f(n)$.
This establishes the claim and finishes the problem.
\pagebreak
\section{Solutions to Day 2}
\subsection{USAMO 2006/4, proposed by Ricky Liu}
\textsl{Available online at \url{https://aops.com/community/p490647}.}
\begin{mdframed}[style=mdpurplebox,frametitle={Problem statement}]
Find all positive integers $n$ for which there exist an integer $k \ge 2$
and positive rational numbers $a_1$, \dots, $a_k$ satisfying
$a_1 + a_2 + \dots + a_k = a_1 a_2 \dots a_k = n$.
\end{mdframed}
The answer is all $n$ other than $1,2,3,5$.
\begin{claim*}
The only solution with $n \le 5$ is $n = 4$.
\end{claim*}
\begin{proof}
The case $n=4$ works since $2+2 = 2\cdot2=4$. So assume $n > 4$.
We now contend that $k > 2$.
Indeed, if $a_1 + a_2 = a_1 a_2 = n$ then
$(a_1-a_2)^2 = (a_1+a_2)^2 - 4a_1a_2 = n^2-4n = (n-2)^2 - 4$
is a rational integer square, hence a perfect square.
This happens only when $n = 4$.
Now by AM-GM,
\[ \frac nk = \frac{a_1 + \dots + a_k}{k}
\ge \sqrt[k]{a_1 \dots a_k} = n^{1/k} \]
and so $n \ge k^{\frac{1}{1 - 1/k}} = k^{\frac{k}{k-1}}$.
This last quantity is always greater than $5$, since
\begin{align*}
3^{3/2} &= 3\sqrt3 > 5 \\
4^{4/3} &= 4\sqrt[3]{4} > 5 \\
k^{\frac{k}{k-1}} &> k \ge 5 \qquad \forall k \ge 5.
\end{align*}
This finishes the proof.
\end{proof}
Now, in general:
\begin{itemize}
\ii If $n \ge 6$ is even, we may take
$(a_1, \dots, a_{n/2}) = (n/2, 2, 1, \dots, 1)$.
\ii If $n \ge 9$ is odd, we may take
$(a_1, \dots, a_{(n-3)/2}) = (n/2, 1/2, 4, 1, \dots, 1)$.
\ii A special case $n = 7$: one example is $(4/3, 7/6, 9/2)$.
(Another is $(7/6, 4/3, 3/2, 3)$.)
\end{itemize}
\begin{remark*}
The main hurdle in the problem is the $n=7$ case.
One good reason to believe a construction exists is that
it seems quite difficult to prove that $n=7$ fails.
\end{remark*}
\pagebreak
\subsection{USAMO 2006/5, proposed by Zoran Sunik}
\textsl{Available online at \url{https://aops.com/community/p490682}.}
\begin{mdframed}[style=mdpurplebox,frametitle={Problem statement}]
A mathematical frog jumps along the number line.
The frog starts at $1$, and jumps according to the following rule:
if the frog is at integer $n$,
then it can jump either to $n+1$ or to $n + 2^{m_n+1}$
where $2^{m_n}$ is the largest power of $2$ that is a factor of $n$.
Show that if $k \ge 2$ is a positive integer
and $i$ is a nonnegative integer,
then the minimum number of jumps needed to reach $2^ik$
is greater than the minimum number of jumps needed to reach $2^i$.
\end{mdframed}
We will think about the problem in terms of
finite sequences of jumps $(s_1, s_2, \dots, s_\ell)$,
which we draw as
\[ 1 = x_0
\taking{s_1} x_1
\taking{s_2} x_2
\taking{s_3} \dots
\taking{s_\ell} x_\ell \]
where $s_k = x_k - x_{k-1}$ is the length of some hop.
We say the sequence is \emph{valid} if it has the
property required by the problem:
for each $k$, either $s_k = 1$ or $s_k = 2^{m_{x_{k-1}}+1}$.
An example is shown below.
\begin{lemma*}
Let $(s_1, \dots, s_\ell)$ be a sequence of jumps.
Suppose we delete pick an index $k$ and exponent $e > 0$,
and delete any jumps after the $k$th one
which are divisible by $2^e$.
The resulting sequence is still valid.
\end{lemma*}
\begin{proof}
We only have to look after the $k$th jump.
The launching points of the remaining jumps after the $k$th
one are now shifted by multiples of $2^e$
due to the deletions;
so given a jump $x \taking{s} x+s$
we end up with a jump $x' \taking{s} x'+s$
where $x-x'$ is a multiple of $2^e$.
But since $s < 2^e$, we have $\nu_2(x') < e$
and hence $\nu_2(x) = \nu_2(x')$ so the jump is valid.
\end{proof}
\begin{center}
\begin{asy}
unitsize(0.6cm);
defaultpen(fontsize(8pt));
for (int i=1; i<=24; ++i) {
if (i!=8) label("$"+(string)i+"$", (i,0));
}
label("$\boxed{8}$", (8,0));
void arr(int i, int j, pen p, real eps) {
pair M = ((i+j)/2, eps*(j-i)**0.5/2);
draw((i,0)..M..(j,0), p, EndArrow(TeXHead), Margin(2,2));
label("$"+(string)(j-i)+"$", M, eps*dir(90), p);
}
arr( 1, 3, red, 1);
arr( 3, 4, red, -1);
arr( 4, 12, blue+dashed, 1);
arr(12, 13, red, -1);
arr(13, 14, red, 1);
arr(14, 18, blue+dashed, -1);
arr(18, 19, red, 1);
arr(19, 21, blue+dashed, -1);
arr(21, 23, blue+dashed, 1);
arr(23, 24, red, -1);
add(shift(-8, 3)*CC());
for (int i=1; i<=8; ++i) {
if (i!=8) label("$"+(string)i+"$", (i,0));
}
label("$\boxed{8}$", (8,0));
arr( 1, 3, red, 1);
arr( 3, 4, red, -1);
arr( 4, 5, red, -1);
arr( 5, 6, red, 1);
arr( 6, 7, red, 1);
arr( 7, 8, red, -1);
\end{asy}
\end{center}
Now let's consider a valid path to $2^i k$ with $\ell$ steps, say
\[ 1 = x_0
\taking{s_1} x_1
\taking{s_2} x_2
\taking{s_3} \dots
\taking{s_\ell} x_\ell = 2^i \cdot k \]
where $s_i = x_i - x_{i-1}$ is the distance jumped.
We delete jumps in the following way:
starting from the largest $e$ and going downwards until $e=0$,
we delete all the jumps of length $2^e$
which end at a point exceeding the target $2^i$.
By the lemma, at each stage, the path remains valid.
We claim more:
\begin{claim*}
Let $e \ge 0$.
After the jumps of length greater than $2^e$ are deleted,
the resulting end-point is at least $2^i$,
and divisible by $2^{\min(i,e)}$.
\end{claim*}
\begin{proof}
By downwards induction.
Consider any step where \emph{some} jump is deleted.
Then, the end-point must be strictly greater than $x = 2^i - 2^e$
(i.e.\ we must be within $2^e$ of the target $2^i$).
It is also divisible by $2^{\min(i,e)}$ by induction hypothesis,
since we are changing the end-point by multiples of $2^e$.
And the smallest multiple of $2^{\min(i,e)}$ exceeding $x$ is $2^i$.
\end{proof}
On the other hand by construction when the process ends
the reduced path ends at a point at most $2^i$,
so it is $2^i$ as desired.
Therefore we have taken a path to $2^i k$
and reduced it to one to $2^i$ by deleting some jumps.
This proves the result.
\pagebreak
\subsection{USAMO 2006/6, proposed by Zuming Feng, Zhonghao Ye}
\textsl{Available online at \url{https://aops.com/community/p490691}.}
\begin{mdframed}[style=mdpurplebox,frametitle={Problem statement}]
Let $ABCD$ be a quadrilateral,
and let $E$ and $F$ be points on sides $AD$ and $BC$,
respectively, such that $\frac{AE}{ED} = \frac{BF}{FC}$.
Ray $FE$ meets rays $BA$ and $CD$ at $S$ and $T$, respectively.
Prove that the circumcircles of triangles $SAE$, $SBF$, $TCF$, and $TDE$
pass through a common point.
\end{mdframed}
\begin{center}
\begin{asy}
size(8cm);
defaultpen(fontsize(9pt));
pair A = (-1,3);
pair B = (-3,-2);
pair C = (6,-2);
pair D = (3,5);
pair M = (A*C-B*D)/(A+C-B-D);
pair E = 0.7*A+0.3*D;
pair F = 0.7*B+0.3*C;
pair S = extension(E, F, A, B);
pair T = extension(C, D, E, F);
draw(T--F);
draw(A--B--C--D--cycle);
draw(A--S);
draw(T--D);
draw(circumcircle(S, A, E), dotted+blue);
draw(circumcircle(S, B, F), dotted+blue);
draw(circumcircle(T, C, F), dotted+blue);
draw(circumcircle(T, D, E), dotted+blue);
pair P = extension(A, B, C, D);
pair Q = extension(A, D, B, C);
draw(A--Q--B, dashed);
draw(S--P, dashed);
draw(circumcircle(P, A, D), dotted+red);
draw(circumcircle(P, B, C), dotted+red);
draw(circumcircle(Q, A, B), dotted+red);
draw(circumcircle(Q, C, D), dotted+red);
dot("$A$", A, dir(A));
dot("$B$", B, dir(B));
dot("$C$", C, dir(C));
dot("$D$", D, dir(D));
dot("$M$", M, dir(M));
dot("$E$", E, dir(E));
dot("$F$", F, dir(F));
dot("$S$", S, dir(135));
dot("$T$", T, dir(T));
dot("$P$", P, dir(P));
dot("$Q$", Q, dir(Q));
/* Source generated by TSQ */
\end{asy}
\end{center}
Let $M$ be the Miquel point of $ABCD$.
Then $M$ is the center of a spiral similarity taking $AD$ to $BC$.
The condition guarantees that it also takes $E$ to $F$.
Hence, we see that $M$ is the center of a spiral similarity taking $\ol{AB}$ to $\ol{EF}$,
and consequently the circumcircles of $QAB$, $QEF$, $SAE$, $SBF$ concur at point $M$.
In other words, the Miquel point of $ABCD$ is also the Miquel point of $ABFE$.
Similarly, $M$ is also the Miquel point of $EDCF$, so all four circles concur at $M$.
\pagebreak
\end{document}