JEE Mathematics Permutations and Combinations

Mastering permutations and combinations is non-negotiable for JEE success, as it forms the backbone of probability and is a consistent, high-weightage topic across both JEE Main and Advanced. Beyond direct questions, proficiency in systematic counting is essential for solving complex problems in probability, coordinate geometry, and algebra. This unit trains you to think logically, avoid careless errors, and build a methodical approach—a skill set that directly translates to a higher score.

Foundational Principles: The Bedrock of Counting

All counting begins with the Fundamental Principle of Counting (FPC). If one operation can be performed in $m$ ways and another independent operation can be performed in $n$ ways, then the two operations together can be performed in $m\times n$ ways. This principle extends to any number of successive independent operations.

Consider a more JEE-level application: How many odd numbers between 3000 and 4000 can be formed using the digits 0,1,2,3,4,5 if repetition is allowed? We break it down stepwise. The thousand's place must be 3 (1 way). The unit's place must be odd (1,3,5 → 3 ways). The hundred's and ten's places can be any of the 6 digits (6 ways each). By FPC, total numbers = $1\times 6\times 6\times 3=108$.

Permutations: The Art of Arrangement

A permutation is an ordered arrangement of a set of distinct objects. The number of permutations of $n$ distinct objects taken $r$ at a time is given by $${}^n{P}_r=\frac{n!}{(n-r)!}.$$ When all $n$ objects are arranged, it's simply $n!$.

Arrangements with Repetition Allowed: If you have $n$ distinct objects and you want to form arrangements of length $r$ where repetition is allowed, the number of ways is simply $n^r$ by the FPC.

Arrangements with Some Identical Objects: The number of distinct permutations of $n$ objects, where there are $n_1$ identical of type 1, $n_2$ identical of type 2, ..., $n_k$ identical of type k, is given by the multinomial coefficient: $$\frac{n!}{n_1!\cdot n_2!\cdots n_k!}.$$ A classic example: permutations of the letters in "MISSISSIPPI". Here, n=11, with M(1), I(4), S(4), P(2). The count is $\frac{11!}{4!4!2!}$.

Circular Permutations: Arrangements around a circle are different from linear rows because rotation does not create a new permutation. The number of circular permutations of $n$ distinct objects is $(n-1)!$. If the circle can be flipped over (like in a necklace), it becomes $\frac{(n-1)!}{2}$. A key JEE strategy is to fix one object's position to break rotational symmetry, reducing the problem to a linear arrangement of the remaining $(n-1)$ objects.

Combinations: The Essence of Selection

A combination is a selection of objects where order does not matter. The number of combinations of $n$ distinct objects taken $r$ at a time is given by the binomial coefficient $${}^n{C}_r=\frac{n!}{r!(n-r)!}.$$ The relationship with permutations is clear: ${}^n{P}_r={}^n{C}_r\times r!$, because you can first select (${}^n{C}_r$ ways) and then arrange the selection ($r!$ ways).

The power of ${}^n{C}_r$ extends to algebraic identities like the binomial theorem, but its core application in counting is for unordered selections. For example, forming a committee of 3 people from 10 is ${}^{10}{C}_3$, as the order of selection is irrelevant.

Advanced Counting Scenarios

Distribution Problems: These are tricky and require careful modeling. The central question: Are the objects distinct? Are the recipients distinct? Can a recipient get zero objects?

• Distinct objects to distinct recipients: This is a direct FPC application. Distributing $n$ distinct gifts to $r$ distinct people such that each person can get any number is $r^n$.
• Identical objects to distinct recipients: This is a "stars and bars" problem. The number of non-negative integer solutions to $x_1+x_2+...+x_r=n$ is ${}^{n+r-1}{C}_{r-1}$. If each recipient must get at least one (positive solutions), it becomes ${}^{n-1}{C}_{r-1}$.

Derangements: A derangement is a permutation of objects such that no object appears in its original position. The number of derangements $D_n$ of $n$ distinct objects is given by the formula: $$D_n=n!\left(1-\frac{1}{1!}+\frac{1}{2!}-\frac{1}{3!}+...+(-1{)}^n\frac{1}{n!}\right).$$ For JEE, knowing $D_2=1$, $D_3=2$, $D_4=9$, and $D_5=44$ is often sufficient. A typical problem: "In how many ways can 4 letters be placed in 4 addressed envelopes so that no letter goes to its correct envelope?" Answer: $D_4=9$.

Principle of Inclusion and Exclusion (PIE): This is a vital tool for counting the union of sets where there is overlap. For two sets, $|A\cup B|=|A|+|B|-|A\cap B|$. For three sets: $|A\cup B\cup C|=|A|+|B|+|C|-|A\cap B|-|B\cap C|-|C\cap A|+|A\cap B\cap C|$. PIE is frequently used to solve problems like "How many numbers from 1 to 100 are divisible by 2, 3, or 5?" or to find the number of onto functions.

Common Pitfalls

Overcounting and Undercounting: This is the single biggest source of error. A common overcount occurs when you treat a combination as a permutation unnecessarily. For instance, choosing a team of 3 from 10 people is ${}^{10}{C}_3$, not ${}^{10}{P}_3$. Undercounting often happens in complex arrangement problems where you forget to consider all cases. Always ask: "Is order important in this selection?"

Misapplying Formulas in Distribution: Confusing "distinct objects to distinct recipients" with "identical objects to distinct recipients" will lead to the wrong answer. Before using any formula, explicitly state the nature of the objects and recipients. A good check is to test your logic with smaller, verifiable numbers.

Ignoring Special Constraints: Failing to handle constraints like "at least one," "at most one," or "two particular objects are never together" systematically causes errors. The standard JEE strategy is to first arrange without the constraint, then subtract the arrangements that violate it. For "two objects never together," arrange the rest first, then slot the restricted objects into the gaps created.

Confusing Circular with Linear Arrangements: Forgetting to divide by $n$ for a simple circle or by $2$ for a necklace/flippable arrangement is a frequent mistake. Always visualize if rotation creates a new arrangement in the context of the problem.

Summary

• The Fundamental Principle of Counting is your primary tool; break complex problems into a sequence of independent choices.
• Use permutations (${}^n{P}_r$, $n!$) when the order of arrangement matters, and combinations (${}^n{C}_r$) when it does not. The formula for permutations with identical objects is a direct application of combinations.
• Circular permutations require fixing one reference point to eliminate rotational symmetry, leading to $(n-1)!$ arrangements.
• For distribution, first classify the problem: Are objects/recipients distinct or identical? This determines whether you use exponentiation ($r^n$), stars and bars (${}^{n+r-1}{C}_{r-1}$), or other methods.
• Derangements and the Principle of Inclusion-Exclusion are specialized tools for problems involving "no object in its place" and counting unions of overlapping sets, respectively.
• The key to accuracy is a systematic, case-wise approach that avoids the twin traps of overcounting and undercounting. Always define what a "way" represents in your count.