Timeline for Mean length of the longest substring (not sequence) of a random string
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 12, 2017 at 15:39 | comment | added | Pat Devlin | Sure. Depending on what you mean by "wait time." | |
| Jan 12, 2017 at 14:46 | vote | accept | Ilhan | ||
| Nov 12, 2019 at 14:41 | |||||
| Jan 12, 2017 at 14:46 | comment | added | Ilhan | So it would be the expected wait time of that occourance | |
| Jan 12, 2017 at 14:44 | comment | added | Pat Devlin | I meant that the proof is the same. | |
| Jan 12, 2017 at 14:43 | comment | added | Ilhan | Are you sure it is the same as the longest expected occourance of H coin flips? It is allowed for the common substring to be HTHHTHT.. in that analogy | |
| Jan 12, 2017 at 14:38 | history | answered | Pat Devlin | CC BY-SA 3.0 |