Permutation & Combination

The whole topic comes down to one question: does the order of arrangement matter? Get that right and the correct formula follows automatically. This page covers that core distinction, repeated-letter arrangements, the "at least" and "always together" variants exams favour, and several fully worked examples.

Written by Mahesh Srivastava, Founder of Pariksha Saathi. Published: 2026-10-03. Editorial standards & corrections

Jump to practice questions ↓

The concept, quickly

  • Permutation counts ARRANGEMENTS, where order matters (ABC is different from BCA). Combination counts SELECTIONS, where order doesn’t matter (choosing the group {A, B, C} is the same regardless of order).
  • Factorial is the building block for both: n! = n × (n−1) × (n−2) × … × 1, and by convention 0! = 1.
  • Permutation of n items taken r at a time: ⁿPᵣ = n! / (n−r)!. Combination of n items taken r at a time: ⁿCᵣ = n! / (r! × (n−r)!) — a combination is a permutation divided by the r! ways to arrange the chosen r items, since order no longer matters.
  • Watch the wording: "arrange", "order", "ranks", "different ways to stand in a line" signal permutation. "Choose", "select", "form a committee" (where only the group matters, not who does what within it) signal combination.
  • If a word has repeated letters, arranging all of them is NOT simply n! — divide by the factorial of each letter’s repeat count: arrangements = n! / (p! × q! × …), where p, q, … are how many times each distinct letter repeats.
  • Fundamental counting principle: for a task done in several independent steps, each with its own number of choices, multiply the choices together. This is what lets you build up passwords, codes or registration numbers digit by digit, not just count subsets.
  • "At least" conditions (e.g. "a committee with at least 2 women") are usually solved by splitting into cases and adding (exactly 2, exactly 3, …), or by subtracting the complement (total ways minus the ways with fewer than the minimum) — whichever needs fewer cases.
  • "Two particular people/items must always be together" in a row: glue them into a single block, arrange the reduced set of units, then multiply by the number of ways to arrange the people WITHIN that block (2! if it’s a pair).

Worked examples

1. In how many ways can the letters of the word "MANGO" be arranged?

Solution

  1. MANGO has 5 distinct letters, and arranging them is a permutation of all 5.
  2. Number of arrangements = 5! = 5 × 4 × 3 × 2 × 1 = 120.

Answer: 120

2. In how many ways can 3 books be selected from a shelf of 8 different books?

Solution

  1. Selecting books (the group chosen, not an order among them) is a combination.
  2. ⁸C₃ = 8! / (3! × 5!) = (8 × 7 × 6) / (3 × 2 × 1) = 336 / 6 = 56.

Answer: 56

3. In how many ways can a President and a Secretary be chosen from a group of 6 people, assuming one person can’t hold both positions?

Solution

  1. The two roles are distinct (President ≠ Secretary), so who gets which role matters — this is a permutation.
  2. ⁶P₂ = 6! / 4! = 6 × 5 = 30.

Answer: 30

4. A committee of 3 people is to be formed from 5 men and 4 women, with exactly 2 men and 1 woman. In how many ways can this be done?

Solution

  1. Choosing 2 men from 5: ⁵C₂ = 10. Choosing 1 woman from 4: ⁴C₁ = 4.
  2. These two choices are independent, so multiply them: 10 × 4 = 40.

Answer: 40

5. In how many ways can the letters of the word "BANANA" be arranged?

Solution

  1. BANANA has 6 letters in total: B occurs once, A occurs 3 times, N occurs 2 times.
  2. Arrangements = 6! / (3! × 2!) = 720 / (6 × 2) = 720 / 12
  3. = 60

Answer: 60

6. A password consists of 2 letters (A–Z) followed by 3 digits (0–9), with repetition allowed in both parts. How many different passwords are possible?

Solution

  1. This is the fundamental counting principle applied step by step, not a selection of a subset.
  2. Letters: 26 choices for each of 2 positions = 26² = 676. Digits: 10 choices for each of 3 positions = 10³ = 1,000.
  3. Total passwords = 676 × 1,000 = 6,76,000.

Answer: 6,76,000

7. A committee of 4 is to be formed from 6 men and 4 women, with at least 2 women. In how many ways can this be done?

Solution

  1. Split into cases by the exact number of women: 2, 3, or 4.
  2. Exactly 2 women, 2 men: ⁴C₂ × ⁶C₂ = 6 × 15 = 90.
  3. Exactly 3 women, 1 man: ⁴C₃ × ⁶C₁ = 4 × 6 = 24.
  4. Exactly 4 women, 0 men: ⁴C₄ × ⁶C₀ = 1 × 1 = 1.
  5. Total = 90 + 24 + 1 = 115.

Answer: 115

8. In how many ways can 5 people be seated in a row such that 2 particular people always sit together?

Solution

  1. Glue the 2 particular people into one block. This leaves 4 units to arrange: the block plus the other 3 people.
  2. These 4 units can be arranged in 4! = 24 ways.
  3. Within the block, the 2 people can switch places in 2! = 2 ways.
  4. Total = 24 × 2 = 48.

Answer: 48

Try these yourself

Decide permutation or combination first, then check against the answer.

1. In how many ways can the letters of the word "CHAIR" be arranged?

Answer: 120. All 5 letters distinct: 5!.

2. In how many ways can 4 students be selected from a class of 10 for a quiz team?

Answer: 210. ¹⁰C₄.

3. In how many ways can a committee of 2 men and 2 women be formed from 6 men and 5 women?

Answer: 150. ⁶C₂ × ⁵C₂ = 15 × 10.

4. In how many ways can the letters of the word "LEVEL" be arranged?

Answer: 30. L and E each repeat twice: 5!/(2!×2!) = 120/4.

5. A code consists of 3 digits (0–9), with repetition allowed. How many different codes are possible?

Answer: 1,000. 10³, by the fundamental counting principle.

6. A committee of 3 is to be formed from 5 men and 3 women, with at least 1 woman. Find the number of ways.

Answer: 46. Total ⁸C₃ = 56; all-men (no woman) = ⁵C₃ = 10; 56 − 10.

7. In how many ways can 4 people be seated in a row such that 2 particular people always sit together?

Answer: 12. Glue the pair into 1 block (3 units total): 3! × 2! = 6 × 2.

All 38 practice questions on Permutation and Combination, with answers →

Where this comes up

Permutation and Combination is the counting method that Probability questions build on. If the quantitative or numerical aptitude syllabus of your exam lists permutation and combination, this lesson covers it; check your exam’s official notification to confirm.

Keep practising

Solve the questions above before opening the answers. Explain each step in your own words, then revisit any mistakes.

Start this topic’s quiz →

Explore the lesson library