I'd like to start a little series on some paradoxes, maybe for the pure joy of the paradox or perhaps to talk about some related idea. Today's uses an abuse of proof by induction, a handy little tool that is great for proving (verifying really) facts that we're told but awful at telling us why they're true. Induction is used to prove a fact about all whole numbers (perhaps after a point) and we start by showing that something is true for the smallest case, usually n = 1. Then we follow by showing that if the statement is true for some n, then it must be true for n + 1. And in fact, it's true for n = 1, so this proves it's true for n = 2. Now we know it's true for n = 2, we can conclude it for n = 3, and so on. A simple example might be: we can reach any rung on a ladder because we can reach the first rung ( base case ) and from any rung we can reach the next rung ( induction step ).