| ??? 06/07/09 08:32 Modified: 06/07/09 08:50 Read: times |
#165907 - Reminding of Achilles and the turtoise Responding to: ???'s previous message |
I think it is a quite interesting problem, since the way it is attacked so very much affects how hard it is to solve.
I obviously did not count "bounces" or try to solve the sum of an infinite series. This problem is a bit similar to the old problem of Achilles and the tortoise: http://en.wikipedia.org/wiki/Zeno's_paradoxes Edit: As I see it, there are three ways to solve: 1) The elegant way just involving the head 2) Solving limes 120*sum 1/(5^n) for n=0->inf, i.e. 120*(1 + 1/5 + 1/25 + 1/125 + ...) 3) Getting a compiler and the fastest computer in town. |
| Topic | Author | Date |
| As I like tests when interviewing people | 01/01/70 00:00 | |
| Nice one | 01/01/70 00:00 | |
| Ok Then | 01/01/70 00:00 | |
| Reminding of Achilles and the turtoise | 01/01/70 00:00 | |
| The story is... | 01/01/70 00:00 | |
| Infinite series need not requre inf number of steps | 01/01/70 00:00 | |
| Thats easy.... | 01/01/70 00:00 | |
| Yes | 01/01/70 00:00 | |
I wonder | 01/01/70 00:00 |