Probability of coin flipping streaks.

  • Context: Undergrad 
  • Thread starter Thread starter Dmobb Jr.
  • Start date Start date
  • Tags Tags
    Probability
Click For Summary
SUMMARY

The probability of achieving a streak of k heads when flipping a coin n times is a complex problem in probability theory. A referenced article from MIT discusses the mathematical framework for calculating such probabilities, but it becomes impractical for large values of k, such as k=100. The probability of flipping 100 consecutive heads is calculated to be 1/2^100, which is approximately 10^-30, indicating that even with a million flips, the likelihood remains exceedingly low. This highlights the need for more sophisticated computational methods to analyze streak probabilities effectively.

PREREQUISITES
  • Understanding of basic probability theory
  • Familiarity with combinatorial mathematics
  • Knowledge of algorithms for probability calculations
  • Basic programming skills for computational simulations
NEXT STEPS
  • Explore the article "Introduction to Algorithms" for deeper insights into probability algorithms
  • Research Monte Carlo simulations for estimating probabilities in large sample spaces
  • Learn about Markov chains and their application in modeling streaks
  • Investigate advanced probability concepts such as the law of large numbers
USEFUL FOR

Mathematicians, computer scientists, and anyone interested in probability theory, particularly those analyzing random processes and streak phenomena in coin flipping or similar experiments.

Dmobb Jr.
Messages
39
Reaction score
0
Recently I was discussing hitting streaks with my dad and I said "If you flip a coin a million time you're bound to get a streak of a hundred."

I am not sure if this is actually true and I am having some trouble figuring it out.

The more general question that I would like to be able to answer is what is the probability that you will get a streak of k heads when you flip a coin n times?

I found this article "http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-spring-2005/lecture-notes/l24_spcl_topics.pdf"

It explaines how to solve this however it requires k base cases. For k=100, this method is kind of useless. Can anyone think of a good way to solve this for large k and n?

PS. Using a computer is certainly okay.
 
Last edited by a moderator:
Physics news on Phys.org
Try google "coin flip streaks". One entry "Introduction to algorithms - page 112" might help.
 
The probability of rolling 100 heads in a row is 1/2100, or less than 10-30. Multiply this by a million and you still get a ridiculously small number. Note well: This is an upper bound. This simple calculation ignores the fact that there is a chance of getting 101 heads (or more) in a row somewhere along the line.
 

Similar threads

  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 41 ·
2
Replies
41
Views
8K
  • · Replies 57 ·
2
Replies
57
Views
6K
  • · Replies 47 ·
2
Replies
47
Views
8K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 29 ·
Replies
29
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K