{"id":3310798,"date":"2006-02-14T13:47:00","date_gmt":"2006-02-14T13:47:00","guid":{"rendered":"http:\/\/su.blog.bunty.tv\/2006\/02\/14\/Lemma-All-horses-are-the\/"},"modified":"2007-11-26T03:37:45","modified_gmt":"2007-11-26T03:37:45","slug":"Lemma-All-horses-are-the","status":"publish","type":"post","link":"http:\/\/su.blog.bunty.tv\/?p=3310798","title":{"rendered":"Lemma:  All horses are the"},"content":{"rendered":"<div class='sustuff'>Stumbleupon <a href='http:\/\/horsewithnobunty.stumbleupon.com\/review\/3310798\/'>Review<\/a>\n<\/div>\n<p> <\/p>\n<ul>\n<p>Lemma:  All horses are the same color.<\/p>\n<p>Proof (by induction):<\/p>\n<ul>\n    Case n=1:  In a set with only one horse, it is obvious that all horses<br \/>\n    in that set are the same color.<\/p>\n<p>    Case n=k:  Suppose you have a set of k+1 horses.  Pull one of these<br \/>\n    horses out of the set, so that you have k horses.  Suppose that all of<br \/>\n    these horses are the same color.  Now put back the horse that you took<br \/>\n    out, and pull out a different one.  Suppose that all of the k horses<br \/>\n    now in the set are the same color.  Then the set of k+1 horses are all<br \/>\n    the same color.  We have k true => k+1 true; therefore all horses are<br \/>\n    the same color.<\/p>\n<\/ul>\n<p>Theorem:  All horses have an infinite number of legs.<\/p>\n<p>Proof (by intimidation):<\/p>\n<ul>\n<p>    Everyone would agree that all horses have an even number of legs.  It<br \/>\n    is also well-known that horses have forelegs in front and two legs in<br \/>\n    back.  4 + 2 = 6 legs, which is certainly an odd number of legs for a<br \/>\n    horse to have!  Now the only number that is both even and odd is infinity;<br \/>\n    therefore all horses have an infinite number of legs.<\/p>\n<p>\n    However, suppose that there is a horse somewhere that does not have an<br \/>\n    infinite number of legs.  Well, that would be a horse of a different<br \/>\n    color; and by the Lemma, it doesn&#8217;t exist.\n<\/ul>\n<p><\/p>\n<pre><br \/>\r\n                                           QED<br \/>\r\n<br \/>\r\n<\/pre>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Stumbleupon Review Lemma: All horses are the same color. Proof (by induction): Case n=1: In a set with only one horse, it is obvious that all horses in that set are the same color. Case n=k: Suppose you have a &hellip; <a href=\"http:\/\/su.blog.bunty.tv\/?p=3310798\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_et_pb_use_builder":"","_et_pb_old_content":""},"categories":[1381],"tags":[400569],"_links":{"self":[{"href":"http:\/\/su.blog.bunty.tv\/index.php?rest_route=\/wp\/v2\/posts\/3310798"}],"collection":[{"href":"http:\/\/su.blog.bunty.tv\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/su.blog.bunty.tv\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/su.blog.bunty.tv\/index.php?rest_route=\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"http:\/\/su.blog.bunty.tv\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=3310798"}],"version-history":[{"count":0,"href":"http:\/\/su.blog.bunty.tv\/index.php?rest_route=\/wp\/v2\/posts\/3310798\/revisions"}],"wp:attachment":[{"href":"http:\/\/su.blog.bunty.tv\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3310798"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/su.blog.bunty.tv\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=3310798"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/su.blog.bunty.tv\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=3310798"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}