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.
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 |