0% found this document useful (0 votes)
51 views

Permutation and Combination

Uploaded by

tanzim
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
51 views

Permutation and Combination

Uploaded by

tanzim
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 25

Permutation and Combination

Suraiya Pervin
We throw around the term “combination” loosely, and
usually in the wrong way. We say things like, “Hey, what’s
your locker combination?” but what we really ought to be
sayings is “Hey, what’s your locker permutation?”
So what’s the difference? And what exactly is a
permutation?
How To Tell the Difference?

• The difference between combinations and permutations is


ordering. 
• With permutations we care about the order of the
elements, whereas with combinations we don’t.
• For example, say your locker “combo” is 5432. If you
enter 4325 into your locker it won’t open because it is a
different ordering.
The permutations of 2, 3, 4, 5 are:
5432, 5423, 5324, 5342, 5234, 5243,
4532, 4523, 4325, 4352, 4253, 4235,
3542, 3524, 3425, 3452, 3254, 3245,
2543, 2534, 2435, 2453, 2354, 2345
Your locker “combo” is a specific permutation of 2, 3, 4 and
5. If your locker worked truly by combination, you could
enter any of the above permutations and it would open!
Find the number of permutations of six objects, say, A, B, C, D,
E, F, taken three at a time. In other words, find the number of
“three-letter words” using only the given six letters without
repetition.
Let us represent the general three-letter word by the
following three positions:
—, —, —
The first letter can be chosen in 6 ways; following this the
second letter can be chosen in 5 ways; and, finally, the third
letter can be chosen in 4 ways. Write each number in its
appropriate position as follows: 6 , 5 , 4 By the Product Rule
there are m = 6·5·4 = 120 possible three-letter words without
repetition from the six letters.
• Find the number of seven-letter words that can be
formed using the letters of the word “BENZENE.”

• Three cards are chosen one after the other from a 52-card
deck. Find the number of ways this can be done:
(a) with replacement; (b) without replacement.
• Find the number of combinations of 4 objects, A, B, C,
D, taken 3 at a time.
• A farmer buys 3 cows, 2 pigs, and 4 hens from a man
who has 6 cows, 5 pigs, and 8 hens. Find the number m
of choices that the farmer has.
• Find the number of ways that 7 people can arrange
themselves: (a) In a row of chairs;
(b) Around a circular table.

• Find the number of distinct permutations that can be


formed from all the letters of each word: (a) THOSE;( b)
UNUSUAL;( c) SOCIOLOGICAL.
• A box contains 8 blue socks and 6 red socks. Find the
number of ways two socks can be drawn from the box
if: (a) They can be any color. (b) They must be the same
color.

• Find the number of committees of 5 with a given


chairperson that can be selected from 12 people
• There are 12 students in a class. Find the number of ways
that the 12 students can take any one 3 tests if 4 students
are to take each test.
• Find the number of automobile license plates where:
a) Each plate contains 2 different letters followed by 3
different digits. (b) The first digit cannot be 0.
• Find the number of ways a judge can award first, second,
and third places in a contest with 18 contestants.
Find the number of ways 5 large books, 4 medium-size books,
and 3 small books can be placed on a shelf where:
(a) there are no restrictions;
(b) all books of the same size are together.
• A debating team consists of 3 boys and 3 girls. Find the
number of ways they can sit in a row where: (a) there are
no restrictions; (b) the boys and girls are each to sit
together; (c) just the girls are to sit together.
• Find the number of ways 5 people can sit in a row where:
(a) there are no restrictions; (b) two of the people insist
on sitting next to each other.
• Consider all positive integers with three different digits.
Find the number of them which are: (a) greater than 700;
(b) odd; (c) divisible by 5.
• Suppose repetitions are not permitted. (a) Find the
number of three-digit numbers that can be formed from
the six digits 2, 3, 5, 6, 7, and 9. (b) How many of them are
less than 400? (c) How many of them are even?
• Suppose we are given 4 identical red flags, 2 identical blue
flags, and 3 identical green flags. Find the number m of
different signals that can be formed by hanging the 9 flags
in a vertical line.
A restaurant has 6 different desserts. Find the number of
ways a customer can choose: (a) 1 dessert; (b) 2 of the
desserts; (c) 3 of the desserts.
A class contains 9 men and 3 women. Find the number of
ways a teacher can select a committee of 4 from the class
where there is: (a) no restrictions; (b) 2 men and 2 women;
(c) exactly one woman; (d) at least one woman.
A woman has 11 close friends. Find the number of ways she
can invite 5 of them to dinner where: (a) There are no
restrictions. (b) Two of the friends are married to each other
and will not attend separately. (c) Two of the friends are not
speaking with each other and will not attend together.
A class contains 8 men and 6 women and there is one
married couple in the class. Find the number of ways a
teacher can select a committee of 4 from the class where
the husband or wife but not both can be on the committee.
A box has 6 blue socks and 4 white socks. Find the number
of ways two socks can be drawn from the box where:
(a) There are no restrictions. (b) They are different colors.
(c) They are the same color.
A student is to answer 10 out of 13 questions. Find the
number of her choices where she must answer:
(a) the first two questions;
(b) exactly 3 out of the first 5 questions;
(c) the first or second question but not both;
(d) at least 3 of the first 5 questions.
A B C
How many ways are there to put four different employees
into three offices, when each office can contain any number
of employees?
Employees: A, B, C, D; Offices: x, y, z

You might also like