![]() |
|
Problems? Is your data what you think it is? | |
PerlMonks |
Re^2: Fastest way to calculate hypergeometric distribution probabilities (i.e. BIG factorials)?by Anonymous Monk |
on Apr 05, 2010 at 21:15 UTC ( #832923=note: print w/replies, xml ) | Need Help?? |
I could be mistaken but I think this calculates the probability of i successful selections, not i or more successful selections as claimed above. For the cdf, prob of i or more successes, you need to do the following:
In Section
Seekers of Perl Wisdom
|
|