Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Chapter 3 : 3.12 - Exercises Problem 7 #23

Open
mskhan001 opened this issue Apr 2, 2022 · 2 comments
Open

Chapter 3 : 3.12 - Exercises Problem 7 #23

mskhan001 opened this issue Apr 2, 2022 · 2 comments

Comments

@mskhan001
Copy link

The solution given by you here seems incorrect to me. There should be (1-px) term in the end to account for failing.

Refer - math.stackexchange

@vmdd
Copy link

vmdd commented Aug 7, 2024

I guess you meant this problem (or the link might have changed).

For the case of only reaching lvl 1 and no futher, we need to account for failure to go to lvl2 $(1 - p_1)$, so

$$P(X = 1) = 1 \cdot (1 - p_1)$$

Also, it cannot be equal $1$ at $X = 1$, since that would mean it needs to be $0$ at any other point.

@RamonAraujo
Copy link

I agree with @vmdd . From the question statement, I interpret that X is the highest level that Bob can reach by playing the game. X = 1 if Bob fails to pass to level 2, which occurs with probability (1-p1).

Therefore, I think the correct answer to question 3.12 is

$$P(X=k) = \begin{cases} 1-p_1 &, ~\text{for}~ k=1\\ p_1 p_2 \dots p_{k-1} (1-p_k) &, ~\text{for}~ k=\{ 2,3,4,5,6 \} \\ p_1 p_2 p_3 p_4 p_5 p_6 &, ~\text{for}~ k=7 \\ 0 &, ~\text{otherwise}~ \end{cases}$$

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants