Thread
:
Speeding up (n mod m) for very large fixed n and varying smaller m
View Single Post
2016-02-08, 12:52
#
2
bgbeuning
Dec 2014
3×5×17 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.
bgbeuning
View Public Profile
Find More Posts by bgbeuning