Scribd
Upload
107 views

Permutation and Combination

The document discusses the fundamental principle of counting and its application to calculating the number of possible outcomes for multiple events. It then provides examples of using this principle to count the number of possible numbers that can be formed from given digits when order and repetition matter. Specifically, it calculates the number of 3+ digit numbers from 1-6, numbers between 200-900 with distinct digits, 7-digit telephone numbers with no repetition, numbers with at most 3 different digits from 1-5, 3-digit odd numbers from 1-9 without repetition, and 3-digit numbers from 1-5.

Uploaded by

Sudip
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
107 views

Permutation and Combination

The document discusses the fundamental principle of counting and its application to calculating the number of possible outcomes for multiple events. It then provides examples of using this principle to count the number of possible numbers that can be formed from given digits when order and repetition matter. Specifically, it calculates the number of 3+ digit numbers from 1-6, numbers between 200-900 with distinct digits, 7-digit telephone numbers with no repetition, numbers with at most 3 different digits from 1-5, 3-digit odd numbers from 1-9 without repetition, and 3-digit numbers from 1-5.

Uploaded by

Sudip
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

 Fundamental Principle of Counting: If an event can occur in m

different ways, following which another event can occur in n


different ways, then the total number of occurrence of the
events in the given order is m × n.
 This principle can be generalized f multiple items ‘If an event
can occur in m different ways, following which another event
can occur in n different ways, following which a third event can
occur in p different ways, then the total number of occurrence
to ‘the events in the given order is m × n × p.”
Q) How many number of at least three digits can be formed from
the integer 1,2,3,,4,5,6

 The numbers must contain at least three digit and can go above that which
means the answer has 3 4 5 and 6 digits all together.
 For three digits , there will be 6*5*4 = 120
 For 4 Digits, There will be 6*5*4*3=360 possible numbers
 For 5 digits , there will be 6*5*4*3*2 = 6! = 720
 For 6 digits, there will be 6*5*4*3*2*1 = 6! = 720
 <Note- the digits are non repeating as the question said it to be “different digits” >
 Now add them up = 120+360+2*720 = 1920
 How many numbers are there between 200 and 900 in which all the digits are
distinct?

 Solution
 The number can be placed in hundred place (n1)=7 ways
 The number can be place in tenth place (n2)= 9 ways
 The number can be place in hundred place (n3)= 8 ways

 By Principle of counting the number of ways 3 digits number can be formed


= n1* n2 * n3
7*9*8
504
 Telephone number consist of 7 digits and non of them begin with zero . How many
telephone numbers could be possible if no if no digit appear more than once?
 Solution
 There are 7 places to fill number

 No of ways to put digits in 1st place =9


 No of ways to put digits in 2nd Place=9
 No of ways to put digits in 3nd Place=8
 No of ways to put digits in 4nd Place=7
 No of ways to put digits in 5nd Place=6
 No of ways to put digits in 6nd Place=5
 No of ways to put digits in 7nd Place=4

 Total possible telephone no = 9.9.8.7.6.5.4


 =544320
How many number of at most three different digits can be formed
form the integers 1,2,3,4,5 ?

How many ways 3-digit odd numbers can be formed by using the
digit 1 to 9 when the repetition of digits is not allowed.

How many three digit number can be formed by using the digits
1,2,3,4,5 ? How many of them are divisible by 2
 Permutation with distinct objects
 Let’s assume the word “CARD” with distinct objects C, A, R,& D. How many 4 & 2
letter words can we form using letters of CARD, when repetition of letters is not
allowed, also find the number of 4 letters word if repletion is allowed?
 Solution: Since we need to create 4 letters word, let’s assume we have 4 bucket.
 Case 1: 4 letters Repetition is not allowed
 In this case, bucket 1 can have any of the 4 letters “C, A , R , D” . That is 4 choices
 Bucket 2 can have any of the remaining 3 letters as one letter is now inside bucket 1,
that is 3 choices
 Bucket 3 will can any any of the remaining 2 letters that is 2 choices
 Bucket 4 will have only 1 choice that is the remaining letter. Thus 1 choice.
 If you multiple all these choices : 4* 3 * 2 *1 , you will get the number of possible 4
letter words with “C A R D”, without repetition
 Thus number of 4 letter possible words are : 4* 3 * 2 *1 = 24 words when repetition is
not allowed.
 Case 2: 4 letters Repetition is allowed
 In this case, bucket 1 can have any of the 4 letters “C, A , R , D” . That is 4 choices
 Bucket 2 can also have any of the 4 letters, since repetition is allowed, that is 2
choices
 Bucket 3 can also have any of the 4 letters, since repetition is allowed, that is 2
choices
 Bucket 4 can also have any of the 4 letters, since repetition is allowed, that is 2
choices
 If you multiple all these choices: 4* 4 * 4 *4 , you will get the number of possible 4
letter words with “C A R D” with repetition.
 Thus number of possible 4 letter words are : 4* 4 * 4 *4 = 256 words when repetition
is allowed.

You might also like