Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Question: Suppose that the number of cans of soda pop filled in a day at a bottling plant is a random variable with an expected value of 10,000 and a variance of 1000.

a) Use Markov's inequality to obtain an upper bound on the probability that the plant will fill more than 11,000 cans on a particular day.

b) Use Chebyshev's inequality to obtain a lower bound on the probability that the plant will fill between 9000 and 11,000 cans on a particular day.

Short Answer

Expert verified

Answer

a. So, the probability that the plant will fill more than 11,000 cans is 0.9091.

b. So, the probability that the plant will fill between 9,000 and 11,000 cans is 0.999

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

In the problem given  

The plant will fill between 9,000 and 11,000 cans on a particular.

02

The definition and the formula for the given problem

Markov's inequality\(P(X(s) \ge a) \le E(X)/a\) says that for a positive random variable X and any positive real number a, the probability that X is greater than or equal to a is less than or equal to the expected value of X divided by a.

Chebyshev's inequality: it states that minimum of just \(75\% \) of values must lie within two standard deviations of the mean and \(89\% \) within three standard deviations.

03

Determining the sum in expanded form

(a) Apply Markov's inequality with a=11000:

Markov's inequality:

\(P(X(s) \ge a) \le \frac{{E(X)}}{a}\)

\(\begin{array}{c}E(X) = 10000\\V(X) = 1000\end{array}\)

\(\begin{array}{c}P(X(s) \ge 11,000) \le \frac{{E(X)}}{{11,000}}\\ = \frac{{10,000}}{{11,000}}\\ = \frac{{10}}{{11}}\\ \approx 0.9091\end{array}\)

04

Using Markov's inequality to obtain an upper bound on the probability.  

(b) Apply Chebyshev's inequality with r=1000 :

Chebyshev's inequality:

\(P(|X(s) - E(X)| \ge r) \le \frac{{V(X)}}{{{r^2}}}\)

\(\begin{aligned}{*{20}{c}}{P(9000 < X < 11,000)}{ = P( - 1000 < X - 10,000 < 1000)}\\{}&{ = P( - 1000 < X - E(X) < 1000)}\\{}&{ = P(|X(s) - E(X)| < 1000)}\\{}&{ = 1 - P(|X(s) - E(X)| \ge 1000)\quad {\rm{ Complement rule }}}\\{}&{ \ge 1 - \frac{{V(X)}}{{{{1000}^2}}}}\\{}&{ = 1 - \frac{{1000}}{{{{1000}^2}}}}\\{}&{ = 1 - \frac{1}{{1000}}}\\{}&{ = \frac{{999}}{{1000}}}\\{}&{ = 0.999}\end{aligned}\)

Result

  1. \(\frac{{10}}{{11}} \approx 0.9091\)
  2. \(\frac{{999}}{{1000}} \approx 0.999\)

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Question: In this exercise we will use Bayes' theorem to solve the Monty Hall puzzle (Example 10 in Section 7.1). Recall that in this puzzle you are asked to select one of three doors to open. There is a large prize behind one of the three doors and the other two doors are losers. After you select a door, Monty Hall opens one of the two doors you did not select that he knows is a losing door, selecting at random if both are losing doors. Monty asks you whether you would like to switch doors. Suppose that the three doors in the puzzle are labeled 1, 2, and 3. Let W be the random variable whose value is the number of the winning door: assume that \(p\left( {W = k} \right) = \frac{1}{3}\) for k=1,2,3. Let M denote the random variable whose value is the number of the door that Monty opens. Suppose you choose door i

a) What is the probability that you will win the prize if the game ends without Monty asking you whether you want to change doors?

b) Find \(p\left( {M = j\left| {W = k} \right.} \right)\) for j=1,2,3 and k= 1.2.3

e) Use Bayes' theorem to find \(p\left( {M = j\left| {M = k} \right.} \right)\) where i and j and are distinct values d) Explain why the answer to part (c) tells you whether you should change doors when Monty gives you the chance to do so,

Question: Let E be the event that a randomly generated bit string of length three contains an odd number of 1s, and let F be the event that the string starts with 1. Are E and F Independent?

Question 2. To show

IfE1,E2,E3.....Enare events from a finite sample space, thenp(E1โˆชE2โˆช.....โˆชEn)โฉฝP(E1)+p(E2)+....+p(En).

Question: Suppose that we roll a fair die until a\(6\)comes up or we have rolled it\(10\)times. What is the expected number of times we roll the die?

Question: Find the probability of selecting none of the correct six integers in a lottery, where the order in which these integers are selected does not matter, from the positive integers not exceeding

(a) 40.

(b) 48.

(c) 56.

(d) 64.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free