HOME WORK

2 1 .
Sets

a AVB = 2 1 1 2 ,
3 , 4 , 59 lAVB) = 5

b .
AlB =
g23 1AnBl = 1

A B =
G 1 3
49 IA -Bl 3
-

c . , ,
=

d . A AB =
9/3 , 4
, 53 /AAB1 = 4

e .
A x B = & (1 ,
2)
,
(1 , 5) ,
(2 , 2) ,
(2 , 5) ,
(3 , 2) ,
(3 , 5) , (4,2) , (4 , 5) 3
(A X
B1 = S

f . 2
3
=
90, 823 , 959 , 31,599 129 = 4

& 20 =
0 is False because 20 is not .
empty
It is actually the element &

③
2033
22203 = 230 ,

=
20 , 203132035 , 30 30333 ,

=
6ES16653 : S355s 663 ,
35gggg .

④
I

234
57
6
 a An BNC 3 (ADB) C 3 5 7
g
: : 1
, , ,
.
.

b AVBUC : 1
,
2 , 3, 4 , 5, 67 h (AnB) V (ANC) : 2
,
3 ,
3
,
.
.

C .
A R( BUC) : 2
,
3 ,
6 i . A D(BAC) : 1 ,
3
,
5
,
7

d .
A -

(BMC) : 2 , 56
, j. A b (DRC) : 2
,
4 , 5, 6

e . (AVB) -

C : 5, 6,7

8 .
A -
/B -

C) : 2 ,
3
,
5

⑤ An(BUC) =
(AnB) UCANC)

CADB) DC = AD /DDC

⑥ ADB = BDA = 5 7
,

=> commutative

CADB)DC = AD (BAC) = 1 , $ , 517

=> associative

A DA = (A A)-
v (A -

A) =
000 = 0
2 2
. Relations

a . Add (1 ,
1) ,
(2 ,
2)
,
(3 , 3) , (414)

b . Add (2 , 1)
,
(3 , 2) s (4,3)

c . Add (13) ,
(14) ,
(2 , 47

d .
Add all pairs in AXA that not in R
 ①
a . Add (1 , 1) , (2 , 2) ,
(3 , 3)

b .
Add (2 , 1) ,
(3
,
2) , (1 ,
3)
0 Add (1 , 1) ,
(1 , 3) < (2 , 1) (2 2) , , (3 , 27 (3 , 3)
, ,

.
d Add (1 ,
1) , (113) , (21) < (2,2) , (3 , 2)
,
Cs , 3)

⑨
2 (1 , 1) S

Let b
, c be element A
a
, any of

We have a = a
=> a = a
Creglexivity
a = b -
> a - b and b EaE) b = a (symmetry)
a = b and b = c >
-
a 1 b and a CE) a = c (transitivity

.
2 3 Functions .

Function :
fi=& (2 , 1) 15 , 219 . There are 12
functions
,

(4x3)

Function :
g
:=
&(1 , 2) ,
(2 ,
2) ,
(3 , 5)
,
<4 ,
5) G maps A onto B .
There are

16-2 14
=
functions

.4
2 strings n

a . Ix / 30 ( Prove by induction

Base case : x = E = ) (x :
12) = 0 Thus ( = 00

*
Inductive case : X # E .
Let ne

definition length (x1 (u) 130 100 (u20)

by of + 1
= + =

=> (130 for all strings x

b
. (y)
(xy) =
(X) + (Preve
by induction (

Base case :
y
= 2 => ly1 = 0 by dey .
# X
, (xy) =
(x2) (x)=
= (x1 + 0

= (x| + (y)
 Inductive case :
y FE .
Let w &* be the pregix of y and a t E be

the last symbol of y

we have
(xu) (x1 + (n) (inductive hypothesis
S
=

I
By day of length :
(xy) =
/xual =
(xu) + 1

| xy| = (xy) + 1 = (x) + (4) + 1 =

|x | +y)

=> Ixy1 =
1x1Hy) for all strings X and
y

C
If Xz =
yz then X
.

,
=
y

Base case : z = E . We have Xz =

yz
)
=
y =
Sy =
Xy = yz = y =
y

*
Inductive case : 2 FE .
Let n + and at E

we have > x =
y (hypothesis
xu yu
= =

Xz = yz
Since z Xua
= wa
=> =
yua
Xu
=> =
yo
=
)x =
y
d then
.

Ig xy = X z ,
y
= z

base case :

y
: .
E We have
xy = x z =
) (y) 12/
=

since
y = & we have 12) ly) = = 0

= z = E

=
) y = z

*
Inductive Let and
case :
y E .

uEz a E

We have yu = Xv implies n = v

Xy = Xz

Now let W be the prefix of z and b be the last symbol of z

so that z = wb .

Xrb
=> Xua =

= Xu = Xv implies u = V (inductive hypothesis)

=> g = na = vb = z
a .

R
Base case : x =
E .
X : = E

Inductive case X :
* 2 .
X = a
(y))

b
+
base case : X= E .
Then (xP = 1 ) =
(2) =
(x)

Inductive case :
X E
We have

(xR1 = 1CnalY' = lauk1 =

(a) + 1nR) = /(a) +
1nk) =
(c) +
1

+
luR) =
It luR/

=> (x41 = 1 + (u) =

IX) Chypothesis]