Related Formula
Probability P(E) = Number of favorable outcomesTotal number of outcomes$$\text{Probability } P(E) = \frac{\text{Number of favorable outcomes}}{\text{Total number of outcomes}}$$
Core Logic
Let S = a, b, c, d, e$S = \{a, b, c, d, e\}$.
Since S$S$ has 5 elements, P(S)$P(S)$ contains 2⁵ = 32$2^5 = 32$ subsets.
The total number of ordered pairs (A, B)$(A, B)$ that can be formed from P(S) × P(S)$P(S) \times P(S)$ is:
32 × 32 = (2⁵)² = 2¹⁰ = 4⁵$$32 \times 32 = (2^5)^2 = 2^{10} = 4^5$$
Alternatively, consider element-wise mapping. For each of the 5 elements in S$S$, it has 4 choices with respect to sets A$A$ and B$B$:
| Status in A | Status in B |
|---|
| Present ($\checkmark$) | Present ($\checkmark$) |
| Present ($\checkmark$) | Absent (x) |
| Absent (x) | Present ($\checkmark$) |
| Absent (x) | Absent (x) |
Step 1: Satisfying the Condition
For A B =$A \cap B = \emptyset$, no element can be present in both A$A$ and B$B$ simultaneously. This rules out the choice where an element is ($\checkmark$) in A$A$ and ($\checkmark$) in B$B$.
Thus, each of the 5 elements has exactly 3 valid choices to ensure disjointness.
Favorable cases = 3⁵$3^5$.
Step 2: Calculating Probability
Probability P = FavorableTotal$P = \frac{\text{Favorable}}{\text{Total}}$:
P = (3⁵)/(4⁵) = (3⁵)/((2²)⁵) = 3⁵2¹⁰$$P = \frac{3^5}{4^5} = \frac{3^5}{(2^2)^5} = \frac{3^5}{2^{10}}$$
Comparing this with (3^p)/(2^q)$\frac{3^p}{2^q}$:
p = 5, q = 10$$p = 5, \quad q = 10$$
p + q = 5 + 10 = 15$$p + q = 5 + 10 = 15$$
Pattern Recognition
Set operations mapping down to element-wise Boolean states (In/Out) transform combinatorial subset problems directly into base-state exponentiation problems (3ⁿ$3^n$ vs 4ⁿ$4^n$). Disjoint sets exclude exactly one state: (In, In).
Chapter Mix
Class 12 Maths: Probability
Class 11 Maths: Sets