Permutation and Combination Calculator

Enter n and r to count permutations, where order matters, or combinations, where it does not.

Repetition

Whether the same item may be chosen more than once.

A whole number from 0 to 1000.

A whole number from 0 to 1000.

Try

Result

You entered5P2{}^{5}P_{2}

5P2=20\displaystyle {}^{5}P_{2} = 20

Combinations (order does not matter)

10\displaystyle 10
Show the work
  1. Permutations (order matters)

    A permutation is an ordered selection: nn choices for the first place, n−1n - 1 for the second, and so on for rr places. Dividing n!n! by (n−r)!(n-r)! cancels the unused factors. Here n=5n = 5 and r=2r = 2.

    Using nPr=n!(n−r)!{}^{n}P_{r} = \frac{n!}{(n-r)!}

    5P2=5!(5−2)!=5!3!=5×4=20\begin{aligned} {}^{5}P_{2} &= \frac{5!}{(5-2)!} \\ &= \frac{5!}{3!} \\ &= 5 \times 4 \\ &= 20 \end{aligned}
  2. Result

    So there are 2020 ways to arrange 22 items chosen from 55 when order matters.

Worked examples