Year 2 · Notes: Making Predictions with Data – Laws of Probability, Permutations and Combinations

Topic: S.S2 Y2 MAKING PREDICTIONS WITH DATA

The axioms of probability, complementary events, the addition law and mutually exclusive events, the multiplication law and independent events, tree diagrams with and without replacement, and real-life permutation and combination problems.

View resource Free to join
NotesFree

Year 2 · Notes: Making Predictions with Data – Laws of Probability, Permutations and Combinations

A lotto player, an insurance company and a weather forecaster all deal with chance. In Year 1 you learnt the words of probability and how to count outcomes. Year 2 gives you the laws for combining events: "this or that", "this and then that", and how counting with permutations and combinations makes hard probability questions manageable.

IN THIS NOTE

  • The axioms of probability and complementary events.

  • The addition law; mutually exclusive events; the link with sets and De Morgan's laws.

  • The multiplication law; independent events.

  • Tree diagrams, with and without replacement.

  • Permutations with restrictions and combinations in real-life problems.

  • Using combinations to find probabilities.

1. The axioms of probability

All of probability rests on three simple rules (axioms) for events in a sample space \(S\): (1) \(0 \le P(A) \le 1\) for every event \(A\); (2) \(P(S) = 1\), because something must happen; (3) if \(A\) and \(B\) cannot happen together, \(P(A \cup B) = P(A) + P(B)\).

From these, the probability that \(A\) does not happen is \[P(A') = 1 - P(A).\] If the chance of rain tomorrow is 0.3, the chance of no rain is 0.7.

2. The addition law

For any two events, \[P(A \cup B) = P(A) + P(B) - P(A \cap B).\] This is the same idea as \(n(A \cup B) = n(A) + n(B) - n(A \cap B)\) for sets: the overlap would otherwise be counted twice. Events are mutually exclusive if they cannot happen together, so \(P(A \cap B) = 0\) and the law becomes \(P(A \cup B) = P(A) + P(B)\).

De Morgan's law also carries over: \(P(A' \cap B') = P\big((A \cup B)'\big) = 1 - P(A \cup B)\), the probability that neither event happens.

WORKED EXAMPLE · The addition law

A fair die is rolled. Let \(A\): "even" \(= \{2, 4, 6\}\) and \(B\): "greater than 4" \(= \{5, 6\}\). Then \(P(A \cup B) = \tfrac{3}{6} + \tfrac{2}{6} - \tfrac{1}{6} = \tfrac{4}{6} = \tfrac{2}{3}\), since \(A \cap B = \{6\}\). The probability of neither is \(\tfrac{1}{3}\).

3. The multiplication law and independence

Two events are independent if one happening does not change the chance of the other, like tossing a coin and rolling a die. For independent events, \[P(A \cap B) = P(A) \times P(B).\] This also works as a test: if \(P(A \cap B) = P(A)P(B)\), the events are independent.

WORKED EXAMPLE · Testing independence

\(P(A) = 0.5\), \(P(B) = 0.4\) and \(P(A \cap B) = 0.2\). Then \(P(A \cup B) = 0.5 + 0.4 - 0.2 = 0.7\), and since \(0.5 \times 0.4 = 0.2\), \(A\) and \(B\) are independent.

WATCH OUT

Mutually exclusive and independent are different ideas. Mutually exclusive events cannot both happen; independent events do not affect each other. Two events with non-zero probabilities cannot be both.

4. Tree diagrams

A tree diagram shows a sequence of choices. Write the probability on each branch, multiply along a path to get the probability of that whole outcome, and add the paths that give the event you want. If an item is not replaced, the probabilities on the second set of branches change.

WORKED EXAMPLE · With and without replacement

A bag has 5 red and 3 blue balls. Two are taken out one after the other.

Without replacement: \(P(\text{both red}) = \tfrac{5}{8} \times \tfrac{4}{7} = \tfrac{20}{56} = \tfrac{5}{14}\). \(P(\text{one of each}) = \tfrac{5}{8}\cdot\tfrac{3}{7} + \tfrac{3}{8}\cdot\tfrac{5}{7} = \tfrac{30}{56} = \tfrac{15}{28}\).

With replacement: \(P(\text{both red}) = \tfrac{5}{8} \times \tfrac{5}{8} = \tfrac{25}{64}\).

5. Permutations with restrictions

When some items must stay together, glue them into one block, arrange the blocks, then arrange the items inside the block. When items must not be together, subtract the "together" arrangements from the total.

WORKED EXAMPLE · Together and apart

6 friends sit in a row. Ama and Kofi must sit together: treat them as one block, giving 5 units: \(5! \times 2! = 240\) ways. If they must not sit together: \(6! - 240 = 720 - 240 = 480\) ways.

The letters of BANANA (3 As, 2 Ns) can be arranged in \(\dfrac{6!}{3!\,2!} = 60\) ways.

6. Combinations and probability

"At least one" problems are often easiest by subtracting the "none" case from the total.

WORKED EXAMPLE · At least one

A committee of 4 is chosen from 7 men and 5 women. The number with at least one woman is \(^{12}C_4 - {^7C_4} = 495 - 35 = 460\).

KEY IDEA

Combinations give probabilities directly: \(P = \dfrac{\text{ways to choose what you want}}{\text{ways to choose anything}}\). For the bag above, \(P(\text{both red}) = \dfrac{^5C_2}{^8C_2} = \dfrac{10}{28} = \dfrac{5}{14}\), the same as the tree diagram.

Check yourself

Keep reading on TudHub

Join free to read the whole note.

Additional Mathematics

Senior High

All Additional Mathematics resources

More on MAKING PREDICTIONS WITH DATA

Other resources you can find on TudHub.

Year 2 · Notes: Making Predictions with Data – Laws of Probability, Permutations and Combinations (Additional Mathematics) · TudHub