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

Difference between revisions of "2002 IMO Problems/Problem 1"
Line 1: Line 1:
 +
==Problem==
 +
 
<math>S</math> is the set of all <math>(h,k)</math> with <math>h,k</math> non-negative integers such that <math>h + k < n</math>. Each element of <math>S</math> is colored red or blue, so that if <math>(h,k)</math> is red and <math>h' \le h,k' \le k</math>, then <math>(h',k')</math> is also red. A type <math>1</math> subset of <math>S</math> has <math>n</math> blue elements with different first member and a type <math>2</math> subset of <math>S</math> has <math>n</math> blue elements with different second member. Show that there are the same number of type <math>1</math> and type <math>2</math> subsets.
 
<math>S</math> is the set of all <math>(h,k)</math> with <math>h,k</math> non-negative integers such that <math>h + k < n</math>. Each element of <math>S</math> is colored red or blue, so that if <math>(h,k)</math> is red and <math>h' \le h,k' \le k</math>, then <math>(h',k')</math> is also red. A type <math>1</math> subset of <math>S</math> has <math>n</math> blue elements with different first member and a type <math>2</math> subset of <math>S</math> has <math>n</math> blue elements with different second member. Show that there are the same number of type <math>1</math> and type <math>2</math> subsets.
 +
 +
==Solution==
 +
{{solution}}
 +
 +
==See Also==
 +
 +
{{IMO box|year=2002|before=First Question|num-a=2}}

Revision as of 23:26, 18 November 2023

Problem

$S$ is the set of all $(h,k)$ with $h,k$ non-negative integers such that $h + k < n$. Each element of $S$ is colored red or blue, so that if $(h,k)$ is red and $h' \le h,k' \le k$, then $(h',k')$ is also red. A type $1$ subset of $S$ has $n$ blue elements with different first member and a type $2$ subset of $S$ has $n$ blue elements with different second member. Show that there are the same number of type $1$ and type $2$ 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
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2002_IMO_Problems/Problem_1&oldid=204491"