Hi! I've uploaded two codes on the google group, computation of binomial coefficients in a much faster way than the currently used in mpir/gmp, using binary splitting (the idea is similar if we would use product tree). In gmp there are two functions for this: mpz_bin_ui and mpz_bin_uiui. Note that my code is slower for small input (small means that k is small in function of n), so use the old code in such cases.
The idea is old, I've sent a similar contribution to gmp years ago, I don't know why they haven't used it. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to mpir-devel@googlegroups.com To unsubscribe from this group, send email to mpir-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en -~----------~----~----~----~------~----~------~--~---
