Fallacious proof/all horses are the same color

Revision as of 12:16, 3 August 2006 by JBL (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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