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

Show that Xis a Poisson random variable with parameter λ, then

EXn=λE(X+1)n-1

Now use this result to compute EX3.

Short Answer

Expert verified

EX3=λ3+3λ2+λ

Step by step solution

01

Step 1: Given information

Given in the question thatXis a Poisson random variable with parameter λ, then E[Xn]=λE[(X+1)n1]. We need to find E[X3]

02

Step 2: Explanation

Using the theorem about the mean of function of random variable,

we have that

EXn=k=0knλkk!e-λ=k=1knλkk!e-λ=λk=1knλk-1k!e-λ

=λk=1kn-1λk-1(k-1)!e-λ=λk=0(k+1)n-1λkk!e-λ=λE(X+1)n-1

which had to be proved. Using that, we have that

EX3=λE(X+1)2=λEX2+2X+1=λEX2+2E(X)+1

Now, use that EX2=Var(X)+EX2=λ+λ2

and thatEX=λ,

so we have that the expression above is equal to

=λλ+λ2+2λ+1=λ3+3λ2+λ

03

Step 3:Final answer

EX3=λ3+3λ2+λ

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

Five distinct numbers are randomly distributed to players numbered1through 5. Whenever two players compare their numbers, the one with the higher one is declared the winner. Initially, players1and 2 compare their numbers; the winner then compares her number with that of player 3, and so on. Let X denote the number of times player 1 is a winner. FindPX=i,i=0,1,2,3,4.

Here is another way to obtain a set of recursive equations for determining Pn, the probability that there is a string of kconsecutive heads in a sequence of nflips of a fair coin that comes up heads with probability p:

(a) Argue that for k<n, there will be a string of kconsecutive heads if either

1. there is a string of kconsecutive heads within the first n-1flips, or

2. there is no string of kconsecutive heads within the first n-k-1flips, flip n-kis a tail, and flips n-k+1,,nare all heads.

(b) Using the preceding, relate PntoPn-1. Starting with Pk=pk, the recursion can be used to obtain Pk+1, thenPk+2, and so on, up to Pn.

A family has n children with probability αpn,n1whereα(1-p)/p

(a) What proportion of families has no children?

(b) If each child is equally likely to be a boy or a girl (independently of each other), what proportion of families consists of k boys (and any number of girls)?

A newsboy purchases papers at 10 cents and sells them at 15 cents. However, he is not allowed to return unsold papers. If his daily demand is a binomial random variable with n=10,p=13, approximately how many papers should he purchase so as to maximize his expected profit?

A satellite system consists ofn components and functions on any given day if at least k of the n components function on that day. On a rainy day, each of the components independently functions with probability p1, whereas, on a dry day, each independently functions with probability p2. If the probability of rain tomorrow is what is the probability that the satellite system will function?

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