This preview shows page 1 out of 3 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 3 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 3 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

� � � Massachusetts Institute of Technology Department of Electrical Engineering & Computer Science 6.041/6.431: Probabilistic Systems Analysis (Fall 2010) Problem Set 3 Due September 29, 2010 1. The hats of n persons are thrown into a box. The persons then pick up their hats at random (i.e., so that every assignment of the hats to the persons is equally likely). What is the probability that (a) every person gets his or her hat back? (b) the firs t m persons w ho picked hats get their own hats back? (c) everyone among th e fi rst m persons to pick up the hats gets back a hat belonging to one of the last m persons to pick up the hats? Now assume, in addition, that every hat thrown into the box has probability p of getting dirty (independently of what happens to the other hats or who has dropped or picked it up). What is the probability that (d) the firs t m persons will pick up clean hats? (e) exactly m persons will pick up clean hats? 2. Alice plays with Bob the following game. First Alice randomly chooses 4 cards out of a 52-card deck, memorizes them, and places th em back into the deck. Then Bob randomly chooses 8 cards out of the same deck. Alice wins if Bob’s cards include all cards selected by her. What is the probability of this happening? 3. (a) Let X be a random variable that takes nonnegative integer values. Show that ∞ E[X] = P(X ≥ k). k=1 Hint: Express the right-hand side of the above formula as a double summation then inter-change the order of the summations. (b) Use the formula in the previous part to find the expectation of a random variable Y whose PMF is defined as follows: 1 pY (y) = , y = a, a + 1, . . . , b b − a + 1where a and b are n onnegative integers with b > a. Note that for y = a, a + 1, . . . , b, pY (y) does not depend explicitly on y since it is a uniform PMF. 4. Two fair three-sided d ice are rolled simultaneously. Let X be the difference of the two rolls. (a) Calculate the PMF, the expected value, and the variance of X. (b) Calculate and plot the PMF of X2 . 5. Let n ≥ 2 be an integer. Show that n � k(k − 1) n k = n(n − 1)2n−2 . k=2 Hint: As one way of solving the problem, following from Example 1.31 in the text, think of a committee that includes a chair and a vice-chair. Page 1 of 2Massachusetts Institute of Technology Department of Electrical Engineering & Computer Science 6.041/6.431: Probabilistic Systems Analysis (Fall 2010) G1† . A candy factory has an endless supply of red, orange, yellow, green, blue, b lack, white, and violet jelly beans. The factory packages the jelly beans into jars in such a way that each jar has 200 beans, equal number of red and orange beans, equal number of yellow and green beans, one more black bean than the number blue beans, and three more violet beans than the number of white beans. One possible color distribution, for example, is a jar of 50 yellow, 50 green, one black, 48 white, and 51 violet jelly beans. As a marketing gimmick, the factory guarantees that no two jars have th e same color distribution. What is the maximum number of jars the factory can produce? †Required for 6.431; optional for 6.041 Page 2 of 2MIT OpenCourseWare http://ocw.mit.edu 6.041 / 6.431 Probabilistic Systems Analysis and Applied Probability Fall 2010 For information about citing these materials or our Terms of Use, visit:


View Full Document

MIT 6 041 - Study Guide

Documents in this Course
Quiz 1

Quiz 1

5 pages

Quiz 2

Quiz 2

6 pages

Quiz 1

Quiz 1

11 pages

Quiz 2

Quiz 2

2 pages

Syllabus

Syllabus

11 pages

Quiz 2

Quiz 2

7 pages

Quiz 1

Quiz 1

6 pages

Quiz 1

Quiz 1

11 pages

Quiz 2

Quiz 2

13 pages

Quiz 1

Quiz 1

13 pages

Load more
Download Study Guide
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Study Guide and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Study Guide 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?