Re:Calculating integer factorials in constant time, taking a...
by a1k0n on Wednesday December 16, 2015 @12:41AM
(#10742605)
You wouldn't, for statistics. That's my point.
Only in number theory problems do you actually need bignums for factorials, and those are usually toy problems or modulo some big prime.
I don't know of any actual applications where you need to compute the bignum factorial. I'm curious what the GP needed it for.
Eg, Stirlings approximation for ln(n!) should serve fairly well for moderate and above values of n. And knowing your statistical distribution at large n you can likely find a decent distribution from a discrete case requiring n! into a continuous one, eg Gaussian.