Wasn’t there once an airline called Air Lingus? You don’t think…?
Giraffes have an infinite nuber of legs. And they are all the same color, too.
*Lemma 1: All giraffes are the same colour.
Proof by induction: It is obvious that one giraffe is the same colour. Let us assume the proposition P(k) that k giraffes are the same colour and use this to imply that k+1 giraffes are the same colour. Given the set of k+1 giraffes, we remove one giraffe; then the remaining k giraffes are the same colour, by hypothesis. We remove another giraffe and replace the first; the k giraffes, by hypothesis, are again the same colour. We repeat this until by exhaustion the k+1 sets of k giraffes have been shown to be the same colour. It follows that since every giraffe is the same colour as every other giraffe, P(k) entails P(k+1). But since we have shown P(1) to be true, P is true for all succeeding values of k, that is, all giraffes are the same colour. Q.E.D.
Theorem 1: Every giraffe has an infinite number of legs.
Proof by intimidation: Giraffes have an even number of legs. Behind they have two legs and in front they have fore legs. This makes six legs, which is certainly an odd number of legs for a giraffe. But the only number that is both odd and even is infinity. Therefore giraffes have an infinite number of legs. Now to show that this is general, suppose that somewhere there is a giraffe with a finite number of legs. But that is a giraffe of another colour, and by the lemma that does not exist. Q.E.D.*
From here.
Giraffes have an infinite number of legs. And they are all the same color, too.
*Lemma 1: All giraffes are the same colour.
Proof by induction: It is obvious that one giraffe is the same colour. Let us assume the proposition P(k) that k giraffes are the same colour and use this to imply that k+1 giraffes are the same colour. Given the set of k+1 giraffes, we remove one giraffe; then the remaining k giraffes are the same colour, by hypothesis. We remove another giraffe and replace the first; the k giraffes, by hypothesis, are again the same colour. We repeat this until by exhaustion the k+1 sets of k giraffes have been shown to be the same colour. It follows that since every giraffe is the same colour as every other giraffe, P(k) entails P(k+1). But since we have shown P(1) to be true, P is true for all succeeding values of k, that is, all giraffes are the same colour. Q.E.D.
Theorem 1: Every giraffe has an infinite number of legs.
Proof by intimidation: Giraffes have an even number of legs. Behind they have two legs and in front they have fore legs. This makes six legs, which is certainly an odd number of legs for a giraffe. But the only number that is both odd and even is infinity. Therefore giraffes have an infinite number of legs. Now to show that this is general, suppose that somewhere there is a giraffe with a finite number of legs. But that is a giraffe of another colour, and by the lemma that does not exist. Q.E.D.*
From here.
Okay! Okay! I got it the first time, already!
It’s obvious that the hamsters, being both deadly afraid of the infinity enhanced giraffes and delighted by my company, decided to double up for emphasis. The word goes 'round! Beware the hooves of doom!
You bet I do.
But I enjoyed the “nuber” version much more.
Good catch!
First hamsters then giraffes…this is my kind of place.
Every time I see this damn thread title, I get this song stuck in my head:
Giraffe brand pit cleaner
Specially selected pit cleaner
The best pit cleaner in the world is
Specially selected Giraffe brand!
And it’s driving me insane!
It would probably behoove us to keep in mind that a giraffe’s butt is about 10 feet up in the air.
So if we get on Giraffe’s shit list, it’s gonna be raining down on us at a pretty good velocity.
I’m just sayin’…
Threadspotting, hee hee!
Like a nice variety there, furryman?
You kinky monkey, you.