1
Our gang of seven (Alice, Bob, Carlos, Dave, Xing, Yolanda and Zori) are students in a class with a total enrollment of 35. The professor chooses three students at random to go to the board to work challenge problems.
What is the probability that Yolanda is chosen?
What is the probability that Yolanda is chosen and Zori is not?
What is the probability that exactly two members of the club are chosen?
What is the probability that none of the seven members of club are chosen?
2
Bob says to no one in particular, “Did you know that the probability that you will get at least one ‘7’ in three rolls of a pair of dice is slightly less than \(1/2\text{.}\) On the other hand, the probability that you'll get at least one ‘5’ in six rolls of the dice is just over \(1/2\text{.}\)” Is Bob on target, or out to lunch?
3
Consider the spinner shown in Figure 10.1 at the beginning of the chapter.
What is the probability of getting at least one “5” in three spins?
What is the probability of getting at least one “3” in three spins?
If you keep spinning until you get either a “2” or a “5”, what is the probability that you get a “2” first?
If you receive \(i\) dollars when the spinner halts in region \(i\text{,}\) what is the expected value? Since three is right in the middle of the possible outcomes, is it reasonable to pay three dollars to play this game?
4
Alice proposes to Bob the following game. Bob pays one dollar to play. Fifty balls marked \(1,2,\dots,50\) are placed in a big jar, stirred around, and then drawn out one by one by Zori, who is wearing a blindfold. The result is a random permutation \(\sigma\) of the integers \(1\text{,}\) \(2,\dots,50\text{.}\) Bob wins with a payout of two dollars and fifty cents if the permutation \(\sigma\) is a derangement, i.e., \(\sigma(i)\neq i\) for all \(i=1,2,\dots,n\text{.}\) Is this a fair game for Bob? If not how should the payoff be adjusted to make it fair?
5
A random graph with vertex set \(\{1,2,\dots,10\}\) is constructed using the following method. For each two element subset \(\{i,j\}\) from \(\{1,2,\dots,10\}\text{,}\) a fair coin is tossed and the edge \(\{i,j\}\) then belongs to the graph when the result is “heads.” For each \(3\)element subset \(S\subseteq\{1,2,\dots,n\}\text{,}\) let \(E_S\) be the event that \(S\) is a complete subgraph in our random graph.
Explain why \(P(E_S)= 1/8\) for each \(3\)element subset \(S\text{.}\)
Explain why \(E_S\) and \(E_T\) are independent when \(S\cap T\le 1\text{.}\)

Let \(S=\{1,2,3\}\text{,}\) \(T=\{2,3,4\}\) and \(U=\{3,4,5\}\text{.}\) Show that
\begin{equation*}
P(E_SE_T)= P(E_SE_TE_U).
\end{equation*}
6
Ten marbles labeled \(1,2,\dots,10\) are placed in a big jar and then stirred up. Zori, wearing a blindfold, pulls them out of the jar two at a time. Players are allowed to place bets as to whether the sum of the two marbles in a pair is \(11\text{.}\) There are \(C(10,2)= 45\) different pairs and exactly \(5\) of these pairs sums to eleven.
Suppose Zori draws out a pair; the results are observed; then she returns the two balls to the jar and all ten balls are stirred before the next sample is taken. Since the probability that the sum is an “11” is \(5/45=1/9\text{,}\) then it would be fair to pay one dollar to play the game if the payoff for an “11” is nine dollars. Similarly, the payoff for a wager of one hundred dollars should be nine hundred dollars.
Now consider an alternative way to play the game. Now Zori draws out a pair; the results are observed; and the marbles are set aside. Next, she draws another pair from the remaining eight marbles, followed by a pair selected from the remaining six, etc. Finally, the fifth pair is just the pair that remains after the fourth pair has been selected. Now players may be free to wager on the outcome of any or all or just some of the five rounds. Explain why either everyone should or no one should wager on the fifth round. Accordingly, the last round is skipped and all marbles are returned to the jar and we start over again.
Also explain why an observant player can make lots of money with a payout ratio of nine to one. Now for a more challenging problem, what is the minimum payout ratio above which a player has a winning strategy?