Permutation & Combination

Count ordered and unordered selections of r items from n.

Count

Items available, 0 to 1,000

Items chosen, 0 to n

n and r are whole numbers from 0 to 1,000, and r cannot be greater than n. A combination ignores order. A permutation counts each order separately.

Enter n and r.

How permutations and combinations are counted

A combination is the number of ways to choose r items from n when order does not matter. A permutation counts each different order as its own way.

Choosing 0 items can be done in 1 way. r cannot be greater than n. The count is a whole number from the product of the falling terms.

How to use this calculator

  1. Choose combination or permutation.
  2. Enter n, the items available, and r, the items chosen.
  3. Read the number of ways. The row below shows r.

Formula

A combination divides out the orders inside each selection.

Combinations of n items taken r at a time
C(n,r)=n!r!(n−r)!

A permutation is n! / (n − r)!. C(5, 2) = 10 and P(5, 2) = 20, because each pair has 2 orders.

Source

Combinations and permutations are defined on the Wikipedia page on combinations.

Worked examples

Example: C(5, 2)

C(5, 2) = 10.

Example: P(5, 2)

P(5, 2) = 20.

What to keep in mind

n and r are whole numbers from 0 to 1,000. C(10, 3) = 120. P(10, 3) = 720. C(8, 0) = 1. If r is greater than n, there is no result. A completed result, including n and r, can be stored in this browser’s local history and never leaves your device. Clear it with the history Clear action or by clearing site data.

Common questions about permutations and combinations

What is C(5, 2)?

10.

What is P(5, 2)?

20.

What is C(10, 3)?

120.

What is P(10, 3)?

720.

What is C(8, 0)?

1. Choosing nothing can be done in one way.

Does this calculator store my numbers?

A completed result can be saved in this browser’s local history, including n and r. It stays on your device and is not sent to our servers or to analytics. Clear it with the history Clear action or by clearing site data.