Permutations and Combinations: JEE Main

Permutations and combinations form the foundation of counting, and they reliably contribute one to two questions in JEE Main while underpinning probability and the binomial theorem. The chapter rewards clear logical thinking over heavy computation, but it also trips up students who confuse arrangements with selections. Mastering the core distinction makes the entire topic intuitive. This guide covers every concept the exam tests and the techniques that solve its favourite problem types.

The Fundamental Principle of Counting

Everything in this chapter flows from the fundamental principle of counting: if one task can be done in a number of ways and a second independently in another number of ways, the two together can be done in the product of those ways. The addition principle handles mutually exclusive cases. Master these two principles, because most counting problems are ultimately applications of them, and recognizing whether to multiply or add is the first decision in any problem. Build this judgment through varied practice.

Many problems that look like they require permutation or combination formulas can be solved directly from these fundamental principles with clearer reasoning.

Permutations: When Order Matters

A permutation is an arrangement where order matters, and the number of arrangements of distinct objects follows the standard formula. Master the cases involving repetition, arrangements of objects that are not all distinct, and the important constraint problems where certain objects must or must not be together. The technique of treating a group that must stay together as a single unit, then arranging within it, is a recurring and high-value method. To practice these, take a free mock test with a counting focus.

Constraint problems, where certain positions are restricted, reward a systematic case-by-case approach rather than trying to apply a single formula.

Combinations: When Order Does Not Matter

A combination is a selection where order does not matter, and the combination formula follows from the permutation formula by dividing out the arrangements within each selection. The central skill of the entire chapter is recognizing whether a problem calls for a permutation or a combination, and this distinction is the most frequent source of errors. Master the standard selection problems, including those with constraints such as selecting at least or at most a certain number of items. The relationship between permutations and combinations clarifies why the formulas take their form.

Problems involving selection followed by arrangement combine both concepts and are a common higher-difficulty type worth practicing deliberately.

Circular Permutations and Special Cases

Circular permutations, where objects are arranged in a circle, follow a modified formula because rotations of the same arrangement are considered identical. Master the standard circular cases, including the distinction between arrangements where clockwise and counterclockwise are different and where they are the same, such as a necklace. The distribution of objects into groups, and problems involving the formation of teams, round out the chapter and reward careful application of the core principles.

Strategy for Permutations and Combinations

The keys are mastering the fundamental counting principles, distinguishing arrangements from selections instantly, and recognizing the standard constraint and circular cases. This chapter rewards logical reasoning, so focus on understanding each problem rather than pattern-matching to a formula. It is the foundation for our probability guide, so study them in sequence, and slot it into week two of your revision plan. Master the counting principles and both this chapter and probability become dependable marks.