Documente Academic
Documente Profesional
Documente Cultură
4:
1
Raji, Exercises 3.1:
3. Show that if a, b, m and n are integers such that m and n are positive,
n j m and a b (mod m), then a b (mod n).
If a b (mod m), then m j (a b). If also n j m, then n j (a b), that is
a b (mod n).
4. Show that if ai bi (mod m) for i = 1; 2; : : : ; n, where m P is a posi-
n
tive
Pn integer and a i , bi are integers for i = 1; 2; : : : ; n, then i=1 ai
i=1 bi (mod m).
As m divides ai bi for
P Pneach i, the
Pndistributive
Pn law shows thatP m divides
n n
Pni=1 (ai bi ). But i=1 ai i=1 b i = i=1 (ai b i ), so i=1 ai
i=1 bi (mod m).
(n 1) n
1+2+ + (n 1) =
2
To verify this fact, in case you don’t know it, let s = 1 + 2 + +
(n 2) + (n 1), and note that s = (n 1) + (n 2) + + 2 + 1.
Putting these two expressions for s one above the other, and adding, shows
that 2s = n + n + + n where there are n 1 terms in that sum. So
2s = (n 1) n.
Finally, note that
(n 1) n
2
is divisible by n exactly when n 1 is even. So the answer to question is:
for those n that are odd.
Clark, Exercises
a a mod m (mod m) .
2
What does this mean? A common use of the expression a mod m, espe-
cially in some computer languages, is to denote the remainder when you
divide a by m, according to the division algorithm. Clark introduced this
usage earlier in a part I did not assign. So a mod m = r if a = mq + r for
some q and r, where 0 r < m. Clearly if a mod m = r, then a r = mq
is divisible by m, that is, a r (mod m). So we have proved what we
wanted to prove.
15.2 Using De…nition 15.1 show that the following congruences are true:
For the …rst, 385 322 = 63 = 3 21. For the second, 385 ( 322) =
63 = 3 ( 21). For the third, 1 ( 17) = 18 = 3 6, and for the fourth,
33 0 = 33 = 3 11.
15.3 Use Theorem 15.1 to show that the congruences in Exercise 15.2 are valid.
Theorem 15.1 says that a b (mod m) if and only if a mod m = b mod m.
For the …rst congruence, note that 385 = 128 3+1 and 322 = 107 3+1, so
385 mod 3 = 1 = 322 mod 3. For the second, note that 385 = ( 129) 3+2
and 322 = ( 108) 3 + 2, so ( 385) mod 3 = 2 = ( 322) mod 3. For the
third, 1 = 0 3 + 1 and 17 = ( 6) 3 + 1, so 1 mod 3 = 1 = ( 17) mod 3,
For the fourth, 33 = 11 3 + 0 and 0 = 0 3 + 0, so 33 mod 3 = 0 = 0 mod 3.
15.4 (a) Show that a is even , a 0 (mod 2) and a is odd , a 1 (mod 2).
a is even , 2 divides a , 2 divides a 0 , a 0 (mod 2).
a is odd , 2 divides a 1 , a 1 (mod 2).
(b) Show that a is even , a mod 2 = 0 and a is odd , a mod 2 = 1.
a is even , a = 2n + 0 for some n , a mod 2 = 0.
a is odd , a = 2n + 1 for some n , a mod 2 = 1.
15.5 Show that if m > 0 and a is any integer, there is a unique integer r 2
f0; 1; 2; : : : ; m 1g such that a r (mod m).
The division algorithm tells us that there are unique integers q and r such
that a = qm + r and r 2 f0; 1; 2; : : : ; m 1g. But a = qm + r for some q
exactly when a r is divisible by m, which means that a r (mod m).
15.6 Find integers a and b such that 0 < a < 15, 0 < b < 15, and ab
0 (mod 15).
We need ab to be divisible by 15, so take a = 3 and b = 5. We could also
take a = 12 and b = 10.
3
15.7 Find integers a and b such that 1 < a < 15, 1 < b < 15, and ab
1 (mod 15).
This is a little trickier, but there are many candidates so it’s easy to …nd
one pair. For example 2 8 1, 4 4 1, 7 13 1, 11 11 1, and
14 14 1.
if and only if
a b (mod m1 m2 )