The typical system of congruence equations addressed by the CRT looks like $$ x \equiv a_i \text{ mod } n_i $$ Is there a way to use those or similar techniques to tackle something of this form? $$ (x + a_i) \equiv 0 \text{ mod } n_i $$
Asked
Active
Viewed 32 times
0
-
6Yes. Your equation is same as $x \equiv -a_i$ mod $n_i.$ – coffeemath Dec 14 '20 at 00:22
-
well that was very easy...should have seen that.. – Palace Chan Dec 14 '20 at 01:05