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 X be a normal random variable with mean μand variance σ2. Use the results of Theoretical Exercise 7.46 to show that

EXn=j=0[n/2]n2jμn2jσ2j(2j)!2jj!

In the preceding equation, [n/2] is the largest integer less than or equal to n/2. Check your answer by letting n=1 and n=2.

Short Answer

Expert verified

It has been shown thatEXn=j=0[n/2]n2jσ2j(2j)!2jj!μn2j

Step by step solution

01

Given information 

X be a normal random variable with mean μand variance σ2.

In the preceding equation, n/2 is the largest integer less than or equal ton/2.

02

Solution 

We need to use the binomial theorem to obtain the result,

EXn=E(μ+σZ)n

=j=0nnjσjEZjμnj

From theoretical exercise 46 , we need to obtain the following result:

Eetz=et22

=j=0t2/2jj!

03

Solution

Now we need to compare and substitute the given,

EXn=jn,jevennjσjEZjμnj

=j=0[n/2n2jσ2jEZ2jμn2j

So as a result,

EXn=j=0[n/2n2jσ2j(2j)!2jj!μn2j

Hence,EXn=j=0[n/2]n2jσ2j(2j)!2jj!μn2j

Where,[n/2]is the greatest integer less than or equal to n/2.

04

Final answer 

From the above calculation it has been shown thatEXn=j=0[n/2]n2jσ2j(2j)!2jj!μn2j.

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

For a group of 100 people, compute

(a) the expected number of days of the year that are birthdays of exactly 3 people;

(b) the expected number of distinct birthdays.

Two envelopes, each containing a check, are placed in front of you. You are to choose one of the envelopes, open it, and see the amount of the check. At this point, either you can accept that amount or you can exchange it for the check in the unopened envelope. What should you do? Is it possible to devise a strategy that does better than just accepting the first envelope? Let Aand B, A<B, denote the (unknown) amounts of the checks and note that the strategy that randomly selects an envelope and always accepts its check has an expected return of (A+B)/2. Consider the following strategy: Let F(·)be any strictly increasing (that is, continuous) distribution function. Choose an envelope randomly and open it. If the discovered check has the value x, then accept it with probability F(x)and exchange it with probability 1F(x).

(a) Show that if you employ the latter strategy, then your expected return is greater than (A+B)/2. Hint: Condition on whether the first envelope has the value Aor B. Now consider the strategy that fixes a value x and then accepts the first check if its value is greater than x and exchanges it otherwise. (b) Show that for any x, the expected return under thex-strategy is always at least (A+B)/2and that it is strictly larger than (A+B)/2if xlies between Aand B.

(c) Let X be a continuous random variable on the whole line, and consider the following strategy: Generate the value ofX, and if X=x, then employ the x-strategy of part (b). Show that the expected return under this strategy is greater than (A+B)/2.

The joint density function ofXandYis given by

f(x,y)=1ye-(y+x/y),x>0,y>0

Find E[X],E[Y]and show that Cov(X,Y)=1

For an event A, let IA equal 1 if A occurs and let it equal 0 if A does not occur. For a random variable X, show that E[X|A] = E[XIA] P(A

If E[X]=1and Var(X)=5find

(a)E[(2+X2)]

(b)Var(4+3X)

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