Calculates the following:

How many permutations can we have from a sample of r elements from a set of n distinct objects where order does matter and replacements are not allowed?

This calculator has 2 inputs.

How many permutations can we have from a sample of r elements from a set of n distinct objects where order does matter and replacements are not allowed?

This calculator has 2 inputs.

- 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 with replacement