Frederick begins to walk a distance of But he is so tired that, in the first minute, he covers In the next minute, he covers half of the remaining distance, i.e. Again, in the next minute, he covers half of the remaining distance, which and so on.
Will Frederick be able to complete the
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.
The distance Fredrick covers each minute is a geometric series given by:
5 0 , 2 5 , 1 2 . 5 , . . . ⟹ 5 0 × ( 1 , 2 1 , 4 1 , . . . )
The sum of the series 1 , 2 1 , 4 1 , . . . to n terms is 2 ( 1 − ( 2 n 1 ) ) .
For Fredrick to cover 1 0 0 m , the series sum should converge to 2 . But this happens only when n → ∞ . Hence Fredrick can never cover the distance!