Suppose that stars are distributed in space according to a


Honors Exam 2013: Probability

1. A deck of cards is shuffled well. The cards are dealt one by one, until the first time an Ace appears.

(a) Find the probability that no Kings, Queens, or Jacks appear before the first Ace.

(b) Find the probability that exactly one King, exactly one Queen, and exactly one Jack appear (in any order) before the first Ace.

2. There will be X ∼ Pois(λ) courses offered at a certain school next year.

(a) Find the expected number of choices of 4 courses (in terms of λ, fully simplified), assuming that simultaneous enrollment is allowed if there are time conflicts.

(b) Now suppose that simultaneous enrollment is not allowed, and that there are only four possible time slots: 10 am, 11:30 am, 1 pm, 2:30 pm (each course meets Tuesday-Thursday for an hour and a half, starting at one of these times). Rather than trying to avoid major conflicts, the school schedules the courses completely randomly: after the list of courses for next year is determined, they randomly get assigned to time slots, independently and with probability 1/4 for each time slot.

Let Xam and Xpm be the number of morning and afternoon courses for next year, respectively (where "morning" means starting before noon). Find the joint PMF of Xam and Xpm, i.e., find P(Xam = a, Xpm = b) for all a, b.

3. You are given an amazing opportunity to bid on a mystery box containing a mystery prize! The value of the prize is completely unknown, except that it is worth at least nothing, and at most a million dollars. So the true value V of the prize is considered to be Uniform on [0, 1] (measured in millions of dollars).

You can choose to bid any amount b (in millions of dollars). You have the chance to get the prize for considerably less than it is worth, but you could also lose money if you bid too much. Specifically, if b < 2/3V , then the bid is rejected and nothing is gained or lost. If b ≥ 2/3V, then the bid is accepted and your net payoff is V - b (since you pay b to get a prize worth V). What is your optimal bid b (to maximize the expected payoff)?

4. Let U1, U2, U3 be i.i.d. ∼ Unif(0, 1). Find P(U1U2 < U23).

5. Let X1, X2, X3, . . . , X10 be the total number of inches of rain in Boston in October of 2013, 2014, 2015, . . . , 2022, respectively, with these r.v.s independent N (µ, σ2). (Of course, rainfall can't be negative, but µ and σ are such that it is extremely likely that all the Xj's are positive.) We say that a record value is set in a certain year if the rainfall is greater than all the previous years (going back to 2013; so by definition, a record is always set in the first year, 2013).

(a) On average, how many of these 10 years will set record values? (Your answer can be a sum but the terms should be simple.)

(b) Determine whether the event that the year 2020 sets a record is independent of the event that the year 2021 sets a record.

(c) Find the probability that the October 2020 rainfall will be more than double the October 2021 rainfall in Boston, in terms of the standard Normal CDF Φ.

6. Suppose that stars are distributed in space according to a 3-dimensional Poisson process with parameter λ (for simplicity, take space to be R3 without worrying about whether the universe is finite or infinite). This means that the number of stars in any region of space is Poisson with parameter λ times the volume of the region, and the numbers of stars in any two disjoint regions of space are independent.

(a) You are at the origin. Find the distribution of the (Euclidean) distance from you to the nearest star (give the CDF or the PDF).

(b) Let S be a bounded region of space, which has been partitioned into disjoint subregions S1, . . . , Sk. What is the (conditional) joint PMF of the star counts for each Sj, given that there are exactly n stars in S?

Attachment:- Assignment.rar

Request for Solution File

Ask an Expert for Answer!!
Engineering Mathematics: Suppose that stars are distributed in space according to a
Reference No:- TGS01483338

Expected delivery within 24 Hours