olymmath

IMO 2002 Problem 1

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

Community text Kalva (prase.cz mirror). Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator imo/2002/p1 · Tag VJ94GQWQ89 · Edit this page on GitHub · Keys: j next, k previous