Ultimate Calculator
Math

Permutations and Combinations Calculator

Count the ways to choose or arrange r items from n, with or without caring about order.

Combinations (order ignored)

120

Permutations (order matters)
720
With repetition allowed, ordered
1,000
  1. Permutations: 10 × 9 × 8 = 720
  2. Each group of 3 can be ordered in 3! = 6 ways
  3. Combinations: 720 ÷ 6 = 120

The formula

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

Use permutations when the order of the chosen items matters, like a podium or a passcode. Use combinations when it does not, like a hand of cards or a committee. There are always at least as many permutations as combinations.

How to use this calculator

  1. Enter total items.
  2. Enter items chosen.
  3. Read the answer on the right. It updates as you type, and the numbered steps underneath show how it was worked out.

Worked example

Using Total items: 10; Items chosen: 3.

  1. Permutations: 10 × 9 × 8 = 720
  2. Each group of 3 can be ordered in 3! = 6 ways
  3. Combinations: 720 ÷ 6 = 120

Combinations (order ignored): 120

Common questions

How do I know whether order matters?

Ask whether swapping two chosen items gives a different outcome. If first and second place are different results, order matters and you want permutations.

What does “n choose r” mean?

It is another name for the number of combinations: how many different groups of r items can be picked from n.