Permutation & Combination

## 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.”

The above principle can be generalized for any finite number of events.

“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.”

Keywords
AND➜ MULTIPLICATION (Product Rule)

## What is Permutation?

A permutation is defined as an arrangement in a definite order of a number of objects taken, some or all at a time. Counting permutations are merely counting the number of ways in which some or all objects at a time are rearranged. The convenient expression to denote permutation is defined as “ nP”.

The permutation formula is given by:

0 ≤ r ≤ n

where the symbol “!” denotes the factorial which means that the product of all the integers is less than or equal to n but it should be greater than or equal to 1.

Factorial Notation:

The notation n! represents the product of the first n natural numbers, i.e., the product 1 × 2 × 3 × . . . × (n – 1) × n is denoted as n!. We read this symbol as ‘n factorial’.

Thus, 1 × 2 × 3 × 4 . . . × (n – 1) × n = n !

For example,

1! = 1

2! = 1 x 2 = 2

3! = 1 x 2 x 3 = 6

4! = 1 x 2 x 3 x 4 = 24, which are the factors of the given number.

### Permutation when all the Objects are Distinct

There are some theorems involved in finding the permutations when all the objects are distinct. They are :

Theorem 1: If the number of permutations of n different objects taken r at a time, it will satisfy the condition 0 < r ≤ n and the objects which do not repeat is n ( n – 1) ( n – 2)……( n – r + 1), then the notation to denote the permutation is given by “ Pr

Theorem 2: The number of permutations of different objects “n” taken r at a time, where repetition is allowed and is given by nr.

### Permutation when all the Objects are not Distinct

Theorem 3: To find the number of permutations of the objects ‘n’, and ‘p’s are of the objects of the same kind and the rest is all different is given as n! / p!

Theorem 4: The number of permutations of n objects, where p1 are the objects of one kind, p2 are of the second kind, …, pis of the kth kind and the rest, if any, are of a different kind, then the permutation is given by n! / ( p1!p2!…Pk!)

## What is Combination?

The combination is a selection of a part of a set of objects or a selection of all objects when the order doesn’t matter. Therefore, the number of combinations of n objects taken r at a time.

The combination formula is given by:

OR

Relationship Between Permutation and combination:

In permutation and combination for class 11, the relationship between the two concepts is given by two theorems. They are;

Theorem 5: nPr = nCr! ; if 0 < r ≤ n.

Theorem 6: nC+ nCr-1 = n+1Cr

### Difference between Permutation and Combination

• Permutation involves arranging objects or numbers in a specific order, while combination involves selecting objects or numbers without considering the order.
• In permutation, the order of arrangement matters, whereas in combination, the order of selection does not matter.
• The formula for permutation is nPr = n! / (n - r)!, whereas the formula for combination is nCr = n! / (r! * (n - r)!) (where n is the total number of objects or elements in the set. r is the number of objects or elements to be selected. n! denotes the factorial of n, which is the product of all positive integers from 1 to n.)

### Applications of Permutation and Combination

Permutation and combination have various applications in real-life scenarios and different fields of study. Some common applications include:

• Probability: Permutation and combination are used to calculate the number of possible outcomes in probability experiments.
• Combinatorial Optimization: These concepts are used to solve optimization problems in computer science and operations research.
• Statistics: Permutation and combination are used in statistical analysis to calculate the number of possible arrangements and combinations of data.
• Cryptography: These concepts are used in encryption algorithms to generate secure keys and codes.

Question for Permutation & Combination
Try yourself:Find the number of words, with or without meaning, that can be formed with the letters of the word ‘INDIA’.

## Solved Questions

Q.1. From a pack of cards in how many ways can you select-

a) A king and a queen

b) A king or a queen

There are 52 cards in a pack, with 4 kings and 4 queens.

A king can be selected in 4 ways and a queen can be selected in 4 ways. Number of ways of selection of a king AND a queen is 4×4=16 (Product rule)

Number of ways of selection of a king OR a queen 4+4=8 (Addition rule)

The fundamental principle of counting (FPC) is the basic concept of permutation and combination.

Q.2. In how many ways can 3 people A, B, C be arranged in 2 places?

Manually solving we will get 6 cases as given below.

AB BA

AC CA

BC CB

This can be explained using FPC like this

There are two seats __ __. In the first seat A,B or C can sit. i.e., 3 possibilities.

Let A sit in the first place. Thus, in second place either B or C can sit.

The second seat can hence be taken up in 2 ways Together A,B ‘AND’ C can be seated in 3 x 2 = 6 ways.

Thus, the number of arrangement of 3 things at 2 places can be done in 3×2 ways.

Q.3. In how many ways can 4 people be seated in 3 chairs?

First seat can be filled in 4 ways.

Second seat can be filled in 3 ways.

Third seat can be filled in 2 ways.

So all together 4 people can be arranged in 3 seats in 4x3x2 = 24 ways.

Generalizing; arrangement of n things at r places can be done in [n(n-1)(n-2)…(n-r+1)] ways.

This arrangement of n things at r places is denoted by nPr .

nPr = n(n-1)(n-2)…(n-r+1) = n!/(n-r)!

It should be noted that in all these examples, the order of arrangement is important.

In other words, AB and BA are counted as 2 different cases. An arrangement where the order is important is called permutation

Now let us see one case where the order is not important.

Question for Permutation & Combination
Try yourself:In how many different ways can the letters of the word 'LEADING' be arranged in such a way that the vowels always come together?

Q.4. How many doubles teams can be selected from 3 persons A, B, C?

Let’s take a doubles team AB. Change the order, i.e. to BA. Notice that both the teams are one and the same.

So here the order is not important. Hence, it’s a case of a combination. Here one can select the team in 3 ways

AB

AC

BC

If the order is important, then the total number of arrangements can be done in nPr = 3P2 ways.

We will get the 6 cases as:

AB BA

AC CA

BC CB

But in this particular question every 2! (because of A,B can be arranged in 2! Ways) cases will be counted as only one

case, i.e AB and BA is one and the same team.

So the number of selections of 2 things from 3 things can be done in = (3P2) / 2!

Similarly, the number of selections of 3 things from 4 things can be done in = (4P3) / 3!

Generalizing: the number of selections of r things from n things can be done in = (nPr) / r! ways.

The number of selections of r things from n different things is denoted by nCr,

which is what we learn as “Combination”.

∴ nCr = nPr/r!=n!/[(n-r)! r!]

Thus, you can understand now, that wherever the arrangement is necessary apart from selection,

we used Permutation and when we just need to select without arranging, we use Combination.

To make the point even clearer.

Question for Permutation & Combination
Try yourself:Find the number of words, with or without meaning, that can be formed with the letters of the word ‘CHAIR’.

Q.5. In how many ways can you select a President and a Vice-President from 3 people?

Is it a case of permutation or combination?

In the above question, since the word “select” appears, it may tempt you to consider combination.

So let’s take a case where A is the President and B is the Vice-President. Now change the order,

i.e. B is President and A Vice-President. Are both the cases same? No, they are not! We see that both the cases are different.

The order is important. Hence it is a case of permutation.

Question for Permutation & Combination
Try yourself:Among a set of 5 black balls and 3 red balls, how many selections of 5 balls can be made such that at least 3 of them are black balls.

Question for Permutation & Combination
Try yourself:Solve the following.
i) 30 P
ii) 30 C 2

The document Permutation & Combination | CSAT Preparation - UPSC is a part of the UPSC Course CSAT Preparation.
All you need of UPSC at this link: UPSC

## CSAT Preparation

207 videos|156 docs|192 tests

## FAQs on Permutation & Combination - CSAT Preparation - UPSC

 1. What is the Fundamental Principle of Counting?
Ans. The Fundamental Principle of Counting states that if there are m ways to do one thing and n ways to do another thing, then there are m * n ways to do both things together.
 2. What is a Permutation?
Ans. A permutation is an arrangement of objects in a specific order, where the order matters. In other words, it is a way of selecting objects and arranging them in a sequence.
 3. What is a Combination?
Ans. A combination is a selection of objects where the order does not matter. It is a way of choosing a subset of objects from a larger set without regard to the arrangement or order in which they are chosen.
 4. How can the Fundamental Principle of Counting be applied to Permutations?
Ans. The Fundamental Principle of Counting can be applied to permutations by considering each position in the arrangement as a separate event. For each position, we have a certain number of choices, and by multiplying these choices together, we can determine the total number of possible permutations.
 5. How can the Fundamental Principle of Counting be applied to Combinations?
Ans. The Fundamental Principle of Counting can be applied to combinations by using the concept of permutations. We first calculate the number of permutations for a given selection, and then divide it by the number of ways the objects can be arranged. This helps us eliminate the duplicate arrangements and gives us the total number of combinations.

## CSAT Preparation

207 videos|156 docs|192 tests

### Up next

 Explore Courses for UPSC exam

### How to Prepare for UPSC

Read our guide to prepare for UPSC which is created by Toppers & the best Teachers
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Track your progress, build streaks, highlight & save important lessons and more!
Related Searches

,

,

,

,

,

,

,

,

,

,

,

,

,

,

,

,

,

,

,

,

,

;