Counting Methods
View .md

Permutations

A permutation is an ordered arrangement of objects. Order matters!

All n Objects

The number of ways to arrange nn distinct objects:

P(n)=n!=n×(n−1)×⋯×2×1P(n) = n! = n \times (n-1) \times \cdots \times 2 \times 1

Example: Arranging 3 books on a shelf: 3!=63! = 6 ways.

k Objects from n

Choosing kk objects from nn and arranging them in order:

P(n,k)=n!(n−k)!P(n, k) = \frac{n!}{(n-k)!}

Example: Selecting president, VP, secretary from 10 people:

P(10,3)=10!7!=10×9×8=720P(10, 3) = \frac{10!}{7!} = 10 \times 9 \times 8 = 720

Why Division?

We divide by (n−k)!(n-k)! because we’re only arranging kk objects, not all nn.

Think of it as:

  • Choose position 1: nn choices
  • Choose position 2: n−1n-1 choices
  • Choose position k: n−k+1n-k+1 choices
  • Total: n×(n−1)×⋯×(n−k+1)=n!(n−k)!n \times (n-1) \times \cdots \times (n-k+1) = \frac{n!}{(n-k)!}

Example: Race Rankings

In a race with 8 runners, how many ways can gold, silver, bronze be awarded?

P(8,3)=8!5!=8×7×6=336P(8, 3) = \frac{8!}{5!} = 8 \times 7 \times 6 = 336