Re:The Patient Ant And The Stretchy Rubber Band
by Dove on Monday February 20, 2012 @11:30AM
(#3612841)
For the record, I was playing with an experimental perl script (which I was in the process of concluding would not work), when lotharbot walked in and asked what I was doing. I explained the problem, and he had the solution within a few seconds.
The first minute, the ant moves 1/100 of the length of the rubberband. The second minute, 1/200. The third minute, 1/300. Then 1/400, 1/500, 1/600, and so on.
Those who are well-versed in discrete math should recognize this as a variant of the "harmonic series" [0]. It is divergent, meaning it eventually -- but excruciatingly slowly -- will reach any given number. Thus, the ant will eventually reach the end of the rubberband. However, this will take him about 1.5 x 10^43 steps [1]
[0] http://en.wikipedia.org/wiki/Harmonic_series_%28mathematics%...
[1] http://oeis.org/A082912 - "In 1968 John W. Wrench Jr calculated the exact minimum number of terms needed for the series to sum past 100; that number is 15 092 688 622 113 788 323 693 563 264 538 101 449 859 497. Certainly, he did not add up the terms."