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.)
From intuition | Comment 4 of 13 |
This is a beauty problem. I'm going to give a formula that come from intuition, leaving a more fully treatment to verify it

It's obvious that if we think not of straight lines but on a curve, we get a very dense spiral and the distance becomes infinite, as the circles of the spiral can be infinitely close one to another.

But when trying to adapt to that spiral a finite number of parts N an idea comes. And is this:

Consider a circle with origin in B and being A a point of it. Now if the number of segments is N consider dividing the distance between A and B in N equal parts. Now trace the circle with centre in B and radio the distance from B to each part of the division. We get N concentric circles with origin in B. 

Now we trace from A a tangential segment to the immediate circle, and from that point a segment tangencial to the next lower circle, and so to arrive to B. Each segment departs from a circle and is tangent to the immediately inferior concentric circle. When N is a very big number I suppose that this is going to fit very well into the spiral. 

And is mathematically simple because the length of each segment is the producto of the radio of the circle for the sin of the angle between both radios

For segment in position  i: L(i)= r(i) sen a(i)

But r(i)=(n-i)/n
and cos a(i)=(n-i-1)/n-i, 
so we have r (i) and sin a(i) as function of n.

The lenght of each segment is then:

L(i)= [(n-i/n]*sqr[1-[(n-i-1)/(n-i)]^2]

And the formula for the distance is: 

d= Sigma [(n-i)/n]*sqr[1-[(n-i-1)/n-i]^2]   (i from 0 to n-1)

For 
N=2 d=1.366
N=3 d=1.519


From here is clear that this is not the solution as for N=2 we can have a distance of 1,4142 (bigger than mine). 
We can adjust the radios in a non linear but quadratic way. I mean making the concentric circles have each an area in arithmetic proportion. Then the radio of the circle i should be

 r(i)=sqr(i/N)

When we do this and use the formulas given before everything simplifies and we get

d=sigma 1/sqrN  and then ae there are N terms
d=sqr N

N=2 d=1,414
N=3 d=1,732
N=4 d=2,000

which is a better result.

Edited on January 15, 2019, 6:39 am

Edited on January 15, 2019, 7:05 am
  Posted by armando on 2019-01-15 03:53:56

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 (0)
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