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)?
The required longest possible route length as given by:
• Charlie is: N * sin{pi/(2 * N)}
• Jer and armando is: V(n)
Edited on June 10, 2022, 11:58 pm
Puzzle Answer
