(adsbygoogle = window.adsbygoogle || []).push({}); Coin tossing ---extended version---

We learned in previous posts that to obtain a string of at least K Heads, one has to flip a coin 2^(K+1)-2 times (N) on average (Markov chains), e.g. K = 3 HEADS, N would be 14.

On the other hand: flipping a coin 14 times and calculating the probability that a string of at least 3 HEADS occurs, the probability = 0.647949219

The strange thing is that doing the string of HEADS from 1 to (let's say) 10 and calculating the matching average nr of flips (N = 2^(K+1)-2), reversing this exercise and calculating the probability of occurence of such a string in N, is always around the above mentioned probability of 0.647949219.

Can someone please explain?

thnx in advance

Marc

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Coin tossing -extended version-

Loading...

Similar Threads - Coin tossing extended | Date |
---|---|

I Coin toss with changing probability | Dec 17, 2016 |

I How is Cantor set similar to coin tosses? | Jun 10, 2016 |

Tossing a coin n times | Nov 22, 2015 |

Toss coin probabilities (Bino vs Gauss approx) | May 24, 2015 |

Coin Toss net gain standard deviation | Apr 30, 2015 |

**Physics Forums - The Fusion of Science and Community**