Permutation Calculator
Calculate nPr (ordered arrangements) instantly. Explore interactive slot animations to understand why order matters, view step-by-step math, and solve challenge problems.
Interactive Visualizer — Why Order Matters
A permutation is an ordered arrangement. Swapping positions creates a completely new permutation!
Order Insight
Tap Shuffle Positions above to generate a new ordered arrangement. In permutations, ABC ≠ BAC!
Permutation vs Combination
Understand when order matters and when it doesn't.
In a permutation, changing the order of items creates a brand new outcome.
Quick Challenge: Can You Solve It?
4 runners enter a race. In how many different ways can the 1st, 2nd, and 3rd place podium spots be awarded?
Interesting Facts About Permutations
1. Permutations Grow Extremely Fast
Because nPr multiplies consecutive decreasing integers, values escalate dramatically. For example, 10P5 = 30,240, and 20P10 = 670,442,572,800!
What is a Permutation (nPr)?
In mathematics and combinatorics, a permutation is an ordered arrangement of a collection of distinct objects. The defining characteristic of a permutation is that the sequence or order matters.
- Total Items ($n$): The total size of the set of available items.
- Positions to Fill ($r$): The number of distinct spots or slots being filled ($0 \le r \le n$).
- Order Matters: Selecting item A then B is completely distinct from selecting item B then A ($AB \ne BA$).
- No Repetition: Once an item is placed in a position, it cannot be chosen for another slot in the same arrangement.
Real-World Examples Where Order Matters
Everyday scenarios that require calculating permutations:
- Athletic Races & Podiums: In an 8-runner race, awarding 1st, 2nd, and 3rd medals is $8P3 = 8 \times 7 \times 6 = 336$ possibilities.
- Security Passcodes & PINs: Entering digits "4-8-2-1" is different from "1-2-4-8".
- Class Officer Elections: Electing a President, Vice President, and Secretary from 10 candidates has $10P3 = 720$ distinct outcomes.
- Seating Arrangements: Arranging 5 dinner guests across 5 numbered chairs has $5P5 = 5! = 120$ possible seatings.
Understanding the Permutation Formula
The fundamental counting principle provides the basis for the permutation formula:
Step 1 · Slot 1 Choice
n Options
For the very first position, you have all $n$ items available to choose from.
Step 2 · Subsequent Slots
(n-1), (n-2)... Options
Each subsequent position has one fewer choice because items cannot be reused.
Step 3 · Falling Product
n × (n-1) × ... × (n-r+1)
Multiplying the choices for all $r$ slots yields the exact permutation count without needing giant factorials.
Reference Table of Common Permutations
Quick reference list of frequently calculated permutations for students, teachers, and exams.
You might also like
Frequently Asked Questions
A permutation is an ordered arrangement of objects where the sequence or position matters. Given n total items, nPr calculates the number of unique ways to arrange r of those items into r distinct positions without repetition.
The key difference is whether order matters. In a permutation, changing the sequence creates a different outcome (e.g., PIN 1234 is distinct from 4321). In a combination, order does not matter and only the group members count (e.g., a hand of cards or a fruit salad).
The mathematical formula for permutations is P(n, r) = n! / (n - r)!, which simplifies to the falling product: n × (n - 1) × (n - 2) × ... × (n - r + 1). This multiplies r consecutive decreasing integers starting from n.
nP0 = 1 because there is mathematically exactly one way to arrange zero items into zero slots (the empty set). When r = n, you are arranging all items across all available positions, which equals n! (e.g., 5P5 = 5! = 120).
Yes, 100%. All permutation calculations, visualizer animations, and step evaluations happen directly inside your web browser using native BigInt arithmetic. No numbers or inputs are ever sent to any remote server.