Permutation Calculator (nPr)

Quick answer

The permutation calculator counts the ordered arrangements of r items chosen from n (without repetition, nPr = n!/(n − r)!, or with repetition, nʳ), shows how many combinations that corresponds to and lists the permutations of small sets.

Ignored when you type the objects themselves below.

If you type names here, n is taken from how many you entered and the list below uses them.

Number of permutations
720
Permutations without repetition P(n, r)
720
Permutations with repetition nʳ
1,000
Combinations C(n, r) (if order did not matter)
120
Chance of guessing one particular arrangement
1 in 720 (0.138889%)
Orderings of r items (r!)
6
The permutations
(A, B, C) (A, B, D) (A, B, E) (A, B, F) (A, B, G) (A, B, H) (A, B, I) (A, B, J) (A, C, B) (A, C, D) (A, C, E) (A, C, F) (A, C, G) (A, C, H) (A, C, I) (A, C, J) (A, D, B) (A, D, C) (A, D, E) (A, D, F) (A, D, G) (A, D, H) (A, D, I) (A, D, J) (A, E, B) (A, E, C) (A, E, D) (A, E, F) (A, E, G) (A, E, H) (A, E, I) (A, E, J) (A, F, B) (A, F, C) (A, F, D) (A, F, E) (A, F, G) (A, F, H) (A, F, I) (A, F, J) (A, G, B) (A, G, C) (A, G, D) (A, G, E) (A, G, F) (A, G, H) (A, G, I) (A, G, J) (A, H, B) (A, H, C) (A, H, D) (A, H, E) (A, H, F) (A, H, G) (A, H, I) (A, H, J) (A, I, B) (A, I, C) (A, I, D) (A, I, E) (A, I, F) (A, I, G) (A, I, H) (A, I, J) (A, J, B) (A, J, C) (A, J, D) (A, J, E) (A, J, F) (A, J, G) (A, J, H) (A, J, I) (B, A, C) (B, A, D) (B, A, E) (B, A, F) (B, A, G) (B, A, H) (B, A, I) (B, A, J) (B, C, A) (B, C, D) (B, C, E) (B, C, F) (B, C, G) (B, C, H) (B, C, I) (B, C, J) (B, D, A) (B, D, C) (B, D, E) (B, D, F) (B, D, G) (B, D, H) (B, D, I) (B, D, J) (B, E, A) (B, E, C) (B, E, D) (B, E, F) (B, E, G) (B, E, H) (B, E, I) (B, E, J) (B, F, A) (B, F, C) (B, F, D) (B, F, E) (B, F, G) (B, F, H) (B, F, I) (B, F, J) (B, G, A) (B, G, C) (B, G, D) (B, G, E) (B, G, F) (B, G, H) (B, G, I) (B, G, J) (B, H, A) (B, H, C) (B, H, D) (B, H, E) (B, H, F) (B, H, G) (B, H, I) (B, H, J) (B, I, A) (B, I, C) (B, I, D) (B, I, E) (B, I, F) (B, I, G) (B, I, H) (B, I, J) (B, J, A) (B, J, C) (B, J, D) (B, J, E) (B, J, F) (B, J, G) (B, J, H) (B, J, I) (C, A, B) (C, A, D) (C, A, E) (C, A, F) (C, A, G) (C, A, H) (C, A, I) (C, A, J) (C, B, A) (C, B, D) (C, B, E) (C, B, F) (C, B, G) (C, B, H) (C, B, I) (C, B, J) (C, D, A) (C, D, B) (C, D, E) (C, D, F) (C, D, G) (C, D, H) (C, D, I) (C, D, J) (C, E, A) (C, E, B) (C, E, D) (C, E, F) (C, E, G) (C, E, H) (C, E, I) (C, E, J) (C, F, A) (C, F, B) (C, F, D) (C, F, E) (C, F, G) (C, F, H) (C, F, I) (C, F, J) (C, G, A) (C, G, B) (C, G, D) (C, G, E) (C, G, F) (C, G, H) (C, G, I) (C, G, J) (C, H, A) (C, H, B) (C, H, D) (C, H, E) (C, H, F) (C, H, G) (C, H, I) (C, H, J) (C, I, A) (C, I, B) (C, I, D) (C, I, E) (C, I, F) (C, I, G) (C, I, H) (C, I, J) (C, J, A) (C, J, B) (C, J, D) (C, J, E) (C, J, F) (C, J, G) (C, J, H) (C, J, I) (D, A, B) (D, A, C) (D, A, E) (D, A, F) (D, A, G) (D, A, H) (D, A, I) (D, A, J) (D, B, A) (D, B, C) (D, B, E) (D, B, F) (D, B, G) (D, B, H) (D, B, I) (D, B, J) (D, C, A) (D, C, B) (D, C, E) (D, C, F) (D, C, G) (D, C, H) (D, C, I) (D, C, J) (D, E, A) (D, E, B) (D, E, C) (D, E, F) (D, E, G) (D, E, H) (D, E, I) (D, E, J) (D, F, A) (D, F, B) (D, F, C) (D, F, E) (D, F, G) (D, F, H) (D, F, I) (D, F, J) (D, G, A) (D, G, B) (D, G, C) (D, G, E) (D, G, F) (D, G, H) (D, G, I) (D, G, J) (D, H, A) (D, H, B) (D, H, C) (D, H, E) (D, H, F) (D, H, G) (D, H, I) (D, H, J) (D, I, A) (D, I, B) (D, I, C) (D, I, E) (D, I, F) (D, I, G) (D, I, H) (D, I, J) (D, J, A) (D, J, B) (D, J, C) (D, J, E) (D, J, F) (D, J, G) (D, J, H) (D, J, I) (E, A, B) (E, A, C) (E, A, D) (E, A, F) (E, A, G) (E, A, H) (E, A, I) (E, A, J) (E, B, A) (E, B, C) (E, B, D) (E, B, F) … showing the first 300 of 720

A permutation is an arrangement in which order matters: gold, silver and bronze going to Ann, Ben and Cara is different from Ben, Ann and Cara. The number of ways to fill r ordered positions from n distinct objects is n × (n − 1) × … × (n − r + 1), written nPr or P(n, r). Arranging all n objects gives n! permutations: 3,628,800 ways to line up 10 books.

When the same object may be used repeatedly, every position has n choices and the count is nʳ. That is how PIN codes, licence plates and passwords are counted: a 4-digit PIN has 10⁴ = 10,000 possibilities, a 10-character password using 62 letters and digits has 62¹⁰ ≈ 8.39 × 10¹⁷.

Choose the type, enter n and r, and the calculator returns the exact count (with every digit for numbers up to 24 digits), the combination count for comparison and the odds of guessing one arrangement. Type your own objects to see the arrangements listed (up to 300 of them), which helps when checking a schedule, a seating plan or a homework answer.

How to use the Permutation Calculator

  1. Number of objects to choose from (n): Ignored when you type the objects themselves below.
  2. Number chosen (r)
  3. Type of selection
  4. Objects to list (optional, comma-separated): If you type names here, n is taken from how many you entered and the list below uses them.
  5. List the selections

Everything is calculated in your browser, so results appear instantly and nothing you type is sent to a server.

How it works

Without repetition the calculator multiplies the r largest factors n, n − 1, …, n − r + 1. With repetition it multiplies n by itself r times. All arithmetic is exact. Listing follows dictionary order and stops at 300 entries.

Worked example

Nine cards numbered 1 to 9; how many ordered 3-card sequences can be dealt? P(9, 3) = 9 × 8 × 7 = 504. Each set of 3 cards can be ordered 3! = 6 ways, so there are 504 ÷ 6 = 84 combinations. If each card were returned before the next draw there would be 9³ = 729 sequences.

Permutation counts at a glance

Situation Formula Count
Podium places from 10 runners P(10, 3) 720
Arrange 5 books on a shelf 5! 120
4-digit PIN 10⁴ 10,000
Licence plate: 3 letters + 3 digits 26³ × 10³ 17,576,000
Batting order of 9 players 9! 362,880

Formula

P(n, r) = n! ÷ (n − r)! With repetition: nʳ P(n, r) = C(n, r) × r!

Worked example

Inputs: Number of objects to choose from (n): 10; Number chosen (r): 3; Type of selection: Permutations – order matters, no repeats; Objects to list (optional, comma-separated): ; List the selections: Yes – show up to 300.
Results: Number of permutations = 720; Permutations without repetition P(n, r) = 720; Permutations with repetition nʳ = 1,000; Combinations C(n, r) (if order did not matter) = 120; Chance of guessing one particular arrangement = 1 in 720 (0.138889%); Orderings of r items (r!) = 6.

Key terms

Permutation
An ordered arrangement of objects.
nPr
The number of permutations of r objects taken from n, n!/(n − r)!.
Permutation with repetition
An arrangement where objects may be reused, counted as nʳ.

Frequently asked questions

How many ways can 3 medals go to 10 runners?

P(10, 3) = 10 × 9 × 8 = 720.

How many 4-digit PINs are there?

With repetition 10⁴ = 10,000; with all digits different, P(10, 4) = 5,040.

What is the difference between nPr and nCr?

nPr counts ordered arrangements, nCr unordered selections. nPr = nCr × r!, so P(10, 3) = 120 × 6.

How many ways can the letters of a word be arranged?

n! for distinct letters (WORD: 4! = 24). With repeated letters divide by the factorial of each repeat count (LETTER: 6! ÷ (2! × 2!) = 180).

What is P(n, n)?

n!, the number of ways to arrange all n objects. P(n, 0) = 1.

How many 3-digit numbers can be made from the cards 0–8 with no repeats?

8 × 8 × 7 = 448, because the first digit cannot be 0.

Why does the count grow so fast?

Factorials grow faster than any power: 20! already exceeds 2.4 × 10¹⁸.

Sources

  1. NIST Digital Library of Mathematical Functions: Combinatorial analysis
  2. Penn State STAT 414: Introduction to Probability Theory
  3. Wolfram MathWorld: Probability and statistics

Cite this calculator

Speedy Calculator. (2026). Permutation Calculator (nPr). Speedy Calculator. https://speedycalculator.com/calculators/statistics/permutations/