1. heorem 3.3.5 Let
Cre k: 1s any integer, i.e., I =1 (mod
Then a = b(mod m) has o
solution when d does mot divide b; but if d
b
and m be in
are etactly
10n
Note. The words'exactly d
meanthat there are d distinct integers
0 Such that aa;b(mod m) for ¿ = 1.2,..,d and if u 1S an
integer sUch that =0(mod m),then u= a; (mod m) for some iwhere
1<i< d.
272tegers with m > 0 and gcd(a, r) = d.
divides b, there d
solutions.