2002 IMO Problems/Problem 1

Problem

is the set of all with non-negative integers such that . Each element of is colored red or blue, so that if is red and , then is also red. A type subset of has blue elements with different first member and a type subset of has blue elements with different second member. Show that there are the same number of type and type subsets.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

Proof sketch

Okay this is going to be really bad because it's going to be one of my first solutions to an IMO problem, but basically, we can choose to interpret graphically by putting it on the graph. It turns out that it will just create a right isosceles triangle of lattice points that has legs of length n-1 and a right angle at the origin. This is simple because h and k have to be non negative, or and above, while h+k<n will make a triangle. However, we can't count the points on the line since it's dotted. A lattice of blue points will look like this:

{Insert diagram here, preferably at some lower n like n=5}

Second, we will consider what happens if we color an arbitrary point red. The problem states that all points with coordinate points equal to less than that arbitrary point will be colored red. Graphically, this means that the point colored red, along with all the points that are in the rectangle containing the origin and point as their corners, will be colored red. Notice how coloring other nontrivial points red will just create a block shape that's all red for the triangle. An example is shown below

{Insert diagram here, like two rectangles, clearly highlighted points at n=5 along with their respective rectangles}

Lastly, we will consider what it means to find the

See Also

2002 IMO (Problems) • Resources
Preceded by First Question	1 • 2 • 3 • 4 • 5 • 6	Followed by Problem 2
All IMO Problems and Solutions