THE BASIC PRINCIPLE OF COUNTING
If two experiments that are to be performed are such that the first one may result in any of m
possible outcomes; and if, for each of these m possible outcomes, there are n possible outcomes
of the second experiment, then there is m n possible outcomes of the two experiments.
Example 1
How many outcomes are there in tossing a coin and throwing a die once?
Solution
Tossing a coin gives 2 outcomes.
Throwing a die gives 6 outcomes.
Total outcomes 2 6 = 12 outcomes
Example 2
How many outcomes are there in tossing one coin 3 times?
Solution
1st toss gives 2 outcomes, 2nd toss gives 2 outcomes, 3rd toss gives 2 outcomes
Total outcomes 2 2 2 8
Example 3
How many 4-digit security codes can be gotten?
Solution
Number of codes = 10 10 10 10
1
10000
Example 4
How many 5-digit security codes can be gotten if the first digit must not be 0 and the last digit
must not be 0 or 1?
Solution
Number of codes = 9 10 10 10 8
72000
Example 5
How many different combinations of 2-letter initials are there using the English alphabets?
Solution
Total outcomes 26 26 676
Example 6
How many 6-character passwords are there where first 3 characters are letters, the last three
digits, and there are no repetitions?
Solution
There are 26 letters
There are 10 digits
Total outcomes 26 25 24 10 9 8
11232000
2
PERMUTATION
Suppose we want to find the number of ways of arranging the letters a, b, c in a line. Here, order
is of importance as abc and cba , for example, are two different arrangements. By direct
counting we have 6 ways; namely abc , acb , bac , bca , cab and cba . Each arrangement is
known as permutation. There are 3 2 1 = 6 possible permutation of a set of 3 objects.
In general, the numbers of different arrangements of n different objects is equal to the product
n (n 1) (n 2) 2 1 .
This product is denoted by n ! (read n factorial)
N/B: 0! 1.
Permutation, in other words, is the number of arrangements of n objects taking r objects at a
n!
time. Mathematically, n pr
(n r )!
Example
In how many ways can the letters of the word “CAMPUS” be permuted?
Solution
There are 6 letters of the word
Number of ways 6 P6 6!
720 ways
3
Example
A class consists of 10 students. An examination is given and the students are ranked according to
their performance. Assume that no two students obtain the same score. How many different
rankings are possible?
Solution
Number of rankings 10 P10 10!
3628800
Example
In how many ways can the 1st, 2nd and 3rd positions be taken by ten candidates in a test
assuming that there is no tie?
Solution
Permutation of 10 students taking 3 at a time 10 P3
720
Example
A bookseller wants to put 4 Maths books, 3 chemistry books, 5 history books and 2 French
books on a shelf. She wants to arrange the books so that books of same subject are together. How
many different arrangements are possible?
Solution
Arrangement for 4 different subjects = 4!
4
Arrangement for 4 Maths books = 4!
Arrangement for 3 Chemistry books = 3!
Arrangement for 5 History books = 5!
Arrangement for 2 French books = 2!
Total arrangements 4! 4! 3! 5! 2! 829440
PERMUTATION OF INDISTINGUISHABLE (NON-UNIQUE) OBJECTS
The permutation of n objects, of which n1 are alike, n2 objects are alike, and up to nr objects
that are alike; and n1 n2 nr n is given by
n!
n1 ! n2 ! nr !
Example
Find the number of different permutations of the letters of the word “EXCELLENCE”.
Solution
Total number of letters = 10
Number of letter E = 4
Number of letter C = 2
Number of letter L = 2
10!
37800
4! 2! 2!
5
Example
A chess tournament has 10 competitors, of which 4 are Russians, 3 Nigerians, 2 Brits and 1
American. If the tournament result lists just the nationalities of the competitors in the order in
which they are placed, how many outcomes are possible?
Solution
10!
Total outcomes 12600
4! 3! 2!1!
Weekend Drill
1. Find the number of permutations of the letters of the word “MATHEMATICS”.
2. Find the number of ways the digits 0, 1, 2, 3 can be permuted to get a number greater
than 3000 if:
a.) Repetition is allowed
b.) Repetition is not allowed
