Introduction to Permutations

Learn how to count arrangements where order matters using permutations.

Advanced25 minLesson

Definition

A permutation is an arrangement of objects where order matters.
The number of ways to arrange distinct objects in a row is:
This is called n factorial.
When selecting and arranging objects from objects:
Key insight: In permutations, ABC is different from BAC because the order is different.

Try it now

What is (3 factorial)?

Worked Examples

In how many ways can 4 students (Anna, Ben, Carla, David) line up for a photo?

1

Identify what we're counting

We need to arrange all 4 students in a line where position mattersThis is a permutation of 4 objects

2

Count choices for each position

1st position: 4 choices\\2nd position: 3 remaining\\3rd position: 2 remaining\\4th position: 1 remaining

3

Calculate using factorial

4

Interpret the result

There are 24 different ways to arrange 4 students24 arrangements

Common Mistakes

Confusing permutations and combinations

Why it's wrong: Permutations count arrangements where ORDER MATTERS. Combinations count selections where order doesn't matter.

Correct: Ask yourself: "Does rearranging change the outcome?" If selecting a committee (no positions), order doesn't matter = combination. If electing officers, order matters = permutation.

Using the wrong formula direction: instead of

Why it's wrong: The larger factorial goes on top because we start with more choices.

Correct: — remember: is always larger, so it goes in the numerator.

Forgetting that

Why it's wrong: When arranging all n objects, we use

Correct: By definition, . This makes the formula work when .

Interactive Sandbox

Expression Calculator

Try these:

History

No calculations yet

Practice Problems

18 problems
Problem 1 of 18
Easy

What is (3 factorial)?

Why It Matters

Permutations help us count arrangements in countless real-world situations:
  • Passwords: How many 4-digit PINs use different digits?
  • Races: How many ways can gold, silver, bronze medals be awarded?
  • Scheduling: In how many orders can 5 tasks be completed?
  • Seating: How many ways can students sit in a row?
Understanding permutations is essential for probability, cryptography, and computer science!

Real World Applications

Password Security

Understanding permutations helps us calculate password strength and security.

Example:

A 4-digit PIN using digits 0-9 without repetition has possibilities.

1Try It Yourself

A website requires a 3-character password using only uppercase letters (A-Z), with no letter repeated.

How many possible passwords are there?

Step 1: Write the mathematical expression

Calculate :

Sports Tournament Brackets

Permutations determine possible outcomes in competitions where finishing position matters.

Example:

In a 6-team playoff, the possible final standings are different orders.

2Try It Yourself

An Olympic swimming final has 8 swimmers. Medals are awarded for 1st, 2nd, and 3rd place.

How many different medal outcomes are possible?

Step 1: Write the mathematical expression

Use :

Key Takeaways

  • 1A permutation is an arrangement where order matters
  • 2To arrange all objects: use
  • 3To arrange objects from objects: use
  • 4Quick method: multiply for terms
  • 5Remember: by definition

Frequently Asked Questions

Ask: "Does the order matter?" If electing a President AND Vice President = permutation (order matters). If choosing 2 people for a committee = combination (order doesn't matter).
Ask: "Does the order matter?" If electing a President AND Vice President = permutation (order matters). If choosing 2 people for a committee = combination (order doesn't matter).
By convention, because there's exactly ONE way to arrange zero objects (do nothing). It also makes formulas like work correctly.
P(n,r) means: "The number of ways to select AND arrange r objects from n objects." For example, = ways to choose and order 3 items from 5.

Glossary

Permutation
An arrangement of objects where order matters
Factorial
The product of all positive integers up to n, written as
P(n,r)
The number of permutations of r objects selected from n objects
Distinct objects
Objects that are all different from each other

Formula Card

Factorial

Product of all positive integers up to n

Permutation

Arrangements of r objects from n

Special cases

, ,

Important values to remember

More in This Topic