Permutations and Combinations has a strange reputation. Students spend weeks learning the formulas — nPr, nCr, circular arrangements, distributions — and still freeze the moment a question doesn't look exactly like the textbook example. The formulas were never the hard part. The hard part was never taught: how to actually see what a problem is asking you to count.
This article builds that seeing. Not more formulas — a way of reading a problem so that the right formula becomes obvious rather than guessed.
This is written for Class 11 and 12 students preparing for Boards and JEE. If you're building your broader Class 11 Maths foundation, our guide on how to prepare Maths for JEE from Class 11 is a good companion to this one.
The Two Fundamental Questions of Counting
Before touching any formula, every counting problem can be reduced to two questions. Answer them correctly, and the formula almost picks itself.
Question 1
What am I actually counting? Objects being arranged, positions being filled, a group being selected, or a sequence being formed — these are different tasks even when the numbers involved look similar.
Question 2
Does order matter? If swapping two chosen items creates a genuinely different outcome for the question, order matters — you are arranging. If it doesn't change anything, you are selecting.
That common mistake, stated plainly: using nPr when order genuinely doesn't matter, or using nCr when it does. Both errors come from the same root cause — reaching for a formula before answering Question 2.
The Core Building Blocks: AND and OR
Underneath every P&C formula are two principles more fundamental than any of them. Understand these two, and you can rebuild every formula in the chapter from scratch if you ever forget it.
The Multiplication Principle — "AND" situations
If one task can be done in m ways, and a second, independent task can then be done in n ways, the two tasks together — this AND then that — can be done in m × n ways. Choosing a shirt (5 options) and then a pair of shoes (3 options) gives 15 total outfits. This principle alone builds every arrangement formula in this chapter.
The Addition Principle — "OR" situations
If a task can be completed in one of several mutually exclusive ways — this way OR that way, never both at once — the total number of ways is the sum of the ways for each case. Choosing a fruit that is either an apple (4 varieties) or an orange (3 varieties) gives 7 total choices, not 12.
Permutations — Arranging Things
A permutation is an arrangement where position matters. The letters ABC and the letters BCA use the same three letters but are different permutations, because the order — the position each letter occupies — is different.
Linear Arrangements
Arranging r objects out of n distinct objects, in a row, where order matters, gives nPr = n! / (n − r)!. Build this from the Multiplication Principle directly: the first position can be filled in n ways, the second in (n − 1) ways (one object is used up), the third in (n − 2) ways, and so on for r positions.
Arrangements With Restrictions
Restrictions — "these two must sit together," "this person must not be in the first seat" — are best handled by fixing the restricted elements first and arranging the rest around them. For "must sit together," glue the restricted items into a single block, arrange the block with the remaining items, then multiply by the number of ways to arrange the items inside the block.
Circular Permutations — Why We Divide by n
In a straight line, a reference point — the start of the line — exists. In a circle, it doesn't. An arrangement and every rotation of that same arrangement look identical relative to each other, because there is no fixed "first" position.
Linear arrangements of n distinct objects number n!. But every distinct circular arrangement gets counted n times over in that n! — once for each rotation that produces the "same" circle. Dividing by n removes this duplication, leaving (n − 1)! genuinely distinct circular arrangements.
A useful picture: think of beads on a necklace. Rotate the necklace and it's still the same necklace — only flipping or genuinely re-ordering the beads changes it. That's exactly what the division by n is accounting for.
Arrangements of Identical Objects
Arranging the letters of "LEVEL" is not the same task as arranging 5 distinct letters, because the two Ls are indistinguishable from each other, and so are the two Es. Treating them as distinct overcounts every arrangement by the number of ways the identical letters could be shuffled among themselves without producing a visibly different word. Dividing by the factorial of each repeated group — here, 2! for the Ls and 2! for the Es — removes exactly that overcounting.
Combinations — Selecting Things
A combination is a selection where order does not matter. Choosing three friends for a trip — Aman, Bina, and Chetan — is the same group regardless of the order you thought of their names in.
The Relationship Between nPr and nCr
Every combination of r items can be arranged internally in r! different ways. So the count of arrangements (nPr) is exactly r! times the count of selections (nCr). This gives nCr = nPr / r! — a relationship worth deriving yourself rather than memorising, because it is the cleanest proof that permutations and combinations are not two separate ideas, but one idea viewed with and without order.
"At Least" and "At Most" Problems
These are the problems that most often trigger panic — and they are also where complementary counting earns its reputation as the single most useful technique in the chapter. See the dedicated section below.
Selecting Groups With Identical Items
When some items being selected from are identical — choosing fruits from a basket where apples are indistinguishable from each other — the counting shifts from combinations to a different structure entirely, often solved by thinking of it as distributing a quantity rather than selecting individuals. Recognising when a problem has secretly changed category is itself a skill worth practising.
The Most Useful Mental Models — Instead of Blind Formulas
Four techniques do more work in this chapter than any list of formulas. Master these, and unfamiliar problems stop feeling unfamiliar.
Technique 01
The Gap Method
For "no two of a certain type are together" problems: arrange the unrestricted items first, then place the restricted items into the gaps created between them (including the two ends). This sidesteps the messy casework that a direct approach usually creates.
Technique 02
Complementary Counting
Instead of directly counting every case that satisfies a condition, count everything and subtract the cases where the condition completely fails. This is almost always the cleanest route through "at least one" problems.
Technique 03
Casework
When a problem naturally splits into distinct, non-overlapping scenarios, count each scenario separately and add the results — this is the Addition Principle applied deliberately. The skill is recognising clean, mutually exclusive cases rather than messy overlapping ones.
Technique 04
Pattern Mapping
Many JEE problems are a familiar structure — distributing distinct objects into distinct groups, for instance — wearing an unfamiliar costume. Learning to strip the costume off and recognise the underlying pattern is what separates fast solvers from slow ones.
High-Frequency Problem Types in JEE & Boards
A small set of problem structures reappears constantly across JEE Main, JEE Advanced, and Board papers. Recognising the structure quickly is worth more than any single formula.
- People sitting in a row or circle with conditionsOften solved with the Gap Method or by treating a "must sit together" group as a single block.
- Forming numbers or words, with or without repetitionWatch carefully for whether repetition of digits or letters is allowed — this single detail changes every step of the solution.
- Selecting teams or committees with restrictions"At least one specific person must be included," or "two specific people cannot be together" — both are variations on complementary counting or casework.
- Distributing distinct objects into distinct groupsA different structure from simple arrangement — build it from the Multiplication Principle, one object's destination at a time.
- "At least one" or "none" problemsComplementary counting is almost always the fastest route here.
- Mixed problems combining permutation and combinationSelect a group first (combination), then arrange it (permutation) — a very common two-step JEE structure. Identify the two steps separately before combining them.
These problem types build directly on the algebraic reasoning developed in earlier chapters. If your foundation in structured problem translation feels shaky, our article on building the right intuition for Limits and Derivatives covers a similar philosophy — concept before formula — applied to Calculus.
Common Mistakes That Cost Marks
The recurring pattern behind lost marks in P&C
- Treating identical objects as distinct, or distinct objects as identical
- Forgetting to divide by n in circular arrangement problems
- Double-counting or under-counting overlapping cases in casework
- Reaching for nCr when the problem is secretly about arrangement, or the reverse
- Never checking, at the end, whether the final answer actually needed order to be considered
"Almost every P&C mistake traces back to skipping the order question — not to a wrong formula."
The fix for all five is the same discipline: before writing any formula, state in one sentence what is being counted and whether order matters. If you can't state it cleanly, you're not ready to pick a formula yet.
How to Practise P&C Effectively
Quality Over Quantity
Solving fifty near-identical seating arrangement problems builds far less intuition than solving ten genuinely different problem structures. Prioritise variety over repetition once the basics are automatic.
The "Explain in One Sentence" Test
Before solving any P&C problem, try to state — out loud or in writing — exactly what is being counted and whether order matters, in a single sentence. If you cannot do this cleanly, you do not yet understand the problem well enough to solve it correctly, no matter how confidently you start writing formulas.
Recommended Practice Sequence
Start with NCERT — every example and exercise, solved without skipping steps. Move to previous years' JEE questions organised by the problem types above, not chosen at random. Only after both of these feel comfortable should you move to advanced, multi-concept problems that mix permutation and combination in a single question.
An Error Log Built for P&C
Keep a log specifically for this chapter, and for each mistake record: what you were asked to count, whether you got the order question wrong, and which technique (if any) you missed. Patterns emerge quickly — most students find that 2 or 3 specific error types, like consistently forgetting circular division or misjudging "at least" problems, account for most of their losses. For the full method, see our guide on how to analyse your JEE mistakes.
A Quick Decision Framework
Step 1
What am I counting?
Objects, positions, a selected group, or a formed sequence — name it precisely before doing anything else.
Step 2
Does order matter?
Swap two chosen items in your head. Different outcome → permutation. Same outcome → combination.
Step 3
AND or OR?
Sequential, independent choices → multiply. Mutually exclusive alternative routes → add.
Step 4
Any special structure?
Repetition, circularity, restrictions, or "at least" language — each points to a specific technique from the mental models above.
Try These
Work through these before checking the answers. Each maps to a technique covered above.
- In how many ways can 5 boys and 3 girls be seated in a row so that no two girls sit together?Hint: Gap Method.
- How many 4-digit numbers greater than 5000 can be formed using the digits 2, 3, 5, 7, 9 without repetition?Hint: fix the first digit's constraint before applying the Multiplication Principle.
- From a group of 7 men and 5 women, in how many ways can a committee of 5 be formed with at least 2 women?Hint: casework across valid combinations of men and women, or complementary counting for the reverse condition.
- In how many distinct ways can the letters of the word "STATISTICS" be arranged?Hint: identical-object division — count each repeated letter carefully.
Closing Thought
Permutations and Combinations rewards a very specific kind of preparation: not memorising more formulas, but repeatedly asking the same two questions — what am I counting, and does order matter — until the asking becomes automatic. Once that habit is in place, the formulas stop being things you recall under pressure and become tools you reach for because you already know exactly what you need.
Build Real Maths Intuition with Exium Classes
Concept-first teaching that traces every formula to its root. On-campus in Bokaro or live online — your choice.
Reserve Your Seat →