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

bgbeuning · 2016-02-08, 12:52

Sometimes it helps to multiply all the modulo together (M) and compute

X = n mod M

then

x[i] = X mod m[i]

is easier. But your m[i] sound too big for this to help.

2016-02-08, 12:52	#2
bgbeuning Dec 2014 377₈ Posts	Sometimes it helps to multiply all the modulo together (M) and compute X = n mod M then x[i] = X mod m[i] is easier. But your m[i] sound too big for this to help.