Imagine you have a keyboard that only consists of 3 keys; backspace, A, and B. You decide to roll a regular fair dice to determine which key is going to be chosen each time and follow the rules below:
1- If the number on the dice is 3 or 6, you choose backspace.
2- If you see number 2 or 5, you type B.
3- If numbers 1 or 4 appear then you'll press A.
How many steps on average does it require to type out the string "ABBB"?
P.S. would it make any difference if the desired string is a substring as in "AAABABBBA"?
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
According to my calculation, answer should be 63. My solving strategy was to use state diagram. States are: "/, A, AB, ABB, ABBB" . Then, you assign a probability to each state transition (for example, once you are in state "AB", there's 1/3 chance to go to state "ABB" and 2/3 chance to go to state "A"). Based on that, you write out equations for expected value of steps starting from each state and, by going from back to the front, you solve for expected value of steps starting from the "/" state.
Log in to reply
Can you provide a detailed proof? How will the expected value of each state relates to getting average number of attempts to get there?