Shamelessly lifted from a fortune database, with a few changes to reference other E2 wus.

The composition of proofs by oddity is a passtime enjoyable to both mathematicians and linguists, although the peculiar hybrids often found pursuing advanced degrees in computer science tend to be particularly adept.

SAMPLE: To prove that horses have an infinite number of legs.

  1. Horses have an even number of legs.
  2. They have two legs in back and fore legs in front.
  3. This makes a total of six legs, which certainly is an odd number of legs for a horse.
  4. But the only number that is both odd and even is infinity.
  5. Therefore, horses must have an infinite number of legs.
See also related proofs that: And the famous computer science proof that: And other famous proof forms:

Log in or register to write something here or to contact authors.