NMAT /Quantitative Ability

Permutation & combination

Modern Maths · free study notes · Updated

Permutations & Combinations

NMAT – Quantitative Ability
(Study Notes – Markdown)


1. Simple Explanation

  • Permutation: Arrangement of objects where order matters.
  • Combination: Selection of objects where order does not matter.

In NMAT, you’ll often have to decide whether the problem is asking for permutations or combinations and then choose the appropriate formula.


2. Key Points

Concept Formula Parameters Notes
Permutation of n distinct objects (P(n) = n!) (n) Count all possible ordered arrangements.
Permutation of n objects taken r at a time (P(n,r) = \dfrac{n!}{(n-r)!}) (n) total, (r) chosen Order matters.
Combination of n objects taken r at a time (C(n,r) = {n \choose r} = \dfrac{n!}{r!(n-r)!}) (n) total, (r) chosen Order doesn’t matter.
Permutation with repetition (n^r) (n) types, (r) positions Each position can repeat.
Combination with repetition (Stars & Bars) ({n+r-1 \choose r}) (n) types, (r) chosen Equivalent to distributing (r) identical items into (n) bins.
Inclusion–Exclusion (\displaystyle \sum (-1)^k {m \choose k} (n-k)!) For “not allowed” cases Use when counting arrangements that avoid certain positions.
Multinomial Coefficient (\displaystyle \frac{n!}{n_1!n_2!\dots n_k!}) (n) items partitioned into (k) groups Generalization of combinations.

Tips for NMAT

  • Read the question carefully: Words like arrange, order, sequence → permutation. Words like choose, select, pick → combination.
  • Check for repetition: “Repetition allowed” → use (n^r) or stars & bars.
  • Look for constraints: “No two identical items adjacent” → use inclusion–exclusion or other special counting methods.

3. Worked Example

Problem (NMAT style)
In how many ways can 5 different books be arranged on a shelf if the book “Mathematics” must be at one end of the shelf?

Step‑by‑step solution

  1. Identify the type of problem

    • Arrangement → Permutation.
  2. Fix the constraint

    • “Mathematics” must be at one end → it can be placed at the left or right end.
    • Two choices for the end position.
  3. Arrange the remaining books

    • 4 remaining books can be arranged in any order.
    • Number of arrangements = (4! = 24).
  4. Combine choices
    [ \text{Total ways} = 2 \times 4! = 2 \times 24 = 48. ]

Answer: 48 ways.


4. Quick Revision Summary

Topic Key Formula When to Use
Permutation of all objects (n!) Order matters, all objects used.
Permutation of r objects (\dfrac{n!}{(n-r)!}) Order matters, choose r.
Combination of r objects ({n \choose r}) Order doesn’t matter, choose r.
Repetition allowed (permutation) (n^r) Each position can repeat.
Repetition allowed (combination) ({n+r-1 \choose r}) Stars & Bars.
Constraints (e.g., “no two A’s together”) Inclusion–Exclusion Exclude forbidden arrangements.

Practice Strategy

  1. Label the problem (perm/comb).
  2. Count total arrangements.
  3. Apply constraints (fix positions, use inclusion–exclusion).
  4. Simplify using factorials or combinatorial identities.

Final Thought

Master the distinction between “order matters” and “order doesn’t matter.” Once you can spot that, the rest is just plugging numbers into the right formula and simplifying. Happy studying!

Your note

Page 1

Doubt hai is topic me?

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