Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2017 USAMO Problems/Problem 5

Revision as of 16:26, 3 May 2017 by Sujaykazi (talk | contribs) (→‎Solution (INCOMPLETE))

Problem

Let $\mathbf{Z}$ denote the set of all integers. Find all real numbers $c > 0$ such that there exists a labeling of the lattice points $( x, y ) \in \mathbf{Z}^2$ with positive integers for which: only finitely many distinct labels occur, and for each label $i$, the distance between any two points labeled $i$ is at least $c^i$.

Solution (INCOMPLETE)

For $c\le 1,$ we can label every lattice point $1.$ For $c\le \sqrt[4]{2},$ we can make a "checkerboard" labeling, i.e. label $(x, y)$ with $1$ if $x+y$ is even and $2$ if $x+y$ is odd. One can easily verify that these labelings satisfy the required conditions. Therefore, a labeling as desired exists for all $0 < c\le \sqrt[4]{2}.$

An iterated version of the checkerboard labeling can actually work for all values $c < \sqrt{2}.$ For convenience, define the original lattice grid to be the set of all lattice points in the coordinate plane. Define a modified lattice grid of size $x$ to be a structure similar to the lattice points on the coordinate plane, but with the minimum separation between any two points equaling $x$ (as opposed to $1$).

NOTE: A CLEARER NOTION OF WHAT EXACTLY IS MEANT BY A "CHECKERBOARD ARRANGEMENT" SHOULD BE INCLUDED TO MAKE THIS PART OF THE PROOF COMPLETE. On the first step, assign a label $1$ to half of the points in a checkerboard arrangement. One can see that the points that have not yet been labeled form a modified lattice grid of size $\sqrt{2}$ (this lattice grid is also rotated by $45^{\circ}$ from the original lattice grid). At this point, for the second step, assign a label $2$ to half of the points, again in a checkerboard arrangement. At this point, the points that have not yet been labeled form a modified lattice grid of size $2$ (and again, it is rotated $45^{\circ}$ from the modified lattice grid after the first step). One then continues in this fashion. For the $N^{\text{th}}$ step, the points we are labeling are separated by at least $\sqrt{2}\times\left(\sqrt{2}\right)^{N-1} = \left(\sqrt{2}\right)^N > c^N,$ so we know that our labeling at each step is acceptable.

After the $N^{\text{th}}$ step (where $N$ is a natural number), the points that have not yet been labeled form a modified lattice grid with size $\left(\sqrt{2}\right)^N.$ Since $c < \sqrt{2},$ we will eventually have $\left(\sqrt{2}\right)^N > c^{n+1}$ for some sufficiently large $N.$ At this point, we can label all remaining points in the original lattice grid $N+1,$ and this produces a labeling of all of the lattice points in the plane that satisfies all of the conditions. Therefore, a labeling as desired exists for all $c < \sqrt{2}.$

We now prove that no labeling as desired exists for any $c\ge 2.$ To do this, we will prove that labeling a $2^k$-by-$2^k$ square grid of lattice points requires at least $k+3$ distinct labels for all natural numbers $k$; hence for a sufficiently large section of the lattice plane the number of distinct labels required grows arbitrarily large, so the entire lattice plane cannot be labeled with finitely many distinct labels. We will prove this using induction.

For the base case, $k=1,$ we have four points in a square of side length $1.$ The maximum distance between any two of these points is $\sqrt{2} < c^1$ for all $c\ge 2,$ so all four points must have different labels. This completes the base case.

Now, for the inductive step, suppose that labeling a $2^k$-by-$2^k$ square grid of lattice points requires at least $k+3$ distinct labels for some natural number $k.$ We will now prove that labeling a $2^{k+1}$-by-$2^{k+1}$ square grid of lattice points requires at least $k+4$ distinct labels.

Take a $2^{k+1}$-by-$2^{k+1}$ square grid of lattice points. Divide this grid into four quadrants, $A, B, C,$ and $D.$ By the inductive hypothesis, $A$ requires at least $k+3$ distinct labels. At least one of these labels must be $k+3$ or greater; take one such label and call it $L.$

The largest distance between any two points in the entire grid is $\sqrt{2}\left(2^{k+1} - 1\right) < c^{k+3}$ for all $c\ge 2.$ Therefore, the label $L$ cannot be used anywhere else in the grid. However, $B, C,$ and $D$ each require at least $k+3$ distinct labels as well by the inductive hypothesis. Thus, they must use at least one label that is not used in $A.$ It follows that the entire grid requires at least $k+4$ distinct labels. This completes the inductive step, and thus we conclude that no labeling as desired exists for any $c\ge 2.$

I have heard from others that the actual boundary is $\sqrt{2}.$ This makes intuitive sense, since the iterated checkerboard labeling outlined above just breaks down at this value (you will be able to get closer and closer to labeling all of the lattice points, but you can never get there, since you will never have $\left(\sqrt{2}\right)^N > c^{n+1}$). The inductive argument above seems fairly loose, so I think that it can be sharpened to bring the upper bound down to $\sqrt{2},$ but I am not sure yet how exactly to do so. I think the way to do it is to somehow force $2$ new labels (instead of just $1$) each time you double the side length of the square grid.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2017_USAMO_Problems/Problem_5&oldid=85544"