COUNTING PRINCIPLES – GRADE 12 SECTION

It is possible to list all possible outcomes using a tree diagram. When you have many possible
outcomes, a tree diagram can become very messy and it becomes difficult to count the possible
outcomes.
Counting principles help you to count the possible outcomes without drawing a tree diagram.
ARRANGEMENT WITH REPEATS
It will help you understand the counting principles by thinking back to the tree diagrams that
you used in previous grades.

EXAMPLE 21
1) A coin is tossed twice. How many outcomes are there?
2) A coin is tossed three times. How many outcomes are there?
3) A coin is tossed four times. How many outcomes are there?
4) A coin is tossed twenty times. How many outcomes are there?
SOLUTION
1. You can use a tree diagram to help you find the number of outcomes when a coin
is tossed twice:

§ There are two possible outcomes for the first toss.

§ There are two possible outcomes for the second toss.
Therefore there are 𝟐 × 𝟐 = 𝟒 outcomes in total.
2. You can use a tree diagram to help you find the number of outcomes when a coin
is tossed twice:

§ There are two possible outcomes for the first toss.

§ There are two possible outcomes for the second toss.
§ There are two possible outcomes for the third toss.
Therefore there are 𝟐 × 𝟐 × 𝟐 = 𝟖 outcomes in total.
3. 𝟐 × 𝟐 × 𝟐 × 𝟐 = 𝟏𝟔 outcomes
4. 𝟐𝟐𝟎 = 𝟏𝟎𝟒𝟖𝟓𝟕𝟔 outcomes

Page 23 of 46
THE FUNDAMENTAL COUNTING PRINCIPLE
The fundamental counting principle state that: if there are m ways to make a choice, and for
each of these there are n ways to make a second choice, and for each of these there are l ways
to make a third choice, and so on, then there are m × n × l ways for both to occur.
The fundamental counting principle is a quick method for calculating numbers of outcomes
using multiplication.
In simple language the fundamental counting principle says: “if you have several stages of an
event, each with a different number of outcomes, then you can FIND the TOTAL number of
outcomes by multiplying the number of outcomes of each stage.”
For example:
A coin is tossed four times. How many outcomes are there?
This situation you can tell from example 16, using a diagram that there are 16 outcomes.
Using counting principle, we check what are the outcomes of the first toss and second toss etc.
i.e. toss 1: head or tail (2 outcomes) toss 2: head or tail (2 outcomes)
toss 3: head or tail (2 outcomes) toss 4: head or tail (2 outcomes)
Therefore:
The possible outcomes = 2 × 2 × 2 × 2 = 16 outcomes.

EXAMPLE
A couple decided on the following menu for their wedding reception:

MENU
Starter Main Course Dessert
Garlic Snails Grilled Kingklip Ice Cream with chocolate sauce
Chicken Livers Beef Fillet Crème Brûlée
Calamari Lamb Shanks Malva Pudding
Chicken Cordon Bleu Peppermint Crisp Tart
Vegetarian Pasta

1. How many different meal combination can be chosen ?

2. A particular person wishes to have Grilled Kingklip as his main course. How many
different meal combinations can he choose?

Page 24 of 46
SOLUTION
1. Starter = 3 choices Main course = 5 choices Dessert = 4
Different combination = 𝟑 × 𝟓 × 𝟒 = 𝟔𝟎 different meal combinations
2. Here you will have to reduce the number of choices the person would have for the menu
since they will only prefer Grilled Kingklip.
Starter = 3 choices Main course = 1 choices Dessert = 4
Different combination = 𝟑 × 𝟏 × 𝟒 = 𝟏𝟐 different meal combinations
CLASSWORK A

SOLUTION

ARRANGEMENT WITH REPEATS

With this, you have many way to use letters or digits that you can be given to use from.
Note! In case where repetition is allowed, we can use:
Number of possible ways = 𝑚$
Where:
• 𝑚 – is the number of options to choose from
EXAMPLE • 𝑡 – is the number of times we choose from these options.

You have to create a 4 – digit codes using numbers 0 – 9.

In how many possible way can you create the code?

SOLUTION
You have 10 digits and you need to create a four digit code:
10 10 10 10
st nd rd th
1 spot 2 spot 3 spot 4 spot
Possible codes = 10 × 10 × 10 × 10 = 10# = 10 000 ways
Page 25 of 46
ARRANGEMENT WITHOUT REPEATS
® Sometimes we have examples where an event can only be used once.
® Multiplying the number of possible outcomes of events each time can also be used in other
contexts.

EXAMPLE
1) Two counters marked A and B are randomly drawn from a box. When a counter is
taken, it is not returned. How many ways can these letters be drawn, i.e., how many
possible outcomes are there?
2) Three counters marked A, B and C are randomly drawn from a box. When a counter is
taken, it is not returned. How many possible outcomes are there?
SOLUTION
1. § If A is the first letter, then B must be the second letter.
§ If B is the first letter, then A must be the second letter.
§ There are two possible outcomes for the first letter.
§ There is only one possible outcome for the second letter.
So the number of possible outcomes = 2 × 1 = 2

2. § There are three possible outcomes for the first letter.

§ There are two possible outcomes for the second letter.
§ There is only one possible outcome for the third letter.
So the number of possible outcomes = 3 × 2 × 1 = 6

Page 26 of 46
 EXAMPLE
You are going out with your friends. You are going to watch a movie and then you are going to
a restaurant.
• There are three movies that you would like to watch.
• There are five restaurant where you would like to eat.
• You can only choose one movie and one restaurant.
How many different combinations of movies and restaurant are there ?
Choice 1 = 3 Movies Choice 2 = 5 restaurant
#You can only choice ONE movie and ONE restaurant.
Number of possible combinations = 𝟑 × 𝟓 = 𝟏𝟓 outcomes

EXAMPLE
You have to create a 4 – digit codes using numbers 0 – 9. In how many possible way can you
create the code?
SOLUTION
You have 10 digits and you need to create a four digit code:
10 9 8 7
st nd rd th
1 spot 2 spot 3 spot 4 spot
Possible codes = 10 × 9 × 8 × 7 = 5 040 ways

EXAMPLE
Consider the word “ACTION”
In how many ways can the letters of the word “ACTION” be arranged ?
SOLUTION
You have 10 digits and you need to create a four digit code:
6 5 4 3 2 1
st nd rd th th th
1 spot 2 spot 3 spot 4 spot 5 spot 6 spot
Possible codes = 6 × 5 × 4 × 3 × 2 × 1 = 720 ways

HOMEWORK
Page 311 – Mind Action Series
Exercises 1
Do the following: a); c); e); f) & g)

Page 27 of 46
FACTORIAL NOTATION
® The arrangement of numbers 4 × 3 × 2 × 1 can be written as 4!.
You say ‘4 factorial’.
6!=6×5×4×3×2×1
n ! = 𝑛 × (𝑛 − 1) × (𝑛 − 2) × (𝑛 − 3) × (𝑛 − 4) × …. × 4 × 3 × 2 × 1
® Factorial notation is used for finding the total number of outcomes without repeats.
® Most scientific calculators have a factorial key.

PERMUTATION
Permutation of object means arrangement of object in some sequence or order.
Theorem
The total number of permutation of a set of n objects taken r at a time is given by:
P(n; r) = 𝑛(𝑛 − 1)(𝑛 − 2) … … … … (𝑛 − 𝑟 + 1) (𝑛 ≥ 𝑟)
Proof:
The number of permutation of a set of ‘n’ objects taken r at a time is equivalent to the number
of ways in which r positions can be filled up by those n objects.
When first object is filled then we have (n – 1) choices to fill up the second position.
Similarly, there are (n – 2) choices to fill up the third position and so on.
Therefore, P(n; r) = 𝑛(𝑛 − 1)(𝑛 − 2) … … … … (𝑛 − 𝑟 + 1)
!!
𝑛𝑃% =
(!%&)!

Note!
We say 𝑛 permute 𝑟.
• 𝑛 is the total number of the outcomes in the event
• 𝑟 is the possible outcomes in the event.

Example
In a company, there are four vacant position available and there are ten applicants.
In how many ways can the company fill this positions ?
Solution
Let 𝑛 = 10 applicants 𝑟 = 4 vacant positions
!! ()! ()! We say:
𝑛𝑃% =
(!%&)!
= (()%*)! = +!
= 5040 OR 10𝑃! = 5040
10 Permute 4

Page 28 of 46
PERMUTATION OF OBJECTS NOT ALL DIFFERENT
The permutation of an objects taken all at a time when p of the objects are of first kind, q of
them are of the second kind, r of them are of the third kind and the rest are all different.
!!
The total number of permutations =
,!..!.&!

CIRCULAR PERMUTATION
Circular permutation is the number of ways to arrange distinct objects along a fixed line.
The total number of permutation of a set of n objects arranged in a circle is P = (𝑛 − 1)!
PERMUTATION OF REPEATED THINGS
The permutation of the n objects taken r at a time when each occur number of times its given
by: Possible ways = 𝑚$ .
Note!
• WHEN REPEATS ARE ALLOWED: you find the total number of outcomes by
multiplying the numbers of possible outcomes in each stage of an event, using the
formula: Possible ways = 𝑚$ .
Note! In case where repetition is allowed, we can use:

Number of possible ways = 𝑚$

Where:
• 𝑚 – is the number of options to choose from
• 𝑡 – is the number of times we choose from these options.

• WHEN REPEATS ARE NOT ALLOWED: you find the total number of each
outcomes by multiplying the number of possible outcomes that are left in each stage of
an event, using Factorial, i.e.,
n ! = 𝑛 × (𝑛 − 1) × (𝑛 − 2) × (𝑛 − 3) × (𝑛 − 4) × …. × 4 × 3 × 2 × 1

Page 29 of 46
 EXAMPLE
1) A three-digit code is made up of numbers 3, 5 and 7. The digits may be repeated.
How many different codes are possible ?
2) A three – digit code is made up of numbers 3, 5 and 7. Each digit is used only once.
How many different codes are possible ?
SOLUTION
1. There are THREE places to fill. Remember repeats is allowed
3, 5 or 7 3, 5 or 7 3, 5 or 7

1st place 2nd place 3rd place

So, because the number can be repeated , there are 3 × 3 × 3 = 𝟐𝟕 possible codes

2. There are THREE places to fill. Remember repeats is not allowed

3, 5 or 7 5 or 7 7
1st Place 2nd Place 3rd Place
OR

5, 3 or 7 7 or 3 3
1st Place 2nd Place 3rd Place
OR

7, 5 or 3 5 or 3 5
1st Place 2nd Place 3rd Place

Because numbers cannot be repeated, there are 3! = 3 × 2 × 1 = 6 codes

EXAMPLE
1) How many three – digit numbers can be formed from the digits 2, 3, 5, 7 and 8. If each
HOMEWORK
digit can be used only once ?
Page
2) How many four – digit codes can be formed if the first 311 – Mind
character must Action Series
be a letter of the
alphabet and the following three characters must be Exercises
digits from1 0 to 9 ?

Do the following: a); c); e); f) & g)

SOLUTION
1. There are only THREE space to be filled. Remember repeats is not allowed.

2, 3, 5,7 or 8 3, 5,7 or 8 5,7 or 8

1st Place 2nd Place 3rd Place

Because numbers can only be used ONCE, there are 5 × 4 × 3 = 60 codes.
OR
𝑛𝑃"
5𝑃& = 60 code

Page 30 of 46
2. Here we have:
§ alphabet been 26 (A, B,C,D, …………,Z.)
§ Digits been 10 (0, 1, 2, 3, 4, 5, 6, 7, 8, 9)

There are only FOUR spaces to fill:

Only Alphabet Digits Digits Digits
1st place 2nd place 3rd place 4th place
® The first place only alphabet should be placed there, so we have 26 of them.
® The second, third and fourth place only digits are to be placed there, we have 10 of
each and there is no condition that digits cannot be used more than once.

So, there are 26 × 10 × 10 × 10 = 26 000 codes. OR there are 26 × 𝟏𝟎𝟑 = 26 000 codes.

#NOTE! If there was a condition like, digits may not be repeated, we would have:

26 × 10 × 9 × 8 = 18 720 codes.

CLASSWORK B

SOLUTION

Page 31 of 46
SPECIAL CONDITION (ARRANGEMENT WITH RESTRICTIONS)
Sometimes when we are counting the number of arrangements, we are given special conditions,
for example similar groups must be arranged together, or two or more elements must be put
together in the arrangement.

EXAMPLE
A photograph needs to be taken of the Representative Council of Learners (RCL) at a school.
There are three girls and two boys in the RCL and all of them need to sit in one row for the
photograph as shown below.

1) Suppose there is no restriction on the order in which the RCL sits.

In how many ways can the RCL be arranged in a row?
2) Suppose the President and the Vice – President of the RCL must be seated next to each other.
In how many different ways can the RCL be arranged in a row ?
3) Suppose all the girls must sit next to each other, and all the boys must sit next to each other.
In how many different ways can the RCL be arranged in a row ?

SOLUTION
1. There are only five learners in total and 5 seat to be utilised.

Girl Boy Boy Girl Girl

1st seat 2nd seat 3rd seat 4th seat 5th seat

So, there are 5! = 5 × 4 × 3 × 2 × 1 = 120 different ways / different arrangements

2. President and Vice President is compulsory for them to be together always.

Girl Boy Boy Girl Girl

2!
OR

Boy Girl Boy Girl Girl

2!

So, there are 2! × 4! = 48 different ways / different arrangements

Page 32 of 46
 3. ALL Girls and ALL Boys is compulsory for them to be close to one another always.

Girl
Girl Girl
Girl Girl
Girl
Boy Boy
3!
2!
So, there are 3! × 2! × 2! = 24 different ways / different arrangements.

EXAMPLE
Consider the word PRODUCT
1.) How many ways can the letters in the word be arranged ?
2.) How many arrangements can be made starting with the letter C and ending with the
letter O?
3.) How many arrangement can be made if the letters C, O and R and D and U must be
grouped together in any order ?
SOLUTION
1. We are given the word “PRODUCT”, they are seven letters, and all letters must be used
without repetition:
Different possible ways = 7! = 𝟓𝟎𝟒𝟎 ways

2. PRDUT O
C
Starting 5! Ending

Fixed position Fixed position

Different possible ways = 1 × 5! × 1 = 𝟏𝟐𝟎 ways
HOMEWORK
3. Page 315 – Mind Action Series
CORDU T P
Exercises 2
5!
Do the following: c); e); f) & g)
3!
Different possible ways = 5! × 3! = 𝟕𝟐𝟎 ways

EXAMPLE
Six glasses and five bottles are to be arranged on a shelf. How many arrangements can be made
if all the glasses must be grouped together and all the bottles must be grouped together ?
Total Glasses = 6 Total Bottles = 5
6! 5!
Different possible ways = 6! × 5! = 𝟖𝟔 𝟒𝟎𝟎 ways

Page 33 of 46
IDENTICAL ITEMS IN A LIST
v Consider how many arrangements of the letters there are in the word LEEK.
• Here is a list of some of the possible arrangements:
LEEK LEKE LEEK LEKE
LKEE LKEE ELEK EELK etc.
• Because the letter E is repeated, we cannot say that there are 4 ! different
arrangements. In fact, because 2 letters are repeated, there is half the number of the
different arrangement there would be if all four letters were different.
v We say that
• If there are n different items that are all different, then there are
𝑛 × (𝑛 − 1) × (𝑛 − 2) … 𝑛 terms or n ! arrangement.
• If there are n different items, but one item is repeated twice, then there are
𝑛 × (𝑛 − 1) × (𝑛 − 2) … 𝑛 terms divided by 2 or 2 ! arrangements.
• If there are n different items, but one item is repeated three times, then there are
𝑛 × (𝑛 − 1) × (𝑛 − 2) … 𝑛 terms divided by 3 × 2 × 1 or 3 ! arrangements.
v Sometimes more than one letter is repeated.
• For example, in the word DODO, D is repeated twice and O is repeated twice.
• Here you can say that if there are n different items, but two items are repeated twice, then
there are 𝑛 × (𝑛 − 1) × (𝑛 − 2) … 𝑛 terms divided by 2 ! × 2 ! arrangements.

!!
The total number of permutations =
#! × &! × '!

EXAMPLE 27
1) Consider the word MEDIAN. In how many ways can you arrange the letters?
2) Consider the word DATA. In how many ways can you arrange the letters?
3) Consider the word PERCENTILE. In how many ways can you arrange the letters?
4) Consider the word CENSUS@SCHOOL. In how many ways can you arrange the
letters?
5) Consider the word STATSSA. How many arrangements will start and end with the
letter ‘T’ ?

SOLUTION
1) Consider the word MEDIAN. In how many ways can you arrange the letters?
There are 6 letters in the word MEDIAN and none of these letters repeat.
So, there are: 6! = 720 different arrangements.

Page 34 of 46
2) Consider the word DATA. In how many ways can you arrange the letters?
There are 4 letters in the word DATA and A is repeated twice.
!!
So, there are: = 12 different arrangements.
#!

3) Consider the word PERCENTILE. In how many ways can you arrange the letters?
There are 10 letters in the word PERCENTILE and E is repeated three times.
$%!
So, there are: = 604 800 different arrangements.
&!

4) Consider the word CENSUS@SCHOOL. In how many ways can you arrange the letters?
There are 12 letters and ‘@’ in the term CENSUS@SCHOOL. S is repeated 3 times, C
is repeated twice, and O is repeated twice. So, we have 13 items.
$&!
So, there are: = 259 459 200 different arrangements.
&! ×#! ×#!

5) Consider the word STATSSA. How many arrangements will start & end with the letter ‘T’ ?
The first letters of the words STATSSA have 7 letters, but the condition is that our first
and last letter must be T.

T A S S A S T
$×)! ×$
So, there are: = 10 different arrangements.
&! ×#!

Page 35 of 46
SOLUTION EXERCISE 2

P
P
P 4
P

P
5 P
P 3

P
P
3
P

[12]
P
P 2

BELOW ARE THE FULL SOLUTIONS FOR EXERCISE 2. PLEASE CHECK VERY CLOSELY.

Page 36 of 46
Page 37 of 46
 USING COUNTING PRINCIPLES TO FIND PROBABILITY
§ You can use these counting principles to find the number of possible outcomes, and you
can also use them to find the number of favourable outcomes.
§ When you know the number of possible outcomes and the number of favourable
outcomes, you can work out the probability of the favourable event using the formula:
/01234 56 6785047293 50:;513<
Probability of a favourable event =
/01234 56 =5<<>293 50:;513<
.

EXAMPLE 28
Suppose a four – digit number is formed by randomly selecting four digits without repetition
from 1; 2; 3; 4; 5; 6; 7 and 8.

What is the probability that the number formed lies between 4000 and 5000 ?

SOLUTION

We need to create a 4 – digit code, this means we only have four (4) spot available and we have
eight (8) digits:

8 possible choices 7 possible choices 6 possible choices 5 possible choices

1st spot 2nd spot 3rd spot 4th spot

Number of possible outcomes = 8 × 7 × 6 × 5 = 1 680

A number that lies between 4000 and 5000 must start with a 4, so we fix 4 and remain with

7 digits to choose from and we only have three places to fill:

4 ! Fixed 7 possible choices 6 possible choices 5 possible choices

1st spot 2nd spot 3rd spot 4th spot

Number of possible outcomes = 1 × 7 × 6 × 5 = 210

()*+,- /0 012/)-1+3, /)45/*,6

Probability that the number lies between 4 000 and 5 000 = ()*+,- /0 7/668+3, /)45/*,6

9:;
= : <=;

:
==

Page 38 of 46
HOMEWORK
Page 316 – Mind Action Series
Exercises 3
Do the following: a); d); e) & g)

Page 39 of 46