Permutations and Combinations

Permutation and Combination deal with counting arrangements and selections of objects.

  • Permutation = Arrangement
    → Order matters. (e.g., seating people, forming numbers, rankings)

  • Combination = Selection
    → Order does not matter. (e.g., selecting a team, choosing questions)

Example:
From A, B, C:

  • Permutations of 2 letters: AB, BA, AC, CA, BC, CB → 6 ways
  • Combinations of 2 letters: AB, AC, BC → 3 ways

2. Key Formulas & Shortcuts

Let nn = total number of items, rr = number to arrange or choose.

A. Factorial Notation

n!=n×(n1)×(n2)××1n! = n \times (n-1) \times (n-2) \times \ldots \times 1

By definition: 0!=10! = 1


B. Permutations

1. Number of permutations of rr out of nn:

nPr=n!(nr)!^nP_r = \frac{n!}{(n - r)!}

2. All permutations of nn distinct items:

nPn=n!^nP_n = n!

3. Permutations with repetition:

If an object is repeated:

Total permutations=n!p1!p2!pk!\text{Total permutations} = \frac{n!}{p_1! \cdot p_2! \cdot \ldots \cdot p_k!}

where p1,p2,...,pkp_1, p_2, ..., p_k are counts of identical items.


C. Combinations

1. Number of combinations of rr out of nn:

nCr=n!r!(nr)!^nC_r = \frac{n!}{r!(n - r)!}

2. Basic identities:

  • nCr=nCnr^nC_r = ^nC_{n-r}
  • nC0=nCn=1^nC_0 = ^nC_n = 1

D. Circular Permutations

  • nn objects in a circle (no reference point):
(n1)!(n - 1)!
  • If clockwise and anticlockwise arrangements are considered same:
(n1)!2\frac{(n - 1)!}{2}

E. Permutations with Restrictions

  • If certain items must always be together:
    Treat them as one unit, then multiply by arrangements within the unit.

  • If certain items must never be together:
    Total permutations – permutations with those items together.


3. Conceptual Tips & Common Mistakes

  • Permutation ≠ Combination → Watch for “arrangement” (order matters) vs “selection” (order doesn’t).
  • Don’t forget to divide by factorials for repeated items.
  • For “at least”/“at most” type questions, use summation over valid ranges.
  • Use cases when restrictions are present.
  • For circular arrangements, fix one item to break rotational symmetry.
  • Understand when to use repetition allowed (e.g., forming passwords with repeated digits).

4. Visual Explanation

Permutation vs Combination

ContextExampleType
Forming passwordsABC ≠ CABPermutation
Selecting playersAB = BACombination
Seating in rowA, B, C → 6 waysPermutation
Forming committees{A, B, C} → 1 wayCombination

Circular Permutation

For 4 people A, B, C, D seated around a circular table:

Total ways = (41)!=6(4-1)! = 6
(ABC, ACB, BAC, BCA, CAB, CBA)


5. Solved Examples

Example 1: Basic Permutation

Q: In how many ways can 3 people be seated in 5 chairs?

A:

5P3=5!(53)!=1202=60^5P_3 = \frac{5!}{(5 - 3)!} = \frac{120}{2} = 60

Example 2: Basic Combination

Q: From 8 players, in how many ways can you select 3 for a team?

A:

8C3=8!3!5!=56^8C_3 = \frac{8!}{3!5!} = 56

Example 3: Permutation with Repetition

Q: How many 3-digit numbers can be formed using digits 1, 2, 3, 4 if repetition is allowed?

A:
Each place has 4 choices:

4×4×4=644 \times 4 \times 4 = 64

Example 4: Permutation with Identical Items

Q: How many ways can you arrange the word “BALLOON”?

Letters: B, A, L, L, O, O, N → 7 letters
Repetition: L(2), O(2)

7!2!2!=50404=1260\frac{7!}{2! \cdot 2!} = \frac{5040}{4} = 1260

Example 5: Circular Permutation

Q: In how many ways can 6 people sit around a circular table?

A:

(61)!=5!=120(6 - 1)! = 5! = 120

Example 6: Restriction – Always Together

Q: How many ways can A and B be always together in a row of 5 people?

A:

  • Treat A+B as 1 block → now 4 people
  • Ways to arrange blocks = 4!4!
  • Ways to arrange A and B in the block = 2!2!
4!×2!=24×2=48\Rightarrow 4! \times 2! = 24 \times 2 = 48

Example 7: Restriction – Never Together

Q: How many ways can A and B never be together in a row of 5?

A:

  • Total arrangements = 5!=1205! = 120
  • A and B together = 4!×2!=484! \times 2! = 48
Not together=12048=72\Rightarrow \text{Not together} = 120 - 48 = 72