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

2002 IMO Problems/Problem 1

Revision as of 07:00, 10 June 2015 by Mattx1732 (talk | contribs) (Created page with "<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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

$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′ ≤ h,k′ ≤ k$ (Error compiling LaTeX. Unknown error_msg), then $(h′,k′)$ (Error compiling LaTeX. Unknown error_msg) 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.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2002_IMO_Problems/Problem_1&oldid=70719"