SETS, RELATIONS & FUNCTIONS

SETS, RELATIONS & FUNCTIONS

SETS

1. SET 2.2 Set-Builder Form

A set is a collection of well-defined and well distinguished In this form, we write a variable (say x) representing any
objects of our perception or thought. member of the set followed by a property satisfied by each
member of the set.
1.1 Notations
For example, the set A of all prime numbers less than 10 in
The sets are usually denoted by capital letters A, B, C, etc. the set-builder form is written as

tr
and the members or elements of the set are denoted by lower- A = {x | x is a prime number less that 10}
case letters a, b, c, etc. If x is a member of the set A, we write
x  A (read as 'x belongs to A') and if x is not a member of the
c v
The symbol '|' stands for the words 'such that'. Sometimes,
we use the symbol ':' in place of the symbol '|'.
set A, we write x  A (read as 'x does not belong to A,). If x
and y both belong to A, we write x, y  A. 3. TYPES OF SETS ac
2. REPRESENTATION OF A SET - @
am
3.1 Empty Set or Null Set
Usually, sets are represented in the following two ways :
g r
A set which has no element is called the null set or empty
(i) Roster form or Tabular form
le set. It is denoted by the symbol I .

Te
(ii) Set Builder form or Rule Method

sit
2.1 Roster Form For example, each of the following is a null set :

Vi
(a) The set of all real numbers whose square is –1.
In this form, we list all the member of the set within braces
(curly brackets) and separate these by commas. For example, (b) The set of all rational numbers whose square is 2.

re
the set A of all odd natural numbers less that 10 in the Roster (c) The set of all those integers that are both even and odd.
form is written as :
o A set consisting of atleast one element is called a

rM
A = {1, 3, 5, 7, 9}
non-empty set.

Fo 3.2 Singleton Set

A set having only one element is called singleton set.

For example, {0} is a singleton set, whose only member is 0.
(i) In roster form, every element of the set is listed
only once. 3.3 Finite and Infinite Set
(ii) The order in which the elements are listed is
A set which has finite number of elements is called a finite
immaterial.
set. Otherwise, it is called an infinite set.
For example, each of the following sets denotes
For example, the set of all days in a week is a finite set
the same set {1, 2, 3}, {3, 2, 1}, {1, 3, 2}
whereas the set of all integers, denoted by
{............ -2, -1, 0, 1, 2,...} or {x | x is an integer}, is an infinite set.
An empty set I which has no element in a finite set A is
called empty of void or null set.
 SETS, RELATIONS & FUNCTIONS

3.4 Cardinal Number 4. OPERATIONS ON SETS

The number of elements in finite set is represented by n(A), 4.1 Union of Two Sets
known as Cardinal number.

3.5 Equal Sets The union of two sets A and B, written as A ‰ B (read as 'A
union B'), is the set consisting of all the elements which are
Two sets A and B are said to be equals, written as A = B, if
every element of A is in B and every element of B is in A. either in A or in B or in both Thus,

3.6 Equivalent Sets A ‰ B = {x : x  A or x  B}

Clearly, x  A ‰ B Ÿ x  A or x  B, and
Two finite sets A and B are said to be equivalent, if n
(A) = n (B). Clearly, equal sets are equivalent but equivalent x  A ‰ B Ÿ x  A and x  B.
sets need not be equal.
For example, the sets A = { 4, 5, 3, 2} and B = {1, 6, 8, 9} are
equivalent but are not equal.

3.7 Subset
v tr
c
ac
Let A and B be two sets. If every elements of A is an element
of B, then A is called a subset of B and we write A  B or
B Š A (read as 'A is contained in B' or B contains A'). B is
called superset of A. - @
r am
For example, if A = {a, b, c, d} and B = {c, d, e, f}, then

le g
A ‰ B = {a, b, c, d, e, f}

T e 4.2 Intersection of Two sets

(i) Every set is a subset and a superset itself.
si t
(ii) If A is not a subset of B, we write A ΠB.
V i The intersection of two sets A and B, written as A ˆ B
(read as ‘A’ intersection ‘B’) is the set consisting of all the
(iii)
re
The empty set is the subset of every set. common elements of A and B. Thus,
(iv) o
If A is a set with n(A) = m, then the number of A ˆ B = {x : x  A and x  B}

r M
subsets of A are 2m and the number of proper
subsets of A are 2m -1. Clearly, x  A ˆ B Ÿ x  A and x  B, and

Fo
For example, let A = {3, 4}, then the subsets of A
are I , {3}, {4}. {3, 4}. Here, n(A) = 2 and number
x  A ˆ B Ÿ x  A or x  B.

of subsets of A = 22 = 4. Also, {3}  {3,4}and {2,3}

Π{3, 4}

3.8 Power Set

The set of all subsets of a given set A is called the power set
of A and is denoted by P(A).
For example, if A = {1, 2, 3}, then

P(A) = { I , {1}, {2}, {3}, {1,2} {1, 3}, {2, 3}, {1, 2, 3}}
For example, if A = {a, b, c, d) and B = {c, d, e, f}, then
Clearly, if A has n elements, then its power set P (A) contains A ˆ B = {c, d}.
exactly 2n elements.
SETS, RELATIONS & FUNCTIONS

4.3 Disjoint Sets 4.6 Complement of a Set

Two sets A and B are said to be disjoint, if A ˆ B = I , i.e. A If U is a universal set and A is a subset of U, then the

and B have no element in common. complement of A is the set which contains those elements
of U, which are not contained in A and is denoted by
A'or Ac. Thus,

Ac = {x : x  U and x  A}

For example, if U = {1,2,3,4 ...} and A {2,4,6,8,...}, then, Ac =

{1,3,5,7, ...}

Important Results
For example, if A = {1, 3, 5} and B = {2, 4, 6},
then A ˆ B = I , so A and B are disjoint sets.
a) Uc = I b) I c = U c) A ‰ Ac = U
4.4 Difference of Two Sets
d) A ˆ Ac = I
v tr
If A and B are two sets, then their difference A - B is defined
c
ac
as : 5. ALGEBRA OF SETS
A - B = {x : x  A and x  B}.
Similarly, B - A = {x : x  B and x  A }.
1.
- @
For any set A , we have

am
a) A ‰ A = A b) A ˆ A = A

2.
g r
For any set A, we have

lec) A ‰ I = A d) A ˆ I = I

Te
sit
e) A ‰ U = U f) A ˆ U = A

Vi
3. For any two sets A and B, we have
g) A ‰ B = B ‰ A h) A ˆ B = B ˆ A

re
For example, if A = {1, 2, 3, 4, 5} and B = {1, 3, 5, 7, 9} then A
- B = {2, 4} and B - A = {7, 9}. o 4. For any three sets A, B and C, we have

rM
i) A ‰ (B ‰ C) = (A ‰ B) ‰ C
Important Results

Fo
j) A ˆ (B ˆ C) = (A ˆ B) ˆ C
(a) A- B z B –A
5. For any three sets A, B and C, we have
(b) The sets A - B , B - A and A ˆ B are disjoint sets
k) A ‰ (B ˆ C) = (A ‰ B) ˆ (A ‰ C)
(c) A - B Ž A and B - A Ž B
l) A ˆ (B ‰ C) = (A ˆ B) ‰ (A ˆ C)
(d) A - I = A and A - A = I
6. If A is any set, we have (Ac)c = A.
4.5 Symmetric Difference of Two Sets 7. Demorgan's Laws For any three sets A, B and C, we have
The symmetric difference of two sets A and B , denoted by m) (A ‰ B)c = Ac ˆ Bc
A ' B, is defined as
n) (A ˆ B)c = Ac ‰ Bc
A ' B = (A - B) ‰ (B - A).
o) A - (B ‰ C) = (A - B) ˆ ( A - C)
For example, if A = {1,2,3,4,5} and B = {1, 3,5,7,9} then
p) A - (B ˆ C) = (A - B) ‰ (A - C)
A ' B = (A - B) ‰ (B - A) = {2,4} ‰ {7,9} = {2,4,7,9}.
 SETS, RELATIONS & FUNCTIONS

Important Results on Operations on Sets Example – 3

(i) A Ž A ‰ B, B Ž A ‰ B, A ˆ B Ž A, A ˆ B Ž B Write the set {x : x is a positive integer and x2 < 30} in the
roster form.
(ii) A - B = A ˆ Bc (iii) (A - B) ‰ B = A ‰ B

(iv) (A - B) ˆ B = I (v) A Ž B œ Bc Ž Ac Sol. The squares of positive integers whose squares are less
than 30 are : 1, 2, 3, 4, 5.
(vi) A - B = Bc - Ac (vii) (A ‰ B) ˆ (A ‰ Bc) = A Hence the given set, in roster form, is {1, 2, 3, 4, 5}.
(viii) A ‰ B = (A - B) ‰ (B - A) ‰ (A ˆ B)
Example – 4
(ix) A - (A - B) = A ˆ B
Write the set {0, 1, 4, 9, 16, .......} in set builder form.
(x)A - B = B -A œ A= B (xi)A ‰ B =A ˆ B œ A= B

(xii) A ˆ (B ' C) = (A ˆ B) ' (A ˆ C) Sol. The elements of the given set are squares of integers :

0, r 1, r 2, r 3, r 4, .......
v tr
Example – 1
c
Write the set of all positive integers whose cube is odd. ac
Hence the given set, in set builder form, is {x2 : xZ}.

Example – 5
- @
am
Sol. The elements of the required set are not even.
State which of the following sets are finite and which are
[' Cube of an even integer is also an even integer]
g r
infinite
Moreover, the cube of a positive odd integer is a positive
e le (i) A = {x : x  N and x2 – 3x + 2 = 0}
odd integer.
t T (ii) B = {x : x  N and x2 = 9}
Ÿ
si
The elements of the required set are all positive odd integers.
i (iii) C = {x : x  N and x is even}

e V
Hence, the required set, in the set builder form, is :
(iv) D = {x : x  N and 2x – 3 = 0}.

2k  1 : k t 0, k  Z .
o r Sol. (i) A = {1, 2}.

Example – 2
r M [' x2 – 3x + 2 = 0 Ÿ (x – 1) (x – 2) = 0 Ÿ x = 1, 2]

Fo
­1 2 3 4 5 6 7½ (ii)
Hence A is finite.

B = {3}.
Write the set ® , , , , , , ¾ in the set
¯2 3 4 5 6 7 8¿
[' x2 = 9 Ÿ x = + 3. But 3  N]
builder form. Hence B is finite.

(iii) C = {2, 4, 6, ......}

Sol. In each element of the given set the denominator is one
more than the numerator. Hence C is infinite.

Also the numerators are from 1 to 7.

ª 3 º
Hence the set builder form of the given set is : (iv) D = I. «' 2x  3 0 Ÿ x  N»
¬ 2 ¼
x:x n / n  1, n  N and 1 d n d 7 .
Hence D is finite.
 SETS, RELATIONS & FUNCTIONS

Example – 6 Example – 8

Which of the following are empty (null) sets ? Are the following pairs of sets equal ? Give reasons.
(i) Set of odd natural numbers divisible by 2 (i) A = {1, 2}, B = {x : x is a solution of x2 + 3x + 2 = 0}
(ii) {x : 3 < x < 4, x  N}
(ii) A = {x : x is a letter in the word FOLLOW},
(iii) {x : x2 = 25 and x is an odd integer}
B = {y : y is a letter in the word WOLF}.
(iv) [x : x2 – 2 = 0 and x is rational]
(v) {x : x is common point of any two parallel lines}.
Sol. (i) A = {1, 2}, B = {–2, –1}

Sol. (i) Since there is no odd natural number, which is divisible [' x2 + 3x + 2 = 0 Ÿ(x + 2) (x + 1) = 0 Ÿx = –2, —1]
by 2.
Clearly A z B.
? it is an empty set.
(ii) A = {F, O, L, L, O, W} = {F, O, L, W}
(ii) Since there is no natural number between 3 and 4.
? it is an empty set. B = {W, O, L, F} = {F, O, L, W}.

(iii) Now x2 = 25 Ÿ x = + 5, both are odd. Clearly A = B.

v tr
c
ac
? The set {– 5, 5} is non-emptry.
Example – 9
(iv) Since there is no rational number whose square is 2,
? the given set is an empty set.
- @
Let A = {1, 2, 3, 4, 5}, B = {3, 4, 5, 6, 7}, C = {6, 7, 8, 9} and
(v) Since any two parallel lines have no common point,
? the given set is an empty set. r am
D = {7, 8, 9, 10}. Find :

le g(a) (i) A ‰ B (ii) B ‰ D

Te
Example – 7 (iii) A ‰ B ‰ C (iv) B ‰ C ‰ D

giving reasons :
si t
Find the pairs of equal sets from the following sets, if any, (b) (i) A ˆ B (ii) B ˆ D (iii) A ˆ B ˆ C.

A = {0}, B = {x : x > 15 and x < 5},

V i
e Sol. (a) (i) A ‰ B = {1, 2, 3, 4, 5} ‰ {3, 4, 5, 6, 7}

or
C = {x : x – 5 = 0}, D = {x : x2 = 25},
E = {x : x is a positive integral root of the equation = {1, 2, 3, 4, 5, 6, 7}.
x2 – 2x – 15 = 0}.
r M (ii) B ‰ D = {3, 4, 5, 6, 7} ‰ {7, 8, 9, 10}
Sol. Here we have,
A = {0} Fo (iii)
= {3, 4, 5, 6, 7, 8, 9, 10}.

A ‰ B ‰ C = {1, 2, 3, 4, 5} ‰ {3, 4, 5, 6, 7} ‰ {6, 7, 8, 9}.

B=I
= {1, 2, 3, 4, 5, 6, 7} ‰ {6, 7, 8, 9} = {1, 2, 3, 4, 5, 6, 7, 8, 9}.
[' There is no number, which is greater than 15 and less
than 5] (iv) B ‰ C ‰ D = {3, 4, 5, 6, 7} ‰ {6, 7, 8, 9} ‰ {7, 8, 9, 10}.
C = {5} [' x – 5 = 0 Ÿ x = 5]
= {3, 4, 5, 6, 7, 8, 9} ‰ {7, 8, 9, 10} = {3, 4, 5, 6, 7, 8, 9, 10}.
D = {– 5, 5} [' x2 = 25 Ÿ x = + 5]
(b) (i) A ˆ B = {1, 2, 3, 4, 5} ˆ {3, 4, 5, 6, 7} = {3, 4, 5}.
and E = {5}.
[' x2 – 2x – 15 = 0 Ÿ (x – 5) (x + 3) = 0 Ÿ x = 5, – 3. Out of (ii) B ˆ D = {3, 4, 5, 6, 7} ˆ {7, 8, 9, 10} = {7}.
these two,
(iii) A ˆ B ˆ C = {1, 2, 3, 4, 5} ˆ {3, 4, 5, 6, 7} ˆ {6, 7, 8, 9} = {3,
5 is positive integral]
4, 5} ˆ {6, 7, 8, 9} = I.
Clearly C = E.
 SETS, RELATIONS & FUNCTIONS

Example – 10 Example – 13

If A1 = {2, 3, 4, 5}, A2 = {3, 4, 5, 6}, A3 = {4, 5, 6, 7}, find Let A = {1, 2, 3, 4, 5, 6}, B = {3, 4, 5, 6, 7, 8}. Find
(A – B) ‰ (B – A).
‰ Ai and ˆ Ai, where i = {1, 2, 3}.
Sol. We have, A = {1, 2, 3, 4, 5, 6} and B = {3, 4, 5, 6, 7, 8}.
Sol. (i) ‰ A i = A1 ‰ A 2 ‰ A 3 = {2, 3, 4, 5} ‰ {3, 4, 5, 6} ‰ ? A – B = {1, 2} and B – A = {7, 8}
{4, 5, 6, 7} ?(A – B) ‰ (B – A) = {1, 2} ‰ {7, 8} = {1, 2, 7, 8}.
= {2, 3, 4, 5} ‰ {3, 4, 5, 6, 7} = {2, 3, 4, 5, 6, 7}. Some Basis Results about Cardinal Number

(ii) ˆ A i = A1 ˆ A 2 ˆ A 3 = {2, 3, 4, 5} ˆ {3, 4, 5, 6} ˆ If A, B and C are finite sets and U be the finite universal set,
then
{4, 5, 6, 7}
(i) n (Ac) = n (U) - n (A)
= {2, 3, 4, 5} ˆ {4, 5, 6} = {4, 5}.
(ii) n (A ‰ B) = n (A) + n (B) - n (A ˆ B)
Example – 11 (iii) n (A ‰ B) = n(A) + n (B), where A and B are disjoint non -

Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9}, A = {1, 2, 3, 4},

empty sets.
(iv) n (A ˆ Bc) = n (A) - n (A ˆ B) v tr
c
ac
B = {2, 4, 6, 8}. Find :
(v) n (Ac ˆ Bc) = n (A ‰ B)c = n (U) - n (A ‰ B)
C
(i) AC (ii) BC (iii) (AC)C (iv) A ‰ B (vi) n (Ac ‰ Bc) = n (A ˆ B)c = n (U) - n (A ˆ B)
- @
(vii) n (A - B) = n (A) - n (A ˆ B)
Sol. (i) AC = Set of those elements of U, which are not in
r am
(viii) n (A ˆ B) = n (A ‰ B) - n (A ˆ Bc) - n (Ac ˆ B)

(ii)
A = {5, 6, 7, 8, 9}.
C
B = Set of those elements of U, which are not in
(ix)

le g
n (A ‰ B ‰ C) = n (A) + n (B) + n (C) - n (A ˆ B) – n(B ˆ C) –
n(C ˆ A) + n (A ˆ B ˆ C)
B = {1, 3, 5, 7, 9}.

t Te
(x) If A1, A2, A3, ... An are disjoint sets , then
n (A1 ‰ A2 ‰ A3 ‰ ... ‰ An) = n(A1) + n (A2) + n (A3)
(iii) (AC)C = Set of those elements of U, which are not in
A’ = {1, 2, 3, 4} = A.
i si + ... + n(An)

(iv) V
A ‰ B = {1, 2, 3, 4} ‰ {2, 4, 6, 8} = {1, 2, 3, 4, 6, 8}.
e
(xi) n (A ' B) = number of elements which belong to exactly

or
one of A or B.
C
A‰B = Set of those elements of U, which are not in Example – 14

A ‰ B = {5, 7, 9}.
r M If A = {1, 2, 3}, B = {4, 5, 6} and C = {7, 8, 9}, verify that

Example – 12 Fo A ‰ B ˆ C = A ‰B ˆ A ‰ C .

If U = {x : x is a letter in English alphabet}, Sol. We have, A = {1, 2, 3}, B = {4, 5, 6} and C = {7, 8, 9}.
A = {x : x is a vowel in English alphabet}. A ‰ B = {1, 2, 3} ‰ {4, 5, 6} = {1, 2, 3, 4, 5, 6} ...(1)
Find AC and (AC)C. A ‰ C = {1, 2, 3} ‰ {7, 8, 9}
= {1, 2, 3, 7, 8, 9} ...(2)
Sol. (i) Since A = {x : x is a letter in English alphabet}, and B ˆ C = {4, 5, 6} ˆ {7, 8, 9} = I ...(3)
? AC is the set of those elements of U, which are not vowels
Now A ‰ B ˆ C 1, 2, 3 ‰ I = {1, 2, 3} ...(4)
= {x : x is a consonant in English alphabet}.
(ii) (AC)C is the set of those elements of U, which are not and A ‰ B ˆ A ‰ C = {1, 2, 3, 4, 5, 6} ˆ {1, 2, 3, 7, 8, 9}
consonants = {x : x is a vowel = {1, 2, 3} ...(5)
in English alphabet} = A. From (4) and (5), A ‰ B ˆ C A ‰ B ˆ A ‰ C , which
C C
Hence (A ) = A. verifies the result.
 SETS, RELATIONS & FUNCTIONS

Example – 15 Example – 17

Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9}, A = {2, 4, 6, 8} and Prove that :

B = {2, 3, 5, 7}. Verify that A ˆ(B – C) = (A ˆB) – (A ˆC)
C C
(i) A ‰ B A C ˆ BC (ii) A ˆ B A C ‰ BC . Sol. Let x be an arbitrary element of A ˆ(B – C).
Then x A ˆ(B – C)
Sol. We have, A = {2, 4, 6, 8} and B = {2, 3, 5, 7}. Ÿ x A and x (B – C)
Ÿ x A and (x B and x C)
(i) A ‰ B = {2, 4, 6, 8} ‰ {2, 3, 5, 7}
Ÿ (x A and x B) and (x A and x C)
= {2, 3, 4, 5, 6, 7, 8} Ÿ x (A ˆB) and x (A ˆC)
A ‰B
C
= {1, 9} ...(1) Ÿ x {(A ˆB) – (A ˆC)}
A ˆ(B – C) Ž(A ˆB) – (A ˆC) ... (1)
Also AC = {1, 3, 5, 7, 9} Let y be an arbitrary element of (A ˆB) – (A ˆC).
and BC = {1, 4, 6, 8, 9} Then y (A ˆB) – (A ˆC)
Ÿ y (A ˆB) and y (A ˆC)
A C ˆ BC = {1, 3, 5, 7, 9} ˆ {1, 4, 6, 8, 9}
Ÿ tr
(y A and y B) and (y A and y C)
v
= {1, 9} ...(2) Ÿ
c
y A and (y B and y C)

From (1) and (2), A ‰ B

C
A C ˆ BC , which verifies the
Ÿ
ac
y A and y (B – C)

result.
Ÿ
- @
y A ˆ(B – C)
(A ˆB) – (A ˆC) ŽA ˆ(B – C) ... (2)
(ii) A ˆ B = {2, 4, 6, 8} ˆ {2, 3, 5, 7} = {2}
am
Combining (1) and (2).
r
A ˆ(B – C) = (A ˆB) – (A ˆC).
A ˆB
C
= {1, 3, 4, 5, 6, 7, 8, 9} ...(3)
le g
Example – 18
and A C ‰ BC = {1, 3, 5, 7, 9} ‰ {1, 4, 6, 8, 9}
T e
= {1, 3, 4, 5, 6, 7, 8, 9} ...(4)
si t Prove the following :

From (3) and (4), A ˆ B

C
i
A C ‰ BC , which verifies the
V
A B œBc Ac

result.
re Sol. Let x Bc, where x is arbitrary.
Example – 16 o Now x Bc

r M
If A and B are any two sets, prove using Venn Diagrams Ÿ xB

(i) A – B = A ˆ BC
Fo
(ii) (A – B) ‰ B = A ‰ B. Ÿ

Ÿ
x A

x Ac
[' A B]

Sol.
Bc Ac ... (1)

Conversely : Let x A, where x is arbitrary.

(i)
Now x A

Ÿ x Ac

Ÿ x Bc [' Bc Ac]

(ii) Ÿ x B

A B

Combining (1) and (2), A B œBc Ac.

 SETS, RELATIONS & FUNCTIONS

Example – 19 n(I ˆM) = 15, n(M ˆA ˆI) = 5

n(X) = 200
Prove the following :
n(M ‰A ‰I) = n(M) + n(A) + n (I) –
A – B = A – (A ˆB)
n(M ˆA) –n (A ˆI) – n (M ˆI) + n (M ˆA ˆ I)
where U is the universal set.
= 35 + 40 + 40 – 20 – 17 – 15 + 5 = 68
Sol. Let x (A – B), where x is arbitrary. (i) Number of students passed in all three examination
Now x (A – B) = 200 – 68 = 132
œ x A and x B (ii) Number of students failed in IIT or AIEEE
œ (x A and x A) and x B =n (I ‰A) = n(I) + n(A) – n (I ˆA)
[Note this step] = 40 + 40 – 17 = 63
œ x A and (x A and x B)
Example – 21
v tr
[Associative Law]
c
œ x A and x (A ˆB) ac
In a hostel, 25 students take tea, 20 students take coffee,

œ x A – (A ˆB) - @
15 students take milk, 10 students take both tea and coffee,

am
8 students take both milk and coffee. None of the them
Hence A – B = A – (A ˆB).
r
take tea and milk both and everyone takes atleast one

g
le
Example – 20 beverage, find the number of students in the hostel.

In a class of 200 students who appeared in a certain T e

si t
examination. 35 students failed in MHTCET, 40 in AIEEE,

V i
40 in IIT, 20 failed in MHTCET and AIEEE, 17 in AIEEE Sol.

re
and IIT, 15 in MHTCET and IIT and 5 failed in all three
examinations. Find how many students o
(i)
r M
Did not fail in any examination.

(ii)
Fo
Failed in AIEEE or IIT. Let the sets, T and C and set M are the students who drink
tea, coffee and milk respectively. This problem can be solved
by Venn diagram.

n(T) = 25; n(C) = 20; n (M) = 15

Sol. n(T ˆC) = 10; n(M ˆC) = 8

Number of students in hostel

= n (T ‰C ‰M)

?n(T ‰C ‰M) = 15 + 10 + 2 + 8 + 7 = 42

n(M) = 35, n(A) = 40, n(I) = 40

n(M ˆA) = 20, n(A ˆI) = 17,