There are better ways to compute factorial quotients without overflow or loss of precision.
So, now I've got my "schoolboy approach" working, care to point me at the methods clever people would use?
In reply to Re^2: Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk
in thread Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |