PrepShorts · Study sheet · Class 11 Mathematics · Chapter 6, Permutations and Combinations
Chapter 6 · Permutations and Combinations
Why choices made one after another multiply rather than add
This video could not be loaded. Reload the page to try again.
Sign in with Google12 min.
Keep your place in this chapter — sign in, it’s free.Sign in
Three trousers and two shirts do not make five outfits. List every pairing and there are six — three equal groups of two, because equal groups are what multiplication counts.
The idea
Two choices made one after another multiply because every single outcome of the first choice leaves the same number of options open at the second — so the outcomes arrive in equal-sized groups, and equal-sized groups are what multiplication counts. Note how little that demands. The options themselves may change from branch to branch, and in most of this chapter they do: only in the two-supply pictures the chapter draws does each first choice leave the second supply literally untouched. What has to hold is the count, not the contents. Addition answers a different question entirely: it counts alternatives you must choose between, not stages you pass through. The chapter's own five-flag signal count settles the distinction by using both in one problem, multiplying inside each signal length and adding across the four lengths because a signal cannot have two lengths at once.
What you should be able to do
- State the counting principle for two stages and for any finite number of stages
- Justify the product by showing that every outcome of the first stage leaves the same number of second-stage options open, rather than by checking a drawn list
- Count the paths in the chapter's two branching figures and confirm they agree with the product
- Decide, for a given problem, whether stages should be multiplied or cases added, and say what test settles it
- Recompute a count when repetition is permitted, and explain why the factors stop shrinking
- Identify which stage carries a restriction and fill that stage first
- Break a problem with a lower bound on length into disjoint cases, count each by the product rule, and add
- Apply the principle to the chapter's opening lock problem and report the number of sequences to be tried
Words to know
| Term | Definition in one line | First introduced |
|---|---|---|
| fundamental principle of counting | the rule that the number of ways two successive stages can happen is the product of their separate counts | printed in this chapter, §6.2, p. 102 |
| multiplication principle | the same rule under its shorter name, which the chapter uses throughout | printed in this chapter, §6.2, p. 102 |
| event | one stage of a choice, whose number of ways is one factor of the product | printed in this chapter, §6.2, p. 102 |
| vacant places | the empty slots to be filled, drawn as small boxes in the worked solutions | printed in this chapter, Example 1, p. 102 |
| in succession | one stage completed before the next begins, which is the condition the product needs | printed in this chapter, §6.2, p. 102 |
| signal | an ordered stack of coloured flags on a staff, the chapter's running example for ordered counting | printed in this chapter, Example 2, p. 103 |
| tree diagram | a branching picture whose root-to-tip paths are the outcomes | an added term; the chapter draws two such figures on p. 101 and never names the shape |
| disjoint cases | groups of outcomes that share no member, so their counts may be added | an added phrasing; the chapter separates the four signal lengths in Example 4 without naming the condition |
Where people slip up
- "Three pants and two shirts make five outfits." Adding counts the garments, not the outfits. The question asks for pairs, and Fig 6.1 shows six of them. Make the student point at the sixth tip.
- "So counting problems are always multiplication." Example 4 adds four numbers. The test is whether the two things being combined are stages of one outcome, which multiply, or alternatives for one outcome, which add — and alternatives may be added only when no outcome belongs to two of them.
- "You can add the four signal counts because they are all signals." You can add them because no signal has two lengths. If the cases could overlap, adding would double-count the overlap.
- "The factors just go down by one each time, always." They shrink only because the supply shrinks. Permit reuse and every factor equals the full supply, which is what turns 24 into 256 in Example 1's Note.
- "Fill the places left to right." Example 3 fills the units place first because that is where the restriction lives, though with reuse permitted either order gives 10. The order starts to matter once repetition is barred: there, filling a restricted place after an unrestricted one can leave a factor that depends on what was already chosen, and the principle needs each stage's count to be a fixed number. Exercise 6.3 Q3 and Q4 are where that bites.
- "The tree proves it." The tree makes the structure visible for six or twelve outcomes; nobody draws 504. The argument that survives the growth is that every first branch has the same number of branches hanging off it — which is true even in Example 1, where the three letters left after the first pick are a different three on every branch.
- "m × n counts unordered pairings." It counts one pant with one shirt as one outcome, and that outcome is a pair of things drawn from two different supplies — a situation where the question of order does not arise yet. It arises in §6.3.
Ask your teacher a person
Your teacher reads this and writes back, usually within a day. For an instant answer, use Ask the video in the sidebar.
Your class sees the question and the answer. Only your teacher sees that it was you.
No questions on this topic yet.
Worked answers: Exercise 6.1 · Exercise 6.2 · Exercise 6.3 · Exercise 6.4 · Miscellaneous Exercise · this video explains Exercise 6.1 Q2, Exercise 6.1 Q4, Exercise 6.1 Q5, Exercise 6.1 Q6, Exercise 6.3 Q3, Exercise 6.3 Q9
Transcript1,773 words
Here is a lock with four wheels, and each wheel carries the ten digits. It opens on one particular ordered sequence, with no digit used twice. You remember the first digit. It is seven. The other three are gone. So how many sequences would you have to try? Listing them is not an option, and you are about to be able to answer that without listing anything. The answer is five hundred and four, and the whole of this is about where that number comes from.
Because it does not come from counting a list. It comes from an argument, and the argument is short. Start somewhere small enough to check by hand. You have three pairs of trousers and two shirts, and you are going to wear one of each. How many different outfits is that? A very natural first answer is five, and five is the number of garments in the wardrobe. It is not the number of outfits, because an outfit is not a garment. It is a pair.
Build them instead of counting them. Trousers one with shirt one. Trousers one with shirt two. Trousers two with shirt one, trousers two with shirt two. Trousers three with shirt one, trousers three with shirt two. Six. Not five. And nothing about that list was multiplied. It was made, and then counted. Now look at the shape of what was just built, because the shape is the whole argument. The six outfits fall into three groups, one for each pair of trousers, and every group holds two.
Two and two and two. Add those up and you get six. That is not a coincidence and it is not a second method. Multiplying is what adding equal groups is called. Three times two means three groups of two, and the only reason six is the answer is that the groups really are equal. So the question to ask is never whether to multiply. It is whether the groups come out equal.
And here is what makes them equal: whichever trousers you pick first, you are left with the same number of shirts. That sentence is the counting principle. Everything else is applying it. Now be careful about what has to be the same, because it is easy to ask for too much. In the trousers and shirts, every first choice leaves you the very same two shirts. Nothing was used up.
That is the comfortable case, and it is not the general one. Take the four letters R, O, S, E, and four places to put them in, using each letter once. Pick R first and you are left with O, S and E. Pick O first and you are left with R, S and E. Those are different collections. There is no shared pile of leftovers here at all. But every one of the four first choices leaves exactly three letters, and three is all the argument needs.
The contents may change from branch to branch. Only the count has to hold still. Which raises the obvious question. What happens when the counts do not hold still? Go back to the three pairs of trousers and two shirts, and change one thing. One shirt clashes with one pair. Build the outfits again and there are five of them, not six. The second stage now leaves two open, then two, then one. Those are not equal groups, so there is nothing to multiply by.
Three times two would have said six, and six is one too many. Here is a second one, further from the edge case. Pick a number from one, two, three, and then pick a strictly smaller one. After one there is nothing smaller to pick. After two there is one thing. After three there are two. Nought, one and two. There is no single number that the second stage is worth, so the product is not merely wrong. It cannot even be written down.
Build them and there are three: two then one, three then one, three then two. Nothing so far needed there to be only two stages. Two school bags, three lunch boxes, two water bottles, one of each. Take the bags and boxes first. Every bag leaves the same three boxes, so that is three groups of two, or two groups of three: six pairs. Now hang the bottles off those six. Every one of the six pairs leaves the same two bottles.
Six groups of two. Twelve. And notice what the third stage did. It doubled what was already there, because the number it left open was two. A stage does not add itself to the count. It multiplies what is already built by however much it leaves open. That is why a modest number of stages runs away from you so quickly. Back to the four letters and the four places, and let us actually do it.
The first place can take any of the four letters. Whatever went in there, the second place has three letters left. Not the same three each time, but three each time. The third place has two, and the last place has the one letter nobody used. Four groups, each containing three groups, each containing two, each containing one. Twenty-four. The factors shrink because the supply shrinks. Each place uses a letter up, and the next place is one poorer.
That is not a law of counting. It is a fact about this particular rule, that a letter may not be used twice. Change the rule and the factors stop shrinking. So change it. Same four places, same four letters, but now a letter may be used as often as you like. The first place takes four. The second place takes four, because nothing was used up. So does the third, and so does the fourth. Two hundred and fifty-six.
Twenty-four and two hundred and fifty-six, on the same four places, from the same four letters. Only the rule about reuse changed. It is tempting to think of the no-reuse rule as throwing away some tidy share of the arrangements. It does not. Divide two hundred and fifty-six by twenty-four and you get thirty-two thirds, which is not a whole number. The restriction is not a fraction taken off the top. It is a different count, arrived at by a different sequence of factors.
There is one more question the principle does not answer for you, and it decides whether you can use the principle at all. Which stage do you do first? Make a two-digit even number from the digits one to five. Even means the units digit has to be two or four. Fill the units place first. Two ways. Then the tens place: five ways, whatever the units digit was. Ten numbers. And if you fill the tens place first instead, five ways, then two ways, and it is ten again.
With repeats allowed the order is a convenience. Now bar the repeats and try both orders again. Units first: two ways, and then four ways every single time, because whichever even digit you used, four of the five remain. Two groups of four. Eight. Tens first: five ways. Then how many even digits are left? If you led with two, only one. If you led with one, both. Two, one, two, one, two. Not equal, so there is nothing to multiply by, and the principle simply does not apply in that order.
The answer is still eight either way. But only one of the two orders can be counted this way. So the rule of thumb has a reason behind it. Fill the restricted place first, and the restriction is spent before it can make the groups uneven. Everything so far has multiplied. Here is a problem where you have to do both. Five flags, all different colours, stacked on a staff to make a signal. A signal uses at least two of them, in order.
So a signal might be two flags, or three, or four, or all five. Count each length on its own. Two flags: five ways then four ways. Twenty. Three flags: five, four, three. Sixty. Four flags: five, four, three, two. A hundred and twenty. Five flags: five, four, three, two, one. A hundred and twenty again, and it is the same number, because the last stage leaves exactly one option and multiplying by one changes nothing.
Now, the total. Twenty and sixty and a hundred and twenty and a hundred and twenty. Three hundred and twenty. Added, not multiplied. And the reason is not that we ran out of things to multiply. The reason is that those four are not stages. They are alternatives. A stage is something you pass through. You choose trousers and then you also choose a shirt. An alternative is something you choose between. A signal is two flags long or it is three, and it is never both.
Stages multiply. Alternatives add. And alternatives may only be added when no outcome belongs to two of them. That condition is doing real work. Watch what happens without it. Split the same signals a different way: the ones using at least three flags, and the ones using at most three. Between them they cover everything, and both counts are honest. Three hundred, and eighty. Add those and you get three hundred and eighty, against a true total of three hundred and twenty.
Sixty too many, which is exactly the number of three-flag signals, because every one of them was counted in both halves. Two correct numbers, added correctly, giving a wrong answer. Nothing about the arithmetic was wrong. The split was. So, the lock. Four wheels, ten digits each, no digit twice, and the first one is known to be seven. That leaves three wheels to fill, and nine digits to fill them from, since seven is already spent.
The first unknown wheel takes any of nine. Whatever went there, the second takes eight, and the third takes seven. Nine groups of eight groups of seven. Five hundred and four. Nobody drew that. Nobody listed it. And no branching picture was needed, because the argument never depended on being able to see the whole thing. It only ever needed one sentence: every choice at one stage leaves the same number open at the next.
That sentence is what you check. If it holds, multiply. If the outcomes come in kinds that cannot overlap, add. And if the number a stage leaves open depends on what came before it, do not reach for either. Reorder the stages, or split into cases, until it does not.
Where this fits
Taken from the notes each video was made from, not from the reading order — these are the ideas this one rests on and the ones that later rest on it.
Comes up again in
- Filling a row of places one at a time from a supply of distinct objectsClass 11 · Ch 6, Permutations and Combinations
- Choosing what to leave out, and the rule that builds each count from two smaller onesClass 11 · Ch 6, Permutations and Combinations
Either side of this one
- Drawing the answer as a piece of the number line, hollow circle or solidClass 11 · Ch 5, Linear Inequalities