"Tomasz Lisowski" <lisowski.tomasz at sssa.NOSPAM.com.pl> wrote in message news:9auule$28g$1 at news.tpi.pl... > It is numerically a bad idea to compute the factorial directly. Most often > it is encountered in expressions, where two similarly huge numbers are > divided, resulting in a quite normal (not so huge) number. For the specific (and frequent) case of binomial coefficients, aka combinations ((a+b)!/(a!b!)), GMP directly offers a shortcut that can be rather speedy (and gmpy, my Python wrapper for GMP, of course exposes it -- it may be the single gmpy function I call most often, as I often compute cards-related probabilities:-). Alex
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4