23. Refer to question 6 above, state true or false: (give reason for your answer)
(i) A and B are mutually exclusive
(ii) A and B are mutually exclusive and exhaustive
(iii) A = B′
(iv) A and C are mutually exclusive
(v) A and B′ are mutually exclusive.
(vi) A′, B′, C are mutually exclusive and exhaustive.
23. Refer to question 6 above, state true or false: (give reason for your answer)
(i) A and B are mutually exclusive
(ii) A and B are mutually exclusive and exhaustive
(iii) A = B′
(iv) A and C are mutually exclusive
(v) A and B′ are mutually exclusive.
(vi) A′, B′, C are mutually exclusive and exhaustive.
-
1 Answer
-
23. (i) A ∩B = { (2, 1), (2, 2), (2, 3), (2, 4), (2, 5), (2, 6),
(4, 1), (4, 2), (4, 3), (4, 4), (4, 5), (4, 6),
(6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6)}∩ { (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6),
(3, 1), (3, 2), (3, 3), (3, 4), (3, 5), (3, 6),
(5, 1), (5, 2), (5, 3), (5, 4), (5, 5), (5, 6)}
A ∩B =∅
Hence, A and B are mutually exclusive.
The given statement is true.
(ii) A ∪B = { (2, 1), (2, 2), (2, 3), (2, 4), (2, 5), (2, 6),
(4, 1), (4, 2), (4, 3), (4, 4), (4, 5), (4, 6),
(6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6)}∩ { (1, 1),
...more
Similar Questions for you
3, 4, 5, 5
In remaining six places you have to arrange
3, 4, 5,5
So no. of ways
Total no. of seven digits nos. =
Hence Req. prob.
f (x) = x? – 4x + 1 = 0
f' (x) = 4x³ – 4
= 4 (x–1) (x²+1+x)
=> Two solution
Let z be equal to (x + iy)
(x + iy) + (x – iy) = (x + iy)2 (i + 1)
Equating the real & in eg part.
(i) & (ii)
4xy = -2x Þ x = 0 or y =
(for x = 0, y = 0)
For y =
x2
x =
=
of
=
When
gives c = 1
So
sum of all solutions =
Hence k = 42
Each element of ordered pair (i, j) is either present in A or in B.
So, A + B = Sum of all elements of all ordered pairs {i, j} for and
= 20 (1 + 2 + 3 + … + 10) = 1100
Taking an Exam? Selecting a College?
Get authentic answers from experts, students and alumni that you won't find anywhere else
Sign Up on ShikshaOn Shiksha, get access to
- 65k Colleges
- 1.2k Exams
- 688k Reviews
- 1800k Answers