Permutation and Combination calculator

Count ordered or unordered selections, with or without replacement.

Combinations
220

Each item can be used once per selection.

Breakdown & share
If order matters
1320
If order is irrelevant
220
Estimates only.

Your inputs

Example values. Change any of them.

How it’s worked out

See how we got 220

Without replacement, P(n,k) = n!/(n−k)! and C(n,k) = P(n,k)/k!. With replacement, ordered selections = nᵏ and unordered selections = C(n+k−1,k).

  1. Use C(12, 3).
  2. The number of selections is 220.

About this calculator

Count ordered or unordered selections, with or without replacement.

Worked example

Combinations · 220

Without replacement, P(n,k) = n!/(n−k)! and C(n,k) = P(n,k)/k!. With replacement, ordered selections = nᵏ and unordered selections = C(n+k−1,k).

  1. Use C(12, 3).
  2. The number of selections is 220.

Formula sources

Reference checked November 22, 2026.