(a) {x: x is a natural number and 4 ? x ? 6} = {4, 5, 6}. Now, {1, 2, 3, 4} and {4, 5, 6} have one element 4 common. Therefore, the given two sets are not disjoint.
(b) The sets {a, e, i, o, u} and {c, d, e, f} have one element e as common. Then, the given two sets are not disjoint.
(c) The sets {x: x is an even integer} and {x: x is an odd integer} have no element as common and therefore they are disjoint sets.
NA
NA
NA
NA
Given: n(C) = 50, n(F) = 20, n(C ? F) = 10.
Number of students playing at least one of these two games = n (C ? F) = n (C) + n (F) ? n (C ? F)
= 50 + 20 ? 10 = 60.
Given in the question ,
n(X ?Y) = 18, n(X) = 8, n(Y) = 15.
Using the formula
n(X ? Y) = n(X) + n(Y) ? n(X ? Y), we get n(X ? Y) = 8 + 15 ? 18 = 5.
Given in the question ,
n(A) = 40, n(A ? B) = 60 and n(A ? B) = 10.
As we know the formula,
n(A ? B) = n(A) + n(B) ? n(A ? B)
Putting these values in the formula, we get
60 = 40 + n(B) ? 10
? n(B) = 30.
Given in the question,
n(H ? E) = 1000, n(H) = 750, n(E) = 400
Use the below formula,
n(H ? E) = n(H) + n(E) ? n(H ? E)
We get 1000 = 750 + 400 ? n(H ? E)
? n(H ? E) = 1150 ? 1000 = 150.
Number of People who can speak Hindi only
= n(H ? E?) = n(H) ? n(H ? E)
= 750 ? 150 = 600.
Let, E be the set of people who are egg-eaters and M be the set of people who are meat-eaters.
As per given question,
n(E) = 3200, n(M) = 2500, n(E ? M) = 1500.
Use the formula
n(E ? M) = n(E) + n(M) ? n(E ? M)
= 3200 + 2500 ? 1500
= 5700 ? 1500 = 4200.
? Number of pure vegetarians = n(U) ? n(E ? M)
Number of pure vegetarians = 5000 ? 4200 = 800.
Let P = set of people who like coffee and Q = set of people like tea.
Then, P ? Q = set of people who like at least one of the two drinks.
And P ? Q = set of people who like both the drinks.
Given in the question,
n(P) = 37, n(Q) = 52, n(P ? Q) = 70.
Use the below formula,
n(P ? Q) = n(P) + n(Q) ? n(P ? Q)
Put the value from the given question,
70 = 37 + 52 ? n(P ? Q)
? n(P ? Q) = 89 ? 70 = 19.
? 19 people like both coffee and tea.
Comments
There are no comments.Copyright ©CuriousTab. All rights reserved.