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

Let Xbe a binomial random variable with parameters nandp. Show that, fori>np,

(a)the minimum e-tiEetXoccurs when tis such thatet=iq(n-i)pwhereq=1-p.

(b)P{Xi}nni2(n-i)n-ipi(1-p)n-i

Short Answer

Expert verified

(a)ddte-tiEetX=0et=iq(n-i)p

(b)Use Chernoff's bounds and the result obtained in(a).

Step by step solution

01

Given Information.

Let Xbe a binomial random variable with parameters nandp.

02

Explanation.

Let Xbe a binomial random variable with parameters(n,p). In this task, we are going to use Chernoff's bounds. Specifically, it Yis a random variable with MGF (the moment generating function), andi>0,t>0, then

P{Yi}e-itMY(t)

Since Xis a binomial random variable with parameters n&p, its MGF is

M(t)=defEetX=(1-p)+petn=q+petn

03

Part (a) Explanation.

Let function fis defined asf(t)=e-tiEetX,t>0. So, we are looking for a minimum of this function. First, notice that f(t)=e-tiM(t)and therefore we have:

f(t)=e-tiq+petn

The first derivative of the function fis

dfdt=e-itq+petn-1>0(n-i)pet-iq

Therefore we have:

dfdt=0(n-i)pet-iq=0et=iq(n-i)p

It is given thati>np.

Therefore we have:

dfdt=0(n-i)pet-iq=0et=iq(n-i)p

It is given thati>np. Notice that

i>npet>1.

04

Part (b) Explanation.

Using Chernoff's bounds and the result we obtained in(a), we get:

P{Xi}e-itq+petn=et-iq+petn=(a)iq(n-i)p-iq+piq(n-i)pn=(n-i)piqinpq(n-i)pn=nnqn-ipiii(n-i)n-i=nn(1-p)n-ipiii(n-i)n-i

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

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

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

A.J. has 20 jobs that she must do in sequence, with the times required to do each of these jobs being independent random variables with mean 50 minutes and standard deviation 10 minutes. M.J. has 20 jobs that he must do in sequence, with the times required to do each of these jobs

being independent random variables with mean 52 minutes and standard deviation 15 minutes.

(a) Find the probability that A.J. finishes in less than 900 minutes.

(b) Find the probability that M.J. finishes in less than 900 minutes.

(c) Find the probability that A.J. finishes before M.J.

Repeat part (a)of Problem8.2when it is known that the variance of a student’s test score is equal

to25.

A lake contains 4 distinct types of fish. Suppose that each fish caught is equally likely to be any one of these types. Let Y denote the number of fish that need be caught to obtain at least one of each type.

(a) Give an interval (a, b) such thatP(aYb)0.9

(b) Using the one-sided Chebyshev inequality, how many fish need we plan on catching so as to be at least 90 percent certain of obtaining at least one of each type?

Civil engineers believe that W, the amount of weight (in units of 1000pounds) that a certain span of a bridge can withstand without structural damage resulting, is normally distributed with a mean of 400and standard deviation of40. Suppose that the weight (again, in units of 1000pounds) of a car is a random variable with a mean of 3and standard deviation.3. Approximately how many cars would have to be on the bridge span for the probability of structural damage to exceed.1?

Suppose that X is a random variable with mean and variance both equal to 20. What can be said about P{0 < X < 40}?

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