Data Structures and Algorithms -- 66-230
Discrete Mathematics Overview -- Solution to Colored Horses Problem.

Class Exercise 2 on Induction: The proof of the induction step is wrong and in particular it fails when n=2. When n=2, $H_1 \cap H_2 = \{ \, \}$. Hence, nothing can be concluded about the relationship between colors c₁ and c₂. Note that the induction step can be proved for n>2. This then would require an additional basis case for n=2, which obviously can not be proved.