Calculate permutations (nPr) and combinations (nCr) for n items taken r at a time, with the underlying factorials. Exact big-integer math. Free and instant.

The size of the whole set.
How many are selected (r ≤ n).
Combinations (nCr)
Permutations (nPr)
n!
r!
(n − r)!
Permutations count ordered selections (nPr = n! ÷ (n−r)!); combinations count unordered ones (nCr = n! ÷ (r!(n−r)!)). n and r must be whole numbers with 0 ≤ r ≤ n. Very large results are shown in scientific notation.

Add this free tool to your own website — copy and paste the code below.