In this chapter we show how to define addition and multiplication of residue classes modulo . With respect to these binary operations is a ring as defined in Appendix A.
Definition
For we define and
Example
For we have and Note that since and we have and so we can also write
Since a residue class can have many representatives, it is important to check that the rules given in Definition do not depend on the representatives chosen. For example, when we know that so we should have and In this case we can check that Now since . Hence , as desired. Also and . Then and so and hence , as desired.
When performing addition and multiplication in using the rules in Definition , due to Theorem , we may at any time replace by if . This will sometimes make calculations easier.
Example
Take . Then and , so and since .
When working with it is often useful to write all residue classes in the least nonnegative residue system, as we do in constructing the following addition and multiplication tables for .
Table
Table
Recall that by Exercise 15.1 we have for all and So using residue classes modulo this gives
Hence,
So if and are in the set , these equations give us a way to obtain representations of the sum and product of and in the same set. This leads to an alternative way to define and addition and multiplication in . For clarity we will use different notation.
Definition
For define and for define
Remark
with and as defined is isomorphic to with addition and multiplication given by Definition . [Students taking Elementary Abstract Algebra will learn a rigorous definition of the term isomorphic. For now, we take “isomorphic” to mean “has the same form.”] The addition and multiplication tables for are:
Table
Table
Exercise
Prove that for every modulus we have for all and
Exercise
Construct addition and multiplication tables for .
Exercise
Without doing it, tell how to obtain addition and multiplication tables for from the work in Exercise .
Example
Let’s solve the congruence Using residue classes modulo we see that (1) is equivalent to which is equivalent to which is equivalent to Now we know so by trial and error we see that is a solution.