MAT /Quantitative Ability

Permutation & combination

Modern Maths · free study notes · Updated

📚 Permutations & Combinations

Quantitative Ability – MAT


1. Simple Explanation

Concept What it means When to use it
Permutation Arrangement of r objects chosen from n distinct objects where order matters. Counting ways to line up people, assign seats, or pick a password.
Combination Selection of r objects chosen from n distinct objects where order does not matter. Choosing a committee, picking lottery numbers, or selecting cards from a deck.

Key Formulae

Formula Variables Explanation
Permutation ( P(n,r) = \dfrac{n!}{(n-r)!} ) All n objects, pick r, order matters.
Combination ( C(n,r) = \dfrac{n!}{r!(n-r)!} ) All n objects, pick r, order irrelevant.
Factorial ( n! = n \times (n-1) \times \dots \times 1 ) Product of all positive integers up to n.

2. Key Points

# Point Why it matters
1 Order matters → Permutation Example: 3 people in 2 seats → 3P2 = 6 ways.
2 Order doesn't matter → Combination Example: 3 people choose 2 for a committee → 3C2 = 3 ways.
3 Use factorial shortcuts 5! = 120, 4! = 24 → 5P3 = 120/2 = 60.
4 Avoid double‑counting In combinations, swapping items doesn’t create a new selection.
5 Complementary counting Sometimes it’s easier to count the opposite (e.g., “not all distinct”) and subtract from total.
6 Special cases - If ( r=n ): ( P(n,n)=n! ) and ( C(n,n)=1 ).
- If ( r=0 ): ( P(n,0)=1 ) and ( C(n,0)=1 ).
7 Restrictions Use the multinomial or stars‑and‑bars methods for objects that are not all distinct.

3. Worked Example

Problem
A committee of 4 people is to be selected from 10 candidates.
Then, from this committee, a chairperson and a secretary are to be appointed.
How many different ways can this be done?

Solution

  1. Select the committee (combination)
    [ C(10,4) = \frac{10!}{4!,6!}=210 ]

  2. Appoint chairperson and secretary (permutation of 2 chosen from 4)
    [ P(4,2) = \frac{4!}{(4-2)!} = \frac{4!}{2!}=12 ]

  3. Total arrangements
    [ 210 \times 12 = 2520 ]

Answer: 2520 different ways.


4. Quick Revision Summary

Concept Formula Example
Permutation (P(n,r)=\frac{n!}{(n-r)!}) 5 people in 3 seats → (P(5,3)=60)
Combination (C(n,r)=\frac{n!}{r!(n-r)!}) 5 people choose 3 → (C(5,3)=10)
Factorial (n!=n(n-1)(n-2)\dots1) (4!=24)
Key rule Order matters → permutation; order doesn't → combination 3! = 6 orderings of 3 distinct items
Check Ensure no double‑counting; use complement if easier Counting “at least one pair identical” via total – distinct

Happy studying! Remember:
Permutation = “arrange”
Combination = “choose”


Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.