Hi Mahmut, there is the division with remainder function (mpn_tdiv_qr). The remainder is the same thing as mod of course.
In practice it takes about the same time to compute quotient and remainder as it does to compute just remainder. Bill. On 3 February 2013 20:48, mgundes <mg...@hotmail.com> wrote: > > Hi everybody, > > I need a function to do modular operation on big numbers. I found > mpn_mod_1() but its modulus parameter are single mp_limb_t. I want to use > also big modulus parameter, Is there any function mpn_mod() something like > below to be able to give size of modulus? > > mp_limb_t mpn_mod (mp_limb_t *s1p, mp_size_t s1n, mp_limb_t > *s2p, mp_size_t s2n) > > Thanks for your suggestions. > > Regards, > Thanks > > -- > MahmutG > > -- > You received this message because you are subscribed to the Google Groups > "mpir-devel" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to mpir-devel+unsubscr...@googlegroups.com. > To post to this group, send email to mpir-devel@googlegroups.com. > Visit this group at http://groups.google.com/group/mpir-devel?hl=en. > For more options, visit https://groups.google.com/groups/opt_out. > > -- You received this message because you are subscribed to the Google Groups "mpir-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to mpir-devel+unsubscr...@googlegroups.com. To post to this group, send email to mpir-devel@googlegroups.com. Visit this group at http://groups.google.com/group/mpir-devel?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
