Skip to main content
16 events
when toggle format what by license comment
Feb 11, 2016 at 11:06 vote accept user1946334
Feb 11, 2016 at 7:34 history closed Fernando Muro
Alex Degtyarev
Peter Humphries
Wolfgang
user1688
Not suitable for this site
Feb 10, 2016 at 21:12 review Close votes
Feb 11, 2016 at 7:34
Feb 10, 2016 at 21:11 answer added Fedor Petrov timeline score: 1
Feb 10, 2016 at 21:07 comment added Serguei Popov @user1946334 - then what you want to prove is probably wrong, because the "typical" longest sequence of 0's should be of length roughly $\log_2 n$. Anyhow, see the links below.
Feb 10, 2016 at 21:05 comment added Tony Huynh The title asks a different question than the question in the body.
Feb 10, 2016 at 21:03 answer added Serguei Popov timeline score: 0
Feb 10, 2016 at 21:00 comment added user1946334 The sequence is randomly chosen between all possible combinations of sequences of length n of 1s and 0s.
Feb 10, 2016 at 20:54 comment added Serguei Popov Do you mean that the entries of your sequence are independent, and the 0's and 1's are equiprobable (i.e., 0 w/p 1/2, 1 w/p 1/2)?
Feb 10, 2016 at 20:51 history edited user1946334 CC BY-SA 3.0
added base of log
Feb 10, 2016 at 20:50 history edited Fedor Petrov CC BY-SA 3.0
added 6 characters in body
Feb 10, 2016 at 20:50 comment added Fedor Petrov Ah, probably I made a wrong edit. In any case, please specify the base of logarithm.
Feb 10, 2016 at 20:47 comment added Yemon Choi Why do you expect this result to be true? and on a related note, where/how does the problem originate?
Feb 10, 2016 at 20:46 review First posts
Feb 10, 2016 at 20:49
Feb 10, 2016 at 20:45 history edited Fedor Petrov CC BY-SA 3.0
added 2 characters in body
Feb 10, 2016 at 20:42 history asked user1946334 CC BY-SA 3.0