Permutations and Combinations are concerned with determining the number of different ways of arranging and selecting objects out of a given number of objects, without actually listing them. These are generally referred to as “PnC”. This chapter is all about logic and “counting”. PnC tests your ability to observe the pattern, your mathematical reasoning, and creativity. From the exam point of view, PnC is one of the important chapters. Concepts of Permutations and combinations are mostly used while solving the problems from probability. The problems of probability are no longer as simple as they used to be in elementary standards. However, if you have a command on Permutations and combinations, the chapter probability will be a piece of cake for you.
Suppose you have a smartphone with a screen lock set as a PIN. The number pad has 10 digits from 0 to 9. The lock can be opened if 4 specific digits are arranged in a particular sequence with no repetition. Somehow, you have forgotten this specific sequence of digits. You remember only the first digit which is 7. In order to open the lock, how many sequences of 3digits you may have to check with? To answer this question, you may, immediately, start listing all possible arrangements of 9 remaining digits taken 3 at a time. But, this method will be tedious, because the number of possible sequences may be large. (By the way, it would take a maximum of 504 trials to unlock your screen.) Here, in this Chapter, you will study some basic counting techniques which will enable you to answer this question without actually listing 3digit arrangements. In fact, these techniques will be useful in determining the number of different ways of arranging and selecting objects without actually listing them.
Fundamental Principle of Counting
Permutations as an Arrangement
Combinations as Selections
P(n,r) and C(n,r)
Application of Permutation and Combination
Fundamental Principle of Counting
According to the Addition Principle, if one event can occur in m ways and a second event with no common outcomes can occur in n ways, then one of the first or second events can occur in m + n ways.
If you are shopping for a new computer and you need to decide among 3 desktop computers and 2 laptop computers. Then, what is the total number of computer options you will have?
So as from the figure, you will have a total of 5 options to choose one computer.
According to the Multiplication Principle, if one event can occur in m ways and a second event can occur in n ways after the first event has occurred, then the two events can occur in m × n ways.
Suppose you are choosing an appetizer, an entrée, and a dessert. If there are 2 appetizer options, 3 entrée options, and 2 dessert options on a fixed price dinner menu, there are a total of 12 possible choices of one each as shown in the tree diagram
The possible choices are:
soup, chicken, cake
soup, chicken, pudding
soup, fish, cake
soup, fish, pudding
soup, steak, cake
soup, steak, pudding
salad, chicken, cake
salad, chicken, pudding
salad, fish, cake
salad, fish, pudding
salad, steak, cake
salad, steak, pudding
You can also find the total number of possible dinners by multiplying.
# of appetizer options × # of entree options × # of dessert options
2 × 3 × 2 = 12
A permutation is an arrangement in a definite order of a number of objects taken some or all at a time.
The total number of permutations of n distinct objects taken r at a time is denoted by P(n,r) or ^{n}P_{r} and defined by
Let’s understand this by an example
How many ways can we award a 1st, 2nd and 3rd place prize among five contestants? (Gold / Silver / Bronze)
We’re going to use permutations since the order we hand out these medals matters. Here’s how it breaks down:
Gold medal: 5 choices: A B C D E. Let’s say A wins the Gold.
Silver medal: 4 choices: B C D E. Let’s say B wins the silver.
Bronze medal: 3 choices: C D E. Let’s say… C wins the bronze.
We had 5 choices at first, then 4, then 3. The total number of options was
5 × 4 × 3 = 60
This can also be solved using the formula P(n,r).
n = 5 and r = 3
Each of the different group or selection which can be made by taking some or all of a number of objects, irrespective of their arrangement is called combinations. Combinations mean the selection of the object.
The number of selection that can be formed from n different objects taken r at a time is given by C(n,r) or ^{n}C_{r} and defined as
The term permutation refers to several ways of arranging a set of objects in sequential order. Combination implies several ways of choosing items from a large pool of objects, such that their order is irrelevant.
Suppose, you have to find out the total number of possible samples of two out of three objects X, Y, Z. In this question, first of all, you need to understand, whether the question is related to permutation or combination and the only way to find this out is to check whether the order is important or not.
If the order is important, then the question is related to permutation, and possible samples will be, XY, YX, YZ, ZY, ZX, XZ. Where XY is different from YX, YZ is different from ZY and ZX is different from XZ.
If the order is irrelevant, then the question is related to the combination, and the possible samples will be XY, YZ, and ZX.
Follow these tips to prepare the chapter permutation and combination created by the subject matter experts:
Understand the use of nPr and nCr:
When you first prepare for permutation and combination, the twoterm you’ll learn arenPr andnCrand initially, you will find that you are using these two terms wrongly to solve problems. So in the beginning, solve the problems without using them. Slowly by practice, you’ll understand the pattern and the need for these two terms in solving certain questions. And only after that, you’ll learn the usage of these terms perfectly.
Practice Different types of Questions:
In Permutation and Combination, you can form an infinite number and different type of questions and still cannot be confident that you will be able to solve all questions of this topic. So to be able to solve the maximum number of questions you need to practice a lot, that’s the key. Solve the variety of questions and first try to understand the question. Think about the concept that can be used to solve this question. And don’t jump directly to the solution after just reading the question. In JEE Main questions from this topic won’t be too exaggerated and will test your basics. Make sure you practice the ballbox and other related problems, as many questions previously asked previously in JEE Main revolve around this concept.
First, finish all the concept, example and question given in NCERT Maths Book. You must thorough with the theory of NCERT. Then you can refer to the book Cengage Mathematics Algebra. PnC is explained very well in this book and there are ample amount of questions with crystal clear concepts. You can also refer to the book Arihant Algebra by SK Goyal or RD Sharma. But again the choice of reference book depends on person to person, find the book that best suits you the best depending on how well you are clear with the concepts and the difficulty of the questions you require.
Chapters 
Chapters Name 
Chapter 1 

Chapter 2 

Chapter 3 

Chapter 5 

Chapter 6 

Chapter 7 

Chapter 8 

Chapter 9 

Chapter 10 

Chapter 11 

Chapter 12 

Chapter 13 

Chapter 14 

Chapter 15 

Chapter 16 
If all the words, with or without meaning, are written using the letters of the word QUEEN and are arranged as in English dictionary, then the position of the word QUEEN is :
44^{th}
45^{th}
46^{th}
47^{th}
A man X has 7 friends, 4 of them are ladies and 3 are men. His wife Y also has 7 friends, 3 of them are ladies and 4 are men. Assume X and Y have no common friends. Then the total number of ways in which X and Y together can throw a party inviting 3 ladies and 3 men, so that 3 friends of each of X and Y are in this party, is :
468
469
484
485
The number of ways in which 5 boys and 3 girls can be seated on a round table if a particular boy B_{1} and a particular girl G_{1} never sit adjacent to each other, is :