top | item 29445502

(no title)

grifball | 4 years ago

For understanding: this proof makes sense if you (incorrectly) assume that any two horses are the same color, because then you can take any pair of horses in an n-sized group and split it into intersecting pairs to show that theyre all the same color. With this assumption, this inductive proof would work as well.

discuss

order

No comments yet.