3 ms·
>We will show, by induction, that for any set of n horses, every horse in that set has the same color. >Now suppose for all sets of n horses, every horse in th
by na85 5y ago
>We will show, by induction, that for any set of n horses, every horse in that set has the same color.
>Now suppose for all sets of n horses, every horse in the set has the same color.
"We will prove that $thing is true. Step 1: assume $thing is true"
I guess I don't see what the big deal is. Of course you can befuddle someone if they don't carefully read what you wrote.
- georgeoliver 5y agoOriginally I had the same impression as you, but I'm starting to think the author didn't actually mean to imply your step 1. Their "now suppose for all sets of n" was a poor choice of phrasing and they meant something else than what the average person would assume. For example see https://news.ycombinator.com/item?id=29445778 https://news.ycombinator.com/item?id=29445778