Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
All five letter words are made using all the letters A, B, C, D, E and arranged as in an English dictionary with serial numbers. Let the word at serial number $n$ be denoted by $\mathrm{W}_{\mathrm{n}}$. Let the probability $\mathrm{P}\left(\mathrm{W}_{\mathrm{n}}\right)$ of choosing the word $\mathrm{W}_{\mathrm{n}}$ satisfy $\mathrm{P}\left(\mathrm{W}_{\mathrm{n}}\right)=2 \mathrm{P}\left(\mathrm{W}_{\mathrm{n}-1}\right), \mathrm{n}>1$.
If $\mathrm{P}(\mathrm{CDBEA})=\frac{2^\alpha}{2^\beta-1}, \alpha, \beta \in \mathbb{N}$, then $\alpha+\beta$ is equal to :____________
Step 1: The five distinct-letter words are ordered lexicographically. CDBEA has rank 64: 48 words precede it with first letter A or B; then 12 with prefix CA or CB; then 2 with prefix CDA; then 1 with prefix CDBA.
Step 2: Let P(W₁)=c. The recurrence P(Wₙ)=2P(Wₙ₋₁) gives P(Wₙ)=2ⁿ⁻¹c. Normalizing all 120 word probabilities gives c(1+2+…+2¹¹⁹)=1, hence c=1/(2¹²⁰−1).
Step 3: For rank 64, P(CDBEA)=2⁶³/(2¹²⁰−1), so α=63, β=120, and α+β=183.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.