Math 2

Permutation & Combination

Permutation:
Is the arrangement of objects taking into account, the different orders of arrangement.

The number of different arrangements of 'n' different objects is equal to 'n'!

n
Pr = n!/(n-r)!.

n! -n-factorial

Consider the order of arrangement of abc;

The diagram above is called a tree diagram.

We can now list the different arrangements as;

abc bac cab

acb bca cba

from the diagram above, we can see that number of different arrangements of the letters a, b and c is
equivalent to the product of 3x2x1. Means 3!.

Example 1:

5!=5x4x3x2x1=120

4!=4x3x2x1=24

3!=3x2x1=6

6!=6x5x4x3x2x1=720

Suppose, we are only untreated in the number of why, the first and second position can be taken by four
people in a race, assuming there is no toe.

The first position can be taken in four ways by any pf the four athletes. The second position can be taken
in three different ways by any of the remaining three athletes.

So the number of ways the first and second position can be taken by four people in a race is 4x3. This
arrangement is called permutation of four people taking two at a time and is designated this; 4P2=4x3.

Similarly, the first three positions can be taken in 4x3x2 ways.

This can also be viewed as permutation of four people taking three at atime and designated 4P3.
4P3=4x3x2

Similarly, 4P4=4x3x2x1 is the permutation of 4 objects taking by four at a time.

Thus; 4P4=4x3x2x1=4!

5P5=5x4x3x2x1=5!

5P4=5!/(5-4)!=5!/1=5x4x3x2

5P3=5!/(5-3)!=5!/2!=5x4x3x2/2!=5x4x3

5P2=5!/(5-2)!=5!/3!=5x4x3!/3!=5x4

Hence; in general:
n
Pr=n!/(n-r)! is the permutation of n objects taking at a time.

abcd, abdc, acbd, acdb, adbc, adcb,

bacs, badc, bdac, bdca, bcad, bcda

cabd, cadb, cbad, cbda, cdab, cdba

dacb, dabc, dbac, dbca, dcab, dcba

1st

4!=4x3x2x1=24

4P3=4!/(4-3)!=4!/1=4!=4x3x2

2nd

Bcs -3!=3x2x1=6

Example 2:

Find the number of the permutation of the word KANO.

Solution.

The letters of the word K,A,N,O can be permutated in

4! Ways=4x3x2x1=24 ways.

4P4=4x3x2x1=24
Example 3:

Find the number of ways, the first, second and third positions can be taken by ten candidates in a
scholarship aptitudes test assuming that there must be no tie.

Solution.
10
P3=10!/(10-3)!=10!/7!=10x9x8x7x6x5x4x3x2/7!=10x9x8=720 ways.

Cyclic permutation