Show that if aJ = bJ (mod m) for j = 1, 2,…, n, where m is a positive integer and aj, bj, j = 1,2,…, n, are integers, then
a) .
b) .
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.