All lessons

Module 63: Permutations and combinations · Lesson 63.2 · about 26 min

Permutations and combinations: question types and traps

Every way entrance exams test counting: arrangements with restrictions, together and apart, identical objects, forming numbers, rank of a word, circular arrangements, selections, geometry, divisors, distributions, stars and bars, derangements and inclusion-exclusion, each with its method and its trap.

Key points, meanings and formulas on one page: choose "Save as PDF" in the print box.

Maths · Class 11 · about 26 minutes. Read Permutations and combinations first. Here are the question types, worked examples and practice.

Most counting mistakes are one of two kinds: counting the same thing twice (forgetting to divide), or splitting into cases that overlap or leave a gap. Before you multiply, ask what one finished arrangement looks like and whether your method makes each one exactly once.

The question types

1. Plain arrangements and selections. Decide if order matters. Trap: using nPr for a team or nCr for a ranked list.
2. Restrictions. Fill restricted places first. Together: block. Apart: gaps. Trap: forgetting to arrange the objects inside the block.
3. Identical objects and words. n!/(p! q! …). Trap: in "vowels together" words, the vowels may repeat too, so divide inside the block as well.
4. Forming numbers. First digit not 0; divisibility rules. Trap: one case for numbers ending in 0 and another for the rest, because 0 cannot lead.
5. Rank of a word. Count arrangements starting with each smaller letter, then add 1. Trap: with repeated letters, divide each count by the factorials of the letters still left.
6. Circles and necklaces. (n − 1)!; half for necklaces. Trap: seats that are numbered make it a row, not a circle.
7. Selections with conditions. At least, at most, a particular person in or out. Trap: "choose one woman first, then the rest freely" counts some committees twice.
8. Geometry and divisors. Lines, triangles, diagonals, rectangles; (a + 1)(b + 1)…. Trap: collinear points give one line, not C(k, 2), and no triangles.
9. Distributions. Identical into different boxes: stars and bars. Different into unnamed equal groups: divide by k!. Trap: mixing up identical and different objects.
10. Derangements and inclusion-exclusion. Dₙ; "exactly k right" = C(n, k)Dₙ₋ₖ. Trap: stopping the alternating sum early.

Worked examples

Example 1 (level 3, the overcount trap). A committee of 3 from 4 men and 3 women must have at least one woman. Wrong method: choose a woman (3 ways), then any 2 of the other 6 (15 ways): 45. Right method: all committees minus all-men: C(7, 3) − C(4, 3) = 35 − 4 = 31. The wrong method counts a committee with two women twice, once for each woman picked “first”.

Example 2 (level 4, rank). Find the rank of SCHOOL among its arrangements in dictionary order. Solution. Letters C, H, L, O, O, S. Words starting with C: 5!/2! = 60; with H: 60; with L: 60; with O: 5! = 120. That is 300 words before any word starting with S. After S, the next letters C and H are already the smallest available, so nothing comes before them. After SCH the letters L, O, O are left and the next letter is O: the words starting SCHL come first, and there is 2!/2! = 1 of them. After SCHO the letters L, O are left: SCHOLO comes before SCHOOL, 1 more. Rank = 300 + 1 + 1 + 1 = 303.

Example 3 (level 4, distribution). In how many ways can 6 different books be split into 3 piles of 2 each? Solution. C(6, 2) × C(4, 2) × C(2, 2) = 90 orders the piles; the piles have no names, so divide by 3!: 15. If the piles go to 3 named students, it is 90.

Example 4 (level 5, inclusion-exclusion). How many onto functions are there from a set of 5 elements to a set of 3? Solution. All functions 3⁵ = 243. Subtract those missing at least one element of the codomain: 3 × 2⁵ − 3 × 1⁵ = 96 − 3 = 93. Onto = 243 − 93 = 150.

“Identical or different does not change much.” It changes everything. 5 identical balls into 3 boxes: C(7, 2) = 21 ways. 5 different balls into 3 boxes: 3⁵ = 243 ways. Read the question for the word “identical” or “alike” before you start.

Gaps
k objects in a row leave k + 1 gaps, ends included
Dₙ
derangements: arrangements with nothing in its own place
Physical meaning
Each formula is a way of making every arrangement exactly once. When a method makes some twice, divide or subtract; when it misses some, add a case.

Practise

  • “At least one” is easiest as total minus none.
  • Together: block and arrange inside; apart: gaps method.
  • Rank of a word: count words starting with each smaller letter, divide by repeat factorials, add 1.
  • Unnamed equal groups: divide by k!; named groups: do not.
  • Onto functions from n to 3: 3ⁿ − 3·2ⁿ + 3.
  • Dₙ: 0, 1, 2, 9, 44, 265 for n = 1 to 6.

Check yourself

1How many 3-digit numbers with all digits different can be formed from 0, 1, 2, 3, 4?
2In how many ways can 4 letters be put in their 4 addressed envelopes so that no letter is in the right one?
3The number of divisors of 360 is:

Sources

  • JEE Main and JEE Advanced 2026 syllabi: Permutations and combinations; question patterns studied from published papers (no questions copied)

Your ticks stay in this browser. Save them as a file on the course home.

Updated 2026-11-22. Syllabus and exam patterns follow the official notices checked on 2026-11-22; they can change every year, so check the official exam website. All questions are original fibub work, not copied from past papers or books. Nothing you do here is sent anywhere.