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

Two dice are rolled. Let X and Y denote, respectively, the largest and smallest values obtained. Compute the conditional mass function of Y given X = i, for i = 1,2,...,6. Are X and Y independent? Why?

Short Answer

Expert verified

The conditional mass function of Y and state X and Y are not independent.

Step by step solution

01

Given information

Two dice are rolled. consider X and Y denote the two events that represent the smallest and largest values respectively.

X=ifori=1,2,......,6.

02

Explanation 

Calculate the conditional mass function of Y given X = i for i=1,2,3,4,5,6as follows:

Here X is the larger of the rolls and X=1then there are two cases.

Consider R1 and R2 to be the events that represent the first roll and second roll.

Case 1: Forj<i

role="math" localid="1647233014647" PY=j|X=i=P(Y=j,X=i)P(X=i)=PR1=j,R2=iR1=i,R2=jP(X=i)=236×PX=i

Case 2: For i = j

PY=i|X=j=P(Y=i,X=i)P(X=i)=136×PX=i

Therefore to calculate P (X = i) as follows:

P(X=i)=Pk=1i-1R1=k,R2=iR1=i,R2=kR1=i,R2=i=k=1i-1136+136+136=2i-136

Hence, the conditional mass function of Y given X = i for as

P(Y=jX=i)=22i-1j<i12i-1j=i

Check whether X and Y are independent or not.

If two random variables are independent, then YX.

Here, role="math" localid="1647233450988" PY=j|X=i=PY=j

Hence PY=j|X=jdepends on i then X and Y are not independent

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

Derive the distribution of the range of a sample of size 2 from a distribution having density function f(x)=2x,0<x<1.

In Example 8b, let Yk+1=n+1-i=1kYiShow that Y1,....,Yk,Yk+1 are exchangeable. Note that Yk+1 is the number of balls one must observe to obtain a special ball if one considers the balls in their reverse order of withdrawal.

Consider a directory of classified advertisements that consists of m pages, where m is very large. Suppose that the number of advertisements per page varies and that your only method of finding out how many advertisements there are on a specified page is to count them. In addition, suppose that there are too many pages for it to be feasible to make a complete count of the total number of advertisements and that your objective is to choose a directory advertisement in such a way that each of them has an equal chance of being selected.

(a) If you randomly choose a page and then randomly choose an advertisement from that page, would that satisfy your objective? Why or why not? Let n(i) denote the number of advertisements on page i, i = 1, ... , m, and suppose that whereas these quantities are unknown, we can assume that they are all less than or equal to some specified value n. Consider the following algorithm for choosing an advertisement.

Step 1. Choose a page at random. Suppose it is page X. Determine n(X) by counting the number of advertisements on page X.

Step 2. “Accept” page X with probability n(X)/n. If page X is accepted, go to step 3. Otherwise, return to step 1.

Step 3. Randomly choose one of the advertisements on page X. Call each pass of the algorithm through step 1 an iteration. For instance, if the first randomly chosen page is rejected and the second accepted, then we would have needed 2 iterations of the algorithm to obtain an advertisement.

(b) What is the probability that a single iteration of the algorithm results in the acceptance of an advertisement on page i?

(c) What is the probability that a single iteration of the algorithm results in the acceptance of an advertisement?

(d) What is the probability that the algorithm goes through k iterations, accepting the jth advertisement on page i on the final iteration?

(e) What is the probability that the jth advertisement on page i is the advertisement obtained from the algorithm?

(f) What is the expected number of iterations taken by the algorithm?

A complex machine is able to operate effectively as long as at least 3of its 5 motors are functioning. If each motor independently functions for a random amount of time with density functionf(x)=xe-x,x>0, compute the density function of the length of time that the machine functions.

An insurance company supposes that each person has an accident parameter and that the yearly number of accidents of someone whose accident parameter is λ is Poisson distributed with mean λ. They also suppose that the parameter value of a newly insured person can be assumed to be the value of a gamma random variable with parameters s and α. If a newly insured person has n accidents in her first year, find the conditional density of her accident parameter. Also, determine the expected number of accidents that she will have in the following year.

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