Mathematics
Permutations
Chapter 16
Class: Second Year Secondary
Section: Scienctific
Themes/Objectives
At the end of this chapter, the student should be able to:
1 Identify a permutation, with or without repetition
22 Give and use the formulae of the number of permutations.
3
3 Find the number of outcomes for a given experiment.
ACTIVITY ׀THE COUNTING PRINCIPLE
An employee has 4 shirts and 3 ties.
In how many different ways can he choose his outfit?
For each shirt, there are 3 choice options for the tie:
How many options are there for 4 shirts?
ACTIVITY ׀THE COUNTING PRINCIPLE
We use a tree diagram to break down our choice list.
Then, for 4 shirts, we have 12 choices
ACTIVITY ׀THE COUNTING PRINCIPLE
Another method:
There are 4 shirts and 3 ties.
Then, there are 4 shirt choices and 3 choices for the tie.
4 × 3 = 12
This is the counting principle.
This principle can be applied when we have :
Consecutive choice options from different pools, one after the other
APPLICATION ׀THE COUNTING PRINCIPLE
Exercise 1
A class consists of 15 boys and 12 girls.
We need 1 girl and 1 boy to be class delegates.
How many possible options are there?
Solution : 15 × 12 = 180 options.
Exercise 2
A safe has a 3 digit security code. The possible digits are the numbers
from 0 to 9. How many possible codes are there?
Solution : 10 × 10 × 10 = 1000 different codes.
APPLICATION ׀THE COUNTING PRINCIPLE
Exercise 3
We throw 2 perfect dice .
1) State 2 possible outcomes .
2) How many possible outcomes are there ?
Solution : 1) (1 ; 2) and (3 ; 3) are two possible outcomes
2) 6 × 6 = 36 outcomes.
TEXT ׀FACTORIALS
Definition We define the factorial of a number n to be the product of all positive integers
less than or equal to n. Notation: n! with n! = 1 × 2 × 3 × … × n.
Note that: by convention 0! = 1.
Examples
1! = 1 ; 2! = 1 × 2 = 2 ; 3! = 1 × 2 × 3 = 6
4! = 3! × 4 = 1 × 2 × 3 × 4 = 24.
10! = 10 × 9! = 10 × 9 × 8! = 10 × 9 × 8 × 7!
n! = n × (n – 1)! = n × (n – 1) × (n – 2)!
(n + 2)! n + 2 × n + 1 × n!
= = (n + 2)(n + 1)
n! n!
APPLICATION ׀FACTORIALS
Remark
You can use the calculator to find the factorial of a natural number.
To calculate 5!, press the number , then click and click , the calculator will display 120.
This indicates that 5!=120.
Exercise 1 Exercise 2
13! 5! 14! (n + 3)!
Calculate 3! × 3! ; ; × Simplify
11! 15! 4! n + 3 × (n + 1)!
ACTIVITY ׀PERMUTATIONS
An urn contains 4 cards. Each card has 1 letter written on it.
The first carries the letter A, the second the letter B, the third the letter C and the fourth the letter D.
A B C D
We choose successively and without replacement 2 cards from the urn to form a 2-letter word, the
words need not be meaningful.
A B and B A are two different results.
1) Use an option tree diagram to find all the possible results.
2) What is the number of possible results.
4!
3) Compare the number of possible results with the number
(4 − 2)!
where 4 is the number of letter in the urn and 2 is the number of chosen letters .
TEXT ׀PERMUTATIONS
Definition Consider a finite set E of n elements, and let r ∈ ℕ such that r ≤ n.
We call the set of all ordered lists formed of r distinct elements from E
a permutation of r elements of E
n!
nPr = Arn = = n(n – 1) (n – 2) … (n – r + 1)
n −r !
r fact𝑜𝑟𝑠
(= nb of choices of the 1st element × nb of choices of the 2nd element × … × nb of
choices of the rth)
In the previous activity:
4!
n = 4 and r = 2 , then the number of possible results is 4P2= = 12 results.
4−2 !
(= nb of options for card 1 × nb of options for card 2= 4 × 3 = 12)
APPLICATION ׀PERMUTATIONS
Example
An urn contains balls numbered from 1 till 9.
We draw successively and without replacement 3 balls from the urn.
The results are used to form a 3-digit number.
How many numbers can be formed?
9!
Solution : 9P3 = A39 = = 504 numbers .
9 −3 !
Another method:
nb of choices for the 1st number × nb of choices for the 2nd number × nb of choices for the 3rd
number
= 9 × 8 × 7 = 504 numbers.
APPLICATION ׀PERMUTATIONS
Exercise
An urn contains 3 red balls, 5 black balls and 2 yellow balls.
We draw 3 balls successively without replacement from this urn.
1) In how many ways can this draw be done?
2) In how many ways can we choose 3 balls of the same color?
3) In how many ways can the selection contain at least one red ball?
TEXT ׀PERMUTATIONS
Remark
If we have r = n, then nPr = nPn = n!
Example
An urn contains balls numbered from 1 till 4.
We draw successively without replacement 4 balls from the urn in a way to obtain a 4 digit number.
How many possible 4-digit numbers can be formed.
Solution : 4P4= 4! = 24 numbers
ACTIVITY ׀SAMPLING WITH REPLACEMENT
An urn contains 4 cards, each card has 1 letter written on it.
The first carries the letter A, the second the letter B, the third the letter C and the fourth the letter D.
A B C D
We choose successively and with replacement 2 cards from the urn to form a 2-letter word, the words need
not be meaningful.
A B and B A are two different results, and A A is also a possible result.
1) Use an option tree diagram to find all the possible results.
2) What is the number of possible results.
3) Compare the number of possible results with the number 42.
where 4 is the number of letter in the urn and 2 is the number of chosen letters .
TEXT ׀SAMPLING WITH REPLACEMENT
Definition Consider a finite set E of n elements such that n ∈ ℕ and let r ∈ ℕ.
We call a sampling with replacement (r-list) of r elements of E, the set of all possible
ordered lists formed of r elements. Those elements can be distinct, or they can be the
same. This is why it is called sampling with replacement.
The number of r-lists is n r.
(= nb of choices of 1st element × nb of choices of 2nd element × … × nb of choices of
rth element )
Remark : r can be greater than n.
In the activity:
n = 4 and r = 2 , then the number of possible results is 42 = 16 results.
(= nb of choices of 1st card × nb of choices of 2nd card= 4 × 4 = 16)
APPLICATION ׀SAMPLING WITH REPLACEMENT
Example
An urn contains balls numbered from 1 till 9.
We draw successively and with replacement 3 balls from the urn.
The results are used to form a 3-digit number.
How many numbers can be formed?
Solution : 93 = 729 numbers .
Another method:
nb of choices for the 1st number × nb of choices for the 2nd number × nb of choices for the 3rd
number
= 9 × 9 × 9 = 729 numbers.
APPLICATION ׀SAMPLING WITH REPLACEMENT
Exercise
An urn contains 3 red balls, 5 black balls and 2 yellow balls.
We draw 3 balls successively with replacement from this urn.
1) How many ways can this draw be done?
2) In how many ways can we choose 3 balls of the same color?
3) In how many ways can the selection contain at least one red ball?
FOCUS
n being a natural number , we call n factorial written n!, the whole number defined by
n! = 1 × 2 × 3 × … × n. By convention: 0! = 1.
n ∈ ℕ and r ∈ ℕ such that r ≤ n.
n!
Permutation: nPr = Arn = = n (n – 1) (n – 2) … (n – r + 1)
n −r !
r fac𝑡𝑜𝑟𝑠
(= nb of choices of 1st element × nb of choices of 2nd element × … × nb of choices of rth element )
n ∈ ℕ and r ∈ ℕ.
Sampling with repetition – r-lists: nr = n n n … n
r fac𝑡𝑜𝑟𝑠
(= nb of choices of 1st element × nb of choices of 2nd element × … × nb of choices of rth element )
Our Team
• Coordinator : Samer Siefeldeen
• Author: Haidar Mahmoud Issa
• Reviewer: Izzeddine Hnaini
• Language Editor: Tatiana Aweek
• Translator: Sarah Hajj
Thank you !