Points A and B are on a plane surface, 1 mile apart. Suppose you must walk in a path consisting of N straight lines from point A to point B, such that at all times your (Euclidean) distance to point B is decreasing. What is the longest possible route length (as a function of N)?

Some very cool thoughts so far, but - where does it say in the problem statement that the N segments must be the same length?

Posted by Kenny M on 2019-01-15 07:58:19