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

Counting Methods: Permutations Combinations

The document discusses fundamental counting principles and how they can be used to determine the number of possible outcomes when there are multiple characteristics or events. It provides examples of using permutations and combinations to calculate the number of arrangements or selections of different items. The principles of permutations versus combinations are explained, noting that permutations account for order while combinations do not.

Uploaded by

Mark B. Barroga
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
265 views

Counting Methods: Permutations Combinations

The document discusses fundamental counting principles and how they can be used to determine the number of possible outcomes when there are multiple characteristics or events. It provides examples of using permutations and combinations to calculate the number of arrangements or selections of different items. The principles of permutations versus combinations are explained, noting that permutations account for order while combinations do not.

Uploaded by

Mark B. Barroga
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 31

COUNTING METHODS:

Permutations
and
Combinations
Fundamental Counting
Principle
Fundamental Counting Principle can be used
determine the number of possible outcomes when
there are two or more characteristics .

Fundamental Counting Principle states that if an


event has m possible outcomes and another
independent event has n possible outcomes, then
there are m* n possible outcomes for the two events
together.
Fundamental Counting
Principle
Lets start with a simple example.

A student is to roll a die and flip a coin. How


many possible outcomes will there be?

1H 2H 3H 4H 5H 6H
6*2 = 12 outcomes
1T 2T 3T 4T 5T 6T

12 outcomes
Fundamental Counting
Principle
For a college interview, Robert has to choose what to
wear from the following: 4 slacks, 3 shirts, 2 shoes and
5 ties. How many possible outfits does he have to
choose from?

4*3*2*5 = 120 outfits


Permutations

A Permutation is an arrangement of items


in a particular order.

Notice, ORDER MATTERS!


To find the number of Permutations of n items,
we can use the Fundamental Counting Principle
or factorial notation.
Permutations
The number of ways to arrange the
letters ABC: ____ ____ ____

Number of choices for first blank? 3 ____ ____


Number of choices for second blank? 3 2 ___
Number of choices for third blank? 3 2 1

3*2*1 = 6 3! = 3*2*1 = 6
ABC ACB BAC BCA CAB CBA
Permutations

To find the number of Permutations of n items


chosen r at a time, you can use the formula

n!
n
p
r
    where    0  r  n  .
(n  r )!
5! 5!
p3       5 * 4 * 3  60
 3 )!
5
(5 2!
Permutations
Practice:
A combination lock will open when the right
choice of three numbers (from 1 to 30, inclusive)
is selected. How many different lock
combinations are possible assuming no number
is repeated?

Answer
Permutations
Practice:
A combination lock will open when the right
choice of three numbers (from 1 to 30, inclusive)
is selected. How many different lock
combinations are possible assuming no number
is repeated?

30 ! 30!
p3       30 * 29 * 28  24360
 3 )!
30
( 30 27!
Permutations
Practice:
From a club of 24 members, a President, Vice
President, Secretary, Treasurer and Historian are
to be elected. In how many ways can the offices
be filled?

Answer
Permutations
Practice:
From a club of 24 members, a President, Vice
President, Secretary, Treasurer and Historian are
to be elected. In how many ways can the offices
be filled?

24 ! 24!
p5      
 5 )!
24
( 24 19!
24 * 23 * 22 * 21 * 20  5 ,100 , 480
Combinations
A Combination is an arrangement of
items in which order does not matter.

ORDER DOES NOT MATTER!


Since the order does not matter in
combinations, there are fewer combinations
than permutations. The combinations are a "
subset" of the permutations.
Combinations

To find the number of Combinations of n items


chosen r at a time, you can use the formula

n!
C     where    0  r  n  .
n r r ! ( n  r )!
Combinations
To find the number of Combinations of n items
chosen r at a time, you can use the formula
n!
C     where    0  r  n  .
n r r ! ( n  r )!
5! 5!
C3      
 3 )!
5
3! ( 5 3!2!

5*4* 3* 2*1 5*4 20


   10
3* 2*1* 2*1 2*1 2
Combinations
Practice:

To play a particular card game, each


player is dealt five cards from a standard
deck of 52 cards. How many different
hands are possible?

Answer
Combinations
Practice: To play a particular card game, each
player is dealt five cards from a standard
deck of 52 cards. How many different
hands are possible?
52 ! 52!
C5      
 5 )!
52
5 ! ( 52 5!47!

52 * 51 * 50 * 49 * 48
 2 , 598 , 960
5*4* 3* 2*1
Combinations
Practice:

A student must answer 3 out of 5 essay


questions on a test. In how many different
ways can the student select the questions?

Answer
Combinations
Practice: A student must answer 3 out of 5 essay
questions on a test. In how many
different ways can the student select the
questions?

5! 5! 5*4
C3        10
 3 )!
5
3! ( 5 3!2! 2*1
Combinations
Practice:
A basketball team consists of two centers,
five forwards, and four guards. In how many
ways can the coach select a starting line up
of one center, two forwards, and two guards?

Answer
Combinations
Practice: A basketball team consists of two centers, five forwards, and four
guards. In how many ways can the coach select a starting line up of
one center, two forwards, and two guards?

Center: Forwards: Guards:


2! 5! 5*4 4! 4*3
2
C1   2 5
C2    10 4
C2   6
1 !1 ! 2 !3 ! 2*1 2 !2 ! 2*1

2
C 1 *   5 C 2  *  4 C 2

Thus, the number of ways to select the starting


line up is 2*10*6 = 120.
ASSIGNMENT
Copy the problem and
solve the following
problems. Write your
answer in short bond
papers.
Problem
• How many four-letter words beginning
and ending with a vowel without any
letter repeated can be formed from
the word “engineering”?

“The way up and the way down are


22
one and the same.” - Heraclitus
Problem
• Three different Mathematics books, 2 different
electronics books and Four different
communications books are to be placed in a
shelf with the books of the same subject together.
Find the number of ways in which the books can
be placed.

“The way up and the way down are


23
one and the same.” - Heraclitus
Problem
• How many 4 even-digit numbers can be
formed without repeating any digit from
the following digits: 1, 2, 3, 4 and 6?

“The way up and the way down are


24
one and the same.” - Heraclitus
Problem
• What is the number of permutations of
the letters in the word “ENGINEERING”?

“The way up and the way down are


25
one and the same.” - Heraclitus
Problem
• In how many ways can 5 people line up to
pay their electric bills, if three particular
persons refuse to follow each other?

“The way up and the way down are


26
one and the same.” - Heraclitus
Problem
• How many different ways can 5 boys
and 5 girls form a circle?

“The way up and the way down are


27
one and the same.” - Heraclitus
Problem
• There are five balls of different colors. Two balls
at a time are taken and arranged any way. How
many such combinations are possible?

“The way up and the way down are


28
one and the same.” - Heraclitus
Problem
• Find the total number of combinations of three
letters, J, R, T taken
a.1 at a time.
b.2 at a time.
c. 3 at a time.

“The way up and the way down are


29
one and the same.” - Heraclitus
Problem
• In how many ways can a committee of
three consisting of two chemical engineers
and one mechanical engineer can be
formed from four chemical engineers and
three mechanical engineers?

“The way up and the way down are


30
one and the same.” - Heraclitus
Problem
• A semiconductor company will hire 7 men
and 4 women. In how many ways can the
company choose from 9 men and 6
women who qualified for the position?

“The way up and the way down are


31
one and the same.” - Heraclitus

You might also like