MathematicsCombinatoricsA-Level

CambridgeAQAAPIBAbiturBaccalauréat GénéralBachilleratoCAPS

Permutations (nPr)

Number of ordered selections of r objects from n.

Understand the formulaSee the free derivationOpen the full walkthrough

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

Open Full Walkthrough Try Calculator

This public page keeps the free explanation visible and leaves premium worked solving, advanced walkthroughs, and saved study tools inside the app.

Core idea

Overview

Permutations determine the number of distinct ways to arrange a subset of items selected from a larger group where the order of selection is significant. This mathematical operation counts unique sequences by dividing the total arrangements of the set by the arrangements of the remaining unselected items.

When to use: Apply this formula when you are selecting a specific number of elements from a set and the sequence or position of those elements changes the outcome. It is strictly for scenarios without replacement, meaning once an item is chosen, it cannot be picked again for the same arrangement.

Why it matters: Permutations are foundational in fields like computer science for algorithm complexity and in cybersecurity for estimating the strength of passwords. They also play a critical role in statistical mechanics and scheduling logistics where the sequence of operations impacts efficiency.

Symbols

Variables

nP r = Permutations, n = Total Items, r = Items Chosen

n P r

Permutations

V a r iab l e

n

Total Items

V a r iab l e

r

Items Chosen

V a r iab l e

Walkthrough

Derivation

Derivation of the Permutations Formula (nPr)

Counts ordered selections by multiplying available choices at each step.

Choose r distinct items from n distinct items.
Order matters.

Count choices position-by-position:

First position has n choices, second has n−1, continuing until r positions are filled.

n \cdot (n - 1) \cdot (n - 2) \dots (n - r + 1)

Express using factorials:

The product above is exactly n! with the final (n−r)! factors cancelled.

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

Result

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

Visual intuition

Graph

The plot of nPr for a fixed r shows a polynomial-like growth, while treating n as a continuous variable reveals a rapidly increasing curve that behaves similarly to exponential functions. The graph originates from the point where n=r, resulting in a value of 1, and curves steeply upward as n increases, reflecting the factorial nature of the calculation. This rapid growth illustrates the combinatorial explosion that occurs when selecting ordered arrangements from an increasing set of items.

Graph type: exponential

Why it behaves this way

Intuition

Imagine selecting 'r' distinct objects from a larger pool of 'n' objects and arranging them into 'r' specific, ordered slots, where each unique arrangement in the slots counts as a different outcome.

n

Total number of distinct items available for selection.

Represents the size of the initial set from which items are chosen. A larger 'n' generally means more possible arrangements.

r

Number of items to be selected and arranged from the total 'n'.

Represents the length of the ordered sequence being formed. A larger 'r' (closer to 'n') means more items are arranged, often leading to more complex arrangements.

!

The factorial operation, representing the product of all positive integers up to a given number.

Counts the total number of ways to arrange a given number of distinct items. For example, 3! = 3 × 2 × 1 = 6 ways to arrange 3 items.

n P r

The total number of distinct ordered arrangements (permutations) of 'r' items chosen from 'n' distinct items.

This is the final count of unique sequences when both the chosen items and their order matter. It shows how many different ways you can pick and line up a subset from a larger group.

Signs and relationships

(n-r)! in the denominator: The denominator (n-r)! accounts for and removes the permutations of the items *not* selected. Since the order of the unselected items doesn't matter for the final arrangement of the 'r' chosen items, we divide by the

Free study cues

Insight

Canonical usage

Permutations calculate the number of distinct ordered arrangements, which is a dimensionless integer count.

Common confusion

Students might mistakenly try to assign physical units to n, r, or the permutation result, when all are dimensionless counts. It is crucial to remember that permutations quantify possibilities, not physical quantities.

Dimension note

The result of a permutation calculation is a count of possible ordered arrangements, which is an inherently dimensionless integer quantity.

Unit systems

$n$ dimensionless (integer) · Represents the total number of distinct items available for selection.

$r$ dimensionless (integer) · Represents the number of items to be selected and arranged from the total n items.

One free problem

Practice Problem

A club with 10 members needs to elect a President, a Vice President, and a Secretary. How many different ways can these three distinct positions be filled?

Total Items10

Items Chosen3

Solve for: P

Hint: Since the positions are specific roles, the order of selection creates different outcomes.

The full worked solution stays in the interactive walkthrough.

Where it shows up

Real-World Context

Number of ways to award gold, silver, bronze from n finalists.

Study smarter

Tips

Always verify if 'order matters' before choosing permutations over combinations.
Simplify calculations by canceling out the (n-r)! term from the n! numerator.
Recall that 0! equals 1 when dealing with cases where n equals r.
Check that n is always greater than or equal to r.

Avoid these traps

Common Mistakes

Using nCr when order matters.
Using r > n.

Common questions

Frequently Asked Questions

Counts ordered selections by multiplying available choices at each step.

Apply this formula when you are selecting a specific number of elements from a set and the sequence or position of those elements changes the outcome. It is strictly for scenarios without replacement, meaning once an item is chosen, it cannot be picked again for the same arrangement.

Permutations are foundational in fields like computer science for algorithm complexity and in cybersecurity for estimating the strength of passwords. They also play a critical role in statistical mechanics and scheduling logistics where the sequence of operations impacts efficiency.

Using nCr when order matters. Using r > n.