/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q.7.76 Let X be the value of the first ... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

Let X be the value of the first die and Ythe sum of the values when two dice are rolled. Compute the joint moment generating function of X and Y.

Short Answer

Expert verified

The joint moment generating functions ofXandYareMx,yt1,t2=136∑x=16∑y=x+1x+6et1x+t2y.

Step by step solution

01

Given Information

Let X be the value of the first die and Y the sum of the values when two dice are rolled.

02

Explanation

Y=2,3,4,5,6,7ifX=13,4,5,6,7,8ifX=24,5,6,7,8,9ifX=35,6,7,8,9,10ifX=46,7,8,9,10,11ifX=57,8,9,10,11,12ifX=6

P(X=x,Y=y)=136for allx and y.

Mx,yt1,t2=Eet1X+t2Y
03

Explanation

Mx,yt1,t2=Eet1X+t2Y

=∑x=16∑y=x+1x+6P(X=x,Y=y)et1x+t2y

=136∑x=16∑y=x+1x+6et1x+t2y

04

Final Answer

The joint moment generating functions of X andYareMx,yt1,t2=136∑x=16∑y=x+1x+6et1x+t2y.

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 91Ó°ÊÓ!

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

Cards from an ordinary deck are turned face up one at a time. Compute the expected number of cards that need to be turned face up in order to obtain

(a) 2 aces;

(b) 5 spades;

(c) all 13 hearts.

Consider nindependent trials, the ithof which results in a success with probability Pl.

(a) Compute the expected number of successes in the ntrials-call it μ

(b) For a fixed value of μ, what choice of P1,…,Pnmaximizes the variance of the number of successes?

(c) What choice minimizes the variance?

In Example 2h,say that i andj,i≠j, form a matched pair if i chooses the hat belonging to j and j chooses the hat belonging to i. Find the expected number of matched pairs.

A deck of n cards numbered 1 through n is thoroughly shuffled so that all possible n! orderings can be assumed to be equally likely. Suppose you are to make n guesses sequentially, where the ith one is a guess of the card in position i. Let N denote the number of correct guesses.

(a) If you are not given any information about your earlier guesses, show that for any strategy, E[N]=1.

(b) Suppose that after each guess you are shown the card that was in the position in question. What do you think is the best strategy? Show that under this strategy

E[N]=1n+1n−1+⋯+1≈∫1n1xdx=logn

(c) Supposethatyouaretoldaftereachguesswhetheryou are right or wrong. In this case, it can be shown that the strategy that maximizes E[N] is one that keeps on guessing the same card until you are told you are correct and then changes to a new card. For this strategy, show that

E[N]=1+12!+13!+⋯+1n!≈e−1

Hint: For all parts, express N as the sum of indicator (that is, Bernoulli) random variables.

Show that Xis stochastically larger than Yif and only ifE[f(X)]≥E[f(Y)]

for all increasing functions f..

Hint: Show that X≥stY, then E[f(X)]≥E[f(Y)]by showing that f(X)≥stf(Y)and then using Theoretical Exercise 7.7. To show that if E[f(X)]≥E[f(Y)]for all increasing functions f, then P{X>t}≥P{Y>t}, define an appropriate increasing function f.

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.