Chapter 1 .

Division Algorithm .

Let a and b be integers with a Fu

,
then there exist

unique integers of and

ns.t.b-aqtr.oc-rclal
quotient
a i.
diident .

divisor
>
remainder

b) =D d divisor
←

gcdc a. .
if is a common of a and b

and devisor less than

every common C
of a and b is or

equal to d.

I d must be
positive .

method 1 : 1 is a common divisor of a and b

thus I c- d

d also
method 2
if d < o then is a common dinar
-

:
,

of and b, and d d
a -
>
,
contradiction )

Theorem 1.81 Let a and b be nonzero

integers .

Then
gcd car b) is the smallest
positive linear
combination of a and b.

|TÉffmbndmiTiq:
 Proof :

cab ) d divides and ddcwdesb

If d =
gid a .

Thus d divides all linear combinations of a and b.

kat lb ,
k and lane integers .

L
L - -

be linear combination of auaadb

Let katilb so
any positive :

Because d divides kaelb ,

there exists
✗ integer
r .

s.tka-db-rd.TO So

positive .

Thus rat ka -1lb =D .

Now the show the smallest katlb > 0

only missing step is to

is a coommm divisor of a and b.

equals
'

katlb d then if
Let the smallest >o
,

'
and b. he 'll obtain
d is common donor of a

died

To this end wid o we just need to show

g.
-

, .

'

d divides a .
 By the division there exist
algorithm ,
unique integers
and
q r . St
.

'

① a = d Cftr ,
with oercd
'

'

Because d is a dcnear combination of a and b.

integers '
and l !
'
them exit k set . d = K' at tb

Chia -11 b)
'

① a =
qtr
r =
( 1- K' G) at c-I' b.
G)
and b.
Thus r is a Icnear combination of a

smaller linear combination

If r>0 ,
then it is a
positive
than d 's contradiction !
of a and b
'

Thus d divides a
r=o or
equivalently
-

d derides b. ☐
'

Similarly •
-
-
-
-

Euclid 's Algorith .

ads
Let a and b be
positive integers with
.
Then

there exist two lists of positive integers of .gg

, . -

qui q
,
,

and ri ,
ra .
. .
ha .
such that :

(1) A r > the > 0

> ,
> pz > - - .
.
 (2) b = A
qtr ,

a = re Cfztrz
t, =
the Gost B
;

VK -2 = Me, Get the

rice = tis feel for some integer feel .

Example :
find gcd ( 32.12 ) and write it as a den ear

combination of 32 and 12 .

32 = 12×2+8
r
b a
q , ,

12 = 8×1 + 4
ra
A r, Ge

8
=
4×2

r, th Gs

Thus gcd ( 32.12 ) =

gcdl 12.81 =
gcdc 8. 4) =p
.

( 32-12×4×1
4= 12-8×1 12 -

= 12 - 32 + 12×2

= C- 11×32 T 3×12
 and
chapter 2 .
Set Induction .
.

2. 1 Basic concepts .

The notation of a set : {✗ :

pcx , y .

odd and
{ ✗ : ✗ C- IN ,
✗ is .
✗ < 145 .

=
{ 1 ,
3, 5, 7, 9, 11 , 13J

IN is a set { ✗ :
✗ EINS = IN

31N { ✗ : ✗ =3 K ,
KEINJ , { 3✗ :
✗ c- INJ
.

Definition
-
,
The set {✗ : ✗ FXS is called the emptyset_

or null set ,
and it is denoted 0 .

{✗ ✗ Elk and ✗2<05--0

Example : :

Paradox : Is the set of all sets a set ?

Let s be the collection of all sets

ther if S is a set we have S C- S

If ✗ is an element of a set A,

we denote it by ✗ C- A .

If all elements of a set A also elements

of
are
a

set B.

we
say A is a subset of B and denotes it by

A C- B .
C B 2 A)

If It is not a subset of B. we denote it as

A 4- B

Symbolically :

A EB 4- ✗ ) I ✗ c- A ✗ C- B)

Hence ¢ is a subset of all sets .

Any set A has at least two subsets 0 .

and A
-

trivial subsets .

Proof of A c- B- .

A be thus B
Let ✗ c-
arbitrary .
-

. .
.
✗ c-

Hence A c- B
•

Theorem 1.1 For every set A.

-
f.
HE B. Bec
0 c- A ,
A EA .

.
if .

then

AEC.pro#..otfhelas--one ,

✗ C-A be
Let arbitrary .

Then AEB ✗ c- A XEB

BEIC ✗c- B ✗ EC .

Thus ✗ c- A ✗ C- C and A c- C.

•
A common show A=B
strategy to

Pant cis AEB .

Part cii BEA .

Example .
Show that ✗= Y .

✗ =
{ ✗ : ✗ ER ,
1×+11 >
5- xg

Y = { ×: ✗ GIR ,
X>
2)
=
( 2
,
+ A)

Proof :
Ci) Let ✗ C- X .

Then we have 1×+11 > 5- ✗ ,

and we want to show

✗ C- Y or ✗ >2 .

Let us use the method of contradiction

 if XEZ .

Then 1×+11 > 5-✗ 23>0

1×+112>15×5
'

⇐7 ✗2+2×+1
> ✗ -

10×+25

⇐7 12×324 ✗ 32 .
contradiction ! . . .

Cii ) Let ✗ C-
Y cue want to show ✗ EX ,

Ex cause ✗ -2 ,
✗+1 so 1×+1 / =
✗+1

1×+11 > 5- ✗ xtl > f- ✗

✗ c- ✗

⇐7 €7 ✗ 2 which is true
2x > 4 >
,
.

Here ✗ C- Y ✗ c-✗
YEX .

Combining oil and oil have

.
we ✗ C- Y, TEX ✗ =Y
.

1PowerSet\_ The of
•

set
power a set A is

the whose elements

set are subsets of A ,
and it

is denoted CA ) .

RCAF { B : BEAS .

Example :
Let ✗ =
{ { 1,2135 , 14.55 65
, .

pcx )={ 0 { 6) ,
,
{ 14.553 ,
{ { " "3b$
{ 6,1455J
,

,
 { 6. 11.2.33) , { 11.2.33.145 g)
)
{ { 1.2.33 . 14.55.6 ))
•
Theorem :

If It is a set with n elements

then
☒ (A)
"
is a set with 2 elements .

Theorem then
If A C- B.
§cA ③ (B)
•

:
) C-
.