Probability trees and outcomes · Foundation
Introducido| English | Significado |
|---|---|
| conditional probability/kənˈdɪʃənl ˌprɒbəˈbɪlɪti/ | probabilidad condicional |
Pascal and Fermat's letters, 1654
- In 1654 a gambler asked Blaise Pascal how to split the money fairly when a game of chance stops early. Pascal and Pierre de Fermat solved it in a series of letters by listing every way the game could end. Modern probability starts there.
- A tree diagram lists outcomes step by step.
Probability basics
- Probability $= \dfrac{\text{favourable outcomes}}{\text{total equally likely outcomes}}$, from 0 (impossible) to 1 (certain).
- A bag with 3 red and 2 blue counters: $P(\text{red}) = \dfrac{3}{5}$, $P(\text{blue}) = \dfrac{2}{5}$.
A bag has 4 green and 6 yellow sweets. What is P(green)?
Dificultad 1/5 · 100 monedas + un pequeño bono en el primer intento de hoy
4 out of 10.
Drawing a tree
- First draw: two branches, red $\dfrac{3}{5}$ and blue $\dfrac{2}{5}$. Each pair of branches adds to 1.
- Multiply along a path for "and"; add the end results for "or".
The probabilities on a pair of branches from one point add to 1.
Dificultad 1/5 · 100 monedas + un pequeño bono en el primer intento de hoy
One of them must happen.
Worked example: two reds
A counter is taken from the bag (3 red, 2 blue), put back, and a second is taken. Find P(two red).
- With replacement: the second draw is the same as the first, $\dfrac{3}{5}$.
- Multiply: $\dfrac{3}{5} \times \dfrac{3}{5} = \dfrac{9}{25} = 0.36$.
- Without replacement: only 2 red out of 4 remain, so $\dfrac{3}{5} \times \dfrac{2}{4} = \dfrac{6}{20} = 0.3$.
Probability trees and outcomes
A probability lies between 0 and 1
Compare the model with the worked case and explain one change.
A fair coin is tossed twice. What is P(two heads)?
Dificultad 2/5 · 140 monedas + un pequeño bono en el primer intento de hoy
$\dfrac{1}{2} \times \dfrac{1}{2}$.
When the branches change
- Without replacement, the second-draw probabilities depend on the first draw. This is conditional probability 条件概率.
- After a blue, the second draw is red $\dfrac{3}{4}$, blue $\dfrac{1}{4}$.
From 4 green and 6 yellow sweets, two are eaten without replacement. P(both green)?
Dificultad 1/5 · 100 monedas + un pequeño bono en el primer intento de hoy
$\dfrac{4}{10} \times \dfrac{3}{9} = \dfrac{12}{90}$.
"At least one" and "one of each"
- One of each: RB + BR $= 0.3 + 0.3 = 0.6$.
- At least one red $= 1 - P(\text{BB}) = 1 - 0.1 = 0.9$.
P(rain on a day) = 0.3, independently. What is P(rain on at least one of two days)?
Dificultad 2/5 · 140 monedas + un pequeño bono en el primer intento de hoy
$1 - 0.7^2$.
Do not add along a branch. "Red and then red" multiplies: $\dfrac{3}{5} \times \dfrac{2}{4}$. Adding $\dfrac{3}{5} + \dfrac{2}{4}$ gives more than 1 — impossible for a probability.
To find P(red then red), add the two branch probabilities.
Dificultad 1/5 · 100 monedas + un pequeño bono en el primer intento de hoy
Multiply along the path.
Label every branch; each set of branches adds to 1. Multiply along a path, add the paths you want. Without replacement, change the second-stage numbers. "At least one" is often 1 − (none).
A drawer has 5 black and 3 white socks. Two are taken without looking, without replacement. Find the probability they match.
Tree without replacement.