0% found this document useful (0 votes)
44 views

Discrete Assign

The document defines several sets and relations and asks questions about their properties. It contains 9 questions. Question 1 defines sets U, X, Y, Z and asks to enumerate the intersections, unions, differences and complements of these sets. Question 2 defines universal set U, sets P and Q, and asks to draw a Venn diagram showing their relationships and list elements of an intersection. Question 3 proves De Morgan's law that the complement of a union is the intersection of complements. Question 4 proves the associative law for set intersection. The remaining questions involve additional set definitions and proofs related to properties of relations, Venn diagrams, simultaneous equations and enumerating elements of defined sets

Uploaded by

Haroon Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
44 views

Discrete Assign

The document defines several sets and relations and asks questions about their properties. It contains 9 questions. Question 1 defines sets U, X, Y, Z and asks to enumerate the intersections, unions, differences and complements of these sets. Question 2 defines universal set U, sets P and Q, and asks to draw a Venn diagram showing their relationships and list elements of an intersection. Question 3 proves De Morgan's law that the complement of a union is the intersection of complements. Question 4 proves the associative law for set intersection. The remaining questions involve additional set definitions and proofs related to properties of relations, Venn diagrams, simultaneous equations and enumerating elements of defined sets

Uploaded by

Haroon Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 16

Q1:- Let U = {1, 2, 3, …, 10}, X = {1, 2, 3, 4, 5}

Y = {y | y = 2 x, x ÎX}, Z = {z | z2 – 9 z + 14 = 0}
Enumérate:
(1)X Ç Y (2) Y È Z (3) X – Z
(4)Yc (5) Xc – Zc (6) (X – Z) c

SOLUTION:

Sets:-
U = {1, 2, 3, …, 10}
X = {1, 2, 3, 4, 5}
Y = {y  U| y = 2 x, x X}
= {2, 4, 6, 8, 10}
Z = {z  U | Z2 – 9 z + 14 = 0}
= {2, 7}
(1) XÇY
Solution:-
X  Y = {1, 2, 3, 4, 5}  {2, 4, 6, 8, 10}
= {2, 4}

(2) YÈZ

Solution:-
Y  Z = {2, 4, 6, 8, 10}  {2, 7}
= {2, 4, 6, 7, 8, 10}
(3) X–Z

Solution:-
X – Z = {1, 2, 3, 4, 5} – {2, 7}
= {1, 3, 4, 5}
(4) Yc
Solution:-
Yc = U – Y = {1, 2, 3, …, 10} – {2, 4, 6, 8, 10}
= {1, 3, 5, 7, 9}
(5) X' – Z'
Solution:-
X' – Z' = {6, 7, 8, 9, 10} – {1, 3, 4, 5, 6, 8, 9, 10}
= {7}
(6) (X – Z)'
Solution:-
(X – Z)' = U – (X – Z)
= {1, 2, 3, …, 10} – {1, 3, 4, 5}
= {2, 6, 7, 8, 9, 10}

Q2:- Given the following universal set U and its two subsets P and Q, where

U = {x | x Î Z,0 £ x £ 10}
P = {x | x is a prime number}
Q = {x | x2 < 70}
(i) Draw a Venn diagram for the above
(ii) List the elements in Pc Ç Q

Solution:-
Sets Tabular Form:-
U = {x | x Z, 0  x  10}
So we have
U= {0, 1, 2, 3, …, 10}
P = {x | x is a prime number}
P = {2, 3, 5, 7}
Q = {x | X2 < 70}
Q= {0, 1, 2, 3, 4, 5, 6, 7, 8}
(1)

0,1,4,6,8 P

0,1,4,6,8 Q

9,10

(2) Pc Ç Q
Pc = U – P = {0, 1, 2, 3, …, 10} - {2, 3, 5, 7}
= {0, 1, 4, 6, 8, 9, 10}
now
Pc  Q = {0, 1, 4, 6, 8, 9, 10}  {0, 1, 2, 3, 4, 5, 6, 7, 8}
= {0, 1, 4, 6, 8}

Q3:- Prove the DeMorgan’s Law: (A È B)c = Ac Ç Bc.


Proof:-
Let x (AB) c
 x  AB (definition of complement)
x A and x  B (DeMorgan’s Law of Logic)
 x Ac and x  Bc (definition of complement)
 x Ac  Bc (definition of intersection)
But x is an arbitrary element of (AB) c so we have proved that
 (A  B) c  Ac  Bc………(1)
Conversely
let y  Ac  Bc
 y Ac and y  Bc (definition of intersection)
 y A and y  B (definition of complement)
 y A  B (DeMorgan’s Law of Logic)
 y (A  B) c (definition of complement)
But y is an arbitrary element of Ac  Bc
 Ac  Bc  (A  B) c………………(2)
From (1) and (2) we have
(A  B) c = Ac  Bc
Which is the Demorgan`s Law
Hence proved
Q4:- Prove the associative law: A Ç (B Ç C) = (A Ç B) Ç C.
Proof:-
Consider x A  (B  C)
 x A and x  B  C (definition of intersection)
 x A and x B and x  C (definition of intersection)
 x A  B and x C (definition of intersection)
 x (A  B)  C (definition of intersection)
But x is an arbitrary element of A  (B  C)
 A  (B  C)  (A  B)  C……(1)
Conversely,
let y (A  B)  C
 y  A  B and y C (definition of intersection)
 y  A and y  B and y  C (definition of intersection)
 y  A and y  B  C (definition of intersection)
 y A  (B  C) (definition of intersection)
But y is an arbitrary element of (A  B)  C
(A  B)  C  A  (B  C)……..(2)
From (1) & (2), we conclude that
A  (B  C) = (A  B)  C (proved)

Q5:- Prove the following using Membership Table:


(i) A – (A – B) = A Ç B
(ii) (A Ç B)c = A c È B c
(iii) A – B = A Ç Bc
Solution:-
(i) A - (A – B) = A  B.
LET A={1,2}
B={2,3}

Membership table:-
(a)
U
A B

1 2 3

4
A-B={1}

(b)

A B U

1 2 3

4
A-(A-B)={2} which is shaded

(c)

A B U
1 2 3

4
A  B.={2} which is shaded

(ii) (A Ç B)c = A c È B c

LET A={1,2}
B={2,3}

Membership table:-
Part (a):-
U
A B

1 2 3
4
AB

Part (b) U
A B

1 2 3

4
(A  B)c
Part(c):-

A B U

1 2 3
4
A compliment is shaded

Part (d):-

A B U

1 2 3 B compliment is shaded

Part (e):-

A B U

1 2 3
4
A c È B c is shaded
(iii) A – B = A Ç Bc

Part (a):-

A B U

1 2 3

A–B
Part(b):-

A B U

1 2 3
4

Bc is shaded
Part(c):-
U
A B
1 2 3

4
A Ç B c is shaded

Q6:- In a school, 100 students have access to three software packages,


A, B and C
28 did not use any software
8 used only packages A
26 used only packages B
7 used only packages C
10 used all three packages
13 used both A and B
(i) Draw a Venn diagram with all sets enumerated as for as possible.
Label the two subsets which cannot be enumerated as x and y, in
any order.
(ii) If twice as many students used package B as package A, write
down a pair of simultaneous equations in x and y.
(iii) Solve these equations to find x and y.
(iv) How many students used package C?
Solution:-
(i):-
Venn Diagram:-
A B
3
8 26
10
x y

7
C

(ii):-
Given
• # students using package B = 2 (# students using package A)
• Now the number of students which used package B and A are clear from the
diagrams given below. So we have the following equation
 
 3 + 10 + 26 + y = 2 (8 + 3 + 10 + x)
 39 + y = 42 + 2x
or
y = 2x + 3 …………(1)
Also, total number of students = 100.
Hence,
8 + 3 + 26 + 10 + 7 + 28 + x + y = 100
Or
82 + x + y = 100
Or
x + y = 18 …………(2)

(iii):-
y = 2x + 3 ………………(1)
x + y = 18 ………………(2)
Using (1) in (2), we get,
x + (2 x + 3) =18
or
3x + 3=18
or
3x=15
 x=5
Put x=5 in (2)
5 + y = 18
Y = 18 – 5
Y = 13
Consequently y= 13

(iv):-
No. of students using package C
= x + y + 10 + 7
= 5 + 13 + 10 + 7
= 35

Q7:- Let A = {2, 4} and B = {6, 8, 10} and define relations R and S from A
to B as follows:
for all (x,y) ÎA ´ B, xRyÛx|y
for all (x,y) ÎA ´ B, xSyÛy–4=x
State explicitly which ordered pairs are in A ´ B, R, S, RÈS and RÇS.

Solution:-
A  B = {(2,6), (2,8), (2,10), (4,6), (4,8), (4,10)}
R = {(2,6), (2,8), (2,10), (4,8)}
S = {(2,6), (4,8)}
SR
R  S = {(2,6), (2,8), (2,10), (4,8)} = R
R  S = {(2,6), (4,8)} = S

Q8:- Let A = {0, 1, 2} and


R = {(0,2), (1,1), (2,0)} be a relation on A.
1. Is R reflexive? Symmetric? Transitive?
2. Which ordered pairs are needed in R to make it a reflexive and
transitive relation.
Solution:-

i. R is not reflexive, since 0  A but (0, 0) R and also 2  A but (2, 2)


R.
R is clearly symmetric.
R is not transitive, since (0, 2) & (2, 0)  R but (0, 0) R.
ii. For R to be reflexive, it must contain ordered pairs (0,0) and (2,2).
For R to be transitive,
we note (0,2) and (2,0)  R but (0,0) R.
Also (2,0) and (0,2) R but (2,2)R.
Hence (0,0) and (2,2). Are needed in R to make it a transitive relation.
Q9:- Let A = {1, 2, 3, 4} and define relations R1, R2 and R3 on A by the
directed graphs: also show which relationship are transitive.
Consider this R1, R2 & R3 as a relationship

R1 = {(1, 1), (1, 2), (1, 3), (2, 3)}


R2 = {(1, 2), (1, 4), (2, 3), (3, 4)}
R3 = {(2, 1), (2, 4), (2, 3), (3,4)}

Answer:-
 Then R1 is transitive because (1, 1), (1, 2) are in R1 then to be transitive
relation (1,2) must be there and it belongs to R1 Similarly for other order
pairs. And (1, 2), (2, 3) are in R1 then to be transitive relation (1,3) must be
there and it belongs to R1
 R2 is not transitive since (1,2) and (2,3)  R2 but (1,3)  R2.
 R3 is transitive since (2,3) and (3,4)  R3 and also (2,4)  R3 .

Q10:- Let A = {4, 5, 6} and B = {5, 6, 7} and define relations R,


S, and T from A to B as follows:
For all (x, y) ∈ A × B,(x, y) ∈ R means that x ≥ y.
(x, y) ∈ S means that x – y is an integer.
2
T = {(4, 7), (6, 5), (6, 7)}. Draw arrow diagrams for R, S, and T.
Definition:-
X is a element of Y.
Notation: x ∈ Y
Cartesian product of A and B: A x B ={(a,b)|a ∈ A and b ∈ B}
A function F from A to B satisfied the following two properties:
 For every element x ∈ A,there exist an element belong to y∈Bsuch that
(x,y) ∈ F
 If (x,y) ∈ F and (x,z) ∈ F, then y=z( thus an element can not have two
different images)
Solution:-

A = {4, 5, 6}
B = {5, 6, 7}
R = {(x, y) ∈ A x B|x >= y}
S = {(x, y) ∈ A x B| (x – y)/2 is an integer}
T = {(4, 7), (6, 5), (6, 7)}
Arrow diagram for R:-
R = {(x, y) ∈ A x B|x >= y} = {(5, 5), (6, 5), (6, 6)}
 Draw two ellipses one is labeled as A and other is labeled as B.
 Per element x in A/B,A point is placed the corresponding ellipsre wit label x
 We draw an arrow from element x to y if (x,y) ∈ R.

A Relation R B

4 5
5 6
6 7

Arrow diagram for S:-

S = {(x, y) ∈ A x B| (x – y)/2 is an integer} = {(4, 6), (5, 5), (5, 7),(6,6)}

 Draw two ellipses one is labeled as A and other is labeled as B.

 Per element x in A/B,A point is placed the corresponding ellipse wit label x

 We draw an arrow from element x to y if (x,y) ∈ S.

c
A Relation S B

4 5
5 6
6 7
Arrow diagram for T:-
T = {(4, 7), (6, 5), (6, 7)}
 Draw two ellipses one is labeled as A and other is labeled as B.
 Per element x in A/B,A point is placed the corresponding ellipse wit label x
 We draw an arrow from element x to y if (x,y) ∈ T.

A B
Relation T

4 5
5 6
6 7

You might also like