Scribd
Upload
8 views

Math10-Permutation-and-Combinations

The document covers the concepts of permutations and combinations, including the Fundamental Counting Principle, which helps determine the number of possible outcomes for multiple events. It explains how to compute permutations and combinations using formulas and provides examples for better understanding. Additionally, it distinguishes between permutations, where order matters, and combinations, where order does not matter.

Uploaded by

thayladee2009
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Math10-Permutation-and-Combinations

The document covers the concepts of permutations and combinations, including the Fundamental Counting Principle, which helps determine the number of possible outcomes for multiple events. It explains how to compute permutations and combinations using formulas and provides examples for better understanding. Additionally, it distinguishes between permutations, where order matters, and combinations, where order does not matter.

Uploaded by

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

Permutations

and
Combinations
Objectives:

Ø Apply Fundamental Counting Principle

Ø Compute permutations

Ø Compute combinations

Ø Distinguish permutations vs combinations


Fundamental Counting
Principle
Fundamental Counting Principle can be used
to 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, the order of items 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 pr  ( n  r )! where 0  r  n .

5! 5!
5 p3    5 * 4 * 3  60
(5  3)! 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?

30! 30!
30 p3    30 * 29 * 28  24360
( 30  3)! 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?

24! 24!
24 p5   
( 24  5)! 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!
5 C3   
3! (5  3)! 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?
52! 52!
52 C5   
5! (52  5)! 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?

5! 5! 5 * 4
5 C3     10
3! (5  3)! 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?
Center: Forwards: Guards:
2! 5! 5 * 4 4! 4 * 3
2C1   2 5 2
C    10 4 C2   6
1 !1 ! 2!3! 2 * 1 2!2! 2 * 1

2 C1 * 5 C 2 * 4 C 2

Thus, the number of ways to select the


starting line up is 2*10*6 = 120.

You might also like