Read on http://gmplib.org/tasks.html that you/gmp needs an implementation for Chinese Remainder Theorem, on googlegroup I've uploaded two codes that solves it: mpz_crt_coprime works for pairwise coprime modulus, and mpz_crt works in general. One timing:
crt_coprime solves the x==i mod prime(i) for 0<=i<131072 system in about 4 seconds on my machine. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en -~----------~----~----~----~------~----~------~--~---
