[Home]History of BinomialDistribution

HomePage | RecentChanges | Preferences

Revision 7 . . February 18, 2001 3:24 am by RoseParks [*You won't change this so I did.]
Revision 6 . . February 18, 2001 3:22 am by RoseParks [*You won't change this, so I did.]
Revision 5 . . February 18, 2001 3:19 am by RoseParks [*Well I changed it, since you won't.]
Revision 4 . . February 17, 2001 7:31 am by RoseParks [*Will the real author please stand up?]
Revision 3 . . February 17, 2001 7:21 am by RoseParks
Revision 2 . . February 17, 2001 6:55 am by RoseParks
Revision 1 . . February 16, 2001 6:38 am by (logged).bomis.com
  

Difference (from prior major revision) (author diff)

Changed: 3c3
To get a probability of getting X heads in a sequence of N tosses, several things have to happen. If the probability of a head on a single trial is p and then the probability of a tail is q=(1-p) Then the result of X heads and N-X tails on any one trial has a probability calculated by finding the product of multiplying p times itself X times (p^X), and q times itself (N-X) times (q^(N-X)) giving (p^X q^(N-X)). However, there are many sequences which match this description. By the methods of CombinaTorics, we can find that there are N!/(X!*(N-X)!) different combinations with X heads and N-X tails. So, the probability of X heads is
To get a probability of getting X heads in a sequence of N tosses, several things have to happen. If the probability of a head on a single trial is p and then the probability of a tail is q=(1-p) Then the result of X heads and N-X tails on any one trial has a probability calculated by finding the product of multiplying p times itself X times (p^X), and q times itself (N-X) times (q^(N-X)), that is (p^X q^(N-X)). However, there are many sequences which match this description. By the methods of CombinaTorics, we can find that there are N!/(X!*(N-X)!) different combinations with X heads and N-X tails. So, the probability of X heads is

HomePage | RecentChanges | Preferences
Search: