What is a Permutation?
A Permutation is an arrangement of objects where the order matters. If changing the order of items creates a different outcome, the problem is a permutation.
Line Seating Mental Model
Imagine 3 students (Alice, Bob, Charlie) standing in a line. The possible arrangements are:
Total 6 different arrangements because positions have changed ($3! = 3 \times 2 \times 1 = 6$).
Permutations appear regularly in CAT, NMAT, SNAP, and MBA CET. They are essential for solving password formation, rank assignments, scheduling, line & circular seating arrangements, and form the foundation for Probability.
Connected Modern Math Modules:
Number of ways to arrange all $n$ distinct objects in a line.
Product of first $n$ positive integers. Note: $0! = 1$.
Arranging $n$ objects around a round table (fixing 1 reference position).
Arranging Books on a Shelf
Q: How many different ways can 4 different books be arranged on a shelf?
Step 1: Identify $n$ (total books) and $r$ (books to arrange). Here $n = 4$ and all 4 are arranged.
Step 2: Use the all-object permutation formula: $\text{Ways} = n! = 4!$.
Step 3: Calculate $4! = 4 \times 3 \times 2 \times 1 = \mathbf{24 \text{ ways}}$.
Letter Arrangements
Q: How many 3-letter words (with or without meaning) can be formed from the letters A, B, C, D, and E without repetition?
Step 1: Total letters available $n = 5$, positions to fill $r = 3$.
Step 2: Apply $^nP_r = ^5P_3 = \frac{5!}{(5 - 3)!} = \frac{5!}{2!}$.
Step 3: Simplify: $\frac{120}{2} = \mathbf{60 \text{ arrangements}}$.
Restricted Seating (String / Tie Method)
Q: 7 students are to stand in a line. 2 particular students must always stand together. How many arrangements are possible?
Step 1 (Tie Method): Treat the 2 students who must stand together as 1 single block.
Step 2: Total items to arrange = 5 individual students + 1 block = 6 items.
Step 3: Arrange the 6 items in a line: $6! = 720$.
Step 4: The 2 students inside the block can swap positions among themselves in $2! = 2$ ways.
Step 5: Total arrangements = $6! \times 2! = 720 \times 2 = \mathbf{1440 \text{ ways}}$.
❌ Trap 1: Wrong Technique
Using Permutations when Order doesn't matter
Always ask: Does changing the order create a new outcome? If NO, use Combinations ($^nC_r$), not Permutations.
❌ Trap 2: Repetition Confusion
Forgetting Repetition Rules
With repetition allowed, $r$ positions from $n$ choices is $n^r$. Without repetition, use $^nP_r$. Always read the question carefully!
❌ Trap 3: Confusing $n!$ with $^nP_r$
Using $n!$ when $r < n$
Use $n!$ only when arranging ALL available objects. If picking 3 out of 5 objects, use $^5P_3 = \frac{5!}{2!} = 60$, not $5! = 120$.
⚡ The Golden Decision Rule
If the task involves ordering, seating, ranking, or line formation, immediately use Permutations.
⚡ Memorize Key Factorials
Memorizing factorials up to $8!$ saves up to 30 seconds per question in speed exams like MBA CET & NMAT.
Question 1 (Basic):
How many 2-letter arrangements can be formed from the letters A, B, C, and D without repetition?
Solution: Here $n = 4$ letters and $r = 2$ positions.
$\text{Ways} = ^4P_2 = \frac{4!}{(4 - 2)!} = \frac{24}{2} = \mathbf{12 \text{ arrangements}}$.
Question 2 (Moderate):
How many 4-digit numbers can be formed using the digits 1, 2, 3, 4, 5, and 6 without repetition?
Solution: Here $n = 6$ digits available, $r = 4$ positions to fill.
$\text{Ways} = ^6P_4 = \frac{6!}{(6 - 4)!} = \frac{720}{2} = \mathbf{360 \text{ numbers}}$.
Q: What is the difference between a Permutation and a Combination?
In a Permutation, order matters (e.g. ABC and BAC are distinct arrangements). In a Combination, order does not matter (e.g. selecting a 3-person team).
Q: Why is 0! equal to 1?
0! = 1 is defined by mathematical convention so that factorial identities and formulas such as $^nP_r = \frac{n!}{(n-r)!}$ remain consistent when $r = n$.
Q: When should I use n! instead of nPr?
Use $n!$ when arranging every single available object in a set ($r = n$). Use $^nP_r$ when selecting and arranging only a subset of $r$ objects from $n$ available objects.