Chapter 5: Permutations and Combinations

Welcome to Last Minute Lecture.

This free chapter overview is designed to help students review and understand key concepts.

These summaries supplement, not replace the original textbook and may not be redistributed or resold.

For complete coverage, always consult the official text.

So during World War II, taking a really simple six -letter word,

like Saturn,

and running it through an Enigma encryption machine, it yielded over 27 million possible configurations.

Which is just, I mean, staggering to even think about.

Yeah, exactly.

So a word could become ECHKBP or just millions of other completely scrambled realities.

And all of that complexity, that literal war -winning and war -losing complexity, it was born from the fundamental mathematics of arrangement.

It really is.

Millions of hidden realities built from just a handful of letters.

Totally.

So welcome to this custom deep dive.

Today, we are stepping in as your personal last -minute lecture tutoring team.

We're here to help you out.

We are going straight into the architecture of those millions of possibilities.

We're unpacking chapter five of the Cambridge International AS and A -level mathematics course book on probability and statistics.

Yeah, and our mission today is really to demystify the math of selections and arrangements.

Right, specifically permutations and combinations.

Exactly, and to show you how these foundational tools crack wide open some seriously complex probability problems.

Because the applications here go, you know, way beyond historical cryptography.

Oh, for sure.

Like the textbook points out that these very concepts govern modern transport logistics.

They map out relationships between proteins and genetic engineering, and they dictate the security of literally every digital password you use.

So we are basically stepping out of basic arithmetic and into the mechanics of pure choice.

Right, but before we can build those millions of possibilities, we need a foundational building block.

And in this realm of mathematics, that block is the factorial.

The factorial.

Denoted by an exclamation mark.

Yep.

Written out as like the letter N, followed by an exclamation point.

I always read that in my head as the math just being incredibly exciting.

I mean, it is pretty exciting math, but yeah, it's actually a very strict set of instructions.

It tells you to multiply a sequence of descending positive integers.

Okay, so if you see a four with an exclamation point, you calculate four times three times two times one.

Exactly, it's the mathematical engine for calculating arrangements.

And it scales up with, well, terrifying speed.

Oh yeah, it gets huge fast.

The textbook notes that just seven factorials is already over 5 ,000.

Wow.

And by the time you reach 13 factorial, you are dealing with billions.

It's the raw mathematical representation of exponential possibility.

Okay, but let's address a strange mathematical quirk right at the beginning of this section, because I know this trips people up, including me.

Oh, I know exactly what you're gonna say.

Right, the book states that zero factorial equals one.

Conceptually, that sounds like math magic.

How can zero arrangements equal one?

It feels wrong, totally.

But if you look at the sequence the book lays out, there is a distinct pattern of division happening behind the scenes.

Okay, walk me through it.

So if four factorial is 24 and three factorial is six, you get there by dividing 24 by four.

Right, and let's follow that exact logic all the way down.

To get two factorial, we take the previous answer, which is six, and divide it by three, giving us two.

Exactly, and then to get one factorial, we took that two and divide by two, giving us one.

So to find zero factorial, we just relentlessly follow that exact same division pattern.

Yep.

We take the previous answer, which was one, and divide it by one.

One divided by one is one.

Therefore, following the sequence mathematically,

zero factorial must equal one.

The pattern absolutely demands it.

And for your upcoming exams, or just honestly your general sanity when navigating these formulas, remembering that zero factorial equals one is completely non -negotiable.

Because it shows up everywhere later on.

Exactly.

As we start building formulas for selections, you will frequently find zero factorial in the denominator.

If you assume it equals zero, you will accidentally try to divide by zero.

Which we all know is mathematically undefined and will entirely derail your calculation.

Right, so we have our building block.

The factorial handling the heavy lifting of multiplication.

Now we can apply it to our first major tool, which is permutations.

Okay, and the defining characteristic of a permutation is that the order of arrangement absolutely matters.

The order is the entire point.

A permutation is a way of selecting objects and arranging them in a strictly defined sequence.

I always like to think of a permutation as a computer password.

That's a great way to look at it.

Right, because if my password is A, B, typing B, A will return an error.

Even though I'm using the exact same letters, the sequence is altered, so it's considered a completely different entity.

Precisely.

If you are arranging a set of distinct objects in a line,

the number of possible permutations is simply the factorial of the total number of objects.

Just super simple.

It is.

The textbook uses a wonderfully bizarre visual to demonstrate this.

It asks,

which is just a terrifying logistics problem.

Right.

But mathematically, since all nine elephants and all four mice are distinct individual animals,

you are simply arranging 13 unique objects.

Yeah, you don't need to separate them by species if you're just putting them in a single line.

So the math is literally just 13 factorial, which, if you run the calculation, is over 6 .2 billion ways to line up those animals.

And think back to the Enigma machine example from the start of the chapter.

If 13 animals can generate 6 .2 billion arrangements, you can start to see why breaking mechanical encryption by hand was an impossible task.

It's just too much data.

Yeah, the factorial growth creates a sheer wall of mathematical noise.

But, and this is a big, but that calculation only works because every single animal is distinct.

The math changes when the items in your sequence are identical.

Right, because the password analogy gets complicated if you have repeating characters.

The text uses the example of arranging the letters A, A, B, C, D.

If all five letters were completely different, the total arrangements would be five factorial, which is 120.

But we have two A's.

Exactly.

So if I create an arrangement, say B, C, A, A, D, and then I physically swap the positions of the two A's, I still just have B, C, A, A, D.

I literally cannot tell them apart.

And the standard factorial formula is blind to identical items.

It treats those two A's as distinct, meaning it double counts every single arrangement.

So how do we fix it?

To fix this over counting, we take the total permutations, which is five factorial, and we divide it by the factorial of the repetitions.

Oh, I see.

Since there are two A's, we divide by two factorials.

Exactly.

So 120 divided by two gives us 60 unique arrangements.

We are basically mathematically erasing the phantom arrangements that look identical to us.

Okay, divide the total factorial by the factorial of the repetitions.

Got it.

Now, what if we have a pool of items, but we don't want to arrange all of them?

Like a subset.

Yeah.

So we have five letters, but we only want to pull out three and erase them into a password.

This is a permutation of a subset, often denoted with a capital P in formulas, and the formula the textbook introduces here is really elegant.

Let me guess, more factorials.

Of course.

You take the factorial of your total pool of items, and you divide it by the factorial of the items you are leaving behind.

Oh, okay.

So if you have five items and you're arranging three, you are leaving two behind.

You divide five factorial by two factorial.

That's it.

That basic machinery makes sense, right?

But the textbook immediately tests that understanding by introducing restrictions.

Oh, right.

This is where you have to arrange things, but under highly specific rules.

Yeah, and problem solving with restrictions is the ultimate test of whether you understand the logic, or if you're just blindly plugging numbers into a formula.

Which never works in higher math.

No, it really doesn't.

The golden rule for these problems is always the same.

Deal with the restricted positions first.

Isolate the troublemakers.

Okay, let's walk through the book's worked example.

The question asks, how many odd four -digit numbers greater than 3 ,000 can be made from the digits one, two, three, and four, using each digit only once?

Right, so picture four empty slots that we need to fill to build this number.

We have two major constraints here.

First, the number must be greater than 3 ,000.

Exactly.

That restricts our very first slot, the thousands column.

Based on our available digits, that slot can only be filled by the three or the four.

Right, and the second constraint is that the number must be odd.

That restricts our final slot, the units column.

It can only be filled by the one or the three.

And the conflict there is obvious, isn't it?

Yeah, the digit three is involved in both restrictions.

It could be the first number, or it could be the last number, but it can't be both since we can only use it once.

So to prevent the logic from collapsing, we have to split this into two separate parallel scenarios.

Let's isolate the first scenario, assume the first digit is a four.

Okay, so the thousand slot is locked in.

We have one option for that slot.

Right.

If the first slot is a four, that leaves us with the digits one, two, and three for the rest of the number.

Because the whole number must be odd, the final slot has to be the one or the three.

Which gives us two options for the final slot.

Right, once we lock that in, we have two digits left over for the middle two slots, which have no restrictions.

We just arrange those remaining two digits, which is two factorial.

And the logic holds perfectly.

You multiply those independent choices together.

One option for the first slot times two options for the final slot times two factorial for the middle.

So one times two times two, that yields four possible numbers for this specific scenario.

Exactly.

Now for the parallel scenario, what if the number starts with the three?

We lock in the first slot, one option.

But because we just use the three, and the final slot absolutely must be an odd number, we're forced to use the one for the final slot.

It's the only odd digit we have left.

The restriction forces our hand.

So one option for the first slot and one option for the final slot.

We again have two unrestricted digits left for the middle slots, so two factorial.

Multiplying those out gives us two possible numbers for this second scenario.

Since these are parallel realities, a number can start with a four, or it can start with a three, but never both.

We simply add the possibilities together.

Four plus two equals six.

There are exactly six valid number you can build.

See, by dealing with the restricted ends of the number first, the unrestricted middle just naturally fell into place.

It's totally an exercise in structured logic.

It really is.

But permutations, where order strictly dictates the outcome, are only half the toolkit.

We need to shift to the mathematical tool we use when order simply does not matter.

Combinations.

Yes.

If permutations are computer passwords,

combinations are a bowl of ice cream and strawberries.

I love this analogy.

It works, right?

Yeah.

If you put strawberries in the bowl and then add ice cream, you have the exact same dessert as if you put the ice cream in first and then added the strawberries.

The sequence of assembly doesn't change the final outcome.

You're just selecting a group.

Exactly.

And because the arrangement is irrelevant, a combination will always yield fewer possibilities than a permutation of the same objects.

We are dealing purely with selection.

The formula for a combination, denoted by a capital C, looks very similar to the permutation formula, but with an extra mathematical mechanism attached to the denominator.

You divide the total factorial by both the items left behind and an extra factorial of the items you actually selected.

Yeah, that extra division by the selected items factorial is crucial.

It acts as a mathematical eraser.

A mathematical eraser.

I like that.

It systematically wipes out all the different ways the selected group could be arranged, leaving us with just the single concept of the group itself.

The textbook actually illustrates basic selection with a truly absurd example here.

It asks,

in how many ways can three fish be selected from a bowl containing seven fish and two potatoes?

I know, it's so weird.

But it tests your ability to parse relevant data from irrelevant noise.

The potatoes are entirely a distraction.

Completely.

If your target selection is fish, you completely ignore the potatoes.

You aren't selecting from a pool of nine objects, you're selecting three fish from a pool of seven fish.

Exactly.

You just run the combination formula for choosing three from seven, which leaves you with 35 distinct groups of fish.

The math doesn't care about the potatoes.

Good to know.

But where combinations demand real logical rigor is when we start combining different sets of selections.

Oh, absolutely.

You have to recognize when the mathematical rules require you to multiply your selections and when they require you to add them.

This is where I always had to pause and double check my thinking.

The fundamental rule is, if selections are independent, you multiply.

If selections are mutually exclusive, you add.

Spot on.

Let's look at independent selections first.

The text uses the example of picking five books from a shelf of eight and simultaneously picking three magazines from a stack of six.

Okay, the choice of which books you take has absolutely zero physical or logical impact on which magazines you take.

They don't affect each other at all.

Right.

So you calculate the total combinations for the books, choosing five from eight, which gives 56 distinct piles of books.

Then you calculate the magazines, choosing three from six, which gives 20 distinct piles of magazines.

And because they're independent, for every single one of those 56 book piles, you could pair it with any of the 20 magazine piles.

It creates a branching tree of possibilities.

Therefore you multiply.

56 times 20 yields 1 ,120 totally unique combinations of reading material.

Now contrast that branching tree with mutually exclusive selections.

Okay.

The textbook presents a scenario where you must choose a team of five people from a larger group of six women and five men.

The restriction here is that the final team must contain more women than men.

So you cannot just grab five random people and hope for the best.

Definitely not.

You have to map out the allowed team structures.

If the team must have five members and women must outnumber men, what are the actual realities that satisfy that rule?

I'd map it out like a table.

Reality one, the team has three women and two men.

Reality two, the team has four women and one man.

Reality three, the team is entirely five women and zero men.

Right.

Those are the only structures that fit the restriction.

And those three realities are mutually exclusive.

Because a single team of five cannot simultaneously have exactly three women and exactly five women.

It must be one structure or the other.

Precisely.

So we process them one by one.

For the first reality, you calculate the combinations for choosing three women from the six available and multiply that by the combinations of choosing two men from the five available.

Okay.

And that calculation gives you 200 possible teams that fit that specific three to two structure.

You then run that exact same combined calculation for the four women structure, yielding 75 possible teams.

And again, for the five women structure, yielding six possible teams.

And because these are parallel realities that cannot coexist,

we do not multiply them.

We add the totals together.

Yes, add them.

200 plus 75 plus six.

There are 281 possible valid teams.

So if it's a branching path, you multiply.

If they're parallel realities, you add.

Understanding that difference is the key to unlocking the final major concept of this chapter.

The ultimate reason we learned permutations and combinations is that they function as incredibly powerful shortcuts for calculating probability.

Probability, which stripped down to its core is just a fraction, right?

The number of favorable outcomes you want divided by the total number of possible outcomes that could happen.

Exactly.

In a simple scenario, like flipping a coin, that fraction is obvious.

One favorable outcome, say, heads divided by two total possible outcomes, one over two.

But when your total possible outcomes stretch into the thousands, you can't just count them.

No, you definitely can't.

Let's look at the cherry bag example from the text.

You have a bag containing 13 red cherries and seven black cherries.

Sounds like a good bag.

Right.

You reach in and randomly pull out five.

What is the probability that you end up with more red cherries than black ones?

Okay, if you tried to solve this using the conditional probability rules from chapter four, where you draw out probability tree diagrams for every single sequential pick,

you would be drawing branches all day.

It's wildly inefficient.

But with combinations, we can bypass the tree entirely.

We need our denominator first, the total possible outcomes.

You are selecting five cherries from a total pool of 20 cherries.

Order does not matter, so it's a straightforward combination.

The math reveals there are 15 ,504 total possible ways to pull five cherries from that bag.

That's our denominator.

Now we need the numerator, the favorable outcomes.

The restriction is more red than black.

Which requires the exact same logic we used for the men and women team.

We map out the mutually exclusive realities.

Three red and two black, four red and one black, five red and zero black.

Exactly.

You calculate the combinations for each of those three realities, multiply within the reality to combine the red and black selections, and then add the three parallel totals together.

The textbook does the heavy arithmetic for us, revealing there are 12 ,298 favorable combinations.

So to find the final probability, we just build the fraction.

12 ,298 favorable outcomes divided by 15 ,504 total possible outcomes.

And that divides out to a probability of roughly 0 .793.

Yeah.

What would have taken an hour of drawing probability trees took three lines of algebra.

It's a massive analytical shortcut.

It really is.

And the book offers one final highly strategic shortcut in this section regarding probability.

Oh right, the use of complimentary events.

In many complex problems, calculating the exact probability of the outcome you want is mathematically tedious.

Often it is vastly more efficient to calculate the probability of the outcome you do not want and subtract that from absolute certainty.

Which is one.

Exactly.

The textbook demonstrates this with the minibus example.

A minibus has seven passenger seats, three on the driver's side and four on the opposite side.

Two friends sit down randomly.

What's the probability they sit on opposite sides of the bus from each other?

Okay.

So if you attempt to calculate opposite sides directly, you have to map out multiple scenarios.

Friend A on the left and friend B on the right plus friend B on the left and friend A on the right, factoring in all the specific seat choices.

The math expands very quickly.

Too quickly.

But the exact opposite scenario is much simpler.

Because if they aren't sitting on opposite sides, the only other possibility is that they are sitting on the same side.

Exactly.

And same side is much easier to calculate.

They either both sit on the three seat side or they both sit on the four seat side.

And because these are specific distinct seats in a vehicle, the order in which they choose them matters.

So we use permutations.

Spot on.

We calculate the favorable permutations for both choosing the three seat side and add it to the favorable permutations for both choosing the four seat side.

Then we divide that combined number by the total possible ways two people could sit in any of the seven seats.

The math reduces down to three over seven.

But we must remember what that number represents.

Three over seven is the probability that the friends sit on the same side.

And the original question asked for opposite sides.

Right.

Since a probability of one represents absolute guaranteed certainty, we simply take one and subtract our same side probability.

One minus three over seven equals four over seven.

Four out of seven is our final answer.

By actively choosing to calculate the opposite of what the question asked, we bypassed a massive amount of messy calculation.

It forces you to step back from the raw numbers and ask,

is there a structurally more efficient path to this truth?

That is such a good way to frame it.

Okay, let's take a breath and survey the terrain we've covered today.

We did cover a lot.

We started with the factorial, the mathematical engine of descending multiplication.

We used it to build permutations where order strictly dictates reality like a password or an enigma code.

Yep.

Then we introduced a mathematical eraser to build combinations where only the chosen group matters, like strawberries and ice cream.

Which I will always remember now.

And finally, we deployed both of those tools as ultimate cheat codes to bypass massive probability trees, allowing us to calculate thousands of outcomes in a few lines of logic.

It is a profound shift in how you process complex systems.

But before we wrap up, I wanna leave you with a final puzzle from the textbook to test how well you've internalized these rules.

Oh, I love a good puzzle.

In the Explore 5 .3 section, there is a problem about a tandem bicycle.

Ah, yes.

This one is a brilliant logic trap.

Two women and three men are gonna ride a five -seater tandem bicycle.

The book asks you to calculate two different scenarios.

First, find the number of seating arrangements where the two women are physically separated from each other.

Okay.

Second, find the arrangements where the three men are separated from each other.

And the book demonstrates a specific logical method for this.

To separate the women, it suggests grouping the three men together, treating them as a single block to arrange around, and does the math to arrive at 72 possible arrangements.

Then, to separate the men, it groups the two women together, treats them as a single block, repeats the same mathematical steps, and gets 84 arrangements.

Here's the problem you need to ponder.

The mathematical steps in both calculations are identical, but one of those logical paths is fundamentally flawed.

Wait, really?

Yes.

The grouping logic works perfectly for one gender, but fails completely for the other.

As you go about your day, think about the physical reality of a five -seat bike.

Why might treating the three men as a single unbreakable block accidentally force the women to sit together, while treating the women as a block works just fine for separating the men?

Oh, wow.

It perfectly illustrates that you can never just blindly trust a formula.

You always have to picture the physical reality you are modeling.

Well, you've got this.

Take that puzzle with you.

On behalf of the last -minute lecture team, thank you for letting us be your study guides through chapter five today.

Good luck, and keep calculating.