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.)
re: some floundering ideas | Comment 12 of 13 |
(In reply to some floundering ideas by Steven Lord)

Our team of installers is made up of employees who are licensed, bonded and insured for your protection. Our crew takes pride in their work and will always treat you with respect and professionalism. If you have any questions regarding your new Window Awnings or any other products we offer, please feel free to contact us at any time. We look forward to working with you!
  Posted by Hayden Franki on 2022-06-10 14:31:52

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


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

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information