A snail starts on one end of a bungee chord that is 1 km long and can be stretched infinitely long.
Every minute he goes 1 cm along the chord.
However, unfortunately, every minute the chord also gets stretched one more kilometer. (That is, after one minute it is stretched to 2 km, after 2 minutes it is stretched to 3 km, and so on)
Will the poor snail ever reach the other end of the chord?
Assumptions: The chord stretches uniformly.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We can consider the percentage of the chord the snail has traversed every minute.
In the first minute he has traversed 1 0 0 , 0 0 0 1 of the chord. After the second minute, he has traversed an additional 2 0 0 , 0 0 0 1 of the chord, for a total of 2 0 0 , 0 0 0 3 of the chord.
In fact, after n minutes, the percentage of the chord he has traversed is given by:
P ( n ) = 1 0 0 , 0 0 0 1 ( 1 1 + 2 1 + 3 1 + . . . + n 1 )
And we know that as n approaches ∞ the infinite series inside the parentheses diverges, so it will eventually pass 1 0 0 , 0 0 0 .
So, even though it will take a ridiculously long time, yes he will eventually make it! :)