News for hackers. Stuff that matters.
Re:The most common errors in undergraduate mathematics by Grue3 on Friday August 15, 2014 @10:51AM (#8182418)
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.

Re:The most common errors in undergraduate mathematics by taeric on Friday August 15, 2014 @11:59AM (#8182748)
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. :)

Re:The most common errors in undergraduate mathematics by repsilat on Friday August 15, 2014 @11:51AM (#8182712)
This is lovely -- very simple, but my error-finding intuition started me off entirely in the wrong direction.