You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I suggest using the algorithm below.
The text is from [1].
Binomial Coefficients
Binomial coefficients C(n,k) are calculated by first arranging k <= n/2 using C(n,k) = C(n,n-k) if necessary, and then evaluating the following product simply from i=2 to i=k.
k (n-k+i)
C(n,k) = (n-k+1) * prod -----------
i=2 i
It's easy to show that each denominator i will divide the product so far, so the exact division algorithm is used (see Exact Division).
Currently the text book formula
is used to compute binomial coefficients.
I suggest using the algorithm below.
The text is from [1].
Binomial Coefficients
Binomial coefficients C(n,k) are calculated by first arranging k <= n/2 using C(n,k) = C(n,n-k) if necessary, and then evaluating the following product simply from i=2 to i=k.
It's easy to show that each denominator i will divide the product so far, so the exact division algorithm is used (see Exact Division).
[1] https://web.archive.org/web/20111229055708/https://www.gnu.org/software/gmp/manual/html_node/Binomial-Coefficients-Algorithm.html
The text was updated successfully, but these errors were encountered: