All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Reach home (Posted on 2019-01-14) Difficulty: 3 of 5
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)?

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts conjecture | Comment 2 of 11 |
When N is 2, it seems certain that the longest route while constantly decreasing the distance to B, would be the two legs of an isosceles right triangle with AB as the hypotenuse.

The conjecture is that the maximum distance would be achieved by inscribing equal-length chords in a semicircle with A and B as endpoints.  

That would come out to a path length of N * sin(pi/(2*N)).

Edited on January 14, 2019, 4:32 pm
  Posted by Charlie on 2019-01-14 16:26:06

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (2)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information