hupdy
Dec19-06, 04:15 PM
1. Consider n flips of a fair coin. Calculate the probability:
a. n/2 < -Total number of heads
b. 5000 > total #heads
c. n/2 < total #heads < 5n/8
d. n < total #heads.
WHERE n = 8992
2. Consider the shopping problem
Markov transition matrix
.5 | .5
-----------------
.75 - k | .25 + k
where k = 8992 divided by 20000..
Start with initial v0 = (..5,.5) and describe the behavior of the
system for many time steps.
Does your result cycle, does one state become extinct, or does it
approach a limit value?
Any help will be nice.
a. n/2 < -Total number of heads
b. 5000 > total #heads
c. n/2 < total #heads < 5n/8
d. n < total #heads.
WHERE n = 8992
2. Consider the shopping problem
Markov transition matrix
.5 | .5
-----------------
.75 - k | .25 + k
where k = 8992 divided by 20000..
Start with initial v0 = (..5,.5) and describe the behavior of the
system for many time steps.
Does your result cycle, does one state become extinct, or does it
approach a limit value?
Any help will be nice.