Permutation and Combination Calculator

  • Tested against OpenStax examples and 155 cases worked exactly by an independent program
  • Checked by Wayne Bickerton
  • Sources: OpenStax
  • Updated November 11, 2026

Permutations count ordered choices, nPr = n! ÷ (n − r)!, and combinations count groups where order doesn’t matter, nCr = n! ÷ (r! × (n − r)!). If the order matters, like 1st, 2nd and 3rd place, that is a permutation; if it doesn’t, like a hand of cards, it is a combination. Type how many items there are (n) and how many you choose (r).

Permutations (nPr)
1,320 Exact

There are 1,320 ways to choose 3 of 12 items when order matters.

Combinations (nCr) 220
Digits 4
Orders of each group (r!) 6
Every digit

1,320

What is a permutation?

A permutation is an ordered list of r items taken from n. Order matters: picking A then B is different from B then A, like the results of a race or the officers of a club. The count is written nPr.

Source OpenStax · Contemporary Mathematics, 7.2 Permutations ↗

How to calculate permutations (nPr)

nPr = n! ÷ (n − r)!

Here it is with your numbers:

  1. 12P3 = 12 × 11 × 10 (3 numbers, counting down from 12)
  2. 12P3 = 1,320

It means 3 of 12 items can be lined up in 1,320 different orders.

What is a combination?

A combination is a group of r items taken from n where the order doesn’t matter, like a hand of cards or a committee. Each group of r can be put in order r! ways, so there are r! times fewer combinations than permutations. The count is written nCr, or “n choose r”.

Source OpenStax · Contemporary Mathematics, 7.3 Combinations ↗

How to calculate combinations (nCr)

nCr = n! ÷ (r! × (n − r)!)

Here it is with your numbers:

  1. Permutations first: 12P3 = 12 × 11 × 10 (3 numbers, counting down from 12)
  2. 12P3 = 1,320
  3. Each group of 3 can be put in order 6 ways (3!), so divide: 12C3 = 1,320 ÷ 6
  4. 12C3 = 220

It means there are 220 different groups of 3 when the order inside a group doesn’t count.

Permutation and combination examples

FAQs

How do I calculate permutations?

Multiply n by each whole number below it, r numbers in all, which is n! ÷ (n − r)!. Choosing 3 of 12 in order is 12 × 11 × 10, which is 1,320.

Source OpenStax · Contemporary Mathematics, 7.2 Permutations ↗

What are the permutations of 1, 2, 3, 4?

Putting all 4 in order gives 4 × 3 × 2 × 1, which is 24 permutations, from 1234, 1243 and 1324 to 4321.

How many permutations are there of 1, 2, 3, 4, 5, 6, 7, 8, 9?

All 9 digits in order: 9! is 362,880.

Sources

Related calculators