Chapter 10 - Counting
Chapter 10 - Counting
Year 11 Methods
The Multiplication Principle
• Box method
The Multiplication Principle
• Each of these methods involved the same set of steps to arrive at the
solution to the problem.
• This set of steps is known as the multiplication principal.
The Multiplication Principle
• To find the number of ways of performing a given task follow the steps
below:
• STEP 1 Break the task into stages.
• STEP 2 Count the number of choices at stage one, and after one of these
choices has been taken, count the number of choices at stage 2,
and so on.
• STEP 3 Multiply the number of choices at each stage to determine the
number of ways of performing the given task.
The Multiplication Principle
• How many motorcycle number plates are possible if each number plate
must have two letters, excluding the letters I and O, followed by two digits
if:
• a) repetitions of letters and digits are NOT allowed
• b) repetitions are allowed
The Multiplication Principle
• SOLUTION
The Multiplication Principle
• SOLUTION
The Multiplication Principle
• For example
• 3! = 3 x 2 x 1 = 6
• 5! = 5 x 4 x 3 x 2 x 1 = 120
• 7! = 7 x 6 x 5 x 5 x 4 x 3 x 2 x 1 = 5040
Note : 0! is defined as 1.
The Multiplication Principle
• Evaluate:
• 3! + 3!
• =3x2x1+3x2x1 = = =
• = 12 = 504 = 9900 = n2 + 3n + 2
The Multiplication Principle
n
Pr = where n and r are non-negative integers and n ≥ r.
• How many six letter arrangements are there of the word EXCITE?
6! = 6 x 5 x 4 x 3 x 2 x 1 = 720
• How many four letter arrangements are there for the word EXCITE?
6! 720
= =360
(6 − 4 )! 2
• How many two letter arrangements are there for the work EXCITE?
6! 720
= =30
( 6 −2) ! 24
The Multiplication Principle
• Given the set of vowels of the English language {a, e, i, o, u}, how many
selections (or combinations) are there if each combination must contain :
• one vowel?
• two vowels?
• three vowels?
• four vowels?
• five vowels?
Combinations
• Given the set of vowels of the English language {a, e, i, o, u}, how many
selections (or combinations) are there if each combination must contain :
• one vowel?
• If each combination must contain one vowel, then the list of such combination is:
a e i o u
• That is there are five combinations such that each combination has 1 vowel taken from 5
vowels.
Combinations
• Given the set of vowels of the English language {a, e, i, o, u}, how many
selections (or combinations) are there if each combination must contain :
• two vowels?
• If each combination must contain two vowels, then the list of such combination
is:
ae ai ao au ei eo eu io iu ou
• That is, 10 combinations such that each combination has two vowels taken from 5
vowels.
Combinations
• NOTE:
• ae and ea are different arrangements of the two vowels but are the same combination
as the order does not matter.
• The number of permutations of 2 vowels is 2!
• The number of permutations of 2 vowels chosen from 5 vowels is 5 x 4 = 20.
• The number of combinations of 2 vowels chosen from 5 vowels is 10 and is given by
.
• Hence the number of combinations is given by = = 10
Combinations
• Given the set of vowels of the English language {a, e, i, o, u}, how many
selections (or combinations) are there if each combination must contain :
• three vowels?
aei aeo aeu aio aiu aou eio eiu eou iou
• Given the set of vowels of the English language {a, e, i, o, u}, how many
selections (or combinations) are there if each combination must contain :
• four vowels?
• = = =5
Combinations
• Given the set of vowels of the English language {a, e, i, o, u}, how many
selections (or combinations) are there if each combination must contain :
• five vowels?
aeiou
• This method is not very practical for finding the number of combinations as
it is time consuming and may be confusing for large sets of data.
Combinations
• We can find the number of combinations without identifying each one using
combination notation.
Number of objects to choose from n
Cr Number of object in each selection
Combinations
= ×
=
Combinations
7
C4 = =
= =
= 35 = 252
Combinations
• Do Exercise 10B
Pascal’s Triangle
• These results were known as early as 1300AD having been discovered by the
Chinese.
• Pascal did not give a general formula for these binomial coefficients, this was
done by Englishman Sir Isaac Newton (1642-1727).
Pascal’s Triangle
• NOTE:
• Apart from the 1 at each end, any number in a row is the sum of two numbers
immediately above it and on either side of it.
Pascal’s Triangle
• NOTE:
• The coefficients which are equidistant
from the ends of a row are equal in size.
Pascal’s Triangle
• The powers of x decrease from n to 0 and at the same time the powers of y
increase from 0 to n.
Pascal’s Triangle
T4 =
T4 = 448
Pascal’s Triangle
• Do exercise 10C