3 ms·

All horses are of the same color. By induction, suppose there are only n=1 horses. Obviously they are all the same color. Suppose we had proven the statement

by Grue3 12y ago

All horses are of the same color. By induction, suppose there are only n=1 horses. Obviously they are all the same color. Suppose we had proven the statement up to n. For every n+1 horses, the first n horses must be the same color. The last n horses too, must have the same color. Clearly all of them have the same color. QED.

repsilat 12y ago
This is lovely -- very simple, but my error-finding intuition started me off entirely in the wrong direction.
taeric 12y ago
I admit I laughed heavily when I saw that as the first warm up in Concrete Mathematics. And then just breathed deeply with how quickly it got beyond me. :)