Math · Statistics & Probability · Grade 9-12 · 5 min read

Permutation

Q: What is the fastest recognition cue for Permutation?

Look for **arrange**, **order matters**, **ranking**, **first/second/third**, but treat those words as clues, not proof. A word problem can contain a familiar keyword and still ask for a different idea. After noticing the cue, ask the recognition question: Does swapping two of the chosen items create a different valid outcome? That question protects you from using a memorized procedure in the wrong place.

⚡ In one breath

A permutation counts ordered arrangements: choosing and ordering $r$ items from $n$ distinct items, $P(n,r)=\frac{n!

📐 The formula

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

Orient

The one-line idea, why it matters, and the intuition.

Section 1

Quick Answer

A permutation counts ordered arrangements: choosing and ordering $r$ items from $n$ distinct items, $P(n,r)=\frac{n!}{(n-r)!}$ . Use it when rearranging the same items gives a different valid outcome — rankings, seatings, codes, finishing places. The cue is that swapping two positions creates a new arrangement. Before calculating, ask: Does swapping two of the chosen items create a different valid outcome?

Section 2

Why This Matters

Permutations are half the counting decision that every probability problem depends on — get 'does order matter?' wrong and your sample-space size is off by a factor of $r!$ . They distinguish a podium (gold-silver-bronze) from a committee. Recognizing it by "Does swapping two of the chosen items create a different valid outcome?" — rather than by familiar numbers — is what lets a student tell it apart from combination and factorial and counting principle in a mixed problem set.

Section 3

Intuitive Explanation

Three runners A, B, C race for gold, silver, bronze: ABC and BAC are different podiums, so the orderings are $3!=6$ — order makes each a distinct result. This is the clean version of the idea because the visible structure matches the concept before any formula or procedure is chosen.

Do not use a permutation when order does not matter — choosing 3 pizza toppings is a combination, since pepperoni-mushroom-onion is the same pizza as onion-mushroom-pepperoni. That contrast matters because many wrong answers come from recognizing a surface feature, such as a familiar number or word, instead of the actual task.

A useful way to slow down is to name the signal words and then test them. Words like **arrange**, **order matters**, **ranking**, **first/second/third**, **lineup or sequence** are helpful clues, but they are not enough by themselves. They must point to the same structure as the mental model: A permutation counts the ways to line up $r$ chosen items from $n$ when the order of the line matters.

The recognition test is simple: Does swapping two of the chosen items create a different valid outcome? If yes, permutation is probably the right tool; if not, compare with Combination or Factorial or Counting principle before calculating.

Core idea

A permutation counts the ways to line up $r$ chosen items from $n$ when the order of the line matters.

Recognize

The cues that signal this concept and how to distinguish it from look-alikes.

Section 4

When to Use

Use Permutation when you are arranging or ranking items and the order of the chosen items matters. Strong signals include **arrange**, **order matters**, **ranking**, **first/second/third**, **lineup or sequence**. The safest workflow is to read the final question first, identify what kind of answer it wants, and then test the structure. Do not use permutation just because familiar numbers appear; first decide whether the situation answers "Does swapping two of the chosen items create a different valid outcome?" with yes.

✨ Pro tip

Ask: Does swapping two of the chosen items create a different valid outcome?

Section 5

How to Recognize It

Before using Permutation, check the structure of the problem, not just the vocabulary. These questions force the same recognition move from several angles: the task, the signal words, the nearest confusion, and the thing that would make the concept fail.

Does swapping two of the chosen items create a different valid outcome?

If yes, the problem matches permutation. If no, pause before applying the procedure, because the same numbers may belong to a different idea.
Which words signal the structure?

Look for arrange, order matters, ranking, first/second/third. These words are useful only after the situation matches them; a keyword without structure is not proof.
What is the nearest confusion?

Combination is the common trap here: Counts unordered selections, so rearrangements are the same choice. Compare the desired final answer before choosing a method.
What answer form should I expect?

The answer should fit this mental model: A permutation counts the ways to line up $r$ chosen items from $n$ when the order of the line matters. If the expected answer sounds more like combination, use the comparison table before solving.
What would make this NOT Permutation?

Do not use a permutation when order does not matter — choosing 3 pizza toppings is a combination, since pepperoni-mushroom-onion is the same pizza as onion-mushroom-pepperoni. This tells you when to switch tools instead of forcing the concept.

Section 6

Permutation vs Common Confusions

The hard part is recognizing when the task is really about permutation instead of a nearby idea. Read the final answer the problem wants, then ask which row describes the structure before you start calculating.

Permutation vs Common Confusions
Type	Meaning	Key test	Formula	Example
Permutation	Use this when you are arranging or ranking items and the order of the chosen items matters. The deciding question is: Does swapping two of the chosen items create a different valid outcome?	Does swapping two of the chosen items create a different valid outcome?	$P(n, r) = \frac{n!}{(n - r)!}$	In how many ways can 5 runners finish 1st, 2nd, and 3rd?
Combination	Counts unordered selections, so rearrangements are the same choice.	Use when only the group matters, not its order.	$C(n,r)=\frac{n!}{r!(n-r)!}$	Choosing a 3-person committee
Factorial	Arranges all $n$ items, the special case $P(n,n)=n!$ .	Use when you arrange every item, not a subset of size $r$.	$n!$	Seating all 5 guests in a row
Counting principle	Multiplies independent choices, allowing repeats unlike permutations.	Use when each slot is an independent choice that can repeat.	$m\times n$	A 4-digit PIN where digits can repeat

Permutation

Meaning: Use this when you are arranging or ranking items and the order of the chosen items matters. The deciding question is: Does swapping two of the chosen items create a different valid outcome?
Key test: Does swapping two of the chosen items create a different valid outcome?
Formula: $P(n, r) = \frac{n!}{(n - r)!}$
Example: In how many ways can 5 runners finish 1st, 2nd, and 3rd?

Combination

Meaning: Counts unordered selections, so rearrangements are the same choice.
Key test: Use when only the group matters, not its order.
Formula: $C(n,r)=\frac{n!}{r!(n-r)!}$
Example: Choosing a 3-person committee

Factorial

Meaning: Arranges all $n$ items, the special case $P(n,n)=n!$ .
Key test: Use when you arrange every item, not a subset of size $r$.
Formula: $n!$
Example: Seating all 5 guests in a row

Counting principle

Meaning: Multiplies independent choices, allowing repeats unlike permutations.
Key test: Use when each slot is an independent choice that can repeat.
Formula: $m\times n$
Example: A 4-digit PIN where digits can repeat

Apply

Worked examples and the mistakes most students make.

Section 7

Formula & Notation

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

P(n, r) = \frac{n!}{(n-r)!} = n(n-1)(n-2)\cdots(n-r+1)

for

0 \leq r \leq n

How to read it: $P(n, r)$ , $_nP_r$ , or $P^n_r$ all denote permutations of $r$ items from $n$

Section 8

Worked Examples

Example 1 — Top-3 finishers

Easy

Problem

In how many ways can 5 runners finish 1st, 2nd, and 3rd?

Solution

Order matters — different finishing orders are different outcomes.

Name the structure before touching arithmetic — that is what makes the right method obvious.
Ask the recognition question: Does swapping two of the chosen items create a different valid outcome?

If the answer is yes, the concept applies; the cue, not a keyword, decides the method.
Use $P(n,r)$ with $n=5$ , $r=3$ .

The rule is chosen only after the structure matches, so the steps mean something.
$P(5,3)=\frac{5!}{2!}=\frac{120}{2}$ .

Keep units, shape, or answer form tied to the story so the work does not become symbol pushing.
Check the answer against the original question.

It should fit the mental model — arrangements where order matters. If it does not, revisit the recognition step before changing the arithmetic.

Answer

$60$

Takeaway: When order matters, count ordered arrangements with $P(n,r)$ .

Example 2 — Order stops mattering

Standard

Problem

From 5 players, how many ways to pick a 3-person team (no positions)?

Solution

Notice why this looks like the same concept.

Nearby language or numbers can tempt you toward arrangements where order matters.
A team is the same group regardless of the order you name them.

Spotting what actually changed is what separates this from the concept it resembles.
Switch to a combination, dividing out the $3!$ orderings.

The nearby idea may share numbers but answers a different question, so it needs a different move.
State the result in the language of the actual task.

$C(5,3)=\frac{60}{6}=10$ . Name it for what the problem really asked, not the concept you first expected.
Say the contrast in one sentence.

Drop to a combination once order no longer distinguishes outcomes.

Answer

$C(5,3)=\frac{60}{6}=10$

Takeaway: Drop to a combination once order no longer distinguishes outcomes.

Example 3 — Spot the trap: Arrangements where order matters

Application

Problem

A student starts with this idea: "Using a permutation when order doesn't matter" What should they check before accepting that reasoning?

Solution

Pause before the first move.

The first move is a decision, not a calculation — does the situation really match arrangements where order matters.
Run the recognition test: Does swapping two of the chosen items create a different valid outcome?

This is the single check that the trap skips.
that overcounts by $r!$ ; use a combination instead.

Stating the safer rule turns the mistake into a checkable step instead of a vague "be careful."
Compare with the nearest confusion, Combination.

Counts unordered selections, so rearrangements are the same choice.
State the corrected decision and reuse it.

Using the concept only when the structure matches leaves a process the student can repeat on a new problem.

Answer

that overcounts by $r!$ ; use a combination instead.

Takeaway: The recognition step prevents the common trap: Using a permutation when order doesn't matter

Section 9

Common Mistakes

Common slip-up

Using a permutation when order doesn't matter

The right idea

that overcounts by $r!$ ; use a combination instead.

Common slip-up

Allowing repeats

The right idea

$P(n,r)$ assumes distinct items each used once; repeats need the counting principle.

Common slip-up

Confusing $n$ and $r$ in $\frac{n!}{(n-r)!}$

The right idea

$n$ is the pool, $r$ is how many positions you fill.

Practice

Try it, then see where this concept fits in the path.

Section 10

Mini Practice

Try these on your own. Tap Reveal when you want to check.

What clue tells you this is a Permutation situation: In how many ways can 5 runners finish 1st, 2nd, and 3rd?

Hint: Does swapping two of the chosen items create a different valid outcome?
In how many ways can 5 runners finish 1st, 2nd, and 3rd?

Hint: Use $P(n,r)$ with $n=5$ , $r=3$ .
Why is this a contrast case instead of Permutation: From 5 players, how many ways to pick a 3-person team (no positions)?

Hint: A team is the same group regardless of the order you name them.
Fix this thinking: Using a permutation when order doesn't matter

Hint: Name the recognition cue before choosing a rule.
Which is the better fit here: Permutation or Combination? Explain the deciding difference.

Hint: For Permutation, ask: Does swapping two of the chosen items create a different valid outcome?
Write one sentence that would remind a classmate how to recognize Permutation.

Hint: Use the mental model "Arrangements where order matters." and one signal word.

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Practice this concept → Take a mastery check

Section 11

Frequently Asked Questions

How do I know when to use Permutation?

Use Permutation when you are arranging or ranking items and the order of the chosen items matters. Do not start from the numbers alone; first name the structure of the situation. The fastest check is: Does swapping two of the chosen items create a different valid outcome? If the answer is yes and the wording matches cues like arrange, order matters, ranking, then permutation is probably the right tool.

What is Permutation most often confused with?

Permutation is often confused with Combination. Combination means Counts unordered selections, so rearrangements are the same choice. The difference is not just vocabulary; it changes the action you take. For permutation, the key test is "Does swapping two of the chosen items create a different valid outcome?" For combination, the better cue is: Use when only the group matters, not its order.

What is the fastest recognition cue for Permutation?

Look for arrange, order matters, ranking, first/second/third, but treat those words as clues, not proof. A word problem can contain a familiar keyword and still ask for a different idea. After noticing the cue, ask the recognition question: Does swapping two of the chosen items create a different valid outcome? That question protects you from using a memorized procedure in the wrong place.

What mistake should I avoid with Permutation?

Avoid this thinking: "Using a permutation when order doesn't matter" That mistake usually happens when the student jumps to a rule before checking the situation. The safer version is: that overcounts by $r!$ ; use a combination instead. A good habit is to say the mental model out loud first: "Arrangements where order matters." Then choose the calculation or representation.

How can I tell this apart from Factorial?

Factorial is the better fit when the task is about this: Arranges all $n$ items, the special case $P(n,n)=n!$ . Permutation is the better fit when you are arranging or ranking items and the order of the chosen items matters. If both ideas seem possible, compare what the problem wants as the final answer. The desired output often reveals whether you should use permutation or switch to the nearby concept.

Why does Permutation matter?

Permutations are half the counting decision that every probability problem depends on — get 'does order matter?' wrong and your sample-space size is off by a factor of $r!$ . They distinguish a podium (gold-silver-bronze) from a committee. The practical value is recognition: once you can spot permutation, you can choose a method before calculating. That makes later topics easier because you are not memorizing isolated tricks; you are recognizing the same structure when it appears in a new representation.

Section 12

Learning Path

← Before

Factorial

Permutation

You are here

Combination

Before this, students should be comfortable with Factorial. This page focuses on the recognition cue: Does swapping two of the chosen items create a different valid outcome? That cue is the bridge between earlier skills and later problem solving: students first learn to identify the structure, then they learn which calculation, diagram, graph, or proof move belongs to it. After this, Combination become easier to recognize.

Section 13