Make a Markov chain model of a poker game where the states are the number of dollars a player has. With probability .3 a player
1 answer:
You might be interested in
Answer:
C
Step-by-step explanation:
Add 10x to both sides:
-10x - 135 = 117 + 2x
-10x - 135 + 10x = 117 + 2x + 10x
-135 = 117 + 12x
Subtract 117 from both sides:
-135 - 117 = 117 + 12x - 117
-252 = 12x
Divide both sides by 12:
-21 = x
So the answer is C.
Hope this helps!
We should first calculate the average number of checks he wrote per day. To do that, divide 169 by 365 (the number of days in a year) and you get (rounded) 0.463. This will be λ in our Poisson distribution. Our formula is
. We want to evaluate this formula for X≥1, so first we must evaluate our case at k=0.
To find P(X≥1), we find 1-P(X<1). Since the author cannot write a negative number of checks, this means we are finding 1-P(X=0). Therefore we have 1-0.3706=0.6294.
There is a 63% chance that the author will write a check on any given day in the year.<em />
To find P(X≥1), we find 1-P(X<1). Since the author cannot write a negative number of checks, this means we are finding 1-P(X=0). Therefore we have 1-0.3706=0.6294.
There is a 63% chance that the author will write a check on any given day in the year.<em />