How do you prove that a suitcase can hold an infinite number of hankies?
- Base case: Obviously, a single hankie will fit in a suitcase.
- Induction step: Ah well, just one more sure will fit!
How do you prove that a suitcase can hold an infinite number of hankies?
I like how a serious paradox for ancient philosophers becomes just a joke for students today.
“With the assumption that removing a single grain does not cause a heap to not be considered a heap anymore, the paradox is to consider what happens when the process is repeated enough times that only one grain remains and if it is still a heap. If not, then the question asks when it changed from a heap to a non-heap.”
I think the definition of “heapness” should be left up to our Australian brothers and sisters
Ohhh… as a statistician being mildly obsessed about how pie charts often are not such a good idea to visualise your data, this is a very good one!
This reminds me of the (not really a joke) math puzzler. Find the logical misstep in the following induction proof.
To prove:
All horses are the same color.
Base case: Consider a set of one horse. Clearly, one horse is the same color as itself, therefore a set of one horse is all the same color.
Induction step:
Now, where is the poison? The battle of wits has begun.
Nothing rhymes with orange.
Nothing rhymes with purple.
Therefore, by induction, orange rhymes with purple.
I was honestly confused by this. I think you must mean by the transitive property, not induction.