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: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsConstantly decreasing distance?broll2019-01-17 11:24:06
re(2): But....Jer2019-01-16 13:43:17
re(2): But....ariana2019-01-16 03:38:51
re: But....armando2019-01-16 02:59:20
another thoughtSteven Lord2019-01-16 00:40:52
N=3 and conjectured formulaJer2019-01-15 10:01:19
QuestionBut....Kenny M2019-01-15 07:58:19
From intuitionarmando2019-01-15 03:53:56
more thoughtsSteven Lord2019-01-14 23:30:08
Some ThoughtsconjectureCharlie2019-01-14 16:26:06
some floundering ideasSteven Lord2019-01-14 16:20:11
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

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