Std. XI Sci.

 
Perfect Mathematics - II
 
 
 
 
 
Edition: July 2014
 
Mr. Vinodkumar J. Pandey Dr. Sidheshwar S. Bellale
B.Sc. (Mathematics) M.Sc., B.Ed., PhD. (Maths)
G. N. Khalsa College, Mumbai Department of Mathematics,
Dayanand Science College, Latur. 
 
Mr. Vinod Singh
 
M.Sc. (Mathematics)
  Mumbai University 

 
Published by Price : ` 260/-

Target PUBLICATIONS PVT. LTD.

 
Printed at:
  Shiv Mandir Sabhagriha, India Printing Works
 
Mhatre Nagar, Near LIC Colony, 42, G.D. Ambekar Marg,
 
Mithagar Road, Mulund (E), Wadala,
  Mumbai - 400 081 Mumbai – 400 031
Off.Tel: 022 – 6551 6551
  Email: [email protected]
©
Target Publications Pvt. Ltd.
Website: www.targetpublications.org     All rights reserved
 

  No part of this book may be reproduced or transmitted in any form or by any means, C.D. ROM/Audio
Video Cassettes or electronic, mechanical including photocopying; recording or by any information
 
storage and retrieval system without permission in writing from the Publisher.
Written according to the New Text book (2012-2013) published by the Maharashtra State
Board of Secondary and Higher Secondary Education, Pune.

Std. XI Sci.

Perfect Mathematics - II

Salient Features :

• Exhaustive coverage of entire syllabus.

• Covers answers to all textual and miscellaneous exercises.
• Precise theory for every topic.
• Neat, labelled and authentic diagrams.
• Written in systematic manner.
• Self evaluative in nature.
• Practice problems and multiple choice questions for effective
preparation.

TEID : 752
 PREFACE
In the case of good books, the point is not how many of them you can get through, but rather how many can get
through to you.
“Std. XI Sci. : PERFECT MATHEMATICS - II” is a complete and thorough guide critically analysed and
extensively drafted to boost the students confidence. The book is prepared as per the Maharashtra State board syllabus
and provides answers to all textual questions. At the beginning of every chapter, topic – wise distribution of all
textual questions including practice problems has been provided for simpler understanding of different types of
questions. Neatly labelled diagrams have been provided wherever required.
Practice Problems and Multiple Choice Questions help the students to test their range of preparation and the
amount of knowledge of each topic. Important theories and formulae are the highlights of this book. The steps are
written in systematic manner for easy and effective understanding.
The journey to create a complete book is strewn with triumphs, failures and near misses. If you think we’ve
nearly missed something or want to applaud us for our triumphs, we’d love to hear from you.
Please write to us on : [email protected]

Best of luck to all the aspirants!

Yours faithfully,
Publisher

No. Topic Name Page No.

1 Sets, Relations and Functions 1
2 Logarithms 39
3 Complex Numbers 67
4 Sequence and Series 119
5 Permutations and Combinations 172
6 Method of Induction and Binomial Theorem 213
7 Limits 250
8 Differentiation 302
9 Integration 329
10 Statistics (Measures of Dispersion) 345
11 Probability 389
Log Tables
Logarithms 439
Antilogarithms 441
Target Publications Pvt. Ltd. Chapter 01: Sets, Relations and Functions

01 Sets, relations and functions

Type of Problems Exercise Q. Nos.
1.1 Q.1 (i., ii., iii.)
To describe sets in Roster form Practice Problems
Q.1 (i., ii., iii.)
(Based on Exercise 1.1)
1.1 Q.2 (i., ii., iii.), Q.12(i. to iv.)
Practice Problems Q.2 (i., ii., iii.)
To describe sets in Set-Builder (Based on Exercise 1.1) Q.11 (i. to iv.)
form Miscellaneous Q.1 (i., ii., iii.)
Practice Problems
Q.1(i., ii.)
(Based on Miscellaneous)
Q.3 to Q.11
1.1
Q.13 (i. to iv.)
Practice Problems Q.3 to Q.10
Operations on Sets (Based on Exercise 1.1) Q.12 (i., ii.)
Miscellaneous Q.2, 3, 4
Practice Problems
Q.2, 3, 4
(Based on Miscellaneous)
1.2 Q.1, 2, 6, 11
Ordered Pairs Practice Problems
Q.1, 2, 5, 9
(Based on Exercise 1.2)
1.2 Q.3, 4, 5
Practice Problems
Q.3, 4
(Based on Exercise 1.2)
Cartesian product of two Sets
Miscellaneous Q.5 (i., ii.)
Practice Problems
Q.5
(Based on Miscellaneous)
1.2 Q.7, 8, 9, 10
Practice Problems
Q.6, 7, 8
To find domain and range of a (Based on Exercise 1.2)
given relation Miscellaneous Q.6, 7
Practice Problems
Q.6, 7
(Based on Miscellaneous)

1 1
Target Publications Pvt. Ltd. Std. XI Sci.: Perfect Maths - II

1.3 Q.9, 10
Practice Problems
Q.9, 10
(Based on Exercise 1.3)
Types of Functions
Miscellaneous Q.9, 10, 22
Practice Problems
Q.9, 10, 21
(Based on Miscellaneous)
1.3 Q.3, 5, 6, 7
Practice Problems
Q.3, 4, 6, 7
To find values of the given (Based on Exercise 1.3)
function Miscellaneous Q.13 to Q.17
Practice Problems
Q.12 to Q.16
(Based on Miscellaneous)
1.3 Q.11 (i. to iii.)
Operations on functions Practice Problems
Q.11 (i. to iii.)
(Based on Exercise 1.3)
1.3 Q.12 to Q.15
Practice Problems
Q.12 to Q.15
(Based on Exercise 1.3)
Composite function
Miscellaneous Q.18 to Q.21
Practice Problems
Q.17 to Q.20
(Based on Miscellaneous)
1.3 Q.16
Practice Problems Q.16
(Based on Exercise 1.3)
Inverse function
Miscellaneous Q.11, 12
Practice Problems
Q.11
(Based on Miscellaneous)
1.3 Q.1, 2, 4, 8
Practice Problems
Q.1, 2, 5, 8
To find domain and range of a (Based on Exercise 1.3)
given function Miscellaneous Q.8, 23, 24
Practice Problems
Q.8
(Based on Miscellaneous)

2
Target Publications Pvt. Ltd. Chapter 01: Sets, Relations and Functions

Syllabus: Example:
Sets, Subset, Intervals, Types of sets, Power set, The set A of all positive even integers less
Ordered pair, Cartesian products of two sets, than 9 can be written as A = {2, 4, 6, 8}.
Definition of Relation, Domain, Co-domain and ii. Set-Builder method:
Range of Relation, Types of Relation, Definition of In this method, the set is described by the
function, Types of functions, Operations on characteristic property of its elements.
functions, Composite function, Inverse function, In general, if all the elements of set A satisfy
Binary operation, Real valued functions of the real some property P, then write A in set-builder
variable. notation as A = {x/x has property P} and read
it as ‘A is the set of all x such that x has the
Introduction property P’.
All basic concepts of modern mathematics are based Example:
on set theory. The concepts involving logic can be Let B = {3, 4, 5, 6, 7, 8}
explained more easily with the help of set theory. Using the set-builder method, B can be written
as B = {x/x ∈ N, 3 ≤ x ≤ 8}
It plays a crucial role in the study of relations,
functions, probability and is used extensively in Since B = {3, 4, 5, 6, 7, 8} can also be stated
various other branches of mathematics. We shall as the set of natural numbers from 3 to 8
briefly revise and study some more concepts about including 3 and 8.
sets. Some standard sets are as follows:
Sets N = set of all natural numbers
= {1, 2, 3,…..}
A set is a well-defined collection of objects. These
objects may be actually listed or may be specified by Z or I = set of all integers
a rule. A set is usually denoted by the capital letters = { ….−3, −2, −1, 0, 1, 2, 3 …}
A, B, C, N, R, etc. Each object in a set is called an
Q = set of all rational numbers
element or a member of the set and is denoted by the
⎧p ⎫
small letters a, b, c, etc. = ⎨ / p,q ∈ Z,q ≠ 0 ⎬
⎩q ⎭
If x is an element of set A, then we write it as x ∈ A
and read it as ‘x belongs to A’ and if y is not an Subset:
element of set A, then we write it as y ∉ A and read Set A is called a subset of set B, if every element of
it as ‘y does not belong to A’. set A is also an element of set B
Example: i.e., if x ∈ A, then x ∈ B.
If A = {2, 4, 6, 8}, We denote this relation as A ⊆ B and read it as
then 4 ∈ A, 7 ∉ A, 8 ∈ A, 10 ∉ A ‘A is a subset for B’. It s clear that
The set of natural numbers, whole numbers, integers, i. Every set is a subset of itself i.e., A ⊆ A.
rational numbers and real numbers are denoted by N, ii. An empty set φ is a subset of every set.
W, I, Q and R respectively. Example:
If A = {2, 4, 6, 8} and B = {2, 4, 6, 8, 10, 12},
Methods of Representation of Sets
then A ⊆ B.
There are two methods of representing a set which If A ⊆ B, then B is called a superset of A, denoted
are as follows: by B ⊇ A.
i. Roster method (Listing method):
Proper subset:
In this method all the elements are listed or If every element of set A is an element of set B and
tabulated. The elements are separated by B contains at least one element which is not in A,
commas and are enclosed within two then A is said to be a proper subset of B and it is
braces(curly brackets). denoted as A ⊂ B.
3 3
Target Publications Pvt. Ltd. Std. XI Sci.: Perfect Maths - II

Example: Set of all real numbers ≥ p

If A = {2, 3, 5, 6}, B = {1, 2, 3, 4, 5, 6, 7} i.e., [p, ∞) = {x/x∈R, x ≥ p}
Here every element of set A i.e., 2, 3, 5, 6 is an
R
element of set B. But B contains elements 1, 4, 7 p
which are not in A. Hence in the case we say that A
is a proper subset of B and is denoted by A ⊂ B. ii. Set of real numbers < q
i.e., (−∞, q) {x/x∈R, x < q}
Intervals R
q
Open interval
Set of real numbers ≤ q
If p, q ∈ R and p < q, then the set {x/x∈R, p < x < q} i.e., (−∞, q] = {x/x∈R, x ≤ q}
is called open interval and is denoted by (p, q). Here R
q
all the numbers between p and q ∈ (p, q) except p and
q. iii. Set of all real numbers R is (−∞, ∞)
R
p x q R

∴ (p, q) = {x/x∈R, p < x < q} R = (−∞, ∞) = {x/x ∈ R, − ∞ < x < ∞}

Closed interval Types of sets
Empty set:
If p, q ∈ R and p < q, then the set {x/x∈R, p ≤ x ≤ q}
is called closed interval and is denoted by [p,q]. A set which does not contain any element is called
Here all the numbers between p and q ∈ [p, q] an empty set and it is denoted by φ or { }. It is also
including p, q. called null set or void set.
Example:
R
p x q A = {x/x ∈ N, 3 < x < 4}
B = {x/x is a positive integer < 1}
∴ [p, q] = {x/x∈R, p ≤ x ≤ q}
Note:
Semi-closed interval
The set {0} and {φ} are not empty sets as they
If p, q ∈ R and p < q, then the set {x/x∈R, p ≤ x < q} contain one element, namely 0 and φ respectively.
is called semi-closed interval and is denoted by [p, q).
Singleton set:
R
p x q A set which contains only one element is called a
singleton set.
∴ [p, q) = {x/x∈R, p ≤ x < q}
[p, q) includes p but excludes q. Example:
A = {5},
Semi-open interval B = {3},
If p, q ∈ R and p < q, then the set {x/x∈R, p < x ≤ q} X = {x/x ∈ N, 1 < x < 3}
is called semi-open interval and is denoted by (p, q]. The set A = set of all integers which are neither
R positive nor negative is a singleton set since A = {0}
p x q
Finite set:
∴ (p, q] = {x/x ∈ R, p < x ≤ q}
(p, q] excludes p but includes q. A set which contains countable number of elements
is called a finite set.
Remarks:
Example:
i. Set of all real numbers > p
i.e., (p, ∞) = [x/x∈R, x > p} A = {a, b, c}
B = {1, 2, 3, 4, 5}
R
p C = {a, e, i, o, u}
4
Target Publications Pvt. Ltd. Chapter 01: Sets, Relations and Functions

Infinite set: Operations on sets

A set which contains uncountable number of
elements is called an infinite set. Complement of a set:
Example: Let A be a subset of a universal set X then the set of
N = {1, 2, 3, 4……} all those elements of X which do not belong to A is
Z = {…−3, −2, −1, 0, 1, 2, 3,…..} called the complement of set A and it is denoted by
A′ or Ac.
Note:
Thus, A′ = {x/x ∈ X, x ∉ A}
i. An empty set is a finite set.
ii. N, W, I, Q and R are infinite sets. X
Equal sets:
Two sets A and B are said to be equal if they have A
the same elements and we denote this as A = B.
From this definition it follows that “two sets A and A′
B are equal if and only if A ⊆ B and B ⊆ A”
Example: The shaded region in the above figure represents A′.
If A = {1, 2, 3, 4}, B = {2, 4, 1, 3}, then A = B. Example:
Equivalent sets: Let X = {1, 2, 3, 4, 5, 6, 7, 8, 9} be an universal set
Two sets A and B are said to be equivalent, if they and A = {1, 3, 5, 6, 8}.
contain the same number of elements and we denote Then A′ = {2, 4, 7, 9}
it as A ≈ B.
Example: Properties:
If A = {1, 2, 3, 4, 5}, B = {a, b, c, d, e}, then If X is the universal set and A, B ⊆ X, then
n(A) = n(B) i. (A′)′ = A
∴ A and B are equivalent sets. ii. X′ = φ
Note: iii. φ′ = X
Equal sets are always equivalent but equivalent sets iv. A ∩ A′ = φ
need not be equal. v. A ∪ A′ = X
Universal set: vi. If A ⊆ B, then B′ ⊆ A′.
A non-empty set of which all the sets under
Union of sets:
consideration are subsets, is called a universal set. It
is usually denoted by X or U. If A and B are two sets, then the set of those
Example: elements which belong to A or to B or to both A and
If A = {1, 2, 3, 4}, B = {2, 8, 13, 15} and B is called the union of the sets A and B and is
C = {1, 2, 3, …, 50} are sets under consideration, denoted by A ∪ B.
then the set N of all natural numbers can be taken as i.e., A ∪ B = {x/x ∈ A or x ∈ B}
the universal set. The shaded portion in the below venn diagram
represents A ∪ B.
Venn diagram:
A set is represented by any closed figure such as
X
circle, rectangle, triangle, etc. The diagrams
A B
representing sets are called venn diagrams.
Example:
.4 A
i. A = {4, 6, 9} A∪B
.6 .9 Example:
i. If A = {1, 2, 3, 4}, B = {2, 4, 6, 8},
B .a A then A ∪ B = {1, 2, 3, 4, 6, 8}
ii. A = {a, b, c, d, e, f} .b .c ii. If A is the set of all odd integers and B is the
B = {b, e, f} .e .f .d
B⊂A set of all even integers, then A ∪ B is the set
of all integers.
5 5
Target Publications Pvt. Ltd. Std. XI Sci.: Perfect Maths - II

Properties: X
If A, B, C are any three sets, then
i. A∪φ=A A B
ii. A∪X=X
iii. A ∪ B = B ∪ A (Commutative law)
iv. (A ∪ B) ∪ C = A ∪ (B ∪ C) A∩B=φ
Difference of sets:
(Associative law) If A and B are two sets then the set of all the
v. A∪A=A (Idempotent law) elements of A which are not in B is called difference
vi. If A ⊂ B, then A ∪ B = B of sets A and B and is denoted by A − B.
vii. A ⊂ A ∪ B, B ⊂ A ∪ B Thus, A − B = {x/x ∈ A and x ∉ B}
Intersection of sets Similarly, B − A = {x/x ∉ A and x ∈ B}
If A and B are two sets, then the set of those In the below venn diagrams shaded region
elements which belong to both A and B i.e., which represents A − B and B − A .
are common to both A and B is called the X X
intersection of the sets A and B and is denoted by
A ∩ B. A B A B
Thus, A ∩ B = { x/x ∈ A and x ∈ B}
The shaded portion in the below venn diagram
A−B B−A
represents A ∩ B. Example:
If A = {1, 2, 3, 4, 5, 6}, B = {2, 4, 6, 8}, then
X A − B = {1, 3, 5} and B − A = {8}
Distributive Properties of union and intersection
A B If a, b, c ∈ R, then
a × (b + c) = (a × b) + (a × c)
A∩B This is known as distributive property of
Example: multiplication over addition. In set theory, the
If A = {1, 2, 3, 4, 5}, B = {1, 3, 5, 7, 9}, operation of union and intersection of sets are both
then A ∩ B = {1, 3, 5} distributive over each other i.e.,
If A, B, C are any three sets, then
Properties: i. A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
If A, B, C are any three sets, then ii. A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
i. A∩φ=φ We verify these distributive laws using Venn
ii. A∩X=A diagrams shown below. The shaded portion in each
iii. A ∩ B = B ∩ A (Commutative law) figure shows the set obtained by performing the
operation given below the figure.
iv. (A ∩ B) ∩ C = A ∩ (B ∩ C)
(Associative law) X X
A A
v. A∩A=A (Idempotent law)
i.
vi. If A ⊂ B, then A ∩ B = A
B C = B C
vii. A ∩ B ⊂ A, A ∩ B ⊂ B
Disjoint sets: A ∪ (B ∩ C) (A ∪ B) ∩ (A ∪ C)
Two sets A and B are said to be disjoint, if they have
no element in common i.e., A ∩ B = φ. X X
Example: A A
If A = {2, 4, 6} and B = {3, 5, 7}, then A ∩ B = φ ii.
B C = B C
∴ A and B are disjoint sets.
The venn diagram of the disjoint sets A and B is
shown below: A ∩ (B ∪ C) (A ∩ B) ∪ (A ∩ C)
6
Target Publications Pvt. Ltd. Chapter 01: Sets, Relations and Functions

De-Morgan’s laws Exercise 1.1

If A and B are two subsets of a universal set X, then 1. Describe the following sets in Roster form:
i. (A ∪ B)′ = A′ ∩ B′ i. {x/x is a letter of the word
ii. (A ∩ B)′ = A′ ∪ B′ ‘MARRIAGE’}
We verify these laws using Venn diagrams shown ⎧ 1 9⎫
below. The shaded portion in each figure shows the
ii. ⎨ x / x isan integer and − < x < ⎬
⎩ 2 2⎭
set obtained by performing the operation below the iii. {x/x = 2n, n ∈ N}
figure: Solution:
i. i. Let A = {x/x is a letter of the word
X X
A B = A B ‘MARRIAGE’}
∴ A = {M, A, R, I, G, E}
⎧ 1 9⎫
ii. Let B = ⎨ x / x is an integer and − < x < ⎬
(A ∪ B)′ A′ ∩ B′ ⎩ 2 2⎭
∴ B = {0, 1, 2, 3, 4}
ii. X X iii. Let C = {x/x = 2n, n ∈ N}
A B = A B ∴ C = {2, 4, 6, 8, ….}

2. Describe the following sets in Set-Builder

(A ∩ B)′ A′ ∪ B′ form:
Number of elements in a set i. {0}
Let A be a set. Then the total number of elements in it ii. {0, ± 1, ± 2, ± 3}
is denoted by n(A). ⎧1 2 3 4 5 6 7 ⎫
iii. ⎨ , , , , , , ⎬
Example: ⎩ 2 5 10 17 26 37 50 ⎭
Let A = {8, 9, 10, 11, 12} Solution:
∴ n (A) = 5 i. Let A = {0}
The number of elements in the empty set φ is zero. 0 is a whole number but it is not a natural
i.e., n (φ) = 0 number
∴ A = {x / x ∈ W, x∉ N}
Results:
For given sets A, B, C ii. Let B = {0, ± 1, ± 2, ± 3}
i. n(A ∪ B) = n(A) + n(B) − n(A ∩ B) B is the set of elements which belongs to Z
ii. When A and B are disjoint sets, then from −3 to 3
n(A ∪ B) = n(A) + n(B) ∴ B = {x / x ∈ Z, −3 ≤ x ≤ 3}
iii. n(A ∩ B′) + n(A ∩ B) = n(A)
⎧1 2 3 4 5 6 7 ⎫
iv. n(A′ ∩ B) + n(A ∩ B) = n(B) iii. Let C= ⎨ , , , , , , ⎬
⎩ 2 5 10 17 26 37 50 ⎭
v. n(A ∩ B′) + n(A ∩ B) + n(A′ ∩ B) = n(A ∪ B)
vi. n(A∪ B∪ C) = n(A) + n(B) + n(C) − n(A∩B) ⎧ n ⎫
∴ C = ⎨x / x = 2 , n ∈ N, n ≤ 7 ⎬
− n(B ∩ C) − n(A ∩ C) + n(A ∩ B ∩ C) ⎩ n +1 ⎭
Power set 3. If A = {x / 6x2 + x − 15 = 0}
The set of all subsets of set A is called the power set B = {x / 2x2 − 5x − 3 = 0}
of A and it is denoted by P(A). C = {x / 2x2 − x − 3 = 0}, then find
Example: i. A∪B∪C
If A = {a, b, c}, then ii. A∩B∩C
P(A) ={φ, {a}, {b}, {c}, {a, b}, {b, c}, {a, c}, Solution:

Note:
{a, b, c}} {
A = x / 6 x 2 + x − 15 = 0 }
2
If A contains n elements, then the power set of A ∴ 6x + x − 15 = 0
i.e., P(A) contains 2n elements. ∴ 6x2 + 10x − 9x − 15 = 0

7 7
Target Publications Pvt. Ltd. Std. XI Sci.: Perfect Maths - II

∴ 2x(3x + 5) − 3(3x + 5) = 0 5. If A = {1, 2, 3, 4}, B = {3, 4, 5, 6},

∴ (3x + 5) (2x − 3) = 0 C = {4, 5, 6, 7, 8} and universal set
−5 3 X = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, then verify
∴ x= or x =
3 2 the following:
⎧ −5 3 ⎫ i. A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
∴ A =⎨ , ⎬
⎩ 3 2⎭ ii. A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
2
B = {x/2x − 5x − 3 = 0} iii. (A ∪ B)′ = A′ ∩ B′
∴ 2x2 − 5x − 3 = 0 iv. (A ∩ B)′ = A′ ∪ B′
v. A = (A ∩ B) ∪ (A ∩ B′)
∴ 2x2 − 6x + x − 3 = 0
vi. B = (A ∩ B) ∪ (A′ ∩ B)
∴ 2x(x − 3) + 1(x − 3) = 0 vii. n(A ∪ B) = n(A) + n(B) − n(A ∩ B)
∴ (x − 3)(2x + 1) = 0 Solution:
−1 A = {1, 2, 3, 4}, B = {3, 4, 5, 6}, C = {4, 5, 6, 7, 8}
∴ x = 3 or x = X ={1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
2
i. (B ∩ C) = {4, 5, 6}
⎧ −1 ⎫
∴ B = ⎨ , 3⎬ ∴ A ∪ (B ∩ C)= {1, 2, 3, 4, 5, 6}
⎩2 ⎭ (A ∪ B) = {1, 2, 3, 4, 5, 6}
2
C = {x/2x − x − 3 = 0} (A ∪ C) = {1, 2, 3, 4, 5, 6, 7, 8}
∴ 2x2 − x − 3 = 0 ∴ (A ∪ B) ∩ (A ∪ C) = {1, 2, 3, 4, 5, 6}
∴ 2x2 − 3x + 2x − 3 = 0 ∴ A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
∴ x(2x − 3) + 1(2x − 3) = 0 ii. (B ∪ C) = {3, 4, 5, 6, 7, 8}
∴ (2x − 3) (x + 1) = 0 ∴ A ∩ (B ∪ C) = {3, 4}
3 A ∩ B = {3, 4}
∴ x = or x = −1 A ∩ C = {4}
2
∴ (A ∩ B) ∪ (A ∩ C) = {3, 4}
⎧ 3⎫
∴ C = ⎨ −1, ⎬ ∴ A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
⎩ 2⎭
Thus, iii. A ∪ B = {1, 2, 3, 4, 5, 6}
⎧ 5 3 ⎫ ⎧ −1 ⎫ ⎧ 3 ⎫ ∴ (A ∪ B)′ ={7, 8, 9, 10}
i. A ∪ B ∪ C = ⎨− , ⎬ ∪ ⎨ ,3⎬ ∪ ⎨−1, ⎬ A′ = {5, 6, 7, 8, 9, 10},
⎩ 3 2⎭ ⎩ 2 ⎭ ⎩ 2⎭
B′ = {1, 2, 7, 8, 9, 10}
⎧ −5 −1 3 ⎫ ∴ A′ ∩ B′ = {7, 8, 9, 10}
= ⎨ , − 1, , , 3⎬
⎩3 2 2 ⎭ ∴ (A ∪ B)′ = (A′ ∩ B′)
ii. A∩B∩C={}
iv. A ∩ B = {3, 4}
4. If A, B, C are the sets of the letters in the (A ∩ B)′ = {1, 2, 5, 6, 7, 8, 9, 10}
words ‘college’, ‘marriage’ and ‘luggage’ A′ = {5, 6, 7, 8, 9, 10}
respectively, then verify that B′ = {1, 2, 7, 8, 9, 10}
[A − (B ∪ C)] = [(A − B) ∩ (A − C)]. ∴ A′ ∪ B′ = {1, 2, 5, 6, 7, 8, 9, 10}
Solution: ∴ (A ∩ B)′ = A′ ∪ B′
A = {c, o, l, g, e}
B = {m, a, r, i, g, e,} v. A ∩ B = {3, 4}
C = {l, u, g, a, e} A ∩ B′ = {1, 2}
B ∪ C = {m, a, r, i, g, e, l, u} ∴ (A ∩ B) ∪ (A ∩ B′) = {1, 2, 3, 4}
A − (B ∪ C) = {c, o} ∴ A = (A ∩ B) ∪ (A ∩ B′)
A − B = {c, o, l} vi. A ∩ B = {3, 4}
A − C = {c, o} A′ ∩ B = {5, 6}
∴ [(A − B) ∩ (A − C)] = {c, o} = A − (B ∪ C) ∴ (A ∩ B) ∪ (A′ ∩ B) = {3, 4, 5, 6}
∴ [A − (B ∪ C)] = [(A − B) ∩ (A − C)] ∴ B = (A ∩ B) ∪ (A′ ∩ B)
8
Target Publications Pvt. Ltd. Chapter 01: Sets, Relations and Functions

vii. A = {1, 2, 3, 4}, B = {3, 4, 5, 6}, ii. No. of students who failed in AIEEE or IIT
A ∩ B = {3, 4}, A ∪ B = {1, 2, 3, 4, 5, 6} entrance = n(B ∪ C)
∴ n(A) = 4, n(B) = 4, = n(B) + n(C) − n(B ∩ C)
n(A ∩ B) = 2, n(A ∪ B) = 6
= 40 + 40 − 17
∴ n(A) + n(B) − n(A ∩ B) = 4 + 4 − 2 = 6
= 63
∴ n(A ∪ B) = n(A) + n(B) − n(A ∩ B)

6. If A and B are subsets of the universal set X 8. From amongst 2000 literate individuals of a
and n(X) = 50, n(A) = 35, n(B) = 20, town, 70% read Marathi newspapers, 50%
n(A′ ∩ B′) = 5, find read English newspapers and 32.5% read
i. n(A ∪ B) ii. n(A ∩ B) both Marathi and English newspapers.
iii. n(A′ ∩ B) iv. n(A ∩ B′). Find the number of individuals who read
Solution: i. at least one of the newspapers.
n(X) = 50, n(A) = 35, n(B) = 20, n(A′ ∩ B′) = 5
ii. neither Marathi nor English
i. n(A ∪ B) = n(X) − [n(A ∪ B)′] newspaper.
= n(X) − n(A′ ∩ B′)
iii. only one of the newspapers.
= 50 − 5
= 45 Solution:
ii. n(A ∩ B) = n(A) + n(B) − n(A ∪ B) Let M = set of individuals who read Marathi
= 35 + 20 − 45 newspapers
= 10 E = set of individuals who read English
iii. n(A′ ∩ B) = n(B) − n(A ∩ B) newspapers
= 20 − 10 X = set of all literate individuals
= 10 70
∴ n(X) = 2000, n(M) = × 2000 = 1400
iv. n(A ∩ B′) = n(A) − n(A ∩ B) = 35 − 10 = 25 100
50
7. In a class of 200 students who appeared n(E) = × 2000 = 1000
certain examinations, 35 students failed in 100
MHT-CET, 40 in AIEEE and 40 in IIT 32.5
n(M ∩ E) = × 2000 = 650
entrance, 20 failed in MHT-CET and 100
AIEEE, 17 in AIEEE and IIT entrance, n(M ∪ E) = n(M) + n(E) − n(M ∩ E)
15 in MHT-CET and IIT entrance and 5
failed in all three examinations. Find how = 1400 + 1000 − 650
many students = 1750
i. did not fail in any examination. i. No. of individuals who read at least one of the
ii. failed in AIEEE or IIT entrance. newspapers = n(M ∪ E) = 1750.
Solution:
Let A = set of students who failed in MHT-CET ii. No. of individuals who read neither Marathi
B = set of students who failed in AIEEE nor English newspaper
C = set of students who failed in IIT entrance = n(M′ ∩ E′)
X = set of all students = n(M ∪ E)′
∴ n(X) = 200, n(A) = 35, n(B) = 40, n(C) = 40,
= n(X) − n(M ∪ E)
n(A ∩ B)= 20, n(B ∩ C) = 17, n(A ∩ C) = 15,
= 2000 − 1750
n(A ∩ B ∩ C) = 5
i. n(A ∪ B ∪ C) = 250
= n(A) + n(B) + n(C) − n(A ∩ B) − n(B ∩ C)
iii. No. of individuals who read only one of the
− n(A ∩ C) + n(A ∩ B ∩ C)
newspaper = n(M ∩ E′) + n(M′ ∩ E)
= 35 + 40 + 40 − 20 − 17 − 15 + 5
= 68 = n(M ∪ E) – n(M ∩ E)
∴ No. of students who did not fail in any exam = 1750 – 650
= n(X) − n(A ∪ B ∪ C) = 200 − 68 = 132 = 1100
9 9