Mathematics for Computer Science

Chapter 8 Number Theory202

So we can also see that

29 15 .mod7/ because rem.29;7/D 1 Drem.15;7/:

Notice that even though “(mod 7)” appears on the end, thesymbol isn’t any
more strongly associated with the 15 than with the 29. It would really be clearer to
write 29  715 for example, but the notation with the modulus at the end is firmly
entrenched and we’ll stick to it.
The Remainder Lemma 8.5.1 explains why the congruence relation has proper-
ties like an equality relation. In particular, the following properties follow immedi-
ately:

Lemma 8.5.2.

aa .modn/ (reflexivity)

ab iff ba .modn/ (symmetry)

.abandbc/ implies ac .modn/ (transitivity)

We’ll make frequent use of another immediate Corollary of the Remainder Lemma 8.5.1:

Corollary 8.5.3.
arem.a;n/ .modn/
Still another way to think about congruence modulonis that itdefines a partition
of the integers intonsets so that congruent numbers are all in the same set. For
example, suppose that we’re working modulo 3. Then we can partition the integers
into 3 sets as follows:

f :::; 6; 3; 0; 3; 6; 9; ::: g

f :::; 5; 2; 1; 4; 7; 10; ::: g

f :::; 4; 1; 2; 5; 8; 11; ::: g

according to whether their remainders on division by 3 are 0, 1, or 2. The upshot
is that when arithmetic is done modulonthere are really onlyndifferent kinds
of numbers to worry about, because there are onlynpossible remainders. In this
sense, modular arithmetic is a simplification of ordinary arithmetic.
The next most useful fact about congruences is that they arepreservedby addi-
tion and multiplication:

Lemma 8.5.4.Forn 1 , ifab .modn/andcd .modn/, then

1.aCcbCd .modn/,

2.acbd .modn/.