USAMO/md/en-USAMO-2002-notes.md

# USAMO 2002 Solution Notes 

Evan Chen《陳誼廷》

15 April 2024

This is a compilation of solutions for the 2002 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!

## Contents

0 Problems ..... 2
1 Solutions to Day 1 ..... 3
1.1 USAMO 2002/1, proposed by Gabriel Carroll ..... 3
1.2 USAMO 2002/2 ..... 4
1.3 USAMO 2002/3
2 Solutions to Day 2 ..... 6
2.1 USAMO 2002/4 ..... 6
2.2 USAMO 2002/5, proposed by Gabriel Carroll ..... 7
2.3 USAMO 2002/6 ..... 8

## §0 Problems

1. Let $S$ be a set with 2002 elements, and let $N$ be an integer with $0 \leq N \leq 2^{2002}$. Prove that it is possible to color every subset of $S$ either black or white so that the following conditions hold:
(a) the union of any two white subsets is white;
(b) the union of any two black subsets is black;
(c) there are exactly $N$ white subsets.
2. Let $A B C$ be a triangle such that

$$
\left(\cot \frac{A}{2}\right)^{2}+\left(2 \cot \frac{B}{2}\right)^{2}+\left(3 \cot \frac{C}{2}\right)^{2}=\left(\frac{6 s}{7 r}\right)^{2}
$$

where $s$ and $r$ denote its semiperimeter and its inradius, respectively. Prove that triangle $A B C$ is similar to a triangle $T$ whose side lengths are all positive integers with no common divisors and determine these integers.
3. Prove that any monic polynomial (a polynomial with leading coefficient 1) of degree $n$ with real coefficients is the average of two monic polynomials of degree $n$ with $n$ real roots.
4. Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that

$$
f\left(x^{2}-y^{2}\right)=x f(x)-y f(y)
$$

for all pairs of real numbers $x$ and $y$.
5. Let $a, b$ be integers greater than 2. Prove that there exists a positive integer $k$ and a finite sequence $n_{1}, n_{2}, \ldots, n_{k}$ of positive integers such that $n_{1}=a, n_{k}=b$, and $n_{i} n_{i+1}$ is divisible by $n_{i}+n_{i+1}$ for each $i(1 \leq i<k)$.
6. I have an $n \times n$ sheet of stamps, from which I've been asked to tear out blocks of three adjacent stamps in a single row or column. (I can only tear along the perforations separating adjacent stamps, and each block must come out of the sheet in one piece.) Let $b(n)$ be the smallest number of blocks I can tear out and make it impossible to tear out any more blocks. Prove that there are real constants $c$ and $d$ such that

$$
\frac{1}{7} n^{2}-c n \leq b(n) \leq \frac{1}{5} n^{2}+d n
$$

for all $n>0$.

## §1 Solutions to Day 1

## §1.1 USAMO 2002/1, proposed by Gabriel Carroll

Available online at https://aops.com/community/p337845.

## Problem statement

Let $S$ be a set with 2002 elements, and let $N$ be an integer with $0 \leq N \leq 2^{2002}$. Prove that it is possible to color every subset of $S$ either black or white so that the following conditions hold:
(a) the union of any two white subsets is white;
(b) the union of any two black subsets is black;
(c) there are exactly $N$ white subsets.

We will solve the problem with 2002 replaced by an arbitrary integer $n \geq 0$. In other words, we prove:

Claim - For any nonnegative integers $n$ and $N$ with $0 \leq N \leq 2^{n}$, it is possible to color the $2^{n}$ subsets of $\{1, \ldots, n\}$ black and white satisfying the conditions of the problem.

The proof is by induction on $n$. When $n=1$ the problem is easy to do by hand, so this gives us a base case.

For the inductive step, we divide into two cases:

- If $N \leq 2^{n-1}$, then we take a coloring of subsets of $\{1, \ldots, n-1\}$ with $N$ white sets; then we color the remaining $2^{n-1}$ sets (which contain $n$ ) black.
- If $N>2^{n-1}$, then we take a coloring of subsets of $\{1, \ldots, n-1\}$ with $N-2^{n-1}$ white sets; then we color the remaining $2^{n-1}$ sets (which contain $n$ ) white.


## §1.2 USAMO 2002/2

Available online at https://aops.com/community/p337847.

## Problem statement

Let $A B C$ be a triangle such that

$$
\left(\cot \frac{A}{2}\right)^{2}+\left(2 \cot \frac{B}{2}\right)^{2}+\left(3 \cot \frac{C}{2}\right)^{2}=\left(\frac{6 s}{7 r}\right)^{2}
$$

where $s$ and $r$ denote its semiperimeter and its inradius, respectively. Prove that triangle $A B C$ is similar to a triangle $T$ whose side lengths are all positive integers with no common divisors and determine these integers.

Let $x=s-a, y=s-b, z=s-c$ in the usual fashion, then the equation reads

$$
x^{2}+4 y^{2}+9 z^{2}=\left(\frac{6}{7}(x+y+z)\right)^{2}
$$

However, by Cauchy-Schwarz, we have

$$
\left(1+\frac{1}{4}+\frac{1}{9}\right)\left(x^{2}+4 y^{2}+9 z^{2}\right) \geq(x+y+z)^{2}
$$

with equality if and only if $1: \frac{1}{2}: \frac{1}{3}=x: 2 y: 3 z$, id est $x: y: z=1: \frac{1}{4}: \frac{1}{9}=36: 9: 4$. This is equivalent to $y+z: z+x: x+y=13: 40: 45$.

Remark. You can tell this is not a geometry problem because you eliminate the cotangents right away to get an algebra problem...and then you realize the problem claims that one equation can determine three variables up to scaling, at which point you realize it has to be an inequality (otherwise degrees of freedom don't work). So of course, Cauchy-Schwarz...

## §1.3 USAMO 2002/3

Available online at https://aops.com/community/p337849.

## Problem statement

Prove that any monic polynomial (a polynomial with leading coefficient 1) of degree $n$ with real coefficients is the average of two monic polynomials of degree $n$ with $n$ real roots.

First,

## Lemma

If $p$ is a monic polynomial of degree $n$, and $p(1) p(2)<0, p(2) p(3)<0, \ldots$, $p(n-1) p(n)<0$ then $p$ has $n$ real roots.

Proof. The intermediate value theorem already guarantees the existence of $n-1$ real roots.

The last root is obtained by considering cases on $n(\bmod 2)$.

- If $n$ is even, then $p(1)$ and $p(n)$ have opposite sign, while we must have either

$$
\lim _{x \rightarrow-\infty} p(x)=\lim _{x \rightarrow \infty} p(x)= \pm \infty
$$

so we get one more root.

- The $n$ odd case is similar, with $p(1)$ and $p(n)$ now having the same sign, but $\lim _{x \rightarrow-\infty} p(x)=-\lim _{x \rightarrow \infty} p(x)$ instead.

Let $f(n)$ be the monic polynomial and let $M>1000 \max _{t=1, \ldots, n}|f(t)|+1000$. Then we may select reals $a_{1}, \ldots, a_{n}$ and $b_{1}, \ldots, b_{n}$ such that for each $k=1, \ldots, n$, we have

$$
\begin{aligned}
a_{k}+b_{k} & =2 f(k) \\
(-1)^{k} a_{k} & >M \\
(-1)^{k+1} b_{k} & >M .
\end{aligned}
$$

We may interpolate monic polynomials $g$ and $h$ through the $a_{k}$ and $b_{k}$ (if the $a_{k}, b_{k}$ are selected "generically" from each other). Then one can easily check $f=\frac{1}{2}(g+h)$ works.

## §2 Solutions to Day 2

## §2.1 USAMO 2002/4

Available online at https://aops.com/community/p337857.

## Problem statement

Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that

$$
f\left(x^{2}-y^{2}\right)=x f(x)-y f(y)
$$

for all pairs of real numbers $x$ and $y$.

The answer is $f(x)=c x, c \in \mathbb{R}$ (these obviously work).
First, by putting $x=0$ and $y=0$ respectively we have

$$
f\left(x^{2}\right)=x f(x) \quad \text { and } \quad f\left(-y^{2}\right)=-y f(y) .
$$

From this we deduce that $f$ is odd, in particular $f(0)=0$. Then, we can rewrite the given as $f\left(x^{2}-y^{2}\right)+f\left(y^{2}\right)=f\left(x^{2}\right)$. Combined with the fact that $f$ is odd, we deduce that $f$ is additive (i.e. $f(a+b)=f(a)+f(b)$ ).

Remark (Philosophy). At this point we have $f\left(x^{2}\right) \equiv x f(x)$ and $f$ additive, and everything we have including the given equation is a direct corollary of these two. So it makes sense to only focus on these two conditions.

Then

$$
\begin{aligned}
f\left((x+1)^{2}\right) & =(x+1) f(x+1) \\
\Longrightarrow f\left(x^{2}\right)+2 f(x)+f(1) & =(x+1) f(x)+(x+1) f(1)
\end{aligned}
$$

which readily gives $f(x)=f(1) x$.

## §2.2 USAMO 2002/5, proposed by Gabriel Carroll

Available online at https://aops.com/community/p337862.

## Problem statement

Let $a, b$ be integers greater than 2 . Prove that there exists a positive integer $k$ and a finite sequence $n_{1}, n_{2}, \ldots, n_{k}$ of positive integers such that $n_{1}=a, n_{k}=b$, and $n_{i} n_{i+1}$ is divisible by $n_{i}+n_{i+1}$ for each $i(1 \leq i<k)$.

Consider a graph $G$ on the vertex set $\{3,4, \ldots\}$ and with edges between $v, w$ if $v+w \mid v w$; the problem is equivalent to showing that $G$ is connected.

First, note that $n$ is connected to $n(n-1), n(n-1)(n-2)$, etc. up to $n$ !. But for $n>2, n$ ! is connected to $(n+1)$ ! too:

- $n!\rightarrow(n+1)$ ! if $n$ is even
- $n!\rightarrow 2 n!\rightarrow(n+1)!$ if $n$ is odd.

This concludes the problem.

## §2.3 USAMO 2002/6

Available online at https://aops.com/community/p337852.

## Problem statement

I have an $n \times n$ sheet of stamps, from which I've been asked to tear out blocks of three adjacent stamps in a single row or column. (I can only tear along the perforations separating adjacent stamps, and each block must come out of the sheet in one piece.) Let $b(n)$ be the smallest number of blocks I can tear out and make it impossible to tear out any more blocks. Prove that there are real constants $c$ and $d$ such that

$$
\frac{1}{7} n^{2}-c n \leq b(n) \leq \frac{1}{5} n^{2}+d n
$$

for all $n>0$.

For the lower bound: there are $2 n(n-2)$ places one could put a block. Note that each block eliminates at most 14 such places.

For the upper bound, the construction of $\frac{1}{5}$ is easy to build. Here is an illustration of one possible construction for $n=9$ which generalizes readily, using only vertical blocks.

$$
\left[\begin{array}{lllllllll}
A & & E & & I & L & & P & \\
A & & E & G & & L & & P & R \\
A & C & & G & & L & N & & R \\
& C & & G & J & & N & & R \\
& C & F & & J & & N & Q & \\
B & & F & & J & M & & Q & \\
B & & F & H & & M & & Q & S \\
B & D & & H & & M & O & & S \\
& D & & H & K & & O & & S
\end{array}\right]
$$

Actually, for the lower bound, one may improve $1 / 7$ to $1 / 6$. Count the number $A$ of pairs of adjacent squares one of which is torn out and the other which is not:

- For every deleted block, there are eight neighboring squares, at least two on each long edge which have been deleted too. Hence $N \leq 6 b(n)$.
- For every block still alive and not on the border, there are four neighboring squares, and clearly at least two are deleted. Hence $N \geq 2\left((n-2)^{2}-3 b(n)\right)$.

Collating these solves the problem.