Welcome to the World of Counting and Chance!
In your standard A Level Maths, you’ve already mastered the basics of probability. Now, in Further Mathematics, we are going to level up. This chapter focuses on Combinatorics—the art of counting.
Why is this important? Because in the real world, "simple" probability isn't always so simple. Whether it’s calculating the number of ways a DNA sequence can be arranged or the odds of winning a complex lottery, we need to know exactly how many possibilities exist. Don't worry if this seems a bit abstract at first; once you master a few "counting tricks," the probability part is just a simple fraction!
1. The Foundations: Factorials and Prerequisite Knowledge
Before we dive into the new stuff, let’s quickly refresh a tool you'll use constantly: the Factorial.
The notation \( n! \) means multiplying a whole number by every whole number below it down to 1.
Example: \( 4! = 4 \times 3 \times 2 \times 1 = 24 \).
Quick Review: Probability is always:
\( P(\text{Event}) = \frac{\text{Number of successful outcomes}}{\text{Total number of possible outcomes}} \)
2. Permutations vs. Combinations
The biggest challenge in this chapter is deciding whether the order of items matters. We use two different tools depending on the situation:
Permutations (Order Matters)
Use this when the sequence or position is important. Think of a PIN code for a bank card. 1-2-3-4 is different from 4-3-2-1, even though they use the same numbers.
Notation: \( {}^n P_r \) (The number of ways to arrange \( r \) objects from a total of \( n \)).
Formula: \( {}^n P_r = \frac{n!}{(n-r)!} \)
Combinations (Order Doesn't Matter)
Use this when you are just "picking a team" or "choosing a handful." Think of Pizza toppings. If you choose mushrooms and pepperoni, it’s the same pizza regardless of which one the chef puts on first.
Notation: \( {}^n C_r \) (The number of ways to choose \( r \) objects from a total of \( n \)).
Formula: \( {}^n C_r = \frac{n!}{r!(n-r)!} \)
Memory Aid:
Permutations = Position (Order is key!)
Combinations = Choice (Order doesn't matter!)
Did you know? Your "Combination Lock" on your school locker is actually a "Permutation Lock" because the order of the numbers matters!
Key Takeaway: Always ask yourself: "If I swap the order of my choices, does it count as a new outcome?" If Yes, use \( P \). If No, use \( C \).
3. Probability in Selections
In selection problems, we usually choose groups of items from a larger set.
Example: Find the probability that 3 vowels and 2 consonants are chosen when 5 letters are chosen at random from the word CALCULATOR.
Step-by-Step Explanation:
1. Count your items: In "CALCULATOR" (10 letters), we have 4 vowels (A, U, A, O) and 6 consonants (C, L, C, L, T, R).
2. Calculate the bottom of the fraction (Total): Ways to choose any 5 letters from 10: \( {}^{10} C_5 \).
3. Calculate the top of the fraction (Successful):
Ways to choose 3 vowels from 4: \( {}^4 C_3 \)
Ways to choose 2 consonants from 6: \( {}^6 C_2 \)
4. Combine and solve: \( P = \frac{{}^4 C_3 \times {}^6 C_2}{{^{10} C_5}} \)
Common Mistake: Students often forget to multiply the successful combinations together on the top. Remember: "And" means "Multiply" in probability!
4. Arrangements in a Line
Further Maths often asks about arranging objects where some are identical or there are specific rules.
A. Dealing with Repetition
If you have a set of letters where some are the same, the number of distinct arrangements decreases.
Analogy: If you swap two identical red pens in a row of pens, the row looks exactly the same!
The Rule: Divide the total arrangements (\( n! \)) by the factorial of the number of repeats for each item.
Example: Probability that the word "ARTIST" is formed when the letters of "STRAIT" are chosen at random.
1. Total letters in "STRAIT" = 6.
2. Repeats: There are two 'T's and two 'I's in the letters available? No, wait! Always look at the letters provided. In "STRAIT", we have S, T, R, A, I, T. That's two 'T's.
3. Total arrangements of "STRAIT" = \( \frac{6!}{2!} = 360 \).
4. There is only 1 way to spell "ARTIST" (if we treat the two T's as interchangeable).
5. \( P = \frac{1}{360} \).
B. Dealing with Restrictions
Sometimes items must be together, or must not be together.
1. "Must be together" (The Glue Method):
Treat the items that must stay together as one single block. Arrange the "block" and the other items, then multiply by the number of ways to arrange the items inside the block.
2. "Must NOT be together" (The Gap Method):
Arrange the "unrestricted" items first. Then, place the restricted items in the gaps between them (including the ends).
Example: Two consonants are not next to each other in the word "TRAITS".
1. Arrange the vowels (A, I) first: \( 2! \) ways.
2. Identify the gaps: _ A _ I _ (3 gaps).
3. Pick gaps for the consonants (T, R, T, S): This is more complex! Usually, the exam will use simpler "separated" logic. If we had 2 consonants to place in 3 gaps, it would be \( {}^3 P_2 \) ways.
Quick Review Box:
- Together? Glue them into one block.
- Separated? Place them in the gaps of the others.
- Identical items? Divide by \( (\text{repeats})! \)
Summary of Key Terms
Permutation: An ordered arrangement of items. \( {}^n P_r \).
Combination: A selection of items where order is ignored. \( {}^n C_r \).
Distinct: Different or unique.
Multiplicative Principle: If one event has \( a \) outcomes and another has \( b \), there are \( a \times b \) total outcomes for both.
Final Encouragement: This chapter is all about logic. If a problem feels overwhelming, try drawing a small version with just 3 or 4 items to see the pattern. You've got this!