Message text written by "Blosser, Jeremy"
>Chinese Remainder Theorem<
You may want a different way to combine the results from many processors.
CRT - if you have pair-wise relatively prime (positive) integers M1, M2,
..., Mn and residues R1,...Rn
then you can find an integer A such that for all i, 1 LE i LE n, A = Ri
(mod Mi) [here "=" means congruent].
The pairwise relatively prime is important. That is, for all i, j, we have
(Mi, Mj) = 1. In fact, the CRT does not
in general work without this.
The residues can be any integers.
Joth Tupper
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
