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

What is a Permutation?

Define permutations as arrangements where order matters and explore simple examples with distinct objects.

What is a Permutation?

You'll learn: How permutations count the number of ways to arrange objects when order matters.

The Core Idea

A permutation is an arrangement of objects in a specific order. The key phrase is order matters—changing the order produces a different permutation. If you have a set of distinct objects, a permutation tells you one particular way to line them up or sequence them.

Think of it like arranging books on a shelf. If you have three books—A, B, and C—the arrangement ABC is different from BAC, even though both contain the same books. Each distinct ordering is a separate permutation.

Simple Examples with Distinct Objects

Example 1: How many ways can you arrange 2 distinct letters, X and Y?

  • XY
  • YX

That's 2 permutations.

Example 2: How many ways can you arrange 3 distinct letters, A, B, and C?

  • ABC, ACB, BAC, BCA, CAB, CBA

That's 6 permutations.

Notice the pattern: for the first position you have 3 choices, then 2 choices remain for the second position, and finally 1 choice for the last position. Multiply: 3 × 2 × 1 = 6.

Why "Order Matters" is Crucial

Permutations are fundamentally different from situations where order doesn't matter (like choosing team members). In permutations, switching positions creates a new outcome. Finishing 1st, 2nd, 3rd in a race is different from finishing 3rd, 2nd, 1st—even though the same three people are involved.

This connection to ordered outcomes makes permutations essential for counting sequences, rankings, passwords, and any scenario where position or sequence is meaningful.

Key Takeaway: A permutation is an ordered arrangement of distinct objects where changing the order creates a different permutation; the number of permutations grows multiplicatively with the number of objects.