Analyzing the Setup
We are given a sample space S={E1,E2,...,E8} where the probability of each event is weighted by its index: P(En)=36n. Immediately, we observe this is not a uniform distribution.
The higher the index, the more weight the event carries. We are tasked with finding the number of subsets A⊆S such that P(A)≥54.
Many students attempt to construct sets A directly, leading to a combinatorial explosion. In JEE Advanced, when faced with a condition like P(A)≥54, the strategic approach is to utilize the Complement.
The Master Equation
The condition P(A)≥54 implies 1−P(Ac)≥54, which simplifies to P(Ac)≤51. We have transformed a "greater than" problem into a "less than" problem, focusing on small, manageable sets Ac.
Since P(En)=36n, the probability of the complement set Ac is the sum of the probabilities of its individual elements:
Setting this to be less than or equal to 51, we obtain:
Multiplying by 36, we find that the sum of the indices in Ac must satisfy:
Since the indices i are integers, the sum of the indices must be an integer S≤7. This reduces the problem to partitioning integers up to 7 using the set {1,2,...,8}.
The Systematic Grind
We now list the subsets Ac systematically based on the sum of their elements:
- Sum = 0: The empty set ∅. (1 way)
- Sum = 1: The set {1}. (1 way)
- Sum = 2: The set {2}. (1 way)
- Sum = 3: The sets {3} and {1,2}. (2 ways)
- Sum = 4: The sets {4} and {1,3}. (2 ways)
- Sum = 5: The sets {5}, {1,4}, and {2,3}. (3 ways)
- Sum = 6: The sets {6}, {1,5}, {2,4}, and {1,2,3}. (4 ways)
- Sum = 7: The sets {7}, {1,6}, {2,5}, {3,4}, and {1,2,4}. (5 ways)
Final Calculation
Summing the number of ways found for each possible total:
By shifting our perspective to the complement, we turned a daunting probability problem into a simple counting exercise. The total number of subsets A satisfying the condition is 19.