Formula & Calculator
Permutations
Counts the number of ways to arrange r items selected from a set of n distinct items, where the order of selection matters.
Interpretation
nPr = n!/(n−r)!. Number of ways to choose and arrange r items from n. Used in combinatorics, probability, and scheduling.
Variables
| Symbol | Quantity | Unit |
|---|---|---|
| nPr | Number of permutations | |
| n | Total number of distinct items | |
| r | Number of items being arranged |
What it means
The number of permutations (ordered arrangements) of r objects selected from a set of n distinct objects is nPr = n!/(n−r)!. This counts the number of sequences, where order matters. It is used in problems involving passwords, race results, seating arrangements, and in algorithm analysis (e.g., number of possible states). In probability, permutations are used to calculate the number of favourable outcomes. Understanding permutations is foundational for combinatorics and discrete mathematics, with applications in computer science, cryptography, and operations research.
Worked example
Permutations – Two Examples
Real‑World| Parameter | Value |
|---|---|
| n | 5 |
| r | 3 |
| Parameter | Value |
|---|---|
| n | 8 |
| r | 3 |
Common mistakes
- Permutations: nPr = n!/(n−r)! – order matters.
- If r > n: The result is 0 (or undefined).
- n!: Factorial of n – ensure n is a non‑negative integer.
- Applications: Used in counting arrangements, seating, and sequences.
- Check: For small numbers, verify manually.
Applications
Permutations, nPr = n!/(n−r)!, give the number of ordered arrangements of r items from a set of n. This is fundamental in combinatorics and probability. Engineers use it in scheduling, resource assignment, and cryptography. In operations research, it helps in sequencing and routing problems. In computer science, it appears in algorithm analysis and graph problems. By calculating permutations, professionals can quantify the number of possible orders, which is essential for optimisation, risk assessment, and decision‑making in diverse fields such as logistics, software testing, and game theory.
- Task scheduling and assignment problems
- Cryptography – key space and password strength
- Production sequencing and route planning
- Probability calculations in games and betting
- Combinatorial optimisation and search algorithms
Frequently Asked Questions
The number of ways to arrange r items from a set of n distinct items, where order matters, is nPr = n! / (n – r)!. It counts ordered selections.
Using permutations when the order of selection doesn't actually matter, which should instead use the combinations formula.
Permutations consider order; combinations ignore order. For example, ABC and CBA are different permutations but the same combination.
n! = n × (n–1) × … × 1. 0! = 1 by definition.
5P3 = 5! / (5–3)! = 5! / 2! = 120 / 2 = 60.
nPn = n! (all objects are arranged).
For n distinct objects in a circle, the number of arrangements is (n–1)!, because rotations are considered the same.
- Arranging items in a sequence.
- Counting passwords.
- Scheduling tasks.
If repetitions are allowed, the number of permutations is n^r (e.g., 10^4 for a 4‑digit code).
Permutations are derived from factorials: nPr = n! / (n–r)!.