Browse · MathNet
PrintTeam Selection Test for IMO 2010
Turkey 2010 counting and probability
Problem
Let be the set of points in the plane whose coordinates are integers and let
be the collection of all functions from to . We call a function in perfect if every function in that differs from at finitely many points satisfies the condition where denotes the distance between and . Show that there exist infinitely many perfect functions that are not translates of each other.
be the collection of all functions from to . We call a function in perfect if every function in that differs from at finitely many points satisfies the condition where denotes the distance between and . Show that there exist infinitely many perfect functions that are not translates of each other.
Solution
Let be a line in the plane, and let and be the corresponding open half-planes. We set We will show that is a perfect function. Then the family consists of infinitely many perfect functions that are not translates of each other.
Let be a function in differing from at finitely many points, and let Then
We will prove that this expression is nonnegative by defining an injection that satisfies .
Let . Then and . Consider the line passing through the points and . Let , , and let be the unique point on such that and for , and and for .
Since and differ at finitely many points, we know that for all with sufficiently large . In particular, changes sign finitely many times, but at least once on . Let be the smallest integer such that . We define .
as , and we have by construction. Finally, since is the only pair among , , satisfying , is injective.
Let be a function in differing from at finitely many points, and let Then
We will prove that this expression is nonnegative by defining an injection that satisfies .
Let . Then and . Consider the line passing through the points and . Let , , and let be the unique point on such that and for , and and for .
Since and differ at finitely many points, we know that for all with sufficiently large . In particular, changes sign finitely many times, but at least once on . Let be the smallest integer such that . We define .
as , and we have by construction. Finally, since is the only pair among , , satisfying , is injective.
Techniques
Recursion, bijectionInvariants / monovariantsColoring schemes, extremal arguments