Systematic possibilities and equally likely outcomes · Higher
Introducido| English | Significado |
|---|---|
| sample space/ˈsæmpl speɪs/ | espacio muestral |
| product rule/ˈprɒdʌkt ruːl/ | If one choice has m options and another has n, together there are m × n options. |
The Chevalier de Méré's two bets
- In 1654 the gambler Chevalier de Méré noticed that betting on at least one six in 4 rolls of a dice won money, but betting on at least one double six in 24 rolls of two dice lost money. Pascal explained why: $1 - \left(\dfrac{5}{6}\right)^4 \approx 0.518$, but $1 - \left(\dfrac{35}{36}\right)^{24} \approx 0.491$.
- Higher questions count large sample spaces 样本空间 without listing them all.
Buscar $1 - \left(\dfrac{35}{36}\right)^{24}$ to 3 d.p.
Dificultad 2/5 · 140 monedas + un pequeño bono en el primer intento de hoy
Just under one half.
The two-dice grid
- 36 ordered pairs. Total 7: 6 cells, $\dfrac{1}{6}$. A double: $\dfrac{1}{6}$. Total ≥ 11: $\dfrac{1}{12}$.
- Coin and dice: 12 outcomes; head and even $= \dfrac{1}{4}$.
The product rule for counting
- If one choice has $m$ options and another has $n$, there are $m \times n$ combinations.
- A 4-digit PIN: $10^4 = 10\,000$ codes. Three dice: $6^3 = 216$ outcomes.
A lock uses 3 letters (A–Z) then 2 digits. How many codes are possible?
Dificultad 2/5 · 140 monedas + un pequeño bono en el primer intento de hoy
$26^3 \times 10^2$.
Worked example: de Méré's first bet
A fair dice is rolled 4 times. Find P(at least one six).
- Complement: "at least one six" is the opposite of "no sixes".
- No sixes: $\left(\dfrac{5}{6}\right)^4 = \dfrac{625}{1296} \approx 0.482$.
- Answer: $1 - 0.482 = 0.518$ — just better than even, so the bet wins in the long run.
Systematic possibilities and equally likely outcomes
List outcomes systematically using a grid, table or tree
Classify the worked-case statements, then explain the units or invariant that justifies each decision.
A coin is tossed 5 times. Find P(at least one head) as a decimal.
Dificultad 2/5 · 140 monedas + un pequeño bono en el primer intento de hoy
$1 - \left(\dfrac{1}{2}\right)^5$.
Counting with restrictions
- 3-digit numbers from the digits 1–5 with no repeats: $5 \times 4 \times 3 = 60$.
- Even ones only: the last digit is 2 or 4 (2 ways), then $4 \times 3$ for the others: 24.
How many 3-digit numbers can be made from 1, 2, 3, 4, 5, 6 with no repeated digit, if the number must be odd?
Dificultad 2/5 · 140 monedas + un pequeño bono en el primer intento de hoy
3 choices for the last digit, then 5 × 4.
Three dice
- Galileo's puzzle: with 216 ordered outcomes, total 10 occurs 27 times and total 9 occurs 25 times.
- So $P(10) = \dfrac{27}{216} = \dfrac{1}{8}$ and $P(9) = \dfrac{25}{216}$.
Three fair dice are rolled. How many ordered outcomes are there?
Dificultad 1/5 · 100 monedas + un pequeño bono en el primer intento de hoy
$6^3$.
"At least one" is not found by multiplying the number of tries. $4 \times \dfrac{1}{6} = \dfrac{2}{3}$ is wrong: by that method 6 rolls would make a six certain. Use $1 - P(\text{none})$.
The probability of at least one six in 6 rolls of a dice is $6 \times \dfrac{1}{6} = 1$.
Dificultad 1/5 · 100 monedas + un pequeño bono en el primer intento de hoy
Es $1 - \left(\dfrac{5}{6}\right)^6 \approx 0.665$.
Count outcomes with the product rule: $m \times n \times \ldots$. Put the restricted choice first. Find "at least one" as $1 - P(\text{none})$, and treat ordered outcomes as different.
A menu has 4 starters, 5 mains and 3 desserts. How many three-course meals are possible? If 2 mains are vegetarian, how many meals have a vegetarian main?
Product rule.