Timeline for Probability of n-bit sequence appearing at least twice in m-bit sequence
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:39 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Mar 26, 2016 at 20:38 | history | edited | josliber | CC BY-SA 3.0 |
R syntax highlighting
|
| Mar 26, 2016 at 14:57 | comment | added | josliber | @titus.andronicus The other answer computes the exact solution using a markov chain but makes no attempt to yield a closed-form solution. This one is a closed-form solution but is an upper bound. Since they are both pretty long and follow completely different techniques, I chose to post two separate answers. If you're interested in reading more, check out meta.stackexchange.com/questions/224772/… and its duplicates. | |
| Mar 26, 2016 at 14:55 | comment | added | titus.andronicus | Quick question. Why did you write 2 separate answers? Both are very well explained, and I see they follow different approaches, but shouldn't they be combined? Forgive my lack of knowledge, first time with a bounty question ;) | |
| Mar 24, 2016 at 22:13 | history | answered | josliber | CC BY-SA 3.0 |