Timeline for Runner's High (Speed)
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 6, 2018 at 21:21 | comment | added | Ricky | I don't find this so bind-boggling: if $d_1$ is bigger then $d_2/2$, then there is a subset $S$ of $[0,d_2]$ included in every subinterval of length $d_1$. If the second runner is very slow on $S$, for example it needs more time than the total time for the first runner (meaning that it must be very fast outside $S$ to be faster, on average, then the first runner) we have the required situation. | |
| Dec 6, 2018 at 20:26 | answer | added | Mark Dettinger | timeline score: 9 | |
| Dec 5, 2018 at 21:21 | vote | accept | Dominic van der Zypen | ||
| Dec 5, 2018 at 16:47 | answer | added | Alexandre Eremenko | timeline score: 17 | |
| Dec 5, 2018 at 16:28 | history | edited | user44143 | CC BY-SA 4.0 |
Used parallel notation for two runners. Removed use of 0 to denote a runner, so that it can more clearly denote the starting point.
|
| Dec 5, 2018 at 15:01 | comment | added | Robert Israel | Is the runner allowed to run backward? | |
| Dec 5, 2018 at 14:48 | comment | added | Dominic van der Zypen | Lingering in the background, is the question, whether there is such a "global constant" $C>1$ as asked for in the question. I think there must be, but I haven't been able to prove it... | |
| Dec 5, 2018 at 13:00 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
added 5 characters in body
|
| Dec 5, 2018 at 12:47 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |