Back to Lesson

Teacher Guide: Introduction to Permutations

Learn how to count arrangements where order matters using permutations.

Present LessonShare to ClassroomView Student Page

Use this lesson with your class

Free, no student accounts needed.

Share with students

Students open the lesson and practise with instant feedback.

Printable worksheet

All practice problems on paper, with a separate answer key.

Worksheet Answer key

Class quiz

10 questions on Counting Principles. Students join with a name, you see everyone's score.

For Teachers

Learning Objectives
  • Define permutation and explain when order matters
  • Calculate factorial values
  • Apply the permutation formula P(n,r)
  • Distinguish between permutations and combinations
  • Solve real-world counting problems using permutations
Prerequisites
  • • Basic multiplication
  • • Understanding of exponents (helpful but not required)
  • • Familiarity with the concept of arrangements
Discussion Starters
  • 1. Why do you think phone PINs and passwords are more secure when they're longer?
  • 2. If you have 10 books on a shelf, how many ways can you rearrange them?
  • 3. How is choosing a team captain AND co-captain different from just choosing 2 leaders?
  • 4. Can you think of real-life situations where the order of events completely changes the outcome?
Common Misconceptions

Thinking permutation and combination are the same

Remediation: Use concrete examples: Choosing 3 pizza toppings (combination) vs arranging 3 books on a shelf (permutation). Ask: would rearranging change anything?

Believing order only matters with numbers

Remediation: Show that ABC, ACB, BAC, BCA, CAB, CBA are 6 different arrangements of the same 3 letters. Each is a distinct permutation.

Differentiation Ideas

For Struggling Students:

  • • Start with very small sets (3 objects) and list all permutations by hand
  • • Use physical objects (cards, blocks) to build arrangements
  • • Focus on the multiplication principle before introducing factorial notation

For On-Level Students:

  • • Practice P(n,r) calculations with various values
  • • Solve word problems involving passwords, races, and arrangements
  • • Compare permutation counts to understand why adding one object dramatically increases possibilities

For Advanced Students:

  • • Explore permutations with repetition allowed
  • • Investigate permutations of objects that are not all distinct
  • • Connect permutations to probability calculations
Standards Alignment
  • HSS-CP.B.9 (CCSS.MATH.CONTENT.HSS.CP.B.9)

    Use permutations and combinations to compute probabilities of compound events

  • HSA-APR.C.5 (CCSS.MATH.CONTENT.HSA.APR.C.5)

    Know and apply the Binomial Theorem (related to counting principles)

Lesson Resources
  • visualArrangement Builder

    Interactive tool to see all permutations of a set

  • activityPassword Strength Calculator

    Calculate how many passwords are possible with different rules

  • worksheetPermutation Practice

    Problems ranging from basic factorial to complex P(n,r) applications

Lesson Content

Everything students see: definition, examples, common mistakes, applications. Tap to open.

Definition

A permutation is an arrangement of objects where order matters.
The number of ways to arrange nn distinct objects in a row is:
n!=n×(n−1)×(n−2)×⋯×2×1n! = n \times (n-1) \times (n-2) \times \cdots \times 2 \times 1
This is called n factorial.
When selecting and arranging rr objects from nn objects:
P(n,r)=n!(n−r)!=n×(n−1)×⋯×(n−r+1)P(n,r) = \frac{n!}{(n-r)!} = n \times (n-1) \times \cdots \times (n-r+1)
Key insight: In permutations, ABC is different from BAC because the order is different.

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 matters → This 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 → 4×3×2×14 \times 3 \times 2 \times 1
3

Calculate using factorial

4!=4×3×2×14! = 4 \times 3 \times 2 \times 1 → 4!=244! = 24
4

Interpret the result

There are 24 different ways to arrange 4 students → 24 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: (n−r)!n!\frac{(n-r)!}{n!} instead of n!(n−r)!\frac{n!}{(n-r)!}

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

Correct: P(n,r)=n!(n−r)!P(n,r) = \frac{n!}{(n-r)!}, remember: n!n! is always larger, so it goes in the numerator.

Forgetting that 0!=10! = 1

Why it's wrong: When arranging all n objects, we use P(n,n)=n!0!=n!1=n!P(n,n) = \frac{n!}{0!} = \frac{n!}{1} = n!

Correct: By definition, 0!=10! = 1. This makes the formula work when r=nr = n.

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 P(10,4)=5040P(10,4) = 5040 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 P(26,3)P(26,3):

Sports Tournament Brackets

Permutations determine possible outcomes in competitions where finishing position matters.

Example:

In a 6-team playoff, the possible final standings are 6!=7206! = 720 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 P(8,3)P(8,3):

Key Takeaways

  • 1A permutation is an arrangement where order matters
  • 2To arrange all nn objects: use n!=n×(n−1)×⋯×1n! = n \times (n-1) \times \cdots \times 1
  • 3To arrange rr objects from nn objects: use P(n,r)=n!(n−r)!P(n,r) = \frac{n!}{(n-r)!}
  • 4Quick method: multiply n×(n−1)×⋯n \times (n-1) \times \cdots for rr terms
  • 5Remember: 0!=10! = 1 by definition

Frequently Asked Questions

How do I know when to use permutations vs combinations?

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).

Why is 0!=10! = 1?

By convention, 0!=10! = 1 because there's exactly ONE way to arrange zero objects (do nothing). It also makes formulas like P(n,n)=n!0!=n!P(n,n) = \frac{n!}{0!} = n! work correctly.

What does P(n,r)P(n,r) mean in words?

P(n,r) means: "The number of ways to select AND arrange r objects from n objects." For example, P(5,3)P(5,3) = 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 n!n!
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

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

Product of all positive integers up to n

Permutation

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

Arrangements of r objects from n

Special cases

0!=10! = 1, 1!=11! = 1, P(n,n)=n!P(n,n) = n!

Important values to remember

More in This Topic

Introduction to Combinations

Advanced25 min