Analyzing the Sample Space
Imagine a dictionary containing every possible five-letter word formed using the letters A,B,C,D, and E without repetition. Since there are 5 distinct letters, the total number of unique words is given by the permutation of 5 items:
These words are arranged in strict alphabetical order from W1 to W120.
The Hidden Geometric Rhythm
The problem introduces a constraint where the probability of choosing the n-th word is exactly twice the probability of choosing the (n−1)-th word:
If we let the probability of the first word be x, the sequence of probabilities forms a geometric progression: x,2x,4x,…,x⋅2n−1. Since the sum of all probabilities in a sample space must equal 1, we have:
n=1∑120P(Wn)=x(1+2+22+⋯+2119)=1
Using the sum formula for a geometric series S=r−1a(rn−1), where a=x, r=2, and n=120, we obtain:
x(2−12120−1)=1⟹x=2120−11
The Hunt for the Rank
To locate the word CDBEA, we count the permutations systematically:
1. Words starting with A: 4!=24.
2. Words starting with B: 4!=24.
3. Words starting with CA: 3!=6.
4. Words starting with CB: 3!=6.
The total count before reaching words starting with CD is 24+24+6+6=60. Now, we examine words starting with CD:
1. Words starting with CDA: 2!=2.
2. Words starting with CDB: The remaining letters are A and E. The first is CDBAE (63rd word), and the next is CDBEA (64th word).
Thus, the rank of our target word is n=64.
The Grand Synthesis
The probability of choosing W64 is given by:
Substituting the value of x derived earlier:
Given the form 2β−12α, we identify α=63 and β=120. The final result is the sum: