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