The Fundamental Counting Principle & Permutations
The Fundamental Counting Principle & Permutations
COUNTING
PRINCIPLE &
PERMUTATIONS
COUNTING OUTCOMES
Start
1 Coin
st
Tossed
Heads Tails 2 ways to flip the
2nd Coin coin.
Tossed
Heads Tails Heads Tails 2 ways to flip the
coin.
8
COUNTING OUTCOMES
S M L XL XXL S M L XL XXL
S M L XL XXL S M L XL XXL
4*3*3 = 36 sandwiches
At a restaurant at Cedar Point, you
have the choice of 8 different
entrees, 2 different salads, 12
different drinks, & 6 different
desserts.
How many different dinners (one
choice of each) can you choose?
8*2*12*6=
10 x 10 x 10 = 1000
11,232,000 plates
PHONE NUMBERS
How many different 7 digit
phone numbers are possible if
the 1st digit cannot be a 0 or
1?
8*10*10*10*10*10*10=
1,048,576
The Fundamental Counting Principle states that
if one event can occur m ways and a second event
can occur n ways, the number of ways the two
events can occur in sequence is m • n.
COUNTING OUTCOMES
An ordering of n
objects is a
permutation of the
objects.
THERE ARE 6 PERMUTATIONS
OF THE LETTERS A, B, &C
ABC
ACB
You can use the Fundamental
BAC
Counting Principle to determine
BCA the number of permutations of n
CAB objects.
CBA Like this ABC.
There are 3 choices for 1st #
2 choices for 2nd #
1 choice for 3rd.
3*2*1 = 6 ways to arrange the
letters
IN GENERAL, THE # OF
PERMUTATIONS OF N
OBJECTS IS:
n! = n*(n-1)*(n-
2)* …
12 SKIERS…
How many different ways can 12 skiers in
the Olympic finals finish the competition?
(if there are no ties)
12! =
12*11*10*9*8*7*6*5*4*3*2
*1 =
n!
P =
n r
n r !
BACK TO THE LAST
PROBLEM WITH THE SKIERS
It can be set up as the number of permutations of
12 objects taken 3 at a time.
12 P3 = 12! = 12! =
(12-3)! 9!
12*11*10*9*8*7*6*5*4*3*2*1 =
9*8*7*6*5*4*3*2*1
12*11*10 = 1320
10 COLLEGES, YOU WANT
TO VISIT ALL OR SOME
How many ways can you visit
6 of them:
Permutation of 10 objects
taken 6 at a time:
10P6 = 10!/(10-6)! = 10!/4! =
3,628,800/24 = 151,200
HOW MANY WAYS CAN YOU
VISIT ALL 10 OF THEM:
10 P10 =
10!/(10-10)! =
10!/0!=
10! = ( 0! By definition =
1)
3,628,800
Check It Out!
Awards are given out at a costume party. How many ways can “most
creative,” “silliest,” and “best” costume be awarded to 8 contestants if no
one gets more than one award?
=8•7•6
= 336
Awards are given out at a costume party. How many ways can “most
creative,” “silliest,” and “best” costume be awarded to 8 contestants if no
one gets more than one award?
=8•7•6
= 336
students.
There are ten people on your baseball team.
from 7 candidates.
Lines are drawn using 3 non collinear points.
shelf.
PERMUTATIONS
P(6,6) = (1)6 x
(2)
5 (3)
x 4 x 3 x 2 x 1 = 720
(4) (5) (6)
different
ways
We are selecting this many people
PERMUTATIONS
Circular permutation
(n - 1)!
1 combination {ABC}
To find the number of combinations, the formula for
permutations can be modified.
n = 12 and r = 4
Divide out
common
factors.
5
= 495
The swim team has 8 swimmers. Two swimmers will be selected to swim in
the first heat. How many ways can the swimmers be selected?
n = 8 and r = 2
Divide out
common
factors.
4
= 28
52 C5
2,598,960 5-card
hands
Find the number of different Find the number of arrangements
subsets of size 3 in the set: of size 3 in the set:
{m, a, t, h, r, o, c, k, s}. {m, a, t, h, r, o, c, k, s}.
9 C3 9 P3
98
7
504 arrangemen
ts
84 Different
subsets
Guidelines on Which Method to Use
Practice
C2 =10
5
Question 2
26 x 6 x 10 x 10 =15600
Question 3
3x2x1=6
Question 4
3x2x1=6
Question 5
C2 =6
4
Question 6
8 x 7 x 6 = 336
Question 7
9!= 362,880
Question 8
15 Choose 4 = 1365
Return the sheet to the person in front of you along with their score (out of 16)
so far…..
And now for some more…...
Question 9
13 Choose 4 = 715
Question 10
C5 = 792
12
Question 11
C4 = 330
11
Question 12
Combinations: 5 choose 2 = 10
Question 13
Permutation: 9 x 8 x 7 = 504
Question 14
18 choose 3 = 816
Question 15
12 arrange 4 = 11,880