set.seed(12345)
coin <- c("Heads", "Tails")
tosses <- sample(coin, 10, replace = TRUE)
data.frame(tosses) |>
group_by(tosses) |>
summarise(n = n())# A tibble: 2 × 2
tosses n
<chr> <int>
1 Heads 3
2 Tails 7
10:00
If I roll a fair six-sided die, what is the chance that I will roll a multiple of 3 OR a multiple of 4?
Multiples of 3 in \(\{1, \ldots, 6\}\) are \(\{3, 6\}\), and the only multiple of 4 is \(\{4\}\). These two events don’t overlap (they are mutually exclusive), so by the addition rule, \(P(\text{multiple of 3 } OR \text{ multiple of 4}) = \frac{2}{6} + \frac{1}{6} = \frac{3}{6} = \frac{1}{2}\).
We have two events \(A\) and \(B\) in an outcome space \(\Omega\). If \(P(A) = 0.7\) and \(P(B) = 0.5\), can \(A\) and \(B\) be mutually exclusive? Draw a Venn diagram and use it to say what is the largest that the intersection of \(A\) and \(B\) could possibly be. Also, what is the smallest this value can be. That is, find upper and lower bounds on the value of \(P(A \cap B)\).

There are 365 (or 366) days in a year. Everyone has a birthday (e.g. August 2 or June 14). We have roughly 80 people in this class, so clearly we can’t cover the whole calendar year, but it is still possible that two people in class have the same birthday.
Let \(\Omega\) be the outcome space, and let \(P(A)\) denote the probability of the event \(A\). Then we have:
00:30
Consider the Venn diagram below, which has 20 possible outcomes in \(\Omega\), depicted by the purple dots. Suppose the dots represent equally likely outcomes. What is the probability of \(A\) or \(B\) or \(C\)? That is, what is \(P(A \cup B \cup C)\)?
Using the complement rule, \(P(A\cup B \cup C) = 1-\dfrac{5}{20} = \dfrac{15}{20}\)
xkcd comic showing two people discussing what it means to have a 50-50 chance
Suppose we toss a pair of fair six-sided dice, and sum the spots (such as when we play Monopoly). We want to model this using a box of tickets. Will the box shown here work? If so, how many times should we draw, and if not, why not?
# A tibble: 2 × 2
tosses n
<chr> <int>
1 Heads 251
2 Tails 249
We see that as the number of tosses increases, the split of heads and tails begins to look closer to 50-50.
Here is a plot of the proportion of tosses that land heads when we toss a coin \(n\) times, where \(n\) varies from \(1\) to \(1000\).
00:30
Suppose Ali and Bettina are playing a game, in which Ali tosses a fair coin \(n\) times, and Bettina wins one dollar from Ali if the proportion of heads is less than 0.4. Ali lets Bettina decide if \(n\) is 10 or 100.
Which \(n\) should Bettina choose?
20:00
25:00
