We are given that two subsets \( A \) and \( B \) are selected at random from a set \( S \) containing \( n \) elements, and we need to find the probability that \( A \cap B = \emptyset \) and \( A \cup B = S \). For each element in the set \( S \), there are three possibilities:
1. The element is only in \( A \).
2. The element is only in \( B \). 3. The element is in neither \( A \) nor \( B \). However, for the condition \( A \cap B = \emptyset \), an element cannot be in both \( A \) and \( B \) simultaneously. So, for each element, there are two choices: 1. The element is in \( A \). 2. The element is in \( B \). Now, for the condition \( A \cup B = S \), every element of \( S \) must be either in \( A \) or in \( B \) (but not both). Hence, there are \( 2^n \) possible ways to assign each of the \( n \) elements to either \( A \) or \( B \), and the total number of ways is \( 2^n \). The total number of ways to choose \( A \) and \( B \) from \( S \) without any restrictions is \( 3^n \), as each element can independently belong to \( A \), \( B \), or neither. Thus, the probability is the ratio of favorable outcomes to total outcomes: \[ \frac{2^n}{3^n} = \frac{1}{2^n} \] Thus, the correct answer is \( \frac{1}{2^n} \).
| List-I | List-II | ||
|---|---|---|---|
| (A) | $f(x) = \frac{|x+2|}{x+2} , x \ne -2 $ | (I) | $[\frac{1}{3} , 1 ]$ |
| (B) | $(x)=|[x]|,x \in [R$ | (II) | Z |
| (C) | $h(x) = |x - [x]| , x \in [R$ | (III) | W |
| (D) | $f(x) = \frac{1}{2 - \sin 3x} , x \in [R$ | (IV) | [0, 1) |
| (V) | { -1, 1} | ||
| List I | List II | ||
|---|---|---|---|
| (A) | $\lambda=8, \mu \neq 15$ | 1. | Infinitely many solutions |
| (B) | $\lambda \neq 8, \mu \in R$ | 2. | No solution |
| (C) | $\lambda=8, \mu=15$ | 3. | Unique solution |
S is the sample space and A, B are two events of a random experiment. Match the items of List A with the items of List B.
Then the correct match is:
For the probability distribution of a discrete random variable \( X \) as given below, the mean of \( X \) is: