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: Use Chebyshev's inequality to show that the probability that more than 10 people get the correct hat back when a hatcheck person returns hats at random does not exceed \(1/100\) no matter how many people check their hats.

(Hint: Use Example 6 and Exercise 43 in Section 7.4.)

Short Answer

Expert verified

Answer

\(P(X > 10) \le \frac{1}{{100}}\)

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

Chebyshev’s Inequality definition

Chebyshev's Inequality: Let \(X\) be a random variable on a sample space \(S\) with probability function \(p\). If \(r\) is a positive real number, then \(p(|X(s) - E(X)| \ge r) \le V(X)/{r^2}\).

02

Use Chebyshev’s Inequality

If there are total\(n\) no. of people who intend to get their hat back and \(X\) is the random variable that denotes the actual no. of people who do, then it already knows that\(E\left( X \right) = 1,{\rm{ }}V\left( X \right) = 1.\) By Chebyshev's inequality, \(P(|X - E(X)| \ge r) \le \frac{{V(X)}}{{{r^2}}}\). So, the probability that more than 10 people get their correct hat back is

\(P(X > 10) = P((X - E(X)) \ge 10) = P(|X - E(X)| \ge 10) \le \frac{{V(X)}}{{{{10}^2}}} = \frac{1}{{100}}\).

Hence the people check their hat is \(P(X > 10) \le \frac{1}{{100}}\).

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 23. To determine

What is the conditional probability that exactly four heads appear when a fair coin is flipped five times, given that the first flip came up heads?

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,

When a test for steroids is given to soccer players, 98% of the players taking steroids test positive and 12% of the players not taking steroids test positive. Suppose that 5% of soccer players take steroids. What is the probability that a soccer player who tests positive takes steroids?

Question: What is the probability that a five-card hand contains two pairs (that is, two of each of two different kinds and a fifth card of a third kind)?

Question: (Requires calculus) Show that if E1,E2,...,En is an infinite sequence of pair wise disjoint events in a sample space S, thenp(โˆชi=1โˆžEi)=โˆ‘i=1โˆžp(Ei) [ .[Hint: Use Exercise 36 and take limits.]

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