Permutation and combination is one of the most important topics for the JEE and the board examination. Every year, some 23 questions (depends on whether it is Mains or Advanced) come in the exam. Its theory is also used in Probability.
So, it is quite clear that to score decent marks in JEE Maths you should understand this topic completely and become comfortable in solving questions in this area. In this article, I will give you some basic theory, some tips, and some good examples which hopefully will help to strengthen your understanding.
Fundamental Principles of Counting
Multiplication Theorem
If an operation can be performed in ‘m’ different ways and the second operation can be performed in ‘n’ different ways, then two operations in succession can be performed in ‘m * n’ ways.
To understand the above theorem clearly, consider this example:

There is a room in which there are ‘m’ doors to get in and ‘n’ doors to get out. All doors can only be used for one purpose (i.e., the door used to get in cannot be used to get out). Now think, in how many different ways we can cross the door?
The answer is obviously 15 (3*5). In this example, we use the Multiplication Theorem.
Addition Theorem
If two independent operations can be performed by m and n different ways respectively, then either of the operations can be performed in (m + n) ways.
To understand this theorem, consider rolling dice. There are two
independent events (operations): and for each operation we either get an odd face or even face. Both events can happen in 3 different ways, now you have to think in how many ways either of the two events can happen?The answer is 6 different ways. It is one of the simple use of Addition Theorem.
To understand the further concept in Permutation and Combination we have to know what a factorial is.
Factorial
For any positive integer ‘n’, factorial of n can be defined as:
n!=n(n1)(n2)……1
Some examples 4!=4*3*2*1=24
0!=1(standard)
I will discuss its definition later in this article.
Permutations
A permutation is an arrangement of objects in a definite order.
Now, there are three different cases of permutations.
 When all objects are different and repetitions are not allowed.
The number of permutations of n objects taken r at a time, where 0 < r ≤ n, denoted by ^{n}P_{r} , is given by
^{n}P_{r} = n! / (nr)!The number of permutations of n objects taken all at a time is n!.
For example, consider your class. Let’s assume that there are 50 seats and 50 students. So, the number of different ways in which all students can sit is 50!.
Explanation: The first student can sit in 50 different ways, the next one will sit in 49 different ways and so on, and all of them are dependent events so by using Multiplication Theorem total number of ways will be 50*49*48….*1=50!.Another example is shuffling of cards. The number of ways in which total cards can be arranged is 52!.
 When repetitions of objects are allowed.
The number of permutations of n objects, taken r at a time, when repetition of objects is allowed, is n^{r}.
Sometimes you may confuse what is n and r. So, you can remember it by thinking n as total and r correspond to want.
For example, think about a cycle lock which has a 4digit code. Now we have to find how many possible lock combinations there are.
The answer is 10^4.
Explanation: First digit of lock can take any values from 09, so it can take 10 different values. Similarly, for 2nd,3rd, and 4th digit of the lock there will be 10 different values. Thus, by Multiplication Theorem, the total case will be 10*10*10*10=10^4.
 Permutations when objects are not distinct.
The number of permutations of n objects of which p_{1} are of one kind, p_{2} are of the second kind, …, p_{k} are of kth kind and the rest if any, are of different kinds is
n! / (p_{1}!p_{2}!p_{3}!…p_{k}!)Example Most common examples of this topic are from arrangements of the letter.
Find the number of permutations by using the letters of ASSASSINS?

The answer is 9! / (2!*5!*1!*1!)
Explanation — ‘A’ repeats 2 times, ‘S’ repeats 5 times, and ‘I’ and ‘N’ occur a single time.
Combinations
It is basically the number of ways in which one can select ‘r’ objects out of ‘n’ different objects where an order of selection is immaterial. It is denoted by ^{n}C_{r}.
^{n}C_{r} = n! / r!(nr)!
The combination is a more important topic than permutation. Questions are generally asked from this topic.
As far as an example is concerned, you can think of many situations.
Consider the event of rolling a dice — you have to bet on any two numbers of the dice. The total number of combinations will be ^{6}C_{2}.
^{6}C_{2}=6! / 2!*4 =15.
You can also verify it by manually writing all the possible combinations. It will take very little time.
Sometimes a given question can cause confusion as to whether it is asking you to find permutations or combinations.
 So if in the problem number of arrangements is asked and order has significance then it is the question of permutation.
 If in the problem number of ways of selecting objects is asked and order of selections is not important, then use combination.
Some important results
 ^{n}C_{r} = ^{n}C_{nr}
 ^{n}C_{r} + ^{n}C_{r1} = ^{n+1}C_{r}
 n^{n1}C_{r1} = (nr+1)^{n}C_{r1}
These results can easily be proved.
The above theories are the basics of permutation and combination. You can solve almost all questions of JEE Mains papers.
For JEE Advanced, you need to study a little bit more theory. They are basically the applications of what we have seen above. You can get all those concepts in any standard JEE preparation book.
Some Tips
 Read questions carefully. First, you have to decide whether the problem calls for Permutation or Combination.
 Make note of the conditions given in the problem.
 Try to memorize all types of formula. For example, what happens if objects are identical, unidentical, or onlsome of them are identical. It will really make your work quite easy.
 You should solve previous years’ JEE problems. The questions are pretty good and if you can solve it properly, it will boost your confidence.
I have discussed here mostly basic theories and examples. This is just a summary of what is present in the topic. So, you should read the NCERT one time and solve all its examples and problems. After that, you can refer to other books like NCERT Exemplar, and other JEE oriented books.
Permutation and Combination are a moderately hard topic. Initially, you may find it bit confusing, but once you start to get the idea it will be fun. Work hard, but enjoy the topic!
Best of luck!
Comments are closed.