EGERTON UNIVERSITY

COLLEGE OF OPEN AND DISTANCE

LEARNING
E-CAMPUS

MATH 112: Basic Mathematics

Topic 8 Handout

Copyright

Copyright© Egerton University

Published 2020
All rights reserved. No part of this publication may be reproduced, stored in a
retrieval system or transmitted in any form or by any means, electronic,
mechanical, photocopying, recording, or otherwise, without the prior written
permission of the copyright owner.

"Transforming Lives through Quality Education"

Page 1 of 7
Topic 8: Permutation and Combination

Introduction

Welcome to topic eight. This topic introduces you to the ways of finding the number of different
arrangements or selections which are possible from a set of given objects. There are no clear
rules or steps to follow, unlike say in solving a quadratic equation, and the method of solution
often depends on the ability of the learner to think the problem out using any suitable method.

Learning Outcomes

At the end of this topic you should be able to: -

1. Define permutation and combination.

2. Solve various problems involving permutation and combinations.

8.1 Permutation
A permutation is an ordered arrangement of items. Thus AB is a different permutation to BA
even though the individual two items A & B are the same they are in a different order.

Examples

1. A restaurant offers a choice of 3 starters, 4 main courses and 3 sweets. How many
different meals are available?

Solution

3 x 4 x 3 = 36 different meals.

2. A transport manager has to plan routes for his drivers. There are 3 deliveries to be made
to customers X, Y and Z. How many routes can be followed?

Solution

First delivery may be choose in 3 ways

Second delivery may be choose in 2 ways

"Transforming Lives through Quality Education"

Page 2 of 7
 Third delivery may be choose in 1 way

Therefore 3 x 2 x 1 = 6 ways

The arrangements of the n unlike objects are called permutations.

Thus ABC, ACB, BCA, BAC, CAB, CBA are the 3! Permutations

of the three letters A, B, C.

In general a permutation of n objects is written as

n ! = n(n − 1)(n − 2)(n − 3)..........(1) .

Note 1! = 1 and 0! = 1

3. How many even numbers, greater than 2000, can be formed with the digits 1, 2, 4, 8 if
each digit may be used only once in each number?

Solution

If the number is greater than 2000, the first digit can be chosen in 3 ways ie 2, 4, or 8. Then,
whichever has been chosen to be the first digit, there are 2 ways in which the last digit may be
chosen in order to make the number even. Thus there are 3 x 2 ways of choosing the first and
the last digits. When the first and the last digits have been chosen, there are 2 digits, either of
which may be the second digit of the number. Thus there are 3 x 2 x 2 ways of choosing the
first, last and second digit. Now, when three digits have been chosen, there are is only 1 left to
fill the remaining place, and so there are 3 x 2 x 2 x 1, ie 12 even numbers greater than 2000
which may be formed from the digits 1, 2, 4, 8, without repetitions.

8.1.1 Permutations of Groups

The analyst may not wish to arrange all the objects, but groups of objects from within a list.

Example

A company has 4 training officers and it is required to assign one to each of two training
sections. In how many different ways may the four officers be assigned to the two sections?

"Transforming Lives through Quality Education"

Page 3 of 7
 Solution

1st training session can be assigned 4 different ways.

2nd training session can be assigned 3 different ways.

Therefore total number of ways is 4 x 3 = 12 ways

OR

4!
In short = 12
(4 − 2)!

n
In general total number of permutations of n unlike objects taken r at a time denoted by Pr is

n!
= n(n − 1)(n − 2)..............(n − r + 1) .
(n − r)!

8.1.2 Permutations with Similar Items

There will be occasions when the items to be arranged will not all be different. In this case the

number of permutations will be reduced. If we have n items of which n1 of type 1, n2 of type

2, n3 of type 3, .................. nk of type k, then the total number of arrangements will be

n!
since in any one arrangement the different n1 items of the first kind can be
n1 !n !...........nk !

arranged in n1 ! ways, the different n2 items of the second kind can be arranged in n2 ! ways,

..................., the different nk items of the kth kind can be arranged in nk ! ways, then all these

objects can be arranged in n1 !n !...........nk ! ways within one arrangement.

Example

1. In how many ways can the letters of the word MISSISIPI be arranged?

Solution

Let n=9 be the total number of letters

"Transforming Lives through Quality Education"

Page 4 of 7
 n1=1 number of letter M

n2=4 number of letter I

n3=3 number of letter S

n4=1 number of letter P

9!
hence the total number of different arrangements are = 2520
1!4!3!1!

2. In how many ways can five beads, four green beads, two red beads and one white bead
be arranged in a row if beads of the same colour are indistinguishable?

Solution

There are 12 beads altogether. If they were all different they would be arranged in 12! ways. But
there are 5 blue beads, 4 green beads, 2 red beads and 1 white bead. So the total number of
12!
different arrangements is = 83160 .
5!4!2!1!

8.1.3 Permutations of Items in a Round Table/Circle

Since the table is round, the position of items relative to the table is of no consequence. Thus,
supposing n items are arranged on the table, and then all moved one place to the left, the
arrangement is still the same. Therefore one item may be considered to be fixed, and the other
(n-1) can then be arranged about it in (n-1)! ways.

Example

ABCD are to sit around a conference table. In how many ways may this be arranged?

Solution

Fix A in one place. This leaves 3 who may be placed, hence total number of arrangements is
3!=6 ways.

"Transforming Lives through Quality Education"

Page 5 of 7
8.2 Combinations

There will be occasions when selection will be made where the order does not matter meaning
that the arrangements AB will be the same as BA. This is known as combination.

ie A combination is a selection of items where the order of sequence does not matter.

Examples

1. 6 students have to be paired into two’s for an exercise. In how many ways can this be
done?

Solution

Let the students be A, B, C, D, E and F. Then, in groups of two we have

AB AC AD AE AF

BC BD BE BF

CD CE CF

DE DF

EF

A total of 15 ways. Note AB and BA are the same students hence the same way.

For brevity, if we have n unlike items and r the number of items per arrangement, then the total
n!
number of groups are ie combination of n items r at a time and is usually denoted by
r !(n − r)!
n
n
Cr =   .
r

2. A mixed hockey team containing 5 men and 6 women is to be chosen from 7 men and 9
women. In how many ways can this be done?

Solution

7
Five men can be selected from 7 men in C5 ways, and 6 women can be selected from 9 women
9 7 9
in C6 ways. Now for each of the C5 ways of selecting the men, there are C6 ways of
"Transforming Lives through Quality Education"

Page 6 of 7
 7 9 7! 9!
selecting the women, therefore there are C5 x C6 = x =21x84=1764 ways
5!(7 − 5)! 6!(9 − 6)!
of selecting the team.

Topic Summary

In this topic, you have learned:

• Definition permutation and combination.
• How to use permutation to solve various problems.
• How to use combination to solve various problems.

"Transforming Lives through Quality Education"

Page 7 of 7