Also, the Math::Gsl::Sf has a gamma function, which may speed up calculations (I'm not sure if it would or not, I haven't actually studied the inner workings of the gamma function). The gamma function of any whole number is equal to that number's factorial, ie gamma(300) == 300!, which is why I think this function may be faster than a factorial, since there probably aren't 300 multiplications, I bet it's just some sort of integral, which may have quite a few calculations, but not 300 large multiplications.
-Bryan
In reply to Re^2: Fastest way to calculate hypergeometric distribution probabilities (i.e. BIG factorials)?
by mrborisguy
in thread Fastest way to calculate hypergeometric distribution probabilities (i.e. BIG factorials)?
by Commander Salamander
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |