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)?
(In reply to
re: But.... by armando)
The article is exceptionally good and straightforward. This is precisely what I require
|
|
Posted by ariana
on 2019-01-16 03:38:51 |
re(2): But....
