O.

PROBLEM STATEMENT
Say that we have n  , n  1 . Say, also, that a mod n  a  , and similarly b mod n  b . Show that we then enjoy
( a  b) mod n  ( a   b) mod n and also that ( ab) mod n  ( a b) mod n .

I. MY PROOF
We know that a’ and b’ are the remainders in the quotient-remainder decomposition. That is:
a  qa n  a b  qbn  b 101\* MERGEFORMAT [.]

Then: it is obvious that we can mod the sum (a + b) by “n” and get:
(a  b) mod n  ( qa n  a   qbn  b) mod n  (a   b) mod n  0  0 q n mod n 0  ( a   b) mod n
a 202\*
MERGEFORMAT [.]

Now: the other part: what about the product “ab”?

( ab) mod n  ( qa n  a)( qbn  b) mod n   qa qbn 2  n ( qa b  qba )  a b mod n  (a b) mod n
303\*
MERGEFORMAT [.]

That was extremely easy…

41Equation Section (Next)II. BACKGROUND READING

52Equation Section (Next)III. QUESTIONS

63Equation Section (Next)IV. THE ANSWER