Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Prob of flipping coin n times, at no time with #h > #t?
Replies: 10   Last Post: Feb 14, 2013 2:25 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
JohnF

Posts: 154
Registered: 5/27/08
Prob of flipping coin n times, at no time with #h > #t?
Posted: Feb 6, 2013 8:42 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

What's P_n, the prob of flipping a coin n times,
and at no time ever having more heads than tails?
There are 2^n possible h-t-... sequences of n flips,
comprising a binomial tree (or pascal's triangle),
with 50-50 prob of going left/right at each node.
So, equivalently, how many of those 2^n paths never
cross the "center line" (#h = #t okay after even number
of flips)?
Actual problem's a bit more complicated. For m<=n,
what's P_n,m, the prob that #h - #t <= m at all times?
That is, P_n above is P_n,0 here. Equivalently, how
many of those binomial tree paths never get >m past
the "center line"?
--
John Forkosh ( mailto: j@f.com where j=john and f=forkosh )



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.