Q.1. Let A and B be two finite sets such that n (A B) = 30, n (A U B) = 180, n (A B) =60, Find n(B).

). Solution n(A U B) = n(A B) + n(A B) + n(B A) 180 = 30 + 60 + n(B A) n(B A) = 90 Now, n(B) = n(B A) + n(A B) n(B) = 90 + 60 = 150 Q.2 Write the following sets in the roaster form. (i) A = {x | x is a positive integer less than 10 and 2x 1 is an odd number} (ii) C = {x: x2 + 7x 8 = 0, x R} Solution (i) 2x 1 is always an odd number for all positive integral values of x. In particular, 2x 1 is an odd number for x = 1, 2, ... , 9. Thus, A = {1, 2, 3, 4, 5, 6, 7, 8, 9}. (ii) x2 + 7x 8 = 0 or (x + 8) (x 1) = 0 giving x = 8 or x = 1 Thus, C = { 8, 1} Q.3 Use the properties of sets to prove that for all the sets A and B A (A B) = A B Solution A (A B) = A (AB) since A B = (A B) = A (A UB) = (A A) U (AB) = U (AB) = (AB) = A-B Q.4 Let P be the set of prime numbers and let S = {t | 2t 1 is a prime}. (by De Morgans law) (by distributive law)

Prove that S P. Solution Now the equivalent contra positive statement of x S x P is x P x S. Now, we will prove the above contra positive statement by contradiction method Let x P x is a composite number Let us now assume that x S 2x 1 = m (where m is a prime number) 2x = m + 1 Which is not true for all composite number, say for x = 4 because 24 = 16 which can not be equal to the sum of any prime number m and 1. Thus, we arrive at a contradiction x S. Thus, when x P, we arrive at x S So S P. Q.5 Two finite sets have m and n elements respectively. The total number of subsets of first set is 56 more than the total number of subsets of the second set. The values of m and n respectively are. Solution let A and B be such sets, i.e., n (A) = m, n (B) = n So n (P(A)) = 2m, n (P(B)) = 2n Thus n (P(A)) n (P(B)) = 56, i.e., 2m 2n = 56 2n (2 m n 1) = 23 7 n = 3 , 2 mn 1 = 7 m=6