Timeline for Calculating the probability that all possible length $r$ subwords exists in a string, with or without overlaps allowed
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 7, 2014 at 17:11 | history | edited | Bjørn Kjos-Hanssen |
edited tags
|
|
| Apr 7, 2014 at 6:46 | answer | added | Bjørn Kjos-Hanssen | timeline score: 3 | |
| Apr 7, 2014 at 4:01 | comment | added | AClockTicks | @BrendanMcKay Sorry for the typo, it should now be fixed. Also, thanks in general for your comment - this ended up being tricky for me to work out and I feel relieved to know at least one other person doesn't think the problem is trivial. | |
| Apr 7, 2014 at 3:59 | history | edited | AClockTicks | CC BY-SA 3.0 |
deleted 7 characters in body
|
| Apr 6, 2014 at 18:20 | comment | added | Brendan McKay | People voting to close might like to tell us the answer if it is so easy. @AClockTicks: delete the first appearance of the word "binary". | |
| Apr 6, 2014 at 8:43 | review | Close votes | |||
| Apr 14, 2014 at 14:43 | |||||
| Apr 6, 2014 at 8:02 | review | First posts | |||
| Apr 6, 2014 at 8:17 | |||||
| Apr 6, 2014 at 7:45 | history | asked | AClockTicks | CC BY-SA 3.0 |