Business Mathematics – I: Module-1 Factorials and Permutations

Business Mathematics – I : Module-1
- Prof. Hinal Virani, IMBA , GLS University

 Factorials - In mathematics, the product of all
positive integers less than or equal to a given
positive integer.
 It is denoted by that integer and an

exclamation point. (eg. – 4! , 5! )
 In general it is denoted by n! for any nth

number.
 3! = 3x2x1 = 6
 4! = 4x3x2x1 = 24
 5! = 5x4x3x2x1 = 120
 Similarly , solve : 6! , 7! , 8! , 9! .
 6! = 6x5x4x3x2x1 = 720
 7! = 7x6x5x4x3x2x1 = 5040
 8! = 8x7x6x5x4x3x2x1 = 40320
 9! = 9x8x7x6x5x4x3x2x1 = 362880
 n! = n x (n-1) x (n-2) x (n-3) x …… x 1

 0! = 1
 Solve : 1. 8! + 9!
2. 3! – 0!
3. 7! – 6!
 Answers : 1. 403200
2. 5
3. 4320
 4! – 3! = 24 – 6 = 18
(4 x 3! – 3! ) = 3! x (4-1) = 3! x 3 = 18
 5! + 4! = 120+24 = 144
(5x4! + 4!) = 4! x (5 + 1) = 4! X 6 = 144

 100! – 99! = ????
100 x 99 ! – 99! = 99! (100 – 1) = 99!x99
 200 ! – 199! = ?????
Answer = 199! x 199

OR : (+) Addition
AND : (x) Multiplication

How many boxes
are there in total ?
There are 4 Rows and 5 column's

4 X 5 = 20
Let us understand the concepts through
examples!!!
 If you select any one apple from these 5 apples,
how many options are available?
Solution:
 You can select either A1 or A2 or A3 or A4 or A5.

 Or – Addition Rule
 No of ways = (1+ 1+ 1+ 1+ 1) = 5
 3 Movies, 2 Plays operate at same time. In how
many ways you can have entertainment?
Solution:
 3 M and 2 plays at same time
 No of ways -
 M1 or M2 or M3 or P1 or P2
 (1 + 1 + 1 + 1 + 1)=5
 3 Movies , 2 Plays operate at different times . In
how many ways you can have entertainment?
Solution:
5 pm to 6 pm – M1 , M2 , M3
6 pm to 7 pm – p1 , p2
 No of ways –
 (M1 or M2 or M3) And ( P1 or P2)
 (1 + 1 + 1 ) x (1 + 1)
 3x2=6
 In how many ways you can select 1 vegetable and
1 fruit from 3 tomatoes and 3 oranges?
 Solution:
 (T1 or T2 or T3) And (O1 or O2 or O3)

= (3x3) = 9 ways
 There are 4 ways to go from A to B and 2 ways to
go from B to C. In how many ways one can go
from A to C.
Solution:
 A to B : (W1 or W2 or W3 or W4 )
 And
 B to C : (W1 or W2 )
 No of ways – 4 x 2 = 8
 There are 3 ways to go from A to B and 4 ways to
go from B to C. In how many ways one can go
from A to C?
 Answer = 3x4 = 12
In how many ways a person can go from A to B and
come back, taking any route?
Solution:
A to B : (W1 or W2 or W3 or W4 or W5 )
And
B to A : (W1 or W2 or W3 or W4 or W5 )
No of ways : 5 x 5 = 25
 In how many ways a person can go from A to B
and come back, taking same route?
Solution:
If person goes from 1st route
And
B to A : (W1 )
No of ways : 5 x 1 = 5
In how many ways a person can go from A to B and
come back, Where same route to come back is not
taken?
If the person goes from 5th route
And
B to A : (W1 or W2 or W3 or W4 )
No of ways : 5 x 4 = 20
 In how many ways a person can go from A to D?
 Solution:
 Option 1 : A – D = 3
 OR
 Option 2 : A – B – C – D
◦ A to B : 2 and
◦ B to C : 3 and
◦ C to D :1
◦ 2x3x1 = 6
No of ways = 3 + 6 = 9
Arrangement Selection
No specific order or
Selection included
ranking
{a,b,c} ≠ {b,a,c} {a,b,c} = { b,a,c}

 A permutation is a mathematical technique that
determines the number of possible arrangements in a
set when the order of the arrangements matters.
 Notes :
◦ r ≤ 𝑛 , where
r is number of objects to be arranged (No. of
arrangements available.
n is total number of objects

𝟓!
 5P3 =
𝟓−𝟑 !
𝟓! 𝟏𝟐𝟎
 = = = 𝟔𝟎
𝟐 ! 𝟐
𝟒!
 4P2 =
𝟒−𝟐 !
𝟒! 𝟐𝟒
 = = = 𝟏𝟐
𝟐 ! 𝟐
𝟔!
 6P3 =
𝟔−𝟑 !
𝟔! 𝟕𝟐𝟎
 = = = 𝟏𝟐𝟎
𝟑 ! 𝟔
𝟒!
 4P4 =
𝟒−𝟒 !
𝟒! 𝟐𝟒
 = = = 𝟐𝟒
𝟎 ! 𝟏
 5P3
 5P2
 3P3
 8P4
 7P6
 5P3= 60
 5P2 = 20
 3P3 = 6
 8P4 = 1680
 7P6 = 5040
Let us understand the concepts through
examples!!!
 Arrange 3 boys in 3 chairs. What are the possible
number of arrangements?
Solution:
 Total no. of objects : n = 3

 Total no. of arrangements : r = 3
3P 𝟑!
 Formula ; 3 =
𝟑−𝟑 !
𝟑! 𝟔
 = = =𝟔
𝟎 ! 𝟏
 Create position according to number of arrangements.
(i.e – r)
Here 3 arrangements are there.
___

3
These are no of
optionsavailable,
 1st position : n = 3 not the actual
digits(i.e-n)
 Create position according to number of objects to be
arranged. (i.e – r)
Here 3 objects to be arranged.
___

3 2
 1st position : n = 3
 2nd position : n-1 = 3-1 =2
___

 =3x2x1=6
3 2 1
 2nd position : n-1 = 3-1 =2
 3rd position : n-2 = 3-2 = 1
 Arrange 8 boys in 5 chairs. What are the possible
number of arrangements?
Solution:

 Total no. of arrangeent : r = 5
8P 𝟖!
 Formula ; 5 = 𝟖−𝟓 !
𝟖! 𝟒𝟎𝟑𝟐𝟎
 = = = 𝟔𝟕𝟐𝟎
𝟑 ! 𝟔
_____

= 8 x 7 x 6 x 5 x4 =6720
8 7 6 5 4
 Arrange A,B, C,D,E, F, G in four positions. How many
arrangements are possible?
____ = 7 x 6 x 5 X 4 = 840
7 6 5 4
 2nd position : n-1 = 8-1 =6
 3rd position : n-2 = 8-2 = 5
 4th position : n-3 = 8-3 = 4
 Repetition of digits  Repetition of digits not
allowed. allowed.
 Eg. 1234, 12 , 789

 Eg. 1002 , 1000 , 22
 In how many ways using 1 to 7 , a 4 digit number
can be formed, without repetition of digits.
Solution:

 Total no. of objects to be arranged : r = 4
7P 𝟕!
 Formula ; 4 =
𝟕−𝟒 !
𝟕! 𝟓𝟎𝟒𝟎
 = = = 𝟖𝟒𝟎
𝟑 ! 𝟔
____
7
____
7 6
 2nd position : n-1 = 7-1 = 6
____
7 6 5
 2nd position : n-1 = 7-1 =6
 3rd position : n-2 = 7-2 = 5
____ = 7 x 6 x 5x4 = 840 ways
7 6 5 4
 2nd position : n-1 = 7-1 =6
 3rd position : n-2 = 7-2 = 5
 4th position : n-3 = 7-3 = 4
 In how many ways using 1 to 9 form a 3 digit
number can be formed, without repetition of digits.
Solution:
n=9
___
r=3
9
Solution:
n=9
___
r=3
9 8
Solution:
n=9
___
r=3
= 9 x 8 x 7 = 504 ways
9 8 7
 In how many ways A to H can be arranged in 5
position , without repetition of letters.
Solution:
 In how many ways A to H can be arranged in 5
position , without repetition of letters.
Solution:
_____
8 7 6 5 4
Type 2 : With Repetition of Digits
number can be formed, with repetition of digits.
Solution
n=7
____
r=4
7
Note : In case of with repetition , all the digits can
be used for every position. Hence n-1 is not
required
Solution
n=7
____
r=4
7 7
be used for every position. Hence n-1 is not
 1st position : n = 7 required
 2nd position :n = 7
Solution
n=7
____
r=4
= 7 x 7 x 7 x 7 = 2401 ways
7 7 7 7

 1st position : n = 7 be used for every position. Hence n-1 is not
 2nd position :n = 7 required
 3rd position : n = 7
 4th position : n = 7
Solution:
n=9
___
r=3
= 9 x 9 x 9 = 729 ways
9 9 9
 2nd position :n = 9
 3rd position : n = 9
1. In how many ways using 1 to 9 form a 5 digit number can
be formed, without repetition of digits?

be formed, with repetition of digits?
be formed, without repetition of digits? (15120)

be formed, with repetition of digits?(216)
 012 – 3 digit number or 2 digit number???
 0456 – 4 digit number or 3 digit number???
 Similarly, what about 058 , 06247,07554 ???
0 cannot be in first position

Type 3 : 0 and Without
repetition of digits
Solution:
n=5
___
r=3
 1st position : n-1= 4 ( 0 cannot be used so n-1)

Solution:
n=5
___
r=3
4 4

 2nd position :n-1 = 4 ( 0 can be used but digit used in 1st position cannot be used n-1)
Solution:
n=5
___
r=3
= 4 x 4 x 3 = 48 ways
4 4 3

 2nd position :n-1 = 4 ( 0 can be used but digit used in 1st position cannot be used n-1)
 3rd position : n-2 = 3( 0 can be used but digit used in 1st position and 2nd position cannot be
used, n-2)
Solution:
n = 10
____
r=4

Solution:
n = 10
____
r=4
9 9

 2nd position :n-1 = 9 ( 0 can be used but digit used in 1st position cannot be used )
Solution:
n = 10
____
r=4
9 9 8

 3rd position : n-2 = 8( 0 can be used but digit used in 1st and 2nd position cannot be used)
Solution:
n = 10
____
r=4
= 9 x 9 x 8 x 7 = 4536 ways
9 9 8 7

 4th position : n-3 = 7( 0 can be used but digit used in 1st , 2nd and 3rd position cannot be
used,)
Solution:
n=8
____
r=4
= 7 x 7 x 6 x 5 = 1470 ways
7 7 6 5

 4th position : n-3 = 5( 0 can be used but digit used in 1st , 2nd and 3rd position cannot be
used,)

3. Using 0 to 6 form 3 digit no , without repetition of digits
be formed, without repetition of digits? (13440)

be formed, with repetition of digits? (64)
3. 180
Type 4 : 0 and With repetition
of digits
Solution:
n=6
___
r=3

Solution:
n=6
___
r=3
5 6

 2nd position : n = 6 ( All digits can be used)
Solution:
n=6
___
r=3
= 5 x 6 x 6 = 180 ways
5 6 6

 3rd position : n = 6 ( All digits can be used)

Solution:
n=7
____
r=4

Solution:
n=7
____
r=4
= 6 x 7 x 7 x 7 = 2058 ways
6 7 7 7




1. ____
9 8 7 6
= 3024
2. _____ = 90000
__
9 10 10 10 10
= 36
6 6

Business Mathematics – I: Module-1 Factorials and Permutations

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Business Mathematics – I: Module-1 Factorials and Permutations

Uploaded by

Copyright:

Available Formats

Business Mathematics – I : Module-1

- Prof. Hinal Virani, IMBA , GLS University

 It is denoted by that integer and an

 In general it is denoted by n! for any nth

 n! = n x (n-1) x (n-2) x (n-3) x …… x 1

(5x4! + 4!) = 4! x (5 + 1) = 4! X 6 = 144

100 x 99 ! – 99! = 99! (100 – 1) = 99!x99

 200 ! – 199! = ?????

Answer = 199! x 199

AND : (x) Multiplication

There are 4 Rows and 5 column's

 You can select either A1 or A2 or A3 or A4 or A5.

 3 M and 2 plays at same time

 (T1 or T2 or T3) And (O1 or O2 or O3)

{a,b,c} ≠ {b,a,c} {a,b,c} = { b,a,c}

n is total number of objects

 Total no. of objects : n = 3

 Total no. of objects : n = 8

Here 5 objects to be arranged.

 Eg. 1234, 12 , 789

 Total no. of objects : n = 7

Note : In case of with repetition , all the digits can

2. In how many ways using 1 to 6 form a 3 digit number can

2. In how many ways using 1 to 6 form a 3 digit number can

 0456 – 4 digit number or 3 digit number???

 Similarly, what about 058 , 06247,07554 ???

0 cannot be in first position

 1st position : n-1= 4 ( 0 cannot be used so n-1)

 1st position : n-1= 4 ( 0 cannot be used so n-1)

 1st position : n-1= 4 ( 0 cannot be used so n-1)

 1st position : n-1= 9 ( 0 cannot be used so n-1)

 1st position : n-1= 9 ( 0 cannot be used so n-1)

 1st position : n-1= 9 ( 0 cannot be used so n-1)

 1st position : n-1= 9 ( 0 cannot be used so n-1)

 1st position : n-1= 7 ( 0 cannot be used so n-1)

2. In how many ways using 1 to 4 form a 3 digit number can

2. In how many ways using 1 to 4 form a 3 digit number can

 1st position : n-1= 5 ( 0 cannot be used so n-1)

 1st position : n-1= 5 ( 0 cannot be used so n-1)

 1st position : n-1= 5 ( 0 cannot be used so n-1)

 3rd position : n = 6 ( All digits can be used)

 1st position : n-1= 6 ( 0 cannot be used so n-1)

 1st position : n-1= 6 ( 0 cannot be used so n-1)

 3rd position : n = 7 ( All digits can be used)

 3rd position : n = 7 ( All digits can be used)

2. In how many ways using 0 to 9 form a 5 digit number can

3. In how many ways using 0 to 6 form a 2 digit number can

You might also like