Calculates the following:

Number of permutation(s) of n items arranged in r ways =_{n}P_{r}

Number of combination(s) of n items arranged in r__unique__ ways = _{n}C_{r} including subsets of sets

This calculator has 2 inputs.

Number of permutation(s) of n items arranged in r ways =

Number of combination(s) of n items arranged in r

This calculator has 2 inputs.

- combination
- a mathematical technique that determines the number of possible arrangements in a collection of items where the order of the selection does not matter
_{n}P_{r}= n!/r!(n - r)! - factorial
- The product of an integer and all the integers below it
- permutation
- a way in which a set or number of things can be ordered or arranged.
_{n}P_{r}= n!/(n - r)! - permutations and combinations