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

 Reach home (Posted on 2019-01-14)
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

 Subject Author Date Constantly decreasing distance? broll 2019-01-17 11:24:06 re(2): But.... Jer 2019-01-16 13:43:17 re(2): But.... ariana 2019-01-16 03:38:51 re: But.... armando 2019-01-16 02:59:20 another thought Steven Lord 2019-01-16 00:40:52 N=3 and conjectured formula Jer 2019-01-15 10:01:19 But.... Kenny M 2019-01-15 07:58:19 From intuition armando 2019-01-15 03:53:56 more thoughts Steven Lord 2019-01-14 23:30:08 conjecture Charlie 2019-01-14 16:26:06 some floundering ideas Steven Lord 2019-01-14 16:20:11

 Search: Search body:
Forums (0)