Alice is a good gambler and always knows when to stop. Suppose in a game, in each round she has a winning probability of 0.8 and she will stop at the first loss. Try to find the upper bound on the probability that she can win at least 10 rounds using Markov’s inequality.

add an image

step-by-step explanation:

13

step-by-step explanation:

169-1=168

168-3=165

165-5=160

160-7=153

153-9=144

144-11=133

133-13=120

120-15=105

105-17=88

88-19=69

69-21=48

48-23=25

25-25=0

since it took 13times to completely subtract it hence its square root is 13

walter needs to make at least 5 more cookies but no more than 40. 5 ≥ x ≥ 40;

step-by-step explanation:

walter has to make a minimum of 20 cookies. he already has 15 cookies made, so he must make 5 more to meet the minimum.

the maximum amount of cookies he can make is 55. he already has 15, so he has to make no more than 40 more cookies to meet the maximum.

l.jnl.j/n.m,lm,

step-by-step explanation: