Scribd
Upload
44 views

PC Discussion 2

This document discusses permutations and combinations for counting problems. It defines permutations as arrangements where order matters and the number of permutations of n objects taken r at a time is written as P(n,r). Combinations are subsets where order does not matter, written as C(n,r). Formulas are given for both, along with examples of when to use each. Permutations apply when order matters and repetitions are not allowed, while combinations apply when order does not matter and repetitions are not allowed. The fundamental counting principle is used when order does not matter and repetitions are allowed.

Uploaded by

KAPIL SHARMA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
44 views

PC Discussion 2

This document discusses permutations and combinations for counting problems. It defines permutations as arrangements where order matters and the number of permutations of n objects taken r at a time is written as P(n,r). Combinations are subsets where order does not matter, written as C(n,r). Formulas are given for both, along with examples of when to use each. Permutations apply when order matters and repetitions are not allowed, while combinations apply when order does not matter and repetitions are not allowed. The fundamental counting principle is used when order does not matter and repetitions are allowed.

Uploaded by

KAPIL SHARMA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Section P2: Permutations and Combinations

Previously we talked about factorials as a way of counting the number of arrangements of a


given set of objects.
Permutations
In the context of counting problems, arrangements are often called permutations. If there are n
objects and all n are being arranged, then the number of ways to do this is n!.
Sometimes we do not wish to arrange all n objects, but only a subset of those objects say r
objects, where r n. In that case the number of ways to arrange n objects taken r at a time is
given by: n (n 1) (n 2) . . . (n r + 1) ways.
So the Permutation formula is given by: The number of permutations, or arrangements, of n
distinct things taken r at a time, where r n, is: P(n,r) = n (n 1) (n 2) . . . (n r + 1).
P(n,r) is also sometimes written: nPr ; or
.
Examples:
P(5,3) = 5 4 3 = 60
P(5,5) = 5 4 3 2 1 = 120
Notice that P(5,5) = 5!. This is the number of arrangements of 5 objects taken 5 at a time.
Permutations can be related to factorials in the following way:
P(n,r) = n (n 1) (n 2) . . . (n r + 1) multiply top and bottom by (n-r)(n-r-1) 21.
=

simplify this using the factorial definition

So P(n,r) =

in factorial notation.

Example: P(10,4) =

= 10987 = 5040.

You may also use your calculator to do these calculations.


Try several, using both the formula and your calculator. P( 12,5); P (7,7); P(12,2)
When to use permutions:
repetitions are NOT allowed, and
order is important.
1

Example:
Hussein builds homes from nine different models and presently has five lots to build on. In how
many different ways can he arrange homes on these lots? Assume five different models will be
built.
Since order matters (the word arrange is used), it is a permutation.
P(9,5) = 15120 ways
Example:
Five math books, four history books and three science books are to be arranged on a shelf. How
many ways can this be done?
How many ways can they be arranged if all books of the same subject must be kept together?
If they all just need to be arranged, the type of book is irrelevant so you want to arrange 12
books.
P(12,12) = 12!= 479,001,600 ways.
If you must keep the same subjects together, then you have to do a series of tasks:
Decide the order of the subjects: P(3,3) = 3! = 6 ways.
and then
Arrange each subject: math: P(5,5) = 5! = 120 ways
and then
history: P(4,4) = 4! = 24 ways
and then
science: P(3,3) = 3! = 6 ways
Since they are all separated by the words and then, multiply the results: 6120246 = 103,680
ways.
HW P2a, # 28: see handout.
Combinations
Sometimes the order is not important. If you have FOUR people in a club and wish to form a
committee of TWO people, it is not important what order you choose the people, it will be the
same committee. A combination of n people taken r at a time is given by C(n,r). which is also
sometimes written, nCr; or

; or

Lets say we have a group of N = {A,B,C,D }, the number of two person committees is listed
below:
AB, AC, AD, BC,BD,CD

We are trying to find the number of subsets of size 2 from a group of 4 people. There are 6 of
these subsets.
If we wish to find a formula for this, without listing them, let us look at the relationship to
permutations. Each of the subsets has two possible arrangements (permutations), for example
AB can also be arranged as BA, and so on for each subset. Thus there are two times as many
permutations of 4 items taken 2 at a time as there are combinations.
So the number of combinations of 4 people taken two at a time, C(4,2) =

= 6 ways.

The 2 in the denominator appears because there are 2 different ways to arrange each set of two
things. In general r things can be arranged r! different ways (as we have previously seen.)
So the Combinations Formula is given by:
The number of combinations, or subsets, of n distinct things taken r at a times , where r n, is
C(n,r) =

We can combine this formula with the factorial formula for permutations and come up with this:

C(n,r) =

Example:
C(9,5) =

= 126

When to use combinations:


repetitions are NOT allowed, and
order is NOT important.
Examples:
How many ways can a sample of four CD players be selected from a shipment of 30 CD players?
There are no repetitions (once a CD player is chosen, it cannot be chosen again) and order does
NOT matter (the group of 5 players including 1,2,3,4,5, is the same no matter what order they
were chosen).
So C(30,5) = 142,506.
We can use the formula, or our calculator to find this value. Try it both ways.
Example:
3

A committee of 4 is to be formed from a group of 5 women and 6 men.


a) How many ways can this be done, if two of the women refuse to serve on the same
committee?
b) How many ways can it be done if the committee must have 2 men and two women?
a) It is a committee, so it is a combination. Deal with the restriction first. There are 2 cases.
1) Either one of the women is on the committee and not the other, or
2) Neither of the women is on the committee.
Whenever two situations are separated by the word or you add the results of the parts.
1) Put one of the women on the committee: C(2,1) = 2
and then
fill out the rest of the committee from the people other than these two
women: C(9,3) = 84.
Multiply these results: 284 = 168 ways
2) Fill the whole committee from the people other than these two women: C(9,4) = 126 ways.
Sum the two results: 168 + 126 = 294 ways.
Now, when we do a counting problem, it is important that we use the right method (Sometimes,
b ) It is a combination, and can be divided into two parts separated by the word and
1) choose the 2 men: C(6,2)
2) choose the women: C(5,2)
Combine by multiplication (fundamental counting principal): 1510 = 150 ways
How to Choose a Counting Method
If selected items can be repeated, we can use the fundamental counting principle.
If selected items cannot be repeated, and order is important, use permutations.
If selected items cannot be repeated, and order is not important, use combinations.
Key words that can help you decide:
Permutations: order; arrange; put in specific slots or places; identifiers are placed on each
(president, vice-president, secretary; or first second third place).
Combinations: committees; subsets; groups; sample; hands (of cards).
Examples:
a) A teacher has 5 textbooks to give out to 8 students. How many ways can this be done if each
student can have any number of textbooks?
Is this a counting problem that involves the fundamental principle of counting only, or a
permutation, or a combination?

Notice that there are NO limitations on the problem, and that order does not matter. This is Not
a combination or permutation, because once a student is used, he/she can be used again. This is
a counting problem that would use the fundamental principle of counting.
The first textbook can be given to any of the 8 students, and the 2nd text can be given to any of
the 8 and so on. So the solution is 88888 = 85 = 32,768 ways.
Why isnt it 58 ways?
If you were to start with the students and say the first student could have 5 OR the second could
have 5 and so on, you cannot use the fundamental principle of counting, because the statements
are separated by the word OR not the word AND. Secondly, this does not take into account the
possibility that one could have 1 and any of the others 4, or 1 could have 2 and any of the other 3
(and so on with all the variations). This becomes a very complicated method of dealing with the
problem (although it could be done, but has many opportunities for error).
b) A teacher has 5 distinct textbooks to give out to 8 students. How many ways can this be done
if each student can have no more than one textbook?
This problem notes that each textbook is distinct (so they can be told apart). Thus the order they
are distributed matters. Also, once a student has a text he cannot have another (repetitions are
not allowed), so the restrictions of permutations hold.
P(8,5) = 6720 ways
c) A teacher has 5 identical textbooks to give out to 8 students. How many ways can this be
done if each student can have no more than one textbook?
This problem has identical textbooks, so the order they are given out does NOT matter (in the
end it only matters who has the texts, not what order they received them). Also, once a student
has a text, he cannot have another (repetitions are not allowed), so the conditions of
combinations hold.
C(8,5) = 56 ways.
You should be able to tell the differences in these three types of problems, so that you can
identify the methods to be used.
The keys are whether repetitions are allowed, and whether order matters (if the objects are
identical, then order cannot matter).
HW P2b, # 29: see handout

You might also like