1.

a. Let X be the number of combinations of defective computers in your chosen 3.

PMF = {P(X = 3) = (7/28)(6/27)(5/26)
P(X = 2) = (7/28)(6/27)(21/26)*(3!/(2!1!))
P(X = 1) = (7/28)(21/27)(20/26)*(3!/(1!2!))
P(X = 0) = (21/28)(20/27)(19/26)
x = 0 otherwise}
b. ¾​ = ΣP(X = i) * i = 3(7/28)(6/27)(5/26) + 2(7/28)(6/27)(21/26)*(3!/(2!1!)) +
1(7/28)(21/27)(20/26)*(3!/(1!2!)) + (21/28)(20/27)(19/26). Let X be the number of
combinations of defective computers in your chosen 3.
c. Let indicator random variable X​i​ represent if a chosen computer is defective or
not. X​i​ = 1 if the computer is defective, and X​i​ = 0 otherwise. The probability mass
function of X​i​ is:
PMF = {P(X​i​ = 1) = 7/28
P(X​i​ = 0) = 21/28}
E[X​i​] = 1 * 7/28 = ¼
E[X] = E[∑X​i ​(from 1 to 3)]
E[X] = ∑E[X​i​] (from 1 to 3) = ​¾
2. Let indicator random variable X​i​ represent if the ith pile has no two cards of equal rank or
not. X​i​ = 1 if the ith pile has no two cards of equal rank, and X​i​ ​= 0 otherwise. The
probability mass function of X​i​ is:
PMF = {P(X​i​ = 1) = 1 * 48/51 * 44/50 * 40/49
P(X​i​ = 0) = 1 - P(X​i​ = 1)}
E[X​i​] = (1 * 48/51 * 44/50 * 40/46 * 40/49) * 1
E[X] = E[∑X​i ​(from 1 to 13)]
E[X] = ΣE[X​i​] (from 1 to 13) = 13E[X​i​] = ​8.79
3.
a. .2583​ = 15!/(5!10!) / 19!/(5!14!)
b. Let indicator random variable X​i ​represent if a given four runs in a row is a run of
bad luck, where X​i​ = 1 if the four runs is a run of bad luck and X​i​ = 0 otherwise.
PMF = {P(X​i​ = 1) = (.2583)​4
P(X​i​ = 0) = 1 - (.2583)​4​}
E[X​i​] = (.2583)​4​ * 1
E[X] = E[∑X​i​ from 1 to 45525]
In 45,529 deals, there are 45,525 groups of 4 runs in a row.
E[X] = (ΣE[X​i​] from 1 to 45525) = 45529E[X​i​] = ​202.5​ (This answer is when using
full decimal value of part a. If you only use 4 significant digits, you will get 202.7)
4.
a. Let random variable X be the number of cards Martin buys until he has a
complete set of n. Let X​i​ represent the number of cards Martin buys when he has
i different cards until he has one more different card. Since X​i​ has infinite
possibilities, it is geometric and the pmf is:
The probability of buying a different card given you have i different cards is
(n-i)/n, because there are n-i remaining different cards and n total cards you can
buy.
PMF = {P​x​(i) = (i/n)​i - 1​((n-i)/n)}
E[X​i​] = 1/p (As shown in lecture notes for expected value of a geometric r.v.)
= n/(n-i)
E[X] = ΣE[X​i​] from i = 0 to n - 1
E[X] = 1 + n/(n-1) + n/(n-2) + n/(n-3) + … + n
E[X] = nH​n
b. E[X] = ∑(100 / (100 - i)) for i = 0 to i = 99
E[X] = 519 cards