by zefuri » Wed Apr 25, 2007 5:33 pm
Let [unparseable or potentially dangerous latex formula] be a set containing [unparseable or potentially dangerous latex formula] elements, for some positive integer [unparseable or potentially dangerous latex formula]. Suppose that the [unparseable or potentially dangerous latex formula]-element subsets of [unparseable or potentially dangerous latex formula] are partitioned into two classes. Prove that there are at least [unparseable or potentially dangerous latex formula] pairwise disjoint sets in the same class.