Combination Calculator

Enter n and r to count the ways to choose r items from n when order does not matter.

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 entered(52)\binom{5}{2}

(52)=10\displaystyle \binom{5}{2} = 10

Permutations (order matters)

20\displaystyle 20
Show the work
  1. Combinations (order does not matter)

    A combination ignores order, so the r!r! orderings of each chosen group count as one. That divides the permutations by r!r!. Here n=5n = 5 and r=2r = 2.

    Using (nr)=n!r! (n−r)!\binom{n}{r} = \frac{n!}{r!\,(n-r)!}

    (52)=5!2! (5−2)!=5!2! 3!=5×42×1=202=10\begin{aligned} \binom{5}{2} &= \frac{5!}{2!\,(5-2)!} \\ &= \frac{5!}{2!\,3!} \\ &= \frac{5 \times 4}{2 \times 1} \\ &= \frac{20}{2} \\ &= 10 \end{aligned}
  2. Result

    So there are 1010 ways to choose 22 items from 55 when order does not matter.

Worked examples