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(00)\binom{0}{0}

(00)=1\displaystyle \binom{0}{0} = 1

Permutations (order matters)

1\displaystyle 1
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=0n = 0 and r=0r = 0.

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

    (00)=0!0! (0−0)!=0!0! 0!=1\begin{aligned} \binom{0}{0} &= \frac{0!}{0!\,(0-0)!} \\ &= \frac{0!}{0!\,0!} \\ &= 1 \end{aligned}
  2. Result

    So there are 11 ways to choose 00 items from 00 when order does not matter.

Worked examples