SETS

9. If 𝑛(𝐴) = 4, 𝑛(𝐵) = 3, 𝑛(𝐴 × 𝐵 × 𝐶) = 240, then

1. Let 𝑅1 be a relation defined by 𝑛(𝐶) is equal to
𝑅1 = {(𝑎, 𝑏)|𝑎 ≥ 𝑏, 𝑎, 𝑏 ∈ 𝑅}. Then, 𝑅1 is a) 288 b) 1
a) An equivalence relation on 𝑅 c) 12 d) 2
b) Reflexive, transitive but not symmetric 10. In a class, 70 students wrote two tests viz; test-I
c) Symmetric, transitive but not reflexive and test-II. 50% of the students failed in test-I
d) Neither transitive not reflexive but symmetric and 40% of the students in test-II. How many
[Link] the set of human beings a relation 𝑅 is defined students passed in both tests?
as follows:"𝑎𝑅𝑏 iff 𝑎 and 𝑏 have the same brother”. a) 21 b) 7
Then 𝑅 is c) 28 d) 14
a) Only reflexive b) Only symmetric 11. Let 𝑍 denote the set of all integers and 𝐴 =
c) Only transitive d) Equivalence {(𝑎, 𝑏): 𝑎2 + 3𝑏 2 = 28, 𝑎, 𝑏 ∈ 𝑍} and 𝐵 =
3. In a class of 35 students, 17 have taken {(𝑎, 𝑏): 𝑎 > 𝑏, 𝑎, 𝑏 ∈ 𝑍}. Then, the number of
Mathematics, 10 have taken Mathematics but not elements in 𝐴 ∩ 𝐵 is
Economics. If each student has taken either a) 2 b) 3
Mathematics or Economics or both, then the c) 4 d) 6
number of students who have taken Economics but 12. Let 𝐿 be the set of all straight lines in the
not Mathematics is Euclidean plane. Two lines 𝑙1 and 𝑙2 are said to be
a) 7 b) 25 related by the relation 𝑅 iff 𝑙1 is parallel to 𝑙2 .
c) 18 d) 32 Then, the relation 𝑅 is not
4. {𝑛(𝑛 + 1)(2𝑛 + 1): 𝑛 ∈ 𝑍} ⊂ a) Reflexive b) Symmetric
a) {6𝑘 ∶ 𝑘 ∈ 𝑍} b) {12𝑘 ∶ 𝑘 ∈ 𝑍} c) Transitive d) None of these
c) {18𝑘 ∶ 𝑘 ∈ 𝑍} d) {24𝑘 ∶ 𝑘 ∈ 𝑍} 13. Let 𝑅 be a relation on the set 𝑁 be defined by
5. If 𝐴 = {1, 2, 3, 4, 5}, 𝐵 = {2, 4, 6}, 𝐶 = {3, 4, 6}, then {(𝑥, 𝑦)|𝑥, 𝑦 ∈ 𝑁, 2 𝑥 + 𝑦 = 41}. Then, 𝑅 is
(𝐴 ∪ 𝐵) ∩ 𝐶 is a) Reflexive b) Symmetric
a) {3, 4, 6} b) {1, 2, 3} c) Transitive d) None of these
c) {1, 4, 3} d) None of these 14. In an office, every employee likes at least one of
6. Let 𝐴 be the set of all students in a school. A tea, coffee and milk. The number of employees
relation 𝑅 is defined on 𝐴 as follows: who like only tea, only coffee, only milk and all
"𝑎𝑅𝑏 iff 𝑎 and 𝑏 have the same teacher” the three are all equal. The number of employees
a) Reflexive b) Symmetric who like only tea and coffee, only coffee and milk
c) Transitive d) Equivalence and only tea and milk are equal and each is equal
7. If 𝑃 is the set of all parallelograms, and 𝑇 is the set to the number of employees who like all the three.
of all trapeziums, then 𝑃 ∩ 𝑇 is Then a possible value of the number of employees
a) 𝑃 b) 𝑇 in the office is
c) ϕ d) None of these a) 65 b) 90
8. 𝐴 and 𝐵 are any two non-empty sets and 𝐴 is c) 77 d) 85
proper subset of 𝐵. If 𝑛(𝐴) = 5, then find the 15. Which of the following cannot be the number of
minimum possible value of 𝑛(𝐴∆𝐵) elements in the power set of any finite set?
a) Is 1 a) 26 b) 32
b) Is 5 c) 8 d) 16
c) Cannot be determined 16. The relation ‘is subset of’ on the power set 𝑃(𝐴)
d) None of these of a set 𝐴 is
a) Symmetric b) Anti-symmetric
c) Equivalence relation d) None of these
 𝐵 ⊂ 𝐶, then which of the following is true?
a) 𝐵 − 𝐴 = 𝐶 − 𝐵 b) 𝐴 ∩ 𝐵 ∩ 𝐶 = 𝐵
17. Let 𝐴 and 𝐵 be two non-empty subsets of a set 𝑋 c) 𝐴 ∪ 𝐵 = 𝐵 ∩ 𝐶 d) 𝐴 ∪ 𝐵 ∪ 𝐶 = 𝐴
such that 𝐴 is not a subset of 𝐵. Then, 2𝑥−1
27. {𝑥 ∈ 𝑅: 𝑥 3 +4𝑥2 +3𝑥 ∈ 𝑅}equals
a) 𝐴 is a subset of complement of 𝐵
a) 𝑅 − {0} b) 𝑅 − {0, 1, 3}
b) 𝐵 is a subset of 𝐴 1
c) 𝐴 and B are disjoint c) 𝑅 − {0, −1, −3} d) 𝑅 − {0, −1, −3, + 2}
d) 𝐴 and the complement of 𝐵 are non-disjoint 28. If 𝑅 is a relation from a finite set 𝐴 having 𝑚
18. If 𝐴, 𝐵 and 𝐶 are three sets such that 𝐴 ⊃ 𝐵 ⊃ 𝐶, elements to a finite set 𝐵 having 𝑛 elements, then
then (𝐴 ∪ 𝐵 ∪ 𝐶) − (𝐴 ∩ 𝐵 ∩ 𝐶) = the number of relations from 𝐴 to 𝐵 is
a) 𝐴 − 𝐵 b) 𝐵 − 𝐶 a) 2𝑚𝑛 b) 2𝑚𝑛 − 1
c) 𝐴 − 𝐶 d) None of these c) 2𝑚𝑛 d) 𝑚𝑛
19. A survey shows that 63% of the Americans like 29. If 𝐴 = {(𝑥, 𝑦): 𝑦 2 = 𝑥; 𝑥, 𝑦 ∈ 𝑅} and
cheese whereas 76% like apples. If 𝑥% of the 𝐵 = {(𝑥, 𝑦): 𝑦 = |𝑥|; 𝑥, 𝑦 ∈ 𝑅}, then
Americans like both cheese and apples, then a) 𝐴 ∩ 𝐵 = ϕ
a) 𝑥 = 39 b) 𝑥 = 63 b) 𝐴 ∩ 𝐵 is a singleton set
c) 39 ≤ 𝑥 ≤ 63 d) None of these c) 𝐴 ∩ 𝐵 contains two elements only
20. If 𝑋 = {4 − 3𝑛 − 1 ∶ 𝑛 ∈ 𝑁} and 𝑌 = {9(𝑛 −
𝑛 d) 𝐴 ∩ 𝐵 contains three elements only
1): 𝑛 ∈ 𝑁}, then 𝑋 ∪ 𝑌 is equal to 30. Which of the following is an equivalence relation?
a) 𝑋 b) 𝑌 a) Is father of b) Is less than
c) 𝑁 d) None of these c) Is congruent to d) Is an uncle of
21. Let 𝐴 = {𝑥: 𝑥 is a multiple of 3} and 𝐵 = 31. From 50 students taking examinations in
{𝑥: 𝑥 is a multiple of 5}. Then, 𝐴 ∩ 𝐵is given by Mathematics, Physics and Chemistry, 37 passed
a) {3, 6, 9, ...…} b) {5, 10, 15, 20, .......} Mathematics, 24 Physics and 43 Chemistry. At
c) {15, 30, 45, ......} d) None of these most 19 passed Mathematics and Physics, at
22. If 𝑛(𝐴 × 𝐵) = 45, then 𝑛(𝐴) cannot be most 29 passed Mathematics and Chemistry and
a) 15 b) 17 at most 20 passed Physics and Chemistry.
c) 5 d) 9 The largest possible number that could have
23. In order that a relation 𝑅 defined on a non-empty passed all three examinations is
set 𝐴 is an equivalence relation, it is sufficient, if 𝑅 a) 11 b) 12
a) Is reflective c) 13 d) 14
b) Is symmetric 32. Let 𝐴 be the non-void set of the children in a family.
c) Is transitive The relation ′𝑥 is a brother of 𝑦′ on 𝐴 is
d) Possesses all the above three properties a) Reflexive b) Symmetric
24. For real numbers 𝑥 and 𝑦, we write 𝑥 𝑅𝑦 ⇔ 𝑥 − c) Transitive d) None of these
𝑦 + √2 is an irrational number. Then, the relation 𝑅 33. In a class of 30 pupils 12 take needls work, 16
is take physics and 18 take history. If all the 30
a) Reflexive b) Symmetric students take at least one subject and no one
c) Transitive d) None of these takes all three, then the number of pupils taking 2
25. In a class of 45 students, 22 can speak Hindi and 12 subjects is
can speak English only. The number of students, a) 16 b) 6
who can speak both Hindi and English, is c) 8 d) 20
a) 9 b) 11 34. If 𝑅 is a relation on a finite set having 𝑛 elements,
c) 23 d) 17 then the number of relations on 𝐴 is
2
26. 𝐴, 𝐵 and 𝐶 are three non-empty sets. If 𝐴 ⊂ 𝐵 and a) 2𝑛 b) 2𝑛
 c) 𝑛2 d) 𝑛𝑛 c) Only transitive d) Equivalence
35. The void relation on a set 𝐴 is 44. In the above question, the number of families which
a) Reflexive buy none of 𝐴, 𝐵 and 𝐶 is
b) Symmetric and transitive a) 4000 b) 3300
c) 4200 d) 5000
c) Reflexive and symmetric 45. If 𝐴 and 𝐵 are two sets, then 𝐴 ∩ (𝐴 ∪ 𝐵) equals
d) Reflexive and transitive a) 𝐴 b) 𝐵
36. Suppose 𝐴1 , 𝐴2 , … , 𝐴30 are thirty sets, each having 5 c) ϕ d) None of these
elements and 𝐵1 , 𝐵2 , … , 𝐵𝑛 are 𝑛 sets each with 3 46. If 𝐴 = {1,3,5,7,9,11,13,15,17}, 𝐵 = {2,4 … ,18}
elements, let and 𝑁 is the universal set, then 𝐴′ ∪ ((𝐴 ∪ 𝐵) ∩ 𝐵′ )
⋃30 𝑛
𝑖=1 𝐴𝑖 = ⋃𝑗=1 𝐵𝑗 = 𝑆 and each element of 𝑆 belongs is
to exactly 10 of the 𝐴𝑖 's and exactly 9 of the 𝐵𝑗 's. a) 𝐴 b) 𝑁
Then, 𝑛 is equal to c) 𝐵 d) none of these
a) 115 b) 83 47. If 𝐴 = {ϕ, {ϕ}}, then the power set of 𝐴 is
c) 45 d) None of these a) 𝐴 b) {ϕ, {ϕ}, 𝐴}
37. If 𝐴 is a finite set having 𝑛 elements, then 𝑃(𝐴) has c) {ϕ, {ϕ}, {{ϕ}}, 𝐴} d) None of these
a) 2𝑛 elements b) 2𝑛 elements 48. 𝑥
Let 𝐴 = {(𝑥, 𝑦): 𝑦 = 𝑒 , 𝑥 ∈ 𝑅},
c) 𝑛 elements d) None of these 𝐵 = {(𝑥, 𝑦): 𝑦 = 𝑒 −𝑥 , 𝑥 ∈ 𝑅}. Then,
38. Let 𝐴 and 𝐵 have 3 and 6 elements respectively. a) 𝐴 ∩ 𝐵 = ϕ b) 𝐴 ∩ 𝐵 ≠ ϕ
What can be the minimum number of elements in
𝐴 ∪ 𝐵? c) 𝐴 ∪ 𝐵 = 𝑅 2 d) None of these
a) 3 b) 6 49. Let 𝐿 denote the set of all straight lines in a plane.
c) 9 d) 18 Let a relation 𝑅 be defined by 𝛼 𝑅 𝛽 ⇔ 𝛼 ⊥
39. Let 𝑅 be a reflexive relation on a set 𝐴 and 𝐼 be the 𝛽, 𝛼, 𝛽 ∈ 𝐿. Then 𝑅 is
identity relation on 𝐴. Then, a) Reflexive b) Symmetric
a) 𝑅 ⊂ 𝐼 b) 𝐼 ⊂ 𝑅 c) Transitive d) None of these
c) 𝑅 = 𝐼 d) None of these 50. If 𝐴, 𝐵 and 𝐶 are three sets such that 𝐴 ∩ 𝐵 = 𝐴 ∩
40. If 𝐴1 , 𝐴2 , … , 𝐴100 are sets such that 𝑛(𝐴𝑖 ) = 𝑖 + 𝐶and 𝐴 ∪ 𝐵 = 𝐴 ∪ 𝐶, then
2, 𝐴1 ⊂ 𝐴2 ⊂ 𝐴3 … ⊂ 𝐴100 and ⋂100 𝑖=3 𝐴𝑖 = 𝐴, then a) 𝐴 = 𝐶 b) 𝐵 = 𝐶
𝑛(𝐴) = c) 𝐴 ∩ 𝐵 = ϕ d) 𝐴 = 𝐵
a) 3 b) 4 51. Let 𝑆 = {1, 2, 3, 4}. The total number of unordered
c) 5 d) 6 pairs of disjoint subsets of 𝑆 is equal to
41. If 𝐴 and 𝐵 are two given sets, then 𝐴 ∩ (𝐴 ∩ 𝐵)𝑐 is a) 25 b) 34
equal to c) 42 d) 41
a) 𝐴 b) 𝐵 52. 2 2
If 𝐴 = {(𝑥, 𝑦): 𝑥 + 𝑦 = 4; 𝑥, 𝑦 ∈ 𝑅} and
c) Φ d) 𝐴 ∩ 𝐵𝑐 𝐵 = {(𝑥, 𝑦): 𝑥 2 + 𝑦 2 = 9; 𝑥, 𝑦 ∈ 𝑅}, then
42. If a set has 13 elements and 𝑅 is a reflexive relation a) 𝐴 − 𝐵 = ϕ b) 𝐵 − 𝐴 = 𝐵
on 𝐴 with 𝑛 elements, then c) 𝐴 ∩ 𝐵 ≠ ϕ d) 𝐴 ∩ 𝐵 = 𝐴
a) 13 ≤ 𝑛 ≤ 26 b) 0 ≤ 𝑛 ≤ 26 53. Let 𝑛(𝒰) = 700, 𝑛(𝐴) = 200, 𝑛(𝐵) = 300 and
c) 13 ≤ 𝑛 ≤ 169 d) 0 ≤ 𝑛 ≤ 169 𝑛(𝐴 ∩ 𝐵) = 100. Then, 𝑛(𝐴𝑐 ∩ 𝐵𝑐 ) =
43. Let 𝑋 be the set of all engineering colleges in a state a) 400 b) 600
of Indian Republic and 𝑅 be a relation on 𝑋 defined c) 300 d) 200
as two colleges are related iff they are affiliated to 54.
1
If 𝐴 = {θ ∶ cos θ > − 2 , 0 ≤ θ ≤ π} and
the same university, then 𝑅 is 1 π
a) Only reflexive b) Only symmetric 𝐵 = {θ ∶ sin θ > , ≤ θ ≤ π}, then
2 3
 a) 𝐴 ∩ 𝐵 = {θ ∶ π/3 ≤ θ ≤ 2π/3} 62. Two finite sets have 𝑚 and 𝑛 elements. The total
b) 𝐴 ∩ 𝐵 = {θ ∶ −π/3 ≤ θ ≤ 2π/3} number of subsets of the first set is 56 more than
c) 𝐴 ∪ 𝐵 = {θ: −5π/6 ≤ θ ≤ 5π/6} the total number of subsets of the second set. The
d) 𝐴 ∪ 𝐵 = {θ ∶ 0 ≤ θ ≤ π/6} values of 𝑚 and 𝑛 are
a) 𝑚 = 7, 𝑛 = 6 b) 𝑚 = 6, 𝑛 = 3
c) 𝑚 = 5, 𝑛 = 1 d) 𝑚 = 8, 𝑛 = 7

55. In a set of ants in a locality, two ants are said to be

related iff they walk on a same straight line, then
the relation is 63. Let 𝐴 be the set of all animals. A relation 𝑅 is
a) Reflexive and symmetric defined as "𝑎𝑅𝑏 iff 𝑎 and 𝑏 are in different
b) Symmetric and transitive zoological parks”. Then 𝑅 is
c) Reflexive and transitive a) Only reflexive b) Only symmetric
d) Equivalence c) Only transitive d) Equivalence
56. If 𝐴 = {1, 2, 3}, 𝐵 = {𝑎, 𝑏}, then 𝐴 × 𝐵 mapped 𝐴 to 64. Let 𝑋 and 𝑌 be the sets of all positive divisors of
𝐵is 400 and 1000 respectively (including 1 and the
a) {(1, 𝑎), (2, 𝑏), (3, 𝑏)} number). Then, 𝑛(𝑋 ∩ 𝑌) is equal to
b) {(1, 𝑏), (2, 𝑎)} a) 4 b) 6
c) {(1, 𝑎), (1, 𝑏), (2, 𝑎), (2, 𝑏), (3, 𝑎), (3, 𝑏)} c) 8 d) 12
d) {(1, 𝑎), (2, 𝑎), (2, 𝑏), (3, 𝑏)} 65. Let 𝑅 be a relation from a set 𝐴 to a set 𝐵, then
57. If 𝐴𝑛 is the set of first 𝑛 prime numbers, a) 𝑅 = 𝐴 ∪ 𝐵 b) 𝑅 = 𝐴 ∩ 𝐵
then⋃10𝑛=2 𝐴𝑛 = c) 𝑅 ⊆ 𝐴 × 𝐵 d) 𝑅 ⊆ 𝐵 × 𝐴
a) {2,3,5,7,11,13,17,19} 66. If 𝑋 and 𝑌 are two sets, then 𝑋 ∩ (𝑌 ∪ 𝑋)′ equals
b) {2,3,5,7,11,13,17,19,23,29} a) 𝑋 b) 𝑌
c) {3,5} d) {2,3} c) ϕ d) None of these
58. If 𝐴 = {4, 6, 10, 12} and 𝑅 is a relation defined on 𝐴 67. If 𝐴 = {1, 2, 3, 4, 5, 6}, then how many subsets of 𝐴
as “two elements are related iff they have exactly contain the elements 2, 3 and 5?
one common factor other than 1”. Then the relation a) 4 b) 8
𝑅 is c) 16 d) 32
a) Antisymmetric b) Only transitive 68. For any three sets 𝐴1 , 𝐴2 , 𝐴3 , let 𝐵1 = 𝐴1 , 𝐵2 = 𝐴2 −
c) Only symmetric d) Equivalence 𝐴1 and 𝐵3 = 𝐴3 − (𝐴1 ∪ 𝐴2 ), then which one of
59. If 𝑅 is a relation from a set 𝐴 to a set 𝐵 and 𝑆 is a the following statement is always true
relation from 𝐵 to a set 𝐶, then the relation 𝑆𝑜𝑅 a) 𝐴1 ∪ 𝐴2 ∪ 𝐴3 ⊃ 𝐵1 ∪ 𝐵2 ∪ 𝐵3
a) Is from 𝐴 to 𝐶 b) Is from 𝐶 to 𝐴 b) 𝐴1 ∪ 𝐴2 ∪ 𝐴3 = 𝐵1 ∪ 𝐵2 ∪ 𝐵3
c) 𝐴1 ∪ 𝐴2 ∪ 𝐴3 ⊂ 𝐵1 ∪ 𝐵2 ∪ 𝐵3
c) Does not exist d) None of these d) None of these
60. Let 𝑛 be a fixed positive integer. Define a relation 𝑅 69. If 𝐴 is a non-empty set, then which of the
on the set 𝑍 of integers by, 𝑎 𝑅 𝑏 ⇔ 𝑛 | 𝑎 − 𝑏. following is false?
Then, 𝑅 is not 𝑝 ∶ There is at least one reflexive relation on 𝐴
a) Reflexive b) Symmetric 𝑞 ∶ There is at least one symmetric relation on 𝐴
c) Transitive d) None of these a) 𝑝 alone b) 𝑞 alone
61. If 𝑛(𝐴𝑖 ) = 𝑖 + 1 and 𝐴1 ⊂ 𝐴2 ⊂ 𝐴3 ⊂ ⋯ ⊂ 𝐴99 , then c) Both 𝑝 and 𝑞 d) Neither 𝑝 nor 𝑞
99
𝑛(⋃𝑖=1 𝐴𝑖 ) = 70. In an election, two contestants 𝐴 and 𝐵 contested
a) 99 b) 98 𝑥% of the total voters voted for 𝐴 and (𝑥 + 20)%
c) 100 d) 101 for 𝐵. If 20% of the voters did not vote, then 𝑥 =
a) 30 b) 25
 c) 40 d) 35 c) {𝑥 ∶ 𝑥 ≠ 𝑥} d) {𝑥 ∶ 𝑥 = 𝑥}
71. Let 𝐴 = {1,2,3,4}, and let 𝑅 = 79. Let 𝐴 be a set represented by the squares of natural
{(2,2), (3,3), (4,4), (1,2)} be a relation on 𝐴. number and 𝑥, 𝑦 are any two elements of 𝐴. Then,
Then, 𝑅 is a) 𝑥 − 𝑦 ∈ 𝐴 b) 𝑥𝑦 ∈ 𝐴
𝑥
a) Reflexive b) Symmetric c) 𝑥 + 𝑦 ∈ 𝐴 d) 𝑦 ∈ 𝐴
c) Transitive d) None of these
80. Let 𝐴1 , 𝐴2 , 𝐴3 … , 𝐴100 be 100 sets such that 𝑛(𝐴𝑖 ) =
72. In a rehabilitation programme, a group of 50
𝑖 + 1 and 𝐴1 ⊂ 𝐴2 ⊂ 𝐴3 ⊂ ⋯ ⊂ 𝐴100 , then ⋃100 𝑖=1 𝐴𝑖
families were assured new houses and
contains… elements
compensation by the government. Number of
a) 99 b) 100
families who got both is equal to the number of
c) 101 d) 102
families who got neither of the two. The number of
81. In a certain town 25% families own a cell phone,
families who got new houses is 6 greater than the
15% families own a scooter and 65% families
number of families who got compensation. How
own neither a cell phone nor a scooter. If 1500
many families got houses?
families own both a cell phone and a scooter,
a) 22 b) 28
then the total number of families in the town is
c) 23 d) 25
a) 10000 b) 20000
73. Let 𝒰 be the universal set for sets 𝐴 and 𝐵 such that
c) 30000 d) 40000
𝑛(𝐴) = 200, 𝑛(𝐵) = 300 and 𝑛(𝐴 ∩ 𝐵) = 100. Then,
82. If 𝐴, 𝐵 and 𝐶 are three non-empty sets such that
𝑛(𝐴′ ∩ 𝐵′) is equal to 300, provided that 𝑛( 𝒰) is
any two of them are disjoint, then (𝐴 ∪ 𝐵 ∪ 𝐶) ∩
equal to
(𝐴 ∩ 𝐵 ∩ 𝐶) =
a) 600 b) 700
a) 𝐴 b) 𝐵
c) 800 d) 900
c) 𝐶 d) ϕ
74. An integer 𝑚 is said to be related to another integer
83. If 𝑅 = {(𝑎, 𝑏): 𝑎 + 𝑏 = 4} is a relation on 𝑁, then
𝑛 if 𝑚 is a multiple of 𝑛. Then, the relation is
𝑅 is
a) Reflexive and symmetric
a) Reflexive b) Symmetric
b) Reflexive and transitive
c) Antisymmetric d) Transitive
c) Symmetric and transitive
84. The shaded region in the figure represents
d) Equivalence relation
75. Three sets 𝐴, 𝐵, 𝐶are such that 𝐴 = 𝐵 ∩ 𝐶 and 𝐵 =
𝐶 ∩ 𝐴, then
a) 𝐴 ⊂ 𝐵 b) 𝐴 ⊃ 𝐵
c) 𝐴 ≡ 𝐵 d) 𝐴 ⊂ 𝐵′
76. Let 𝑅 be a relation on the set 𝑁 of natural numbers
defined by 𝑛𝑅𝑚 ⇔ 𝑛 is a factor of 𝑚(i. e. 𝑛 | 𝑚). a) 𝐴 ∩ 𝐵 b) 𝐴 ∪ 𝐵
Then, 𝑅 is c) 𝐵 − 𝐴 d) (𝐴 − 𝐵) ∪ ( 𝐵 − 𝐴)
a) Reflexive and symmetric 85. Let 𝑋 = {1, 2, 3, 4, 5} and 𝑌 = {1, 3, 5, 7, 9}. Which
b) Transitive and symmetric of the following is/are not relations from 𝑋 to 𝑌?
c) Equivalence a) 𝑅1 = {(𝑥, 𝑦)|𝑦 = 2 + 𝑥, 𝑥 ∈ 𝑋, 𝑦 ∈ 𝑌}
d) Reflexive, transitive but not symmetric b) 𝑅2 = {(1,1), (2,1), (3,3), (4,3), (5,5)}
c) 𝑅3 = {(1,1), (1,3), (3,5), (3,7), (5,7)}
77. If 𝑎 𝑁 = {𝑎 𝑥 ∶ 𝑥 ∈ 𝑁} and 𝑏 𝑁 ∩ 𝑐 𝑁 = 𝑑 𝑁, where d) 𝑅4 = {(1,3), (2,5), (2,4), (7,9)}
𝑏, 𝑐 ∈ 𝑁 are relatively prime, then 86. Given the relation 𝑅 = {(1,2), (2,3)} on the set
a) 𝑑 = 𝑏𝑐 b) 𝑐 = 𝑏𝑑 𝐴 = {1,2,3}, the minimum number of ordered
c) 𝑏 = 𝑐𝑑 d) None of these pairs which when added to 𝑅 make it an
78. In rule method the null set is represented by equivalence relation is
a) { } b) Φ a) 5 b) 6
 c) 7 d) 8 a) Symmetric
87. If sets 𝐴 and 𝐵 are defined as b) Antisymmetric
1
𝐴 = {(𝑥, 𝑦): 𝑦 = 𝑥 , 0 ≠ 𝑥 ∈ 𝑅}, c) Symmetric and antisymmetric
d) Neither symmetric nor antisymmetric
𝐵 = {(𝑥, 𝑦): 𝑦 = −𝑥, 𝑥 ∈ 𝑅}, then
(𝑛+2)(2𝑛5 +3𝑛4 +4𝑛3 +5𝑛2 +6)
a) 𝐴 ∩ 𝐵 = 𝐴 b) 𝐴 ∩ 𝐵 = 𝐵 96. If 𝐴 = {𝑝: 𝑝 = 𝑛2 +2𝑛
, 𝑛, 𝑝 ∈ Z+ }
c) 𝐴 ∩ 𝐵 = ϕ d) None of these then the number of elements in the set 𝐴, is
88. Let 𝑅 be an equivalence relation on a finite set 𝐴 a) 2 b) 3
having 𝑛 elements. Then, the number of ordered c) 4 d) 6
pairs in 𝑅 is 97. If 𝐴 = {𝑥 ∶ 𝑥 is a multiple of 3} and,
a) Less than 𝑛 𝐵 = {𝑥 ∶ 𝑥 is a multiple of 5}, then 𝐴 − 𝐵 is
b) Greater than or equal to 𝑛 a) 𝐴̅ ∩ 𝐵 b) 𝐴 ∩ 𝐵̅
c) Less than or equal to 𝑛 ̅
c) 𝐴 ∩ 𝐵̅ d) ̅̅̅̅̅̅̅
𝐴∩𝐵
d) None of these 98. An investigator interviewed 100 students to
89. If 𝐴1 ⊂ 𝐴2 ⊂ 𝐴3 ⊂ ⋯ ⊂ 𝐴50 and 𝑛(𝐴𝑖 ) = 𝑖 − 1, then determine the performance of three drinks milk,
𝑛(⋂50 𝑖=11 𝐴𝑖 ) = coffee and tea. The investigator reported that 10
a) 49 b) 50 students take all three drinks milk, coffee and tea;
c) 11 d) 10 20 students take milk and coffee, 30 students
90. If 𝑎 𝑁 = {𝑎 𝑥 ∶ 𝑥 ∈ 𝑁} and 𝑏 𝑁 ∩ 𝑐 𝑁 = 𝑑 𝑁, where take coffee and tea, 25 students take mile and tea,
𝑏, 𝑐 ∈ 𝑁 then 12 students take milk only, 5 students take coffee
a) 𝑑 = 𝑏𝑐 b) 𝑐 = 𝑏𝑑 only and 8 students take tea only. Then, the
c) 𝑏 = 𝑐𝑑 d) None of these number of students who did not take any of the
91. 𝑋 is the set of all residents in a colony and 𝑅 is a three drinks, is
relation defined on 𝑋 as follows: a) 10 b) 20
“Two persons are related iff they speak the same c) 25 d) 30
language”The relation 𝑅 is 99. Consider the following statements:
a) Only symmetric (i) Every reflexive relation is antisymmetric
b) Only reflexive (ii) Every symmetric relation is antisymmetric
c) Both symmetric and reflexive but not transitive Which one among (i) and (ii) is true?
d) Equivalence a) (i) alone is true
92. If 𝑆 is a set with 10 elements and 𝐴 = {(𝑥, 𝑦): 𝑥, 𝑦 ∈ b) (ii) alone is true
𝑆, 𝑥 ≠ 𝑦}, then the number of elements in 𝐴 is c) Both (i) and (ii) true
a) 100 b) 90 d) Neither (i) and (ii) is true
c) 50 d) 45 100. Given 𝑛(𝑈) = 20, 𝑛(𝐴) = 12, 𝑛(𝐵) = 9, 𝑛(𝐴 ∩ 𝐵)
93. Let 𝐴 = {ONGC, BHEL, SAIL, GAIL, IOCL} and 𝑅 be a = 4, where 𝑈 is the universal set, 𝐴 and 𝐵 are
relation defined as “two elements of 𝐴 are related if subsets of 𝑈, then 𝑛[(𝐴 ∪ 𝐵)𝑐 ] equals to
they share exactly one letter”. The relation 𝑅 is a) 10 b) 9
a) Anti-symmetric b) Only transitive c) 11 d) 3
c) Only symmetric d) Equivalence
94. The finite sets 𝐴 and 𝐵 have 𝑚 and 𝑛 elements
respectively. if the total number of subsets of 𝐴 is ANSWER KEY :-
112 more than the total number of subsets of 𝐵,
then the volume of 𝑚 is 1) b 2) d 3) c 4) a
a) 7 b) 9 5) a 6) d 7) a 8) a
c) 10 d) 12 9) d 10) b 11) d 12) d
95. Let 𝑅 = {(𝑎, 𝑎)} be a relation on a set 𝐴. Then, 𝑅 is 13) d 14) c 15) a 16) b
17) d 18) c 19) c 20) b4 (a)
21) c 22) b 23) d 24) aLet 𝐴 = {𝑛(𝑛 + 1)(2𝑛 + 1): 𝑛 ∈ 𝑍}
25) b 26) c 27) c 28) aPutting 𝑛 = ±1, ±2, … ., we get 𝐴 = {… −
29) d 30) c 31) d 32) c30, −6, 0, 6, 30, … }
33) a 34) b 35) b 36) c⇒ {𝑛(𝑛 + 1)(2𝑛 + 1): 𝑛 ∈ 𝑍} ⊂ {6𝑘: 𝑘 ∈ 𝑍}
37) b 38) b 39) b 40) c5 (a)
41) d 42) c 43) d 44) a∵ 𝐴 ∪ 𝐵 = {1, 2, 3, 4, 5, 6}
45) a 46) b 47) c 48) b∴ (𝐴 ∪ 𝐵) ∩ 𝐶 = {1, 2, 3, 4, 5, 6} ∩ {3, 4, 6}
49) b 50) b 51) d 52) b= {3, 4, 6}
53) c 54) a 55) d 56) c6 (d)
57) b 58) c 59) a 60) dWe have,
61) c 62) b 63) b 64) d𝑛(𝐴 ∩ 𝐵̅) = 9, 𝑛(𝐴̅ ∩ 𝐵) = 10 and 𝑛(𝐴 ∪ 𝐵) = 24
65) c 66) c 67) b 68) a⇒ 𝑛(𝐴) − 𝑛(𝐴 ∩ 𝐵) = 9, 𝑛(𝐵) − 𝑛(𝐴 ∩ 𝐵) = 10 and,
69) d 70) a 71) c 72) b𝑛(𝐴) + 𝑛(𝐵) − 𝑛(𝐴 ∩ 𝐵) = 24
73) b 74) b 75) c 76) d⇒ 𝑛(𝐴) + 𝑛(𝐵) − 2𝑛(𝐴 ∩ 𝐵) = 19 and 𝑛(𝐴) + 𝑛(𝐵) −
77) a 78) c 79) b 80) c𝑛(𝐴 ∩ 𝐵) = 24
81) c 82) d 83) b 84) d⇒ 𝑛(𝐴 ∩ 𝐵) = 5
85) d 86) c 87) c 88) b∴ 𝑛(𝐴) = 14 and 𝑛(𝐵) = 15
89) d 90) d 91) d 92) bHence, 𝑛(𝐴 × 𝐵) = 14 × 15 = 210
93) c 94) a 95) c 96) c7 (a)
97) b 98) b 99) d 100) dClearly, 𝑃 ⊂ 𝑇
∴𝑃∩𝑇 =𝑃
8 (a)
HINTS AND SOLUTIONS It is given that 𝐴 is a proper subset of 𝐵
∴ 𝐴 − 𝐵 = ϕ ⇒ 𝑛(𝐴 − 𝐵) = 0
1 (b) We have, 𝑛(𝐴) = 5. So, minimum number of elements
For any 𝑎 ∈ 𝑅, we have 𝑎 ≥ 𝑎 in 𝐵 is 6
Therefore, the relation 𝑅 is reflexive. Hence, the minimum possible value of 𝑛(𝐴 Δ 𝐵) is
𝑅 is not symmetric as (2,1) ∈ 𝑅 but (1,2) ∉ 𝑅. The 𝑛(𝐵) − 𝑛(𝐴) = 6 − 5 = 1
relation 𝑅 is transitive also, because (𝑎, 𝑏) ∈ 𝑅, (𝑏, 𝑐) ∈ 9 (d)
𝑅 imply that 𝑎 ≥ 𝑏 and 𝑏 ≥ 𝑐 which in turn imply that ∵ 𝑛(𝐴 × 𝐵 × 𝐶) = 𝑛(𝐴) × 𝑛(𝐵) × 𝑛(𝐶)
𝑎≥𝑐 24
∴ 𝑛(𝐶) = =2
2 (d) 4×3
Clearly, 𝑅 is an equivalence relation 10 (b)
3 (c) Use 𝑛(𝐴 ∪ 𝐵) = 𝑛(𝐴) + 𝑛(𝐵) − 𝑛(𝐴 ∩ 𝐵)
Let 𝑀 and 𝐸 denote the sets of students who have taken 11 (d)
2 2
Mathematics and Economics respectively. Then, we have ∵ 𝐴 = {(𝑎, 𝑏): 𝑎 + 3𝑏 = 28, 𝑎, 𝑏 ∈ 𝑍}
𝑛(𝑀 ∪ 𝐸) = 35, 𝑛(𝑀) = 17 and 𝑛(𝑀 ∩ 𝐸 ′ ) = 10 ={(5, 1), (-5, -1), (5, -1), (-5, 1), (1, 3), (-1, -3), (-1, 3),
Now, (1, -3), (4, 2), (-4, -2), (4, -2), (-4, 2)}
𝑛(𝑀 ∩ 𝐸 ′ ) = 𝑛(𝑀) − 𝑛(𝑀 ∩ 𝐸) And 𝐵 = {(𝑎, 𝑏): 𝑎 > 𝑏, 𝑎, 𝑏 ∈ 𝑍}
⇒ 10 = 17 − 𝑛(𝑀 ∩ 𝐸) ⇒ 𝑛(𝑀 ∩ 𝐸) = 7 ∴ 𝐴∩𝐵
Now, = {(−1, −5), (1, −5), (−1, −3), (1, −3), (4, 2), (4, −2)}
𝑛(𝑀 ∪ 𝐸) = 𝑛(𝑀) + 𝑛(𝐸) − 𝑛(𝑀 ∩ 𝐸) ∴ Number of elements in 𝐴 ∩ 𝐵 is 6.
⇒ 35 = 17 + 𝑛(𝐸) − 7 ⇒ 𝑛(𝐸) = 25 13 (d)
′)
∴ 𝑛(𝐸 ∩ 𝑀 = 𝑛(𝐸) − 𝑛(𝐸 ∩ 𝑀) = 25 − 7 = 18 We have
𝑅 = {(1,39), (2,37), (3,35), (4,33), (5,31), (6,29),
(7,27), (8,25), (9,23), (10,21), (11,19), (12,17), 22 (b)
(13,15), (14,13), (15,11), (16,9), (17,7), (18,5), We have,
(19,3), (20,1)} 𝑛(𝐴 × 𝐵) = 45
Since (1,39) ∈ 𝑅, but (39,1) ∉ 𝑅 ⇒ 𝑛(𝐴) × 𝑛(𝐵) = 45
Therefore, 𝑅 is not symmetric ⇒ 𝑛(𝐴) and 𝑛(𝐵) are factors of 45 such that their
Clearly, 𝑅 is not reflexive. Now, (15,11) ∈ 𝑅 and product is 45
(11,19) ∈ 𝑅 but (15,19) ∉ 𝑅 Hence, 𝑛(𝐴) cannot be 17
So, 𝑅 is not transitive 24 (a)
14 (c) For any 𝑥 ∈ 𝑅, we have
Total number of employees = 7𝑥 i.e. a multiple of 7. 𝑥 − 𝑥 + √2 = √2 an irrational number
Hence, option (c) is correct ⇒ 𝑥 𝑅 𝑥 for all 𝑥
So, 𝑅 is reflexive
𝑅 is not symmetric, because √2 𝑅 1 but 1 √2
𝑅 is not transitive also because √2 𝑅 1 and 1 𝑅 2 √2 but
√2 2√2
25 (b)
We have,
15 (a)
𝑛(𝐻) − 𝑛(𝐻 ∩ 𝐸) = 22, 𝑛(𝐸) − 𝑛(𝐻 ∩ 𝐸) = 12, 𝑛(𝐻 ∪ 𝐸)
The power set of a set containing 𝑛 elements has 2𝑛
= 45
elements.
∴ 𝑛(𝐻 ∪ 𝐸) = 𝑛(𝐻) + 𝑛(𝐸) − 𝑛(𝐻 ∩ 𝐸)
Clearly, 2𝑛 cannot be equal to 26
⇒ 45 = 22 + 12 + 𝑛(𝐻 ∪ 𝐸)
16 (b)
⇒ 𝑛(𝐻 ∩ 𝐸) = 11
The relation is not symmetric, because 𝐴 ⊂ 𝐵 does not
26 (c)
imply that 𝐵 ⊂ 𝐴. But, it is anti-symmetric because
We have, 𝐴 ⊂ 𝐵 and 𝐵 ⊂ 𝐶
𝐴 ⊂ 𝐵 and 𝐵 ⊂ 𝐴 ⇒ 𝐴 = 𝐵
∴ 𝐴 ∪ 𝐵 = 𝐵 and 𝐵 ∩ 𝐶 = 𝐵
18 (c)
⇒𝐴∪𝐵 =𝐵∩𝐶
We have, 𝐴 ⊃ 𝐵 ⊃ 𝐶
27 (c)
∴ 𝐴 ∪ 𝐵 ∪ 𝐶 = 𝐴 and 𝐴 ∩ 𝐵 ∩ 𝐶 = 𝐶 2𝑥−1
⇒ (𝐴 ∪ 𝐵 ∪ 𝐶) − (𝐴 ∩ 𝐵 ∩ 𝐶) = 𝐴 − 𝐶 Let 𝐴 = {𝑥 ∈ 𝑅: 𝑥 3 +4𝑥2 +3𝑥}
19 (c) Now, 𝑥 3 + 4𝑥 2 + 3𝑥 = 𝑥(𝑥 2 + 4𝑥 + 3)
Given, 𝑛(𝐶) = 63, 𝑛(𝐴) = 76 and 𝑛(𝐶 ∩ 𝐴) = 𝑥 = 𝑥(𝑥 + 3)(𝑥 + 1)
We know that, ∴ 𝐴 = 𝑅 − {0, −1, −3}
𝑛(𝐶 ∪ 𝐴) = 𝑛(𝐶) + 𝑛(𝐴) − 𝑛(𝐶 ∩ 𝐴) 29 (d)
⇒ 100 = 63 + 76 − 𝑥 ⇒ 𝑥 = 139 − 100 = 39 Clearly, 𝑦 2 = 𝑥 and 𝑦 = |𝑥| intersect at (0,0), (1,1) and
And 𝑛(𝐶 ∩ 𝐴) ≤ 𝑛(𝐶) (−1, −1). Hence, option (d) is correct
⇒ 𝑥 ≤ 63 ∴ 39 ≤ 𝑥 ≤ 63 31 (d)
20 (b) Let 𝑀, 𝑃 and 𝐶 be the sets of students taking
We have, examinations in Mathematics, Physics and Chemistry
𝑋 = Set of some multiple of 9 respectively.
and, 𝑌 = Set of all multiple of 9 We have,
∴𝑋 ⊂𝑌 ⇒𝑋∪𝑌 =𝑌 𝑛(𝑀 ∪ 𝑃 ∪ 𝐶) = 50, 𝑛(𝑀) = 37, 𝑛(𝑃) = 24, 𝑛(𝐶) = 43
21 (c) 𝑛(𝑀 ∩ 𝑃) < 19, 𝑛(𝑀 ∩ 𝐶) ≤ 29, 𝑛(𝑃 ∩ 𝐶) ≤ 20
𝐴 ∩ 𝐵 = {𝑥: 𝑥 a multiple of 3}and {𝑥: 𝑥 is a multiple of 5} Now,
= {𝑥: 𝑥 is a multiple of 15} 𝑛(𝑀 ∪ 𝑃 ∪ 𝐶) = 𝑛(𝑀) + 𝑛(𝑃) + 𝑛(𝐶) − 𝑛(𝑀 ∩ 𝑃)
= {15, 30, 45, … … … . } −𝑛(𝑀 ∩ 𝐶) − 𝑛(𝑃 ∩ 𝐶) + 𝑛 (𝑀 ∩ 𝑃 ∩ 𝐶)
⇒ 50 = 37 + 24 + 43 − {𝑛(𝑀 ∩ 𝑃) + 𝑛(𝑀 ∩ 𝐶) + 𝑛(𝑃 100

∩ 𝐶)} ∴ ⋃ 𝐴𝑖 = 𝐴 ⇒ 𝐴3 = 𝐴 ⇒ 𝑛(𝐴) = 𝑛(𝐴3 ) = 3 + 2 = 5

+𝑛(𝑀 ∩ 𝑃 ∩ 𝐶) 𝑖=3

⇒ 𝑛(𝑀 ∩ 𝑃 ∩ 𝐶) 41 (d)
= 𝑛(𝑀 ∩ 𝑃) + 𝑛(𝑀 ∩ 𝐶) + 𝑛(𝑃 ∩ 𝐶) We have,
− 54 𝐴 ∩ (𝐴 ∩ 𝐵)𝑐 = 𝐴 ∩ (𝐴𝑐 ∪ 𝐵𝑐 )
⇒ 𝑛(𝑀 ∩ 𝑃) + 𝑛(𝑀 ∩ 𝐶) + 𝑛(𝑃 ∩ 𝐶) ⇒ 𝐴 ∩ (𝐴 ∩ 𝐵)𝑐 = (𝐴 ∩ 𝐴𝑐 ) ∪ (𝐴 ∩ 𝐵𝑐 )
= 𝑛(𝑀 ∩ 𝑃 ∩ 𝐶) + 54 …(i) ⇒ 𝐴 ∩ (𝐴 ∩ 𝐵)𝑐 = ϕ ∪ (𝐴 ∩ 𝐵𝑐 ) = 𝐴 ∩ 𝐵𝑐
Now, 42 (c)
𝑛(𝑀 ∩ 𝑃) ≤ 19, 𝑛(𝑀 ∩ 𝐶) ≤ 29, 𝑛(𝑃 ∩ 𝐶) ≤ 20 Since 𝑅 is a reflexive relation on 𝐴.
⇒ 𝑛(𝑀 ∩ 𝑃) + 𝑛(𝑀 ∩ 𝐶) + 𝑛(𝑃 ∩ 𝐶) ≤ 19 + 29 + 20 ∴ (𝑎, 𝑎) ∈ 𝑅 for all 𝑎 ∈ 𝐴
[Using (i)] ⇒ 𝑛(𝐴) ≤ 𝑛(𝑅) ≤ 𝑛(𝐴 × 𝐴) ⇒ 13 ≤ 𝑛(𝑅) ≤ 169
⇒ 𝑛(𝑀 ∩ 𝑃 ∩ 𝐶) + 54 ≤ 68 43 (d)
⇒ 𝑛(𝑀 ∩ 𝑃 ∩ 𝐶) ≤ 14 Clearly, 𝑅 is reflexive symmetric and transitive. So, it is
33 (a) an equivalence relation
Given, 𝑛(𝑁) = 12, 𝑛(𝑃) = 16, 𝑛(𝐻) = 18, 44 (a)
𝑛(𝑁 ∪ 𝑃 ∪ 𝐻) = 30 We have,
And 𝑛(𝑁 ∩ 𝑃 ∩ 𝐻) = 0 Required number of families
Now, 𝑛(𝑁 ∪ 𝑃 ∪ 𝐻) = 𝑛(𝑁) + 𝑛(𝑃) + 𝑛(𝐻) = 𝑛(𝐴′ ∩ 𝐵′ ∩ 𝐶′)
−𝑛(𝑁 ∩ 𝑃) − 𝑛(𝑃 ∩ 𝐻) − 𝑛(𝐻 ∩ 𝑁) = 𝑛(𝐴 ∪ 𝐵 ∪ 𝐶)′
+𝑛(𝑁 ∩ 𝑃 ∩ 𝐻) = 𝑁 − 𝑛(𝐴 ∪ 𝐵 ∪ 𝐶)
⇒ 𝑛(𝑁 ∩ 𝑃) + 𝑛(𝑃 ∩ 𝐻) + 𝑛(𝐻 ∩ 𝑁) = 10000 − {𝑛(𝐴) + 𝑛(𝐵) + 𝑛(𝐶) − 𝑛(𝐴 ∩ 𝐵)}
= (12 + 16 + 18) − 30 −𝑛(𝐵 ∩ 𝐶) − 𝑛(𝐴 ∩ 𝐶) + 𝑛(𝐴 ∩ 𝐵 ∩ 𝐶)}
= 46 − 30 = 16 = 10000 − 4000 − 2000 − 1000 + 500 + 300 + 400
35 (b) − 200
The void relation 𝑅 on 𝐴 is not reflexive as (𝑎, 𝑎) ∉ 𝑅 for = 4000
any 𝑎 ∈ 𝐴. The void relation is symmetric and transitive 45 (a)
36 (c) We have,
Given, 𝐴's are 30 sets with five elements each, so 𝐴 ⊂ 𝐴∪𝐵
∑30 ⇒ 𝐴 ∩ (𝐴 ∪ 𝐵) = 𝐴
𝑖=1 𝑛(𝐴𝑖 ) = 5 × 30 = 150 ...(i)
46 (b)
If the 𝑚 distinct elements in 𝑆 and each elements of 𝑆
We have,
belongs to exactly 10 of the 𝐴𝑖 's, then
(𝐴 ∪ 𝐵) ∩ 𝐵′ = 𝐴
∑30
𝑖=1 𝑛(𝐴𝑖 ) = 10𝑚 ...(ii)
∴ ((𝐴 ∪ 𝐵) ∩ 𝐵′ ) ∪ 𝐴′ = 𝐴 ∪ 𝐴′ = 𝑁
From Eqs. (i) and (ii), 𝑚 = 15
48 (b)
Similarly, ∑𝑛𝑗=1 𝑛(𝐵𝑗 ) = 3𝑛 and ∑𝑛𝑗=1 𝑛(𝐵𝑗 ) = 9𝑚
The set 𝐴 consists of all points on 𝑦 = 𝑒 𝑥 and the set 𝐵
∴ 3𝑛 = 9𝑚
consists of points on 𝑦 = 𝑒 −𝑥 , these two curves intersect
9𝑚
⇒ 𝑛= = 3 × 15 = 45 at (0, 1). Hence, 𝐴 ∩ 𝐵 consists of a single point
3
38 (b) 50 (b)
𝐴 ∪ 𝐵 will contain minimum number of elements if 𝐴 ⊂ Given, 𝐴 ∩ 𝐵 = 𝐴 ∩ 𝐶 and 𝐴 ∪ 𝐵 = 𝐴 ∪ 𝐶
𝐵 and in that case, we have ⇒ 𝐵=𝐶
𝑛(𝐴 ∪ 𝐵) = 𝑛(𝐵) = 6 51 (d)
40 (c) Required number
It is given that 𝐴1 ⊂ 𝐴2 ⊂ 𝐴3 ⊂ ⋯ ⊂ 𝐴100 34 + 1
= = 41
2
52 (b)
Clearly, 𝐴 is the set of all points on a circle with centre 61 (c)
S at the origin and radius 2 and 𝐵 is the set of all points It is given that
on a circle with centre at the origin and radius 3. The 𝐴1 ⊂ 𝐴2 ⊂ 𝐴3 … ⊂ 𝐴99
two circles do not intersect. Therefore, 999

𝐴∩𝐵 =ϕ⇒𝐵−𝐴=𝐵 ⋃ 𝐴𝑖 = 𝐴99

53 (c) 𝑖=1
99
We have,
⇒ 𝑛 (⋃ 𝐴𝑖 ) = 𝑛(𝐴99 ) = 99 + 1 = 100
𝑛(𝐴𝑐 ∩ 𝐵𝑐 )
𝑖=1
= 𝑛{(𝐴 ∪ 𝐵)𝑐 } 62 (b)
= 𝑛(𝒰) − 𝑛(𝐴 ∪ 𝐵) It is given that 2𝑚 − 2𝑛 = 56
= 𝑛(𝒰) − {𝑛(𝐴) + 𝑛(𝐵) − 𝑛(𝐴 ∩ 𝐵)} Obviously, 𝑚 = 6, 𝑛 = 3 satisfy the equation
= 700 − (200 + 300 − 100) = 300 63 (b)
54 (a) Clearly, (𝑎, 𝑎) ∈ 𝑅 for any 𝑎 ∈ 𝐴
We have, Also,
1
cos 𝜃 > − and 0 ≤ 𝜃 ≤ 𝜋 (𝑎, 𝑏) ∈ 𝑅
2 ⇒ 𝑎 and 𝑏 are in different zoological parks
⇒ 0 ≤ 𝜃 ≤ 2𝜋/3 and 0 ≤ 𝜃 ≤ 𝜋
⇒ 𝑏 and 𝑎 are in different zoological parks
2𝜋
⇒0≤𝜃≤ ⇒ 𝐴 = {𝜃: 0 ≤ 𝜃 ≤ 2𝜋/3} ⇒ (𝑏, 𝑎) ∈ 𝑅
3
Also, Now, (𝑎, 𝑏) ∈ 𝑅 and (𝑏, 𝑎) ∈ 𝑅 but (𝑎, 𝑎) ∉ 𝑅
1 So, 𝑅 is not transitive
sin 𝜃 > and 𝜋/3 ≤ 𝜃 ≤ 𝜋 64 (d)
2
𝜋 5𝜋 𝜋 5𝜋 𝑋 ∩ 𝑌 = {1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 200}
⇒ ≤𝜃≤ ⇒ 𝐵 = {𝜃: ≤ 𝜃 ≤ }
3 6 3 6 ∴ 𝑛(𝑋 ∩ 𝑌) = 12
𝜋 2𝜋 66 (c)
∴ 𝐴 ∩ 𝐵 = {𝜃: ≤ 𝜃 ≤ } and 𝐴 ∪ 𝐵
3 3 We have,
5𝜋 𝑋 ∩ (𝑌 ∪ 𝑋)′ = 𝑋 ∩ (𝑌 ′ ∩ 𝑋 ′ ) = (𝑋 ∩ 𝑋 ′ ) ∩ 𝑌 ′ = ϕ ∩ 𝑌 ′
= {𝜃: 0 ≤ 𝜃 ≤ }
6 =ϕ
55 (d)
67 (b)
Clearly, 𝑅 is an equivalence relation
The number of subsets of 𝐴 containing 2, 3 and 5 is
56 (c)
same as the number of subsets of set {1, 4, 6} which is
Given, 𝐴 = {1, 2, 3}, 𝐵 = {𝑎, 𝑏}
equal to 23 = 8
∴ 𝐴 × 𝐵 = {(1, 𝑎), (1, 𝑏), (2, 𝑎), (2, 𝑏), (3, 𝑎), (3, 𝑏)}
68 (a)
57 (b)
We have,
Clearly,
𝐵1 = 𝐴1 ⇒ 𝐵1 ⊂ 𝐴1
𝐴2 ⊂ 𝐴3 ⊂ 𝐴4 ⊂ ⋯ ⊂ 𝐴10
10
𝐵2 = 𝐴2 − 𝐴1 ⇒ 𝐵2 ⊂ 𝐴2
𝐵3 = 𝐴3 − (𝐴1 ∪ 𝐴2 ) ⇒ 𝐵3 ⊂ 𝐴3
∴ ⋃ 𝐴𝑛 = 𝐴10 = {2,3,5,7,11,13,17,19,23,29}
∴ 𝐵1 ∪ 𝐵2 ∪ 𝐵3 ⊂ 𝐴1 ∪ 𝐴2 ∪ 𝐴3
𝑛=2
58 (c) 69 (d)
Clearly, The identity relation on a set 𝐴 is reflexive and
𝑅 = {(4,6), (4,10), (6,4), (10,4)(6,10), (10,6), (10,12), symmetric both. So, there is always a reflexive and
(12,10)} symmetric relation on a set
Clearly, 𝑅 is symmetric 70 (a)
(6,10) ∈ 𝑅 and (10,12) ∈ 𝑅 but (6,12) ∉ 𝑅 Let the total number of voters be 𝑛. Then,
𝑛𝑥
So, 𝑅 is not transitive Number of voters voted for 𝐴 = 100
Also, 𝑅 is not reflexive
Number of voters voted for 𝐵 =
𝑛(𝑥+20) 76 (d)
100
Since 𝑛|𝑛 for all 𝑛 ∈ 𝑁. Therefore, 𝑅 is reflexive. Since
∴ Number of voters who voted for both
𝑛𝑥 𝑛(𝑥 + 20) 2|6 but 6 ∤ 2, therefore 𝑅 is not symmetric
= + Let 𝑛 𝑅 𝑚 and 𝑚 𝑅 𝑝
100 100
𝑛(2𝑥 + 20) ⇒ 𝑛 𝑅 𝑚 and 𝑚 𝑅 𝑝
= ⇒ 𝑛|𝑚 and 𝑚|𝑝 ⇒ 𝑛|𝑝 ⇒ 𝑛 𝑅 𝑝
100
𝑛(2𝑥 + 20) 20𝑛 So, 𝑅 is transitive
Hence, 𝑛 − = ⇒ 𝑥 = 30
100 100 77 (a)
71 (c) We have,
Since (1,1) ∉ 𝑅. So, 𝑅 is not reflexive 𝑏 𝑁 = {𝑏 𝑥|𝑥 ∈ N} = Set of positive integral multiples of
Now, (1,2) ∈ 𝑅 but, (2,1) ∉ 𝑅. Therefore, 𝑅 is not 𝑏
symmetric. 𝑐 𝑁 = {𝑐 𝑥|𝑥 ∈ 𝑁} = Set positive integral multiples of 𝑐
Clearly, 𝑅 is transitive ∴ 𝑏𝑁 ∩ 𝑐𝑁 = Set of positive integral multiples of 𝑏𝑐
72 (b) ⇒ 𝑏𝑁 ∩ 𝑐𝑁 = 𝑏𝑐 𝑁 [∵ 𝑏 and 𝑐 are prime]
Let 𝐴 and 𝐵 denote respectively the sets of families Hence, 𝑑 = 𝑏𝑐
who got new houses and compensation 79 (b)
It is given that Let 𝑥, 𝑦 ∈ 𝐴. Then,
𝑛(𝐴 ∩ 𝐵) = 𝑛(𝐴 ̅̅̅̅̅̅̅
∪ 𝐵) 𝑥 = 𝑚2 , 𝑦 = 𝑛2 for some 𝑚, 𝑛 ∈ 𝑁
⇒ 𝑛(𝐴 ∩ 𝐵) = 50 − 𝑛(𝐴 ∪ 𝐵) ⇒ 𝑥𝑦 = (𝑚𝑛)2 ∈ 𝐴
⇒ 𝑛(𝐴) + 𝑛(𝐵) = 50 80 (c)
⇒ 𝑛(𝐵) + 6 + 𝑛(𝐵) = 50 [∵ 𝑛(𝐴) = 𝑛(𝐵) + 6 (given)] We have,
⇒ 𝑛(𝐵) = 22 ⇒ 𝑛(𝐴) = 28 𝐴1 ⊂ 𝐴2 ⊂ 𝐴3 ⊂ ⋯ ⊂ 𝐴100
73 (b) 100 100

We have, ∴ ⋃ 𝐴𝑖 = 𝐴100 ⇒ 𝑛 (⋃ 𝐴𝑖 ) = 𝑛(𝐴100 ) = 101

𝑛(𝐴′ ∩ 𝐵′ ) = 𝑛((𝐴 ∪ 𝐵)′) 𝑖=1 𝑖=1

⇒ 𝑛(𝐴′ ∩ 𝐵′ ) = 𝑛(𝒰) − 𝑛(𝐴 ∪ 𝐵) 81 (c)

⇒ 𝑛(𝐴′ ∩ 𝐵′ ) = 𝑛(𝒰) − {𝑛(𝐴) + 𝑛(𝐵) − 𝑛(𝐴 ∩ 𝐵)} Let the total population of town be 𝑥.
⇒ 300 = 𝑛 (𝒰) − {200 + 300 − 100}
⇒ 𝑛(𝒰) = 700
74 (b)
For any integer 𝑛, we have
𝑛|𝑛 ⇒ 𝑛 𝑅 𝑛
So, 𝑛 𝑅 𝑛 for all 𝑛 ∈ 𝑍 25𝑥 15𝑥 65𝑥
⇒ 𝑅 is reflexive ∴ + − 1500 + =𝑥
100 100 100
Now, 2|6 but 6 does not divide 2 105𝑥
⇒ − 𝑥 = 1500
⇒ (2, 6) ∈ 𝑅 but (6,2) ∉ 𝑅 100
So, 𝑅 is not symmetric 5𝑥
⇒ = 1500
Let (𝑚, 𝑛) ∈ 𝑅 and (𝑛, 𝑝) ∈ 𝑅. Then, 100
(𝑚, 𝑛) ∈ 𝑅 ⇒ 𝑚|𝑛 ⇒ 𝑥 = 30000
} ⇒ 𝑚|𝑝 ⇒ (𝑚, 𝑝) ∈ 𝑅 82 (d)
(𝑛, 𝑝) ∈ 𝑅 ⇒ 𝑛|𝑝
So, 𝑅 is transitive As 𝐴, 𝐵, 𝐶 are pair wise disjoints. Therefore,
Hence, 𝑅 is reflexive and transitive but it is not 𝐴 ∩ 𝐵 = ϕ, 𝐵 ∩ 𝐶 = ϕ and 𝐴 ∩ 𝐶 = ϕ
symmetric ⇒ 𝐴 ∩ 𝐵 ∩ 𝐶 = ϕ ⇒ (𝐴 ∪ 𝐵 ∪ 𝐶) ∩ (𝐴 ∩ 𝐵 ∩ 𝐶) = ϕ
75 (c) 83 (b)
Since, 𝐴 = 𝐵 ∩ 𝐶 and 𝐵 = 𝐶 ∩ 𝐴, Clearly, 𝑅 = {(1,3), (3,1), (2,2)}
Then 𝐴≡𝐵 We observe that 𝑅 is symmetric only
84 (d) Number of element is 𝑆 = 10
Given figure clearly represents And 𝐴 = {(𝑥, 𝑦); 𝑥, 𝑦 ∈ 𝑆, 𝑥 ≠ 𝑦}
(𝐴 − 𝐵) ∪ (𝐵 − 𝐴) ∴ Number of element in 𝐴 = 10 × 9 = 90
85 (d) 93 (c)
𝑅4 is not a relation from 𝐴 to 𝐵, because (7,9) ∈ 𝑅4 but Clearly,
(7,9) ∉ 𝐴 × 𝐵 𝑅 = {(BHEL, SAIL), (SAIL, BHEL), (BHEL, GAIL),
86 (c) (GAIL, BHEL), (BHEL, IOCL), (IOCL, BHEL)}
𝑅 is reflexive if it contains (1,1), (2,2), (3,3) We observe that 𝑅 is symmetric only
∵ (1,2) ∈ 𝑅, (2,3) ∈ 𝑅 94 (a)
∵ 𝑅 is symmetric, if (2,1), (3,2) ∈ 𝑅 According to the given condition,
Now, 𝑅 = {(1,1), (2,2), (3,3), (2,1), (3,2), (2,3), (1,2)} 2𝑚 = 112 + 2𝑛
𝑅 will be transitive, if (3,1), (1,3) ∈ 𝑅 ⇒ 2𝑚 − 2𝑛 = 112
Thus, 𝑅 becomes an equivalence relation by adding ⇒ 𝑚 = 7, 𝑛 = 4
(1,1) (2,2) (3,3), (2,1) (3,2), (1,3), (3,1). Hence, the 96 (c)
total number of ordered pairs is 7 We have,
87 (c) (𝑛 + 2)(2𝑛5 + 3𝑛4 + 4𝑛3 + 5𝑛2 + 6)
𝑝=
The set 𝐴 is the set of all points on the hyperbola 𝑛2 + 2𝑛
𝑥𝑦 = 1 having its two branches in the first and third 6
⇒ 𝑝 = 2𝑛4 + 3𝑛3 + 4𝑛2 + 5𝑛 +
quadrants, while the set 𝐵 is the set of all points on 𝑦 = 𝑛
−𝑥 which lies in second and four quadrants. These Clearly, 𝑝 ∈ 𝑍 + iff n = 1, 2, 3, 6. So, 𝐴 has 4 elements
two curves do not intersect. 97 (b)
Hence, 𝐴 ∩ 𝐵 = ϕ. Clearly,
88 (b) 𝑥 ∈ 𝐴 − 𝐵 ⇒ 𝑥 ∈ 𝐴 but 𝑥 ∉ 𝐵
Since 𝑅 is an equivalence relation on set 𝐴. Therefore ⇒ 𝑥 is a multiple of 3 but it is not a multiple of 5
(𝑎, 𝑎) ∈ 𝑅 for all 𝑎 ∈ 𝐴. ⇒ 𝑥 ∈ 𝐴 ∩ 𝐵̅
Hence, 𝑅 has at least 𝑛 ordered pairs 98 (b)
89 (d) Total drinks=3(𝑖𝑒, milk, coffee, tea).
It is given 𝐴1 ⊂ 𝐴2 ⊂ 𝐴3 ⊂ 𝐴4 … ⊂ 𝐴50
50

∴ ⋃ 𝐴𝑖 = 𝐴11
𝑖=11
50

⇒ 𝑛 ( ⋃ 𝐴𝑖 ) = 𝑛(𝐴11 ) = 11 − 1 = 10 Total number of students who take any of the drink is

𝑖=11 80.
90 (d) ∴The number of students who did not take any of three
We have, drinks= 100 − 80 = 20
𝑏 𝑁 = {𝑏 𝑥|𝑥 ∈ N} = Set of positive integral multiples of 100 (d)
𝑏 𝑛(𝐴 ∪ 𝐵) = 𝑛(𝐴) + 𝑛(𝐵) − 𝑛(𝐴 ∩ 𝐵)
𝑐 𝑁 = {𝑐 𝑥|𝑥 ∈ 𝑁} = Set of positive integral multiples of = 12 + 9 − 4 = 17
𝑐 Hence, 𝑛[(𝐴𝑈𝐵)𝑐 ] = 𝑛(𝑈) − 𝑛(𝐴 ∪ 𝐵)
∴ 𝑐 𝑁 = {𝑐 𝑥 | 𝑥 ∈ 𝑁} = Set of positive integral multiples = 20 − 17 = 3
of 𝑏 and 𝑐 both
⇒ 𝑑 = 1. c. m. of 𝑏 and 𝑐
91 (d)
Clearly, 𝑅 is an equivalence relation
92 (b)