Course contentsShow
← Mathematics
Lesson 2579 of 3,12152. CombinatoricsFree lesson

Counting Permutations of n Distinct Objects

Derive the formula n! for arranging n distinct objects and understand factorial notation.

Counting Permutations of n Distinct Objects

What you'll learn: You'll discover why there are exactly n! ways to arrange n distinct objects and master factorial notation.

The Core Idea

Imagine you have n distinct objects—say, 5 different books—and you want to arrange them in a row on a shelf. How many different orderings are possible?

Let's think step-by-step:

  • For the first position, you have n choices (any of the n books)
  • For the second position, you have (n-1) choices (any remaining book)
  • For the third position, you have (n-1) choices (any remaining book)
  • This continues until the last position has just 1 choice left

By the multiplication principle, the total number of arrangements is:

n × (n-1) × (n-2) × ... × 2 × 1

Factorial Notation

This product appears so frequently in counting that mathematicians gave it a special name and symbol: n! (read "n factorial")

Definition

  • n! = n × (n-1) × (n-2) × ... × 2 × 1
  • By convention: 0! = 1 (useful for formulas)

Examples

  • 3! = 3 × 2 × 1 = 6
  • 4! = 4 × 3 × 2 × 1 = 24
  • 5! = 5 × 4 × 3 × 2 × 1 = 120

Notice how quickly factorials grow! With just 5 books, you have 120 different arrangements.

Why This Formula Works

Each permutation is a bijection from positions to objects. At each step, you're making a choice without replacement. The choices multiply because they're independent decisions made sequentially—and that's exactly what factorial notation captures.

Key Takeaway: The number of ways to arrange n distinct objects in order is n! (n factorial), computed as the product of all positive integers from 1 to n.