Welcome to the World of Counting!
Ever wondered how many ways you could arrange your books on a shelf, or how many different starting lineups a football manager could pick? That’s exactly what Permutations and Combinations is all about. While it might seem like a lot of numbers at first, it’s really just a set of tools to help us count "possibilities" without having to list them all out one by one. Don’t worry if it feels a bit "abstract" at the start—once you grasp the difference between order and selection, everything else falls into place!
1. The Engine Room: Factorials
Before we dive into the main topics, we need to meet the factorial. It is written with an exclamation mark (!), but it doesn’t mean the number is excited! It is simply a shorthand for multiplying a sequence of descending whole numbers.
Definition: \( n! = n \times (n-1) \times (n-2) \times ... \times 1 \)
Example: \( 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120 \)
Memory Aid: Think of factorials as "lining up." If you have 5 different books, there are \( 5! \) ways to line them up on a shelf.
Important Note: By definition, \( 0! = 1 \). It might seem weird, but it makes the formulas work!
2. Permutations: When Order Matters
A permutation is a fancy word for an arrangement. In permutations, the order of the objects is very important.
The Analogy: Imagine a race with 10 runners. The result "Gold: Alice, Silver: Bob" is different from "Gold: Bob, Silver: Alice." Because the order changes the result, this is a permutation.
The Formula: To find the number of ways to arrange \( r \) objects from a total of \( n \) objects:
\( ^nP_r = \frac{n!}{(n-r)!} \)
Step-by-Step Example:
How many ways can you award Gold, Silver, and Bronze medals to 10 runners?
- Identify \( n \): Total runners = 10.
- Identify \( r \): Positions to fill = 3.
- Use the formula: \( ^{10}P_3 = \frac{10!}{(10-3)!} = \frac{10!}{7!} \).
- Simplify: \( 10 \times 9 \times 8 = 720 \) ways.
Quick Takeaway: If the question uses words like "arrange," "line up," "order," or "rank," you are likely dealing with Permutations.
3. Combinations: When Order Does NOT Matter
A combination is a selection or a "group." Here, we don't care about the order; we only care about who or what is in the group.
The Analogy: Imagine choosing 2 pizza toppings from a list of 10. "Pepperoni and Mushroom" is the exact same pizza as "Mushroom and Pepperoni." Since the order doesn't change the outcome, this is a combination.
The Formula: To choose \( r \) objects from \( n \):
\( ^nC_r = \frac{n!}{r!(n-r)!} \)
Notice: We divide by \( r! \) to "remove" the different orders of the same group.
Common Mistake to Avoid:
Students often use \( ^nP_r \) when they should use \( ^nC_r \). Always ask yourself: "If I swap the items I picked, does it change the outcome?" If NO, use combinations (\( C \)).
Quick Review Box:
Permutation (\( P \)): Order matters (Arrangements).
Combination (\( C \)): Order doesn't matter (Selections).
4. Arrangements with Repetition
Sometimes, we want to arrange things where some items are identical. For example, the letters in the word "NEEDLESS."
The word NEEDLESS has 8 letters: N, E, E, D, L, E, S, S.
The letter E repeats 3 times.
The letter S repeats 2 times.
The Rule: Calculate the total arrangements as if they were all unique, then divide by the factorials of the repetitions.
Calculation for NEEDLESS:
\( \frac{8!}{3! \times 2!} = \frac{40320}{6 \times 2} = 3360 \) ways.
Did you know? This "division" method works because it cancels out the "invisible" swaps between identical letters that don't actually create a new look.
5. Arrangements with Restrictions
Cambridge exam questions often add "rules" to the arrangements. Here are the two most common types:
Type A: "Items must be together" (The Glue Method)
Example: 5 people (A, B, C, D, E) stand in a line. A and B must stand next to each other.
- Glue A and B together and treat them as one single block.
- Now you have 4 items: (AB), C, D, E.
- Arrange these 4 items: \( 4! = 24 \).
- Don't forget: A and B can swap places inside their block (AB or BA). That's \( 2! \) ways.
- Total = \( 4! \times 2! = 48 \) ways.
Type B: "Items must NOT be together" (The Gap Method)
Example: 5 people (A, B, C, D, E) stand in a line. A and B must not stand next to each other.
Method: It's often easiest to find the Total arrangements and subtract the ones where they are together.
- Total ways (no rules): \( 5! = 120 \).
- Ways where A and B are together (from the example above): 48.
- Ways where A and B are NOT together: \( 120 - 48 = 72 \) ways.
Key Takeaway: For "together" problems, glue them. For "not together" problems, subtract the "together" ones from the total.
6. People in Rows
Sometimes you are asked about people sitting in two or more rows. Don't let this scare you! If you are just arranging people into specific seats, it’s usually just a permutation problem across all available seats.
Example: 10 people are to be seated in two rows of 5 seats.
If there are no restrictions, this is just \( 10! \), because you are simply arranging 10 people into 10 distinct positions.
Summary Checklist
Before you tackle a problem, ask yourself:
- Is it a Selection (\( C \)) or an Arrangement (\( P \))?
- Are there repeats? (If yes, divide by the repeat factorials).
- Are there restrictions? (Do I need to glue items together or use the subtraction method?).
- Note: You will never be asked about objects in a circle for this paper, so stick to linear (straight line) arrangements!
Encouragement: Permutations and Combinations takes practice. If a question feels confusing, try drawing small boxes for each "seat" or "position" and fill them in one by one. You've got this!