KEY FOR THE ASSIGNMENT

1. a. A  B  A '   A  B

Proof.
A  B  A '    A  B    A  A '  by Distributive Property of  over 
 A  B  U by Complement Law
 A B by Identity Property

b. A  B   A ' B '  

Proof.
 A  B    A ' B '   A  B   A '  A  B   B ' by Distributive Property of  over 
  B  A   A '     A  B   B '  by Commutative Property of 
 B   A  A '     A  B  B '   by Associative Property of 
 B      A    by Complement Law
  by Zero Property
 by Identity Property

c. A  B   A ' B '  A  B '  A ' B 

Proof.
 A  B    A ' B '   A  B   A '  A  B   B ' by Distributive Property of  over 
   A  A '   B  A '      A  B '   B  B '   by Distributive Property of  over 
    B  A '      A  B '     by Complement Law
 B  A '    A  B '  by Identity Property
  A  B '   B  A '  by Commutative Property of 
  A  B '    A ' B  by Commutative Property of 
2. a.
Let U be the set of the 100 respondents (students) in the survey.
A be the set of students who preferred MATH 1
B be the set of students who preferred MATH 2
C be the set of students who preferred NASC 3

A U

18 37

12 2
8
8 2 13

B C

b. 20 students preferred MATH 1 but not MATH 2.

c. 20 students preferred MATH 2 but not NASC 3.

d. 13 students preferred NASC 3 only.

e. 37 students did not prefer any of the three courses.

3. We know that if we have two sets, A1 and A2 ,

n  A1  A2   n  A1   n  A2   n  A1  A2 
2
  n  Ai  
i 1
 n  Ai  Aj 
1i  j  2

And if we have three sets, A1 , A2 , and A3 ,

n  A1  A2  A3   n  A1   n  A2   n  A3   n  A1  A2   n  A1  A3   n  A2  A3   n  A1  A2  A3 
3 .
  n  Ai  
i 1
 n  Ai  Aj   i 
1   3
i j j m 1   3
n  Ai  Aj  Am 

We can generalize the formula for the cardinality of the union of k sets, k  4 , into

k
n  A1  A2  ...  Ak   n  Ai    n Ai  Aj   i  n  Ai  Aj  Am   ...   1 n A1  A2  ...  Ak 
k 1

i 1 1  
i j k j m k 1   

k
where 
i
n  Ai 
1
is the sum of the cardinalities of all the k sets,

k k  1
 n Ai  Aj 
1  
i j k
is the sum of the cardinalities of all the
2
intersections of any pair of distinct sets,

 n  Ai  Aj  Am  is the sum of the cardinalities of all the

1i  j m k

k k  1k  2 
intersections of any group of three
6
distinct sets, and

n  A1  A2  ...  Ak  is the cardinality of the intersection of all the k sets.

4. A  B  C  A C   B C 

Proof.

If x   A  B  C , x  u ,v  where u  A  B and v C .
u  A  B means that u  A and u B .

Since u  A and v C , we can say that x  u ,v  is an element of A C .

Moreover, since u B and v C , x  u ,v  is also an element of B C .

Hence, x   A C   B C  .

On the other hand, if x   A C   B C  , we can say that x is an element of both A C and B C .

By saying that x  A C , we mean that x  u ,v  where u  A and v C .

And since x  u ,v  is also an element of B C , u must also be an element of B .

Thus, it follows that u  A  B ; and therefore, x  u ,v  is also an element of  A  B  C .

So now, by the definition of equal sets, we can conclude that  A  B  C  A C   B C  .