21. Given the sets A = {1, 3, 5}, B = {2, 4, 6} and C = {0, 2, 4, 6, 8}, which of the following may be considered as universal set (s) for all the three sets A, B and C
(i) {0, 1, 2, 3, 4, 5, 6}
(ii)
(iii) {0,1,2,3,4,5,6,7,8,9,10}
(iv) {1,2,3,4,5,6,7,8}
21. Given the sets A = {1, 3, 5}, B = {2, 4, 6} and C = {0, 2, 4, 6, 8}, which of the following may be considered as universal set (s) for all the three sets A, B and C
(i) {0, 1, 2, 3, 4, 5, 6}
(ii)
(iii) {0,1,2,3,4,5,6,7,8,9,10}
(iv) {1,2,3,4,5,6,7,8}
21. Universal set of A, B and C must includes all elements of A, B and C, i.e. 0,1,2,3,4,5,6,8.
So, the universal set of A, B and C is (iii) {0,1,2,3,4,5,6,7,8,9,10}.
Similar Questions for you
(|x| - 3)|x + 4| = 6

(-x - 3) (- (x + 4) = 6
(x + 3) (x + 4) = 6 ⇒ x² + 7x + 12 = 6 ⇒ x² + 7x + 6 = 0
(x + 1) (x + 6) = 0 ⇒ x = -6 (since x < -4)
Case (ii) -4 ≤ x < 0
(-x - 3) (x + 4) = 6
⇒ -x² - 7x - 12 = 6
⇒ x² + 7x + 18 = 0
The discriminant is D = 7² - 4 (1) (18) = 49 - 72 < 0, so no real solution.
Case (iii) x ≥ 0
(x - 3
Given n = 2x. 3y. 5z . (i)
On solving we get y = 3, z = 2
So, n = 2x. 33. 52
So that no. of odd divisor = (3 + 1) (2 + 1) = 12
Hence no. of divisors including 1 = 12
Let A = {a, b, c}, B = {1, 2, 3, 4, 5} n (A × B) = 15
x = number of one-one functions from A to B.
y = number of one-one functions for A to (A × B)
66. Given series is 1× 2× 3 + 2× 3 ×4 + 3× 4 ×5 + … to n term
an = (nth term of A. P. 1, 2, 3, …) ´× (nth terms of A. P. 2, 3, 4) ×
i e, a = 1, d = 2- 1 = 1i e, a = 2, d = 3- 2 = 1
(nth term of A. P. 3, 4, 5)
i e, a = 3, d = 3 -4 = 1.
= [1 + (n -1) 1] ×[2 + (n -1):1]× [3 + (n- 1) 1]
= (1 + n -1)×(2 + n -1
Taking an Exam? Selecting a College?
Get authentic answers from experts, students and alumni that you won't find anywhere else.
On Shiksha, get access to
Learn more about...
Didn't find the answer you were looking for?
Search from Shiksha's 1 lakh+ Topics
Ask Current Students, Alumni & our Experts
Have a question related to your career & education?
See what others like you are asking & answering
