Permutation: Definition, Formula, and Examples

A permutation is a mathematical calculation that determines the total number of unique ways a specific set of objects can be arranged, where the order of arrangement matters.

1. Definition of Permutation

A permutation is an ordered arrangement of all or part of a set of items. Unlike combinations, changing the sequence of the items creates a completely new permutation. For example, the arrangement is counted as a distinct permutation from .

2. The Formula

When choosing and arranging unique items from a total pool of items, the formula is:

Where:

  • is the total number of items in the set.
  • is the number of items chosen for the arrangement.
  • denotes a factorial (e.g., ).

3. Step-by-Step Examples

Example 1: Arranging a Full Set ()

Suppose you want to arrange 3 books (A, B, and C) on a shelf.

  • Formula application: Because you are arranging all 3 items, and . This simplifies to or .
  • Calculation:
  • The 6 possible permutations: ABC, ACB, BAC, BCA, CAB, CBA.

Example 2: Arranging a Subset ()

Suppose a race has 5 runners, and you want to find out how many different ways the Gold, Silver, and Bronze medals (top 3 spots) can be awarded.

  • Identify values: Total runners . Medaled positions .
  • Apply formula:
  • Calculation:
  • Result: There are 60 different ways to award the podium medals.

4. Comparison Summary

ConceptOrder Matters?Example
PermutationYesCreating a lock passcode ( is different from )
CombinationNoSelecting a team of 3 people (Alice and Bob is the same team)

5. Core Concept Summary

A permutation calculates the number of ways to arrange items where order is crucial. If you change the sequence, you create a brand new outcome.