mersenneforum.org - View Single Post - Speeding up (n mod m) for very large fixed n and varying smaller m

mickfrancis · 2016-02-08, 12:00

I have a large fixed n (around 100,000 digits, say) and need to calculate (n mod m) for many different values of m, which are smaller (tens of digits). Is there is any preconditioning I can use, or any transformations that might be applied to speed this process up at all?

2016-02-08, 12:00	#1
mickfrancis Apr 2014 Marlow, UK 2³·7 Posts	Speeding up (n mod m) for very large fixed n and varying smaller m I have a large fixed n (around 100,000 digits, say) and need to calculate (n mod m) for many different values of m, which are smaller (tens of digits). Is there is any preconditioning I can use, or any transformations that might be applied to speed this process up at all?