DOC PREVIEW
UCLA STATS 100C - hw3

This preview shows page 1 out of 2 pages.

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

Unformatted text preview:

170A Killip Homework 3 Due Fri, Oct 14(1) Problem 31 from Chapter 1.(2) Study Problem 42 from Chapter 1.(3) Problem 40 from Chapter 1.(4) Suppose my knowledge/ignorance of the number of branches of a certain store isgiven by the following probability law:P(k branches) = (1 − p)pkwhere 0 < p < 1 and k = 0, 1, 2, 3, . . . .If I subsequently discover that they have at least 7 branches (e.g. I walk intostore and it says ‘branch #7’) what new probability law describes my revisedknowledge.(5) Here are the probabilities for the outcomes in the last problem on HW2:M A ET 1/16 7/32N 3/32 1/8F A ET 1/8 1/8N 3/16 1/16Show that F and T are not independent, but are independent conditioned on A.(6) Which is more probable: to obtain n heads from tossing a fair coin independently2n times or to obtain n + 1 heads by throwing the coin 2n + 2 times? Computethe exact ratio of these probabilities.(7) Starting at the origin on the line we take a step of one unit to the left or to theright with probability 1/2. We do this repeatedly with independent steps. If wetake 2n steps, what is the probability that we find ourselves back at the origin.(8) Problem 53 from Chapter 1.(9) Problem 58 from Chapter 1.(10) Seven blue and four red balls are to be arranged in order. How many ways canthis be done if(a) The blue balls are distinguishable (e.g. numbered) as are the red balls.(b) Blue balls are distinguishable, but the red balls are identical.(c) The balls of each color are indistinguishable.(11) How many ways can we order the twenty six letters of the alphabet together withseven (indistinguishable) # symbols?Continued...1(12) How many ways can we distribute n balls among k bags if(a) the balls and bags are distinguishable (e.g. numbered).(b) the bags are distinguishable; the balls are not.(c) balls and bags are distinguishable, but the bags can contain at most one ball(necessarily, k ≥ n).(d) the bags are distinguishable, the balls are not, and the bags can contain atmost one ball.Hint: The previous question has the same answer as (b) with n = 26 and k =


View Full Document

UCLA STATS 100C - hw3

Download hw3
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 hw3 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 hw3 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?