theorem:(Bezout's If and b positive

identity). a are

such that
integers, then there exist and I

ged(a,b) ak
=
b).
+

Proof: integers. With integers

Assume that
a, b are
positive
by differentvalues. Let
have
xandy, expression
the ax+

value
can
ax+ by can be equal
that
to.
a be the smallest positive
R and be
Let the X
andy give the
values that
is
that d ak bl.
of d,
+
minimum value =

We find
need to some K, 1 S.t.
gcd(a,b) ak+b). =

d ak b)
=
+ is the
equation needed,
WNTSd=
but gcd(a,b).
common divisor of a
and b)
Part 1: Id as a

divisors, d is divicor
By defin of common a common

of a and b if dla and alb.

a dgtr
= with or d

And so

dg
=
r a -

a
= -
(ak b))g
+

a
=
akg blg
- -

=> a(1 kq) b( (g)

- +
-

Since (1-kg) and (-1g) are both integers, this serves

as another expression of the form ax+ by. But since d

is the smallest-positive number expressed as such, I can

also be written as such, and 0 crcd, then r 0.

=

dgtr can simply be a dq, w/c by

=

And so a =

defin of divisibilitymeans thatdia. Similay, itcan

be shown that
all. And thus d is a common divisor
b.
of a and
 Part 2: Id is the god Suppose d' is another common

divisor of a dId'. Since d'la and

and b. WNTs that
a d'm
and b d'n for some integers
d'lb, then
=
=

m and n. Then ak bL
d= +

d'mk + d'nL
->

=> d'(mk n)) +

And so d d'(mk +nt)

= where (mK+n)) is an integer.
= which implies that
Since d is positive and d'
mk n),
+

all other divisor

d'Id. And thus d is greatestof
the

of a and b.

d ak b)
And thusgcd(a,b)
+
= =

#I
HW
Prove that (ma, mb) m.gcd(a,b)
=

God

Modular Arithmetic
integers a, r, and m say that
we a
Definition: For

is congruent
toa modulo m, write as

ar
=

(modm] if m1(a-r).

18 =
4 (mod 7) 3 3(mod (3)
=

0 _r<d
3 2 (mod5)
I (mod 3)
=
-

13 =

18 7,2 4 ...dg
= +

+r

13 3.4
=
+
1 38 = 14 (mod24)
7((18 4) -

38 2
=

(mod12)
...

3)(13 1) -
Proposition: (Modular Arithmetic Properties)
a,b, c, d, and
Assume that m are integers,
a b(mod m)
=
and c = d(mod m).

then, b d(mod m)
i) a+ c
= +

ii) a c - b d(modm)
=
-

b.d(mod m).
iii) a.c
=

Proof:(part i)
Assume a =b (mod m) and C d(mod m)
= .
By
that
defin of modular congruence, we say
m)(a b) -and mi(c d). -

then by the
defin divisibility
of
b mk and c-d
mL
=

a -
=

K adding two,
these
for some integers and 1.
By
(a b) (c d)
- + -
mk
=

mL
+

Regrouping, (a + c) -
d) m(k 1)
(b +
=
+

defin of divisibility
Since K+L is an integer, by
then

m([(a x) + - (b d)]
+

thus by defin of modular congruence

b d(mod m)
=

ac +
+

(i) instead of modulo

HW#2: prove using dgtr
(ii)
#3:prove

#4: prove (iii)