i totally didn't believe this, so i wrote a small script to test it, and 'lo --pic.twitter.com/suTIkc9sH1
-
how many times have you run the script?
just 1000, but the results are pretty consistent if you try different numbers of iterationhttps://gist.github.com/c-johnson/91c9f2f1c0574cfd05978188adff0b4d …
-
-
There's either a bug in your script or the original paragraph is really mundane. You're not counting the number of occurrences of a given sequence, you're counting the number of 20-flip sequences that include it. An string of HHHHHHHHHHHT will just count as one for each.
-
Obviously, you can have HHHT without getting HHHH. But if you get HHHH, then you still have the HHH prefix, and now you have another flip to get T (and if that's H, yet another chance). The only way you get HHHH without HHHT is if after 3 Hs, it's Hs all the way to the end.
- Još 12 drugih odgovora
Novi razgovor -
-
-
interesting! (github keeps timing out on me but I'll check when i can)
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
-
-
There is a bug in the script. Your generating 20 flips and checking if the 4 appears in that. You need to generate 4 flips at a time
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.