Fallacious proof/all horses are the same color

Revision as of 21:45, 7 August 2006 by Mysmartmouth (talk | contribs)

Our base case is not the appropriate base case: if one could show that every pair of horses has the same color (the result for $n = 2$), the fact that all horses have the same color would follow. Unfortunately, the case $n = 2$ does not follow from the case $n = 1$. The first horse is the same color as itself, and so is the second horse, but there is no overlap.

This article is a stub. Help us out by expanding it.

Invalid username
Login to AoPS